oj.uz

Submission #30722

# Submission time Handle Problem Language Result Execution time Memory
30722 2017-07-26T09:37:48 Z rondojim Teams (IOI15_teams) C++14
34 / 100
 4000 ms 24080 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX = (1e5)+1;
 
int n, a[MAX], b[MAX];
set<pair<int,int> > f[MAX];
 
void init(int N, int A[], int B[]) {
	n = N;
	for(int i = 0; i < n; i++) {
		a[i] = A[i];
		b[i] = B[i];
		f[A[i]].emplace(0, i);
		f[B[i]].emplace(1, i);
	}
}
 
int can(int M, int K[]) {
	sort(K, K+M);
	set<pair<int,int> > st;
	vector<pair<int,int> > add_back;
	bool valid = true;
	for(int j = 1, i = 0; j <= n; j++) {
		for(auto p: f[j]) if(!p.first) st.emplace(b[p.second], p.second);
		while(i < M && j == K[i]) {
			valid &= st.size() >= K[i];
			if(!valid) {
				for(auto p: add_back) f[p.first].emplace(1, p.second);
				return 0;
			}
			for(int cnt = 0; cnt < K[i]; cnt++) {
				add_back.push_back(*st.begin());
				f[st.begin()->first].erase(make_pair(1, st.begin()->second));
				st.erase(st.begin());
			}
			i++;
		}
		for(auto p: f[j]) if(p.first) st.erase(make_pair(b[p.second], p.second));
	}
	for(auto p: add_back) f[p.first].emplace(1, p.second);
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:27:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    valid &= st.size() >= K[i];
                       ^

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 17652 KB Output is correct
2 Correct 96 ms 17652 KB Output is correct
3 Correct 183 ms 20028 KB Output is correct
4 Correct 103 ms 18044 KB Output is correct
5 Correct 206 ms 19276 KB Output is correct
6 Correct 176 ms 18508 KB Output is correct
7 Correct 109 ms 17652 KB Output is correct
8 Correct 99 ms 17652 KB Output is correct
9 Correct 149 ms 24080 KB Output is correct
10 Correct 113 ms 23968 KB Output is correct
11 Correct 106 ms 23936 KB Output is correct
12 Correct 133 ms 23608 KB Output is correct
13 Correct 186 ms 21440 KB Output is correct
14 Correct 119 ms 22140 KB Output is correct
15 Correct 209 ms 19104 KB Output is correct
16 Correct 89 ms 17788 KB Output is correct
17 Correct 183 ms 19408 KB Output is correct
18 Correct 213 ms 19356 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 18048 KB Output is correct
2 Correct 79 ms 18048 KB Output is correct
3 Execution timed out 4000 ms 21120 KB Execution timed out
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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