/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 9ms 580.0 KiB
#3 Accepted 20ms 500.0 KiB
#4 Accepted 17ms 536.0 KiB
#5 Accepted 14ms 536.0 KiB
#6 Accepted 14ms 1.27 MiB
#7 Accepted 15ms 2.02 MiB
#8 Accepted 14ms 2.02 MiB
#9 Accepted 5ms 532.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;

#define int        long long int
#define pb         push_back
#define all(x)     x.begin(),x.end()
#define allr(x)    x.rbegin(),x.rend()
#define ii         pair<int,int>
#define endl       '\n'

void pipra(int tc) {
    int n, k, d;
    cin >> n >> k >> d;
    vector<int> a(n);
    for(int i = 0 ; i < n ; i++)
        cin >> a[i];
    int sum = accumulate(a.begin(), a.begin() + k, 0);
    // int cnt = count(a.begin(), a.begin() + k, 1);
    // cout << sum << ' ' << cnt << endl;
    int zero = -1;
    if(sum %d == 0) {
        if(sum == k) {
            cout << 1 << endl;
            return;
        }
        else
            zero = 1;
    }
    for(int i = k ; i < n ; i++) {
        sum += a[i] == 1;
        sum -= a[i - k] == 1;
        if(sum %d == 0) {
            if(sum == k) {
                cout << i - k + 2 << endl;
                return;
            }
            else if(zero == -1)
                zero = i - k + 2;
        }
    }
    cout << zero << endl;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int t = 1;
    cin >> t;
    for(int i = 1 ; i <= t ; i++)
        pipra(i);
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1190 Segment Strength
Contest
Brain Booster #9
Language
C++17 (G++ 13.2.0)
Submit At
2025-04-06 16:18:59
Judged At
2025-04-06 16:18:59
Judged By
Score
100
Total Time
20ms
Peak Memory
2.02 MiB