1 solutions
-
0
C++ :
#include<cstdio> #include<cstring> typedef long long int64; int64 n,k,p; int64 cnt; int64 x,y; int64 c[51][200001], top[51]; int64 total=0; int64 pi=0; int64 Sum,prev; inline void Input(){ memset(top,-1,sizeof(top)); scanf("%lld%lld%lld",&n,&k,&p); for(int64 i=0;i<n;i++){ scanf("%lld%lld",&x,&y); int64 t=++top[x]; if(y<=p||pi>0)cnt++; c[x][t]=cnt; pi=(y<=p)?1:0; } } inline void Work(){ for(int64 color=0;color<k;color++){ prev=c[color][0]; Sum=0; for(int64 i=0;i<=top[color];i++){ if(c[color][i]-prev>0)Sum=i; total+=Sum; prev=c[color][i]; } } } inline void Output(){ printf("%lld",total); } int main(){ Input(); Work(); Output(); return 0; }
- 1
Information
- ID
- 17887
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By