oj.uz

Submission #778264

# Submission time Handle Problem Language Result Execution time Memory
778264 2023-07-10T07:58:32 Z Jarif_Rahman Teams (IOI15_teams) C++17
34 / 100
 4000 ms 28816 KB 
#include "teams.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

int n;
int *A, *B;

void init(int _n, int _A[], int _B[]){
    swap(n, _n);
    swap(A, _A);
    swap(B, _B);
}

int can(int m, int K[]){
    vector<vector<int>> rl(n+1);
    for(int i = 0; i < n; i++) rl[A[i]].pb(i);

    vector<int> projects(n+1, 0);
    for(int i = 0; i < m; i++) projects[K[i]]++;

    priority_queue<int, vector<int>, greater<int>> pq;
    for(int i = 1; i <= n; i++){
        for(int j: rl[i]) pq.push(B[j]);

        int k = projects[i]*i;
        if(k > pq.size()) return 0;
        while(k--) pq.pop();

        while(!pq.empty() && pq.top() == i) pq.pop();
    }

    return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:31:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         if(k > pq.size()) 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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 308 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 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 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 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 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 11 ms 5588 KB Output is correct
2 Correct 12 ms 5504 KB Output is correct
3 Correct 24 ms 5972 KB Output is correct
4 Correct 14 ms 7244 KB Output is correct
5 Correct 8 ms 5224 KB Output is correct
6 Correct 7 ms 5304 KB Output is correct
7 Correct 7 ms 5308 KB Output is correct
8 Correct 5 ms 5244 KB Output is correct
9 Correct 8 ms 5896 KB Output is correct
10 Correct 10 ms 5580 KB Output is correct
11 Correct 7 ms 5580 KB Output is correct
12 Correct 8 ms 5676 KB Output is correct
13 Correct 12 ms 5796 KB Output is correct
14 Correct 15 ms 6604 KB Output is correct
15 Correct 23 ms 6996 KB Output is correct
16 Correct 12 ms 6484 KB Output is correct
17 Correct 10 ms 5596 KB Output is correct
18 Correct 11 ms 5608 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1337 ms 6340 KB Output is correct
2 Correct 1556 ms 6388 KB Output is correct
3 Execution timed out 4062 ms 6092 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4080 ms 28816 KB Time limit exceeded
2 Halted 0 ms 0 KB -