제출 #994088

#제출 시각아이디문제언어결과실행 시간메모리
994088firewater팀들 (IOI15_teams)C++17
21 / 100
289 ms524288 KiB
#include "teams.h" #include<bits/stdc++.h> #define ll long long #define MAXN 500500 #define MAXM 1010 #define fs first #define sn second using namespace std; int n,B,x,y,now,w,sum,v[MAXM],c[MAXM],h[MAXN][800],g[MAXM][MAXM],f[MAXM][MAXM]; vector<pair<int,int> >d[800]; pair<int,int>a[MAXN]; void init(int N, int A[], int BB[]) { n=N; B=800; for(int i=0;i<=n;++i) for(int j=0;j<=n/B;++j) h[i][j]=0; for(int i=1;i<=n;++i){ tie(x,y)=tie(A[i-1],BB[i-1]); a[i]=make_pair(x,y); h[y][i/B]++; d[i/B].push_back({x,y}); } for(int i=0;i<=n/B;++i) sort(d[i].begin(),d[i].end(),[](pair<int,int>a,pair<int,int>b){return (a.sn>b.sn);}); for(int i=1;i<=n;++i) for(int j=1;j<=n/B;++j) h[i][j]+=h[i][j-1]; for(int i=n-1;i>0;--i) for(int j=0;j<=n/B;++j) h[i][j]+=h[i+1][j]; return; } int can(int M, int K[]) { sum=0; w=0; sort(K,K+M); for(int i=0;i<M;++i){ sum+=K[i]; if(sum>n)return 0; if(!w||v[w]!=K[i])v[++w]=K[i],c[w]=K[i]; else c[w]+=K[i]; } for(int i=0;i<=w+1;++i) for(int j=0;j<=w+1;++j) f[i][j]=g[i][j]=0; for(int i=1;i<=w;++i){ now=0; while((now+1)*B<=n&&a[(now+1)*B].fs<=v[i])now++; sum=0; x=0; for(int j=w;j>=i;--j){ while(x<d[now].size()&&d[now][x].sn>=v[j]){ if(d[now][x].fs<=v[i])sum++; x++; } g[i][j]=(now>0?h[v[j]][now-1]:0)+sum; } } for(int i=1;i<=w;++i) for(int j=i;j<=w;++j) f[i][j]=g[i][j]-g[i-1][j]-g[i][j+1]+g[i-1][j+1]; for(int i=1;i<=w;++i){ for(int j=i;j<=w;++j){ x=min(c[i],f[i][j]); f[i][j]-=x; c[i]-=x; } if(c[i])return 0; for(int j=i+1;j<=w;++j) f[i+1][j]+=f[i][j]; } return 1; }

컴파일 시 표준 에러 (stderr) 메시지

teams.cpp: In lambda function:
teams.cpp:25:48: warning: declaration of 'a' shadows a global declaration [-Wshadow]
   25 |   sort(d[i].begin(),d[i].end(),[](pair<int,int>a,pair<int,int>b){return (a.sn>b.sn);});
      |                                   ~~~~~~~~~~~~~^
teams.cpp:11:14: note: shadowed declaration is here
   11 | pair<int,int>a[MAXN];
      |              ^
teams.cpp: In function 'int can(int, int*)':
teams.cpp:54:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |    while(x<d[now].size()&&d[now][x].sn>=v[j]){
      |          ~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...