oj.uz

Submission #769018

# Submission time Handle Problem Language Result Execution time Memory
769018 2023-06-29T05:10:20 Z boyliguanhan Teams (IOI15_teams) C++17
34 / 100
 4000 ms 23016 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
pair<int, int> people[600000];
int n;
void init(int N, int A[], int B[]) {
	n=N;
	for(int i = 0; i < n; i++)
        people[i]={A[i], B[i]};
	sort(people,people+N);
}
int can(int M, int K[]) {
	sort(K,K+M);
	priority_queue<pair<int, int>,vector<pair<int, int>>,greater<pair<int, int>>>q;
	int cur=0;
	for(int i = 0; i < M; i++){
		int x=K[i];
		while(cur<n&&people[cur].first<=x)
            q.push({people[cur].second,people[cur].first}),cur++;
		while(!q.empty()&&q.top().first<x)q.pop();
		if(q.size()<x)return 0;
		while(x--) q.pop();
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:21:14: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int> >, std::greater<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |   if(q.size()<x)return 0;
      |      ~~~~~~~~^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 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 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 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 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 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 308 KB Output is correct
25 Correct 1 ms 212 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 13 ms 1888 KB Output is correct
2 Correct 13 ms 1892 KB Output is correct
3 Correct 20 ms 2964 KB Output is correct
4 Correct 14 ms 2260 KB Output is correct
5 Correct 12 ms 1808 KB Output is correct
6 Correct 13 ms 1888 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 9 ms 2556 KB Output is correct
9 Correct 16 ms 3916 KB Output is correct
10 Correct 12 ms 3596 KB Output is correct
11 Correct 12 ms 3640 KB Output is correct
12 Correct 13 ms 3676 KB Output is correct
13 Correct 21 ms 3460 KB Output is correct
14 Correct 17 ms 4020 KB Output is correct
15 Correct 13 ms 3132 KB Output is correct
16 Correct 12 ms 3028 KB Output is correct
17 Correct 16 ms 3296 KB Output is correct
18 Correct 17 ms 3324 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2268 KB Output is correct
2 Correct 18 ms 2260 KB Output is correct
3 Execution timed out 4059 ms 3888 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 9536 KB Output is correct
2 Correct 79 ms 16276 KB Output is correct
3 Execution timed out 4100 ms 23016 KB Time limit exceeded
4 Halted 0 ms 0 KB -