#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][700],g[MAXM][MAXM],f[MAXM][MAXM];
vector<pair<int,int> >d[700];
void init(int N, int A[], int BB[]) {
n=N;
B=800;
for(int i=1;i<=n;++i){
tie(x,y)=tie(A[i-1],BB[i-1]);
h[y][x/B]++;
d[x/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=n-1;i>0;--i)
for(int j=0;j<=n/B;++j){
h[i][j+1]+=h[i][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)
g[i][j]=0;
for(int i=1;i<=w;++i){
now=v[i]/B;
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;
}
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:47: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]
47 | while(x<d[now].size()&&d[now][x].sn>=v[j]){
| ~^~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
860 KB |
Output is correct |
4 |
Correct |
1 ms |
860 KB |
Output is correct |
5 |
Correct |
0 ms |
604 KB |
Output is correct |
6 |
Correct |
1 ms |
604 KB |
Output is correct |
7 |
Correct |
1 ms |
860 KB |
Output is correct |
8 |
Correct |
0 ms |
860 KB |
Output is correct |
9 |
Correct |
1 ms |
860 KB |
Output is correct |
10 |
Correct |
1 ms |
724 KB |
Output is correct |
11 |
Incorrect |
0 ms |
604 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
145 ms |
281176 KB |
Output is correct |
2 |
Correct |
142 ms |
280148 KB |
Output is correct |
3 |
Correct |
150 ms |
277588 KB |
Output is correct |
4 |
Correct |
143 ms |
278100 KB |
Output is correct |
5 |
Correct |
147 ms |
280260 KB |
Output is correct |
6 |
Correct |
131 ms |
279240 KB |
Output is correct |
7 |
Correct |
141 ms |
280260 KB |
Output is correct |
8 |
Correct |
150 ms |
280260 KB |
Output is correct |
9 |
Incorrect |
119 ms |
278340 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
382 ms |
281696 KB |
Output is correct |
2 |
Correct |
378 ms |
281680 KB |
Output is correct |
3 |
Correct |
416 ms |
281392 KB |
Output is correct |
4 |
Correct |
147 ms |
278096 KB |
Output is correct |
5 |
Execution timed out |
4066 ms |
280784 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
216 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |