oj.uz

Submission #741645

# Submission time Handle Problem Language Result Execution time Memory
741645 2023-05-14T13:47:40 Z MODDI Teams (IOI15_teams) C++14
34 / 100
 4000 ms 20400 KB 
#include "teams.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
using namespace std;
vector<pii> arr;
void init(int N, int A[], int B[]) {
	for(int i = 0; i < N; i++){
		arr.pb(mp(A[i], B[i]));
	}
//	sort(arr.begin(), arr.end(), comp);
}
 
int can(int M, int K[]) {
	vector<int> teams;
	for(int i = 0; i < M; i++)
		teams.pb(K[i]);
	
	sort(teams.begin(), teams.end());
	auto comp = [](pii& a, pii& b){
		return (a.second == b.second) ? a.first > b.first : a.second > b.second;
	};
	priority_queue<pii, vector<pii>, decltype(comp)> pq(comp);
	for(int i = 0;  i< arr.size(); i++)
		pq.push(arr[i]);
	
	for(int i = 0; i < teams.size(); i++){
		int taken = 0;
		vector<pii> reuse;
		while(!pq.empty() && taken < teams[i]){
			pii now = pq.top();
			pq.pop();
			if(teams[i] < now.first || teams[i] > now.second){
				reuse.pb(now);
				continue;
			}
			taken++;
		}
		if(taken < teams[i])	return 0;
		for(auto t : reuse)
			pq.push(t);
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:27:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |  for(int i = 0;  i< arr.size(); i++)
      |                  ~^~~~~~~~~~~~
teams.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for(int i = 0; i < teams.size(); i++){
      |                 ~~^~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4408 KB Output is correct
2 Correct 24 ms 4152 KB Output is correct
3 Correct 24 ms 3596 KB Output is correct
4 Correct 26 ms 5192 KB Output is correct
5 Correct 19 ms 3400 KB Output is correct
6 Correct 343 ms 4316 KB Output is correct
7 Correct 20 ms 4936 KB Output is correct
8 Correct 19 ms 4864 KB Output is correct
9 Correct 10 ms 4804 KB Output is correct
10 Correct 9 ms 4348 KB Output is correct
11 Correct 9 ms 4020 KB Output is correct
12 Correct 11 ms 4016 KB Output is correct
13 Correct 20 ms 4296 KB Output is correct
14 Correct 20 ms 4300 KB Output is correct
15 Correct 13 ms 4552 KB Output is correct
16 Correct 22 ms 5196 KB Output is correct
17 Correct 25 ms 4460 KB Output is correct
18 Correct 28 ms 4460 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4037 ms 4868 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 4049 ms 20400 KB Time limit exceeded
2 Halted 0 ms 0 KB -