oj.uz

Submission #958847

# Submission time Handle Problem Language Result Execution time Memory
958847 2024-04-07T01:13:30 Z 12345678 Teams (IOI15_teams) C++17
34 / 100
 4000 ms 12344 KB 
#include "teams.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;
int n, cur;
vector<pair<int, int>> v;

void init(int N, int A[], int B[]) {
	n=N;
	for (int i=0; i<N; i++) v.push_back({A[i], B[i]});
	sort(v.begin(), v.end());
}

int can(int M, int K[]) {
	sort(K, K+M);
	cur=0;
    priority_queue<int, vector<int>, greater<int>> pq;
    for (int i=0; i<M; i++)
    {
        while (cur<n&&v[cur].first<=K[i]) pq.push(v[cur++].second);
        while (!pq.empty()&&pq.top()<K[i]) pq.pop();
        if (pq.size()<K[i]) return 0;
        while (K[i]--) pq.pop();
    }
	return 1;
}

Compilation message

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

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2184 KB Output is correct
2 Correct 14 ms 2260 KB Output is correct
3 Correct 20 ms 2784 KB Output is correct
4 Correct 15 ms 2260 KB Output is correct
5 Correct 11 ms 2416 KB Output is correct
6 Correct 12 ms 2260 KB Output is correct
7 Correct 10 ms 2256 KB Output is correct
8 Correct 10 ms 2260 KB Output is correct
9 Correct 9 ms 2816 KB Output is correct
10 Correct 8 ms 2768 KB Output is correct
11 Correct 8 ms 2760 KB Output is correct
12 Correct 8 ms 2764 KB Output is correct
13 Correct 14 ms 2260 KB Output is correct
14 Correct 15 ms 2768 KB Output is correct
15 Correct 13 ms 2260 KB Output is correct
16 Correct 13 ms 2260 KB Output is correct
17 Correct 13 ms 2288 KB Output is correct
18 Correct 14 ms 2256 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2256 KB Output is correct
2 Correct 18 ms 2256 KB Output is correct
3 Execution timed out 4056 ms 3312 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 8908 KB Output is correct
2 Correct 88 ms 9408 KB Output is correct
3 Execution timed out 4075 ms 12344 KB Time limit exceeded
4 Halted 0 ms 0 KB -