oj.uz

Submission #331069

# Submission time Handle Problem Language Result Execution time Memory
331069 2020-11-27T08:19:25 Z monkey8 Teams (IOI15_teams) C++17
34 / 100
 4000 ms 19292 KB 
#include "teams.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cstdio>
#include <utility> 
#include <queue>
#include <math.h>
#include <set>
#include <bitset>
#include <cmath>
#include <bitset>
#include <iterator>
#include <limits>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
vector<pii> students;
int N;
void init(int n, int a[], int b[]) {
	N = n;
	for(int i = 0; i < n; i++)
		students.push_back(pii(a[i], b[i]));
	sort(students.begin(), students.end());
}

int can(int m, int k[]) {
	sort(k, k + m);
	priority_queue<int> pq;
	int idx = 0;
	for(int i = 0; i < m; i++) {
		while(idx < N && students[idx].first <= k[i]) {
			pq.push(-students[idx].second);
			idx++;
		}
		while(!pq.empty() && -pq.top() < k[i])
			pq.pop();
		if(pq.size() < k[i]) return 0;
		else {
			for(int j = 0; j < k[i]; j++)
				pq.pop();
		}
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:40:16: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |   if(pq.size() < k[i]) return 0;
      |      ~~~~~~~~~~^~~~~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3428 KB Output is correct
2 Correct 17 ms 3428 KB Output is correct
3 Correct 26 ms 3936 KB Output is correct
4 Correct 20 ms 3808 KB Output is correct
5 Correct 15 ms 3044 KB Output is correct
6 Correct 16 ms 3044 KB Output is correct
7 Correct 13 ms 3044 KB Output is correct
8 Correct 13 ms 3044 KB Output is correct
9 Correct 13 ms 3808 KB Output is correct
10 Correct 11 ms 3424 KB Output is correct
11 Correct 11 ms 3424 KB Output is correct
12 Correct 13 ms 3552 KB Output is correct
13 Correct 20 ms 3296 KB Output is correct
14 Correct 18 ms 3808 KB Output is correct
15 Correct 17 ms 3428 KB Output is correct
16 Correct 17 ms 3428 KB Output is correct
17 Correct 18 ms 3300 KB Output is correct
18 Correct 17 ms 3428 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3808 KB Output is correct
2 Correct 24 ms 3808 KB Output is correct
3 Execution timed out 4061 ms 4584 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 16340 KB Output is correct
2 Correct 107 ms 16340 KB Output is correct
3 Execution timed out 4067 ms 19292 KB Time limit exceeded
4 Halted 0 ms 0 KB -