/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Wrong Answer 20ms 540.0 KiB
#3 Wrong Answer 33ms 540.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
int main()
{
    ll tc;
    cin>>tc;
    while(tc--)
    {
       ll n,k,x;
        cin>>n>>k>>x;
        
        vector<ll>v(n);
        for(int i=0;i<n;i++)
        {
            cin>>v[i];
        }
        ll s=0,id=-1,mx=-1,z=0;
        for(int i=0;i<k;i++)
        {
            s+=v[i];
            if(v[i]==0) z++;
        }
        if(s%x == 0 && z== 0) {
        mx= 1;
        id = 0;
    }

    for (int i=k;i<n;i++) {
        s-= v[i-k];
        if(v[i-k]==0) z--;

        s+=v[i];
        if(v[i]==0) z++;

        if (s%x == 0) {
        ll f=(z==0) ? 1 : 0;
            
            if (f>mx) {
                mx=f;
                id=i-k+1;
            }
        }
    }
    if(id==-1)
        cout<<-1<<endl;
        else
            cout<<id+1<<endl;
    }
}

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:04:25
Judged At
2025-04-06 16:04:25
Judged By
Score
0
Total Time
33ms
Peak Memory
540.0 KiB