Submission #65009447


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
int a[3020020];
pair<int,int> b[3003030];
int dp[1010010];
int dp2[1010010];
int p[202020];
int suma[3030300],sumb[3003030],sump[3030300];
// int fa[1010];
int jc[3303030];
const int mod=998244353;
int res=0;
int ma=0;
vector<int>g[202020],v[202020];
int st[505050][22];
int power(int a,int b){
    int res=1;
    while(b){
        if(b&1)res=res*a%mod;
        b>>=1;
        a=a*a%mod;
    }
    return res;
}
int inv(int x){
    return power(x,mod-2);
}
int C(int n,int m){
    return jc[n]*inv(jc[m])%mod*inv(jc[n-m])%mod;
}
bool cmp(pair<int,int>a,pair<int,int>b){
    return a.first-a.second<b.first-b.second;
}
int r[3030300];
void add(int x,int p,int q){
    if(x==0)return;
    for(int i=x;i<=q;i+=i&-i)dp[i]=max(dp[i],p);
}
int ask(int x){
    int res=0;
    // cout<<x<<endl;
    if(x<=0)return 0;
    for(int i=x;i;i-=i&-i)res=max(res,dp[i]);
    return res;
}

signed main(){
    // cout<<24*5+16*7<<'\n';
    ios::sync_with_stdio(false);
    cin.tie(0); 
    int _=1,i,j;
    // cin>>_;
    while(_--){
        int nn,n,m,i,j=0,k,z,x,y,xx,yy,q;
        int l=0;
        cin>>n>>m;
        map<int,int>mp;
        for(i=0;i<m;i++){
            cin>>x>>y;
            if(x+y<=n)mp[x+y]++;
            else mp[(x+y)-n]++;
        }
   
        int c=m*(m-1)/2;
        for(auto i:mp){
            c-=i.second*(i.second-1)/2;
        }
        cout<<c;
        
        
        
        
    }
}
/*
2
2 3
1 2 3
4 0 5
1 5
1 3 0 4 2

*/

Submission Info

Submission Time
Task D - Line Crossing
User qsmcgogo
Language C++ 20 (gcc 12.2)
Score 400
Code Size 1626 Byte
Status AC
Exec Time 177 ms
Memory 19616 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:56:13: warning: unused variable ‘nn’ [-Wunused-variable]
   56 |         int nn,n,m,i,j=0,k,z,x,y,xx,yy,q;
      |             ^~
Main.cpp:56:22: warning: unused variable ‘j’ [-Wunused-variable]
   56 |         int nn,n,m,i,j=0,k,z,x,y,xx,yy,q;
      |                      ^
Main.cpp:56:26: warning: unused variable ‘k’ [-Wunused-variable]
   56 |         int nn,n,m,i,j=0,k,z,x,y,xx,yy,q;
      |                          ^
Main.cpp:56:28: warning: unused variable ‘z’ [-Wunused-variable]
   56 |         int nn,n,m,i,j=0,k,z,x,y,xx,yy,q;
      |                            ^
Main.cpp:56:34: warning: unused variable ‘xx’ [-Wunused-variable]
   56 |         int nn,n,m,i,j=0,k,z,x,y,xx,yy,q;
      |                                  ^~
Main.cpp:56:37: warning: unused variable ‘yy’ [-Wunused-variable]
   56 |         int nn,n,m,i,j=0,k,z,x,y,xx,yy,q;
      |                                     ^~
Main.cpp:56:40: warning: unused variable ‘q’ [-Wunused-variable]
   56 |         int nn,n,m,i,j=0,k,z,x,y,xx,yy,q;
      |                                        ^
Main.cpp:57:13: warning: unused variable ‘l’ [-Wunused-variable]
   57 |         int l=0;
      |             ^
Main.cpp:53:13: warning: unused variable ‘i’ [-Wunused-variable]
   53 |     int _=1,i,j;
      |             ^
Main.cpp:53:15: warning: unused variable ‘j’ [-Wunused-variable]
   53 |     int _=1,i,j;
      |               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 34
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 2 ms 3404 KiB
00_sample_01.txt AC 2 ms 3412 KiB
01_test_00.txt AC 3 ms 3484 KiB
01_test_01.txt AC 9 ms 3344 KiB
01_test_02.txt AC 3 ms 3428 KiB
01_test_03.txt AC 10 ms 3348 KiB
01_test_04.txt AC 3 ms 3640 KiB
01_test_05.txt AC 29 ms 7812 KiB
01_test_06.txt AC 176 ms 19460 KiB
01_test_07.txt AC 135 ms 15300 KiB
01_test_08.txt AC 3 ms 3528 KiB
01_test_09.txt AC 18 ms 6164 KiB
01_test_10.txt AC 146 ms 18888 KiB
01_test_11.txt AC 36 ms 8692 KiB
01_test_12.txt AC 3 ms 3524 KiB
01_test_13.txt AC 143 ms 18032 KiB
01_test_14.txt AC 177 ms 19616 KiB
01_test_15.txt AC 67 ms 11484 KiB
01_test_16.txt AC 2 ms 3428 KiB
01_test_17.txt AC 139 ms 17088 KiB
01_test_18.txt AC 34 ms 8448 KiB
01_test_19.txt AC 36 ms 8804 KiB
01_test_20.txt AC 78 ms 13128 KiB
01_test_21.txt AC 75 ms 13480 KiB
01_test_22.txt AC 56 ms 11636 KiB
01_test_23.txt AC 17 ms 3468 KiB
01_test_24.txt AC 4 ms 3344 KiB
01_test_25.txt AC 19 ms 3596 KiB
01_test_26.txt AC 4 ms 3384 KiB
01_test_27.txt AC 21 ms 3380 KiB
01_test_28.txt AC 2 ms 3444 KiB
01_test_29.txt AC 2 ms 3372 KiB
01_test_30.txt AC 2 ms 3388 KiB
01_test_31.txt AC 31 ms 3656 KiB