제출 #994036

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
994036		firewater	팀들 (IOI15_teams)	C++14	0 / 100	4101 ms	524288 KiB

teams

#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;
		x=0;
		for(int j=w;j>=i;--j){
			g[i][j]+=(now>0?h[v[j]][now-1]:0);
			while(x<d[now].size()&&d[now][x].sn>=v[j]){
				if(d[now][x].fs<=v[i])g[i][j]++;
				x++;
			}
		}
	}
	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 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]){
      |          ~^~~~~~~~~~~~~~

• Subtask 1: 0 / 21
• Subtask 2: 0 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23