oj.uz

Submission #418374

# Submission time Handle Problem Language Result Execution time Memory
418374 2021-06-05T10:24:16 Z vanic Teams (IOI15_teams) C++14
34 / 100
 4000 ms 26020 KB 
#include "teams.h"
#include <cmath>
#include <algorithm>
#include <iostream>
#include <queue>

using namespace std;

const int maxn=5e5+5;

priority_queue < int, vector < int >, greater < int > > q;
vector < int > sw[maxn];
int n;

void init(int x, int a[], int b[]){
	n=x;
	for(int i=0; i<n; i++){
		sw[a[i]].push_back(b[i]+1);
	}
}

int can(int m, int k[]){
	sort(k, k+m);
	int pos=0;
	for(int i=0; i<=n; i++){
		for(int j=0; j<(int)sw[i].size(); j++){
			q.push(sw[i][j]);
		}
		while(!q.empty() && q.top()==i){
			q.pop();
		}
//		cout <<  "sz " << q.size() << endl;
		while(pos<m && k[pos]==i){
			if((int)q.size()<i){
				while(!q.empty()){
					q.pop();
				}
				return 0;
			}
			for(int j=0; j<i; j++){
				q.pop();
			}
			pos++;
		}
	}
	while(!q.empty()){
		q.pop();
	}
	return 1;
}

/*
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	int a[n], b[n];
	for(int i=0; i<n; i++){
		cin >> a[i] >> b[i];
	}
	init(n, a, b);
	int q;
	cin >> q;
	for(int i=0; i<q; i++){
		int m;
		cin >> m;
		int c[m];
		for(int j=0; j<m; j++){
			cin >> c[j];
		}
		cout << can(m, c) << '\n';
	}
	return 0;
}
*/

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 14540 KB Output is correct
2 Correct 22 ms 14568 KB Output is correct
3 Correct 36 ms 14928 KB Output is correct
4 Correct 25 ms 14972 KB Output is correct
5 Correct 15 ms 13436 KB Output is correct
6 Correct 15 ms 13540 KB Output is correct
7 Correct 13 ms 13544 KB Output is correct
8 Correct 14 ms 13516 KB Output is correct
9 Correct 17 ms 14112 KB Output is correct
10 Correct 16 ms 14020 KB Output is correct
11 Correct 16 ms 13892 KB Output is correct
12 Correct 16 ms 13948 KB Output is correct
13 Correct 21 ms 13908 KB Output is correct
14 Correct 26 ms 14544 KB Output is correct
15 Correct 37 ms 14860 KB Output is correct
16 Correct 24 ms 14412 KB Output is correct
17 Correct 20 ms 13560 KB Output is correct
18 Correct 21 ms 13516 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 15020 KB Output is correct
2 Correct 30 ms 14916 KB Output is correct
3 Execution timed out 4065 ms 15004 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 25668 KB Output is correct
2 Correct 154 ms 25600 KB Output is correct
3 Execution timed out 4077 ms 26020 KB Time limit exceeded
4 Halted 0 ms 0 KB -