/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 9ms 572.0 KiB
#3 Accepted 15ms 532.0 KiB
#4 Accepted 13ms 320.0 KiB
#5 Accepted 13ms 324.0 KiB
#6 Accepted 15ms 532.0 KiB
#7 Accepted 15ms 344.0 KiB
#8 Accepted 15ms 532.0 KiB
#9 Accepted 6ms 532.0 KiB

Code

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;

void solve() {
    int n, k, d;
    cin >> n >> k >> d;
    vector<bool> v(n);

    for(int i = 0; i < n; i++) {
        int x; cin >> x;
        v[i] = x;
    }
    int sum = 0;
    for(int i = 0; i < k - 1; i++) {
        sum += v[i];
    }
    int ans = -1;
    for(int i = k - 1; i < n; i++) {
        sum += v[i];
        if(sum % d == 0) {
            if(sum == k) {
                cout << i - k + 2 << endl;
                return;
            }
            else if(ans == -1) ans = i - k + 2;
        }
        sum -= v[i - k + 1];
    }
    cout << ans << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1190 Segment Strength
Language
C++17 (G++ 13.2.0)
Submit At
2025-04-06 14:54:29
Judged At
2025-04-06 15:25:22
Judged By
Score
100
Total Time
15ms
Peak Memory
572.0 KiB