Submission #163586

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
163586	2019-11-14T06:22:08 Z	shenxy	Teams (IOI15_teams)	C++11	34 / 100	4000 ms	16760 KB

teams

#include "teams.h"
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int, int> ii;
int n;
ii res[100000];
void init(int N, int A[], int B[]) {
	n = N;
	for (int i = 0; i < N; ++i) res[i] = ii(A[i], B[i]);
	sort(res, res + N);
}
int can(int M, int K[]) {
	priority_queue<int> pq;
	sort(K, K + M);
	int ptr = 0;
	for (int i = 0; i < M; ++i) {
		while (ptr != n && res[ptr].first <= K[i]) pq.push(-res[ptr++].second);
		while (!pq.empty() && -pq.top() < K[i]) pq.pop();
		if (pq.size() < K[i]) return 0;
		for (int j = 0; j < K[i]; ++j) pq.pop();
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:20:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (pq.size() < K[i]) return 0;
       ~~~~~~~~~~^~~~~~

Subtask #1

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	3 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	380 KB	Output is correct
10	Correct	3 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	252 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	3068 KB	Output is correct
2	Correct	18 ms	3064 KB	Output is correct
3	Correct	27 ms	3700 KB	Output is correct
4	Correct	20 ms	3576 KB	Output is correct
5	Correct	17 ms	2680 KB	Output is correct
6	Correct	18 ms	2680 KB	Output is correct
7	Correct	14 ms	2680 KB	Output is correct
8	Correct	14 ms	2808 KB	Output is correct
9	Correct	13 ms	3572 KB	Output is correct
10	Correct	12 ms	3112 KB	Output is correct
11	Correct	12 ms	3188 KB	Output is correct
12	Correct	13 ms	3188 KB	Output is correct
13	Correct	20 ms	3208 KB	Output is correct
14	Correct	20 ms	3444 KB	Output is correct
15	Correct	18 ms	3064 KB	Output is correct
16	Correct	18 ms	3064 KB	Output is correct
17	Correct	20 ms	3192 KB	Output is correct
18	Correct	20 ms	3192 KB	Output is correct

Subtask #3

0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	3828 KB	Output is correct
2	Correct	26 ms	3856 KB	Output is correct
3	Execution timed out	4024 ms	4420 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	45 ms	16760 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-