oj.uz

Submission #994119

# Submission time Handle Problem Language Result Execution time Memory
994119 2024-06-07T06:45:26 Z firewater Teams (IOI15_teams) C++14
77 / 100
 330 ms 524288 KB 
#include "teams.h"
#include<bits/stdc++.h>
#define ll long long
#define MAXN 500500
#define MAXM 2024
#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)
		a[i]=make_pair(A[i-1],BB[i-1]);
	sort(a+1,a+1+n);
	for(int i=1;i<=n;++i){
		tie(x,y)=tie(a[i].fs,a[i].sn);
		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;
}

Compilation message

teams.cpp: In lambda function:
teams.cpp:27:48: warning: declaration of 'a' shadows a global declaration [-Wshadow]
   27 |   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:56: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]
   56 |    while(x<d[now].size()&&d[now][x].sn>=v[j]){
      |          ~^~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 604 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 908 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 0 ms 736 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 321872 KB Output is correct
2 Correct 161 ms 320340 KB Output is correct
3 Correct 181 ms 316752 KB Output is correct
4 Correct 177 ms 317524 KB Output is correct
5 Correct 172 ms 321872 KB Output is correct
6 Correct 181 ms 320164 KB Output is correct
7 Correct 168 ms 322024 KB Output is correct
8 Correct 175 ms 321924 KB Output is correct
9 Correct 157 ms 317012 KB Output is correct
10 Correct 167 ms 316628 KB Output is correct
11 Correct 161 ms 317524 KB Output is correct
12 Correct 169 ms 318036 KB Output is correct
13 Correct 171 ms 317008 KB Output is correct
14 Correct 173 ms 317008 KB Output is correct
15 Correct 174 ms 317012 KB Output is correct
16 Correct 178 ms 316872 KB Output is correct
17 Correct 166 ms 316960 KB Output is correct
18 Correct 171 ms 317012 KB Output is correct

Subtask #3
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 322800 KB Output is correct
2 Correct 284 ms 322644 KB Output is correct
3 Correct 256 ms 320748 KB Output is correct
4 Correct 178 ms 317524 KB Output is correct
5 Correct 330 ms 322368 KB Output is correct
6 Correct 308 ms 322384 KB Output is correct
7 Correct 288 ms 322328 KB Output is correct
8 Correct 313 ms 322396 KB Output is correct
9 Correct 161 ms 316948 KB Output is correct
10 Correct 174 ms 317012 KB Output is correct
11 Correct 194 ms 318032 KB Output is correct
12 Correct 267 ms 319116 KB Output is correct
13 Correct 269 ms 317780 KB Output is correct
14 Correct 270 ms 319404 KB Output is correct
15 Correct 251 ms 317780 KB Output is correct
16 Correct 244 ms 317808 KB Output is correct
17 Correct 216 ms 317840 KB Output is correct
18 Correct 197 ms 317836 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 218 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -