oj.uz

Submission #47628

# Submission time Handle Problem Language Result Execution time Memory
47628 2018-05-05T23:23:26 Z RezwanArefin01 Teams (IOI15_teams) C++17
34 / 100
 4000 ms 57896 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std; 

int n, a[500100], b[500100]; 
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];
}

int can(int M, int K[]) {
	int S = 0; 
	for(int i = 0; i < M; i++) S += K[i];
	if(S > n) return 0;

	multiset<pair<int, int> > st; 
	for(int i = 0; i < n; i++) {
		st.insert({b[i], a[i]}); 
	}

	sort(K, K + M); 
	for(int i = 0; i < M; i++) {
		int h = K[i]; 
		for(auto it = st.begin(); it != st.end() && h; ) {
			if(it -> second <= K[i] && K[i] <= it -> first) {
				auto x = it; it++;
				st.erase(x); h--;
			} else it++;
		}
		if(h) return 0;
	} return 1;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 496 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 3 ms 692 KB Output is correct
8 Correct 4 ms 692 KB Output is correct
9 Correct 2 ms 712 KB Output is correct
10 Correct 3 ms 736 KB Output is correct
11 Correct 2 ms 780 KB Output is correct
12 Correct 3 ms 784 KB Output is correct
13 Correct 3 ms 808 KB Output is correct
14 Correct 3 ms 832 KB Output is correct
15 Correct 3 ms 836 KB Output is correct
16 Correct 2 ms 844 KB Output is correct
17 Correct 2 ms 844 KB Output is correct
18 Correct 2 ms 864 KB Output is correct
19 Correct 2 ms 868 KB Output is correct
20 Correct 2 ms 868 KB Output is correct
21 Correct 2 ms 876 KB Output is correct
22 Correct 2 ms 880 KB Output is correct
23 Correct 2 ms 884 KB Output is correct
24 Correct 2 ms 888 KB Output is correct
25 Correct 2 ms 892 KB Output is correct
26 Correct 2 ms 896 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 8268 KB Output is correct
2 Correct 58 ms 9476 KB Output is correct
3 Correct 55 ms 10612 KB Output is correct
4 Correct 63 ms 12312 KB Output is correct
5 Correct 64 ms 12760 KB Output is correct
6 Correct 176 ms 13652 KB Output is correct
7 Correct 56 ms 14312 KB Output is correct
8 Correct 58 ms 15076 KB Output is correct
9 Correct 34 ms 16096 KB Output is correct
10 Correct 26 ms 16472 KB Output is correct
11 Correct 24 ms 17000 KB Output is correct
12 Correct 28 ms 17724 KB Output is correct
13 Correct 49 ms 18696 KB Output is correct
14 Correct 48 ms 19648 KB Output is correct
15 Correct 51 ms 20792 KB Output is correct
16 Correct 54 ms 21932 KB Output is correct
17 Correct 42 ms 23056 KB Output is correct
18 Correct 44 ms 24084 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4032 ms 25984 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4054 ms 57896 KB Time limit exceeded
2 Halted 0 ms 0 KB -