oj.uz

Submission #994061

# Submission time Handle Problem Language Result Execution time Memory
994061 2024-06-07T05:23:52 Z firewater Teams (IOI15_teams) C++14
0 / 100
 277 ms 524288 KB 
#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)
			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;
		// printf("%d %d %d\n",i,now,d[now].size());
		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++;
				// printf("%d %d %d %d\n",i,j,d[now][x].fs,d[now][x].sn);
				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=1;j<=w;++j)
	// 		printf("%d ",f[i][j]);
	// 		putchar(10);
	// }
	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: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:55: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]
   55 |    while(x<d[now].size()&&d[now][x].sn>=v[j]){
      |          ~^~~~~~~~~~~~~~

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Incorrect 1 ms 6492 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 324436 KB Output is correct
2 Correct 161 ms 321872 KB Output is correct
3 Correct 198 ms 319576 KB Output is correct
4 Correct 159 ms 320080 KB Output is correct
5 Incorrect 197 ms 322644 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 323152 KB Output is correct
2 Correct 273 ms 323128 KB Output is correct
3 Incorrect 227 ms 322872 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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