oj.uz

Submission #285440

# Submission time Handle Problem Language Result Execution time Memory
285440 2020-08-29T00:38:53 Z Ozy Teams (IOI15_teams) C++17
34 / 100
 4000 ms 12272 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define debug(a) cerr << #a << " = " << a << endl;
#define ini first
#define fin second

vector<pair<int, int> > inicios;
priority_queue<int> cola;

void init(int N, int A[], int B[]) {

    rep(i,0,N-1) inicios.push_back({A[i],B[i]});
    sort(inicios.begin(), inicios.end());

}

int can(int M, int K[]) {
    int cont;

	sort(K,K+M);
	while (!cola.empty()) cola.pop();
	cont = 0;

	rep(i,0,M-1) {

        while(cont < inicios.size() && inicios[cont].ini <= K[i]) {
            cola.push(-inicios[cont].fin);
            cont++;
        }

        while (!cola.empty() && abs(cola.top()) < K[i]) cola.pop();

        if (cola.size() < K[i]) return 0;
        else rep(j,1,K[i]) cola.pop();

	}
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         while(cont < inicios.size() && inicios[cont].ini <= K[i]) {
      |               ~~~~~^~~~~~~~~~~~~~~~
teams.cpp:35:25: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |         if (cola.size() < K[i]) return 0;
      |             ~~~~~~~~~~~~^~~~~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2296 KB Output is correct
2 Correct 16 ms 2296 KB Output is correct
3 Correct 25 ms 2804 KB Output is correct
4 Correct 18 ms 2296 KB Output is correct
5 Correct 13 ms 2296 KB Output is correct
6 Correct 15 ms 3064 KB Output is correct
7 Correct 12 ms 3064 KB Output is correct
8 Correct 13 ms 3064 KB Output is correct
9 Correct 13 ms 3828 KB Output is correct
10 Correct 11 ms 3444 KB Output is correct
11 Correct 11 ms 3444 KB Output is correct
12 Correct 12 ms 3444 KB Output is correct
13 Correct 20 ms 3316 KB Output is correct
14 Correct 18 ms 3828 KB Output is correct
15 Correct 17 ms 3448 KB Output is correct
16 Correct 18 ms 3448 KB Output is correct
17 Correct 17 ms 3320 KB Output is correct
18 Correct 18 ms 3416 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2296 KB Output is correct
2 Correct 24 ms 2296 KB Output is correct
3 Execution timed out 4089 ms 2804 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 8928 KB Output is correct
2 Correct 102 ms 8928 KB Output is correct
3 Execution timed out 4070 ms 12272 KB Time limit exceeded
4 Halted 0 ms 0 KB -