답안 #201332

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201332	2020-02-10T08:26:11 Z	tinjyu	팀들 (IOI15_teams)	C++14	34 / 100	4000 ms	28116 KB

teams

#include "teams.h"
#include <iostream>
#include <algorithm> 
#include <vector> 
using namespace std;
struct node{
	long long int a,b;
}val[1000005];
long long int n,m,k[1000004];

bool cmp1(node x,node y) {
	return x.a < y.a;  
}
bool cmp2(int x,int y)
{
	return x<y;
}
struct cmp3
{
	bool operator()(node x,node y)
	{
		return x.b>y.b;
	}
};
void init(int N, int A[], int B[]) {
	n=N;
	for(int i=0;i<n;i++)
	{
		val[i].a=A[i];
		val[i].b=B[i];
	}
	sort(val,val+n,cmp1);
}

int can(int M, int K[]) 
{
	m=M;
	for(int i=0;i<m;i++)k[i]=K[i];
	sort(k,k+m,cmp2);
	vector<node> v;
	int p=0;
	for(int i=0;i<m;i++)
	{
		while(val[p].a<=k[i] && p<n)
		{
			v.push_back(val[p]);
			push_heap(v.begin(),v.end(),cmp3());
			p++;
		}
		while(v[0].b<k[i] && v.empty()==false){
			pop_heap(v.begin(),v.end(),cmp3());
			v.pop_back();
		}
		while(k[i]--)
		{
			if(v.empty()==true)
			{
				return 0;
			}
			pop_heap(v.begin(),v.end(),cmp3());
			v.pop_back();
		}
	}
	return 1;
}

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	6 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	6 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	380 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	380 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct

Subtask #2

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	2680 KB	Output is correct
2	Correct	22 ms	2680 KB	Output is correct
3	Correct	37 ms	4844 KB	Output is correct
4	Correct	27 ms	3832 KB	Output is correct
5	Correct	22 ms	2680 KB	Output is correct
6	Correct	23 ms	2808 KB	Output is correct
7	Correct	17 ms	2680 KB	Output is correct
8	Correct	17 ms	2680 KB	Output is correct
9	Correct	29 ms	5228 KB	Output is correct
10	Correct	24 ms	5100 KB	Output is correct
11	Correct	23 ms	4844 KB	Output is correct
12	Correct	25 ms	4844 KB	Output is correct
13	Correct	32 ms	3824 KB	Output is correct
14	Correct	31 ms	4844 KB	Output is correct
15	Correct	22 ms	3064 KB	Output is correct
16	Correct	21 ms	2808 KB	Output is correct
17	Correct	25 ms	3316 KB	Output is correct
18	Correct	25 ms	3316 KB	Output is correct

Subtask #3

0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	3064 KB	Output is correct
2	Correct	30 ms	3064 KB	Output is correct
3	Execution timed out	4090 ms	6544 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	122 ms	12920 KB	Output is correct
2	Correct	117 ms	12920 KB	Output is correct
3	Execution timed out	4099 ms	28116 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-