Submission #56794653


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define re register
#define il inline
#define pii pair<int,int>
#define x first
#define y second
#define gc getchar()
#define rd read()
#define debug() puts("------------")

namespace yzqwq{
    il int read(){
        int x=0,f=1;char ch=gc;
        while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc;}
        while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=gc;
        return x*f;
    }
    il int qmi(int a,int b,int p){
        int ans=1;
        while(b){
            if(b&1) ans=ans*a%p;
            a=a*a%p,b>>=1;
        }
        return ans;
    }
    il auto max(auto a,auto b){return (a>b?a:b);}
    il auto min(auto a,auto b){return (a<b?a:b);}
    il int gcd(int a,int b){
        if(!b) return a;
        return gcd(b,a%b);
    }
    il int lcm(int a,int b){
        return a/gcd(a,b)*b;
    }
    il void exgcd(int a,int b,int &x,int &y){
        if(!b) return x=1,y=0,void(0);
        exgcd(b,a%b,x,y);
        int t=x;
        x=y,y=t-a/b*x;
        return ;
    }
    mt19937 rnd(time(0));
}
using namespace yzqwq;

const int N=4e5+10;
int n,s[N],m;
unordered_map<int,int> cnt;

il void solve(){
    n=rd,m=rd;
    for(re int i=1;i<=n;++i){
        s[i]=s[i+n]=rd;
    }
    for(re int i=1;i<=2*n;++i) s[i]+=s[i-1],s[i]%=m;//,cout<<s[i]<<" ";
    for(re int i=1;i<=n;++i) ++cnt[s[i]];
    int sum=0;
    for(re int i=1,j=n;i<=n;++i){
         --cnt[s[i]];
        //  cout<<s[i]<<" "<<cnt[s[i]]<<" ";
        sum+=cnt[s[i]];
        ++cnt[s[++j]];
        // ++cnt[s[i+1]];
        // --cnt[s[i]];
    }cout<<sum;
    return ;
}

signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    int t=1;while(t--)
    solve();
    return 0;
}

Submission Info

Submission Time
Task D - Pedometer
User harmis_yz
Language C++ 20 (gcc 12.2)
Score 400
Code Size 1814 Byte
Status AC
Exec Time 53 ms
Memory 25792 KiB

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:54:16: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   54 |     for(re int i=1;i<=n;++i){
      |                ^
Main.cpp:57:16: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   57 |     for(re int i=1;i<=2*n;++i) s[i]+=s[i-1],s[i]%=m;//,cout<<s[i]<<" ";
      |                ^
Main.cpp:58:16: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   58 |     for(re int i=1;i<=n;++i) ++cnt[s[i]];
      |                ^
Main.cpp:60:16: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   60 |     for(re int i=1,j=n;i<=n;++i){
      |                ^
Main.cpp:60:20: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   60 |     for(re int i=1,j=n;i<=n;++i){
      |                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 61
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3516 KiB
sample_02.txt AC 1 ms 3604 KiB
sample_03.txt AC 1 ms 3532 KiB
test_01.txt AC 1 ms 3636 KiB
test_02.txt AC 1 ms 3512 KiB
test_03.txt AC 2 ms 4020 KiB
test_04.txt AC 3 ms 4488 KiB
test_05.txt AC 24 ms 9236 KiB
test_06.txt AC 50 ms 25792 KiB
test_07.txt AC 10 ms 10600 KiB
test_08.txt AC 8 ms 6576 KiB
test_09.txt AC 3 ms 4352 KiB
test_10.txt AC 5 ms 5012 KiB
test_11.txt AC 13 ms 6668 KiB
test_12.txt AC 15 ms 6976 KiB
test_13.txt AC 2 ms 3964 KiB
test_14.txt AC 26 ms 25548 KiB
test_15.txt AC 47 ms 25660 KiB
test_16.txt AC 2 ms 3912 KiB
test_17.txt AC 1 ms 3732 KiB
test_18.txt AC 4 ms 4416 KiB
test_19.txt AC 13 ms 6780 KiB
test_20.txt AC 8 ms 5544 KiB
test_21.txt AC 11 ms 9200 KiB
test_22.txt AC 47 ms 25556 KiB
test_23.txt AC 53 ms 19276 KiB
test_24.txt AC 13 ms 6576 KiB
test_25.txt AC 7 ms 5344 KiB
test_26.txt AC 13 ms 6648 KiB
test_27.txt AC 6 ms 4912 KiB
test_28.txt AC 7 ms 6148 KiB
test_29.txt AC 12 ms 8276 KiB
test_30.txt AC 45 ms 17452 KiB
test_31.txt AC 8 ms 6284 KiB
test_32.txt AC 6 ms 4860 KiB
test_33.txt AC 10 ms 6156 KiB
test_34.txt AC 14 ms 6720 KiB
test_35.txt AC 8 ms 6648 KiB
test_36.txt AC 9 ms 6888 KiB
test_37.txt AC 24 ms 11048 KiB
test_38.txt AC 29 ms 11400 KiB
test_39.txt AC 3 ms 4420 KiB
test_40.txt AC 3 ms 4280 KiB
test_41.txt AC 8 ms 5236 KiB
test_42.txt AC 8 ms 6756 KiB
test_43.txt AC 6 ms 5820 KiB
test_44.txt AC 9 ms 6260 KiB
test_45.txt AC 24 ms 10500 KiB
test_46.txt AC 45 ms 16736 KiB
test_47.txt AC 24 ms 10676 KiB
test_48.txt AC 2 ms 3704 KiB
test_49.txt AC 8 ms 6728 KiB
test_50.txt AC 8 ms 6788 KiB
test_51.txt AC 10 ms 6792 KiB
test_52.txt AC 13 ms 6788 KiB
test_53.txt AC 27 ms 10992 KiB
test_54.txt AC 4 ms 4808 KiB
test_55.txt AC 8 ms 5408 KiB
test_56.txt AC 8 ms 6836 KiB
test_57.txt AC 8 ms 6712 KiB
test_58.txt AC 1 ms 3916 KiB