oj.uz

Submission #619598

# Submission time Handle Problem Language Result Execution time Memory
619598 2022-08-02T13:29:26 Z Mounir Teams (IOI15_teams) C++14
34 / 100
 4000 ms 28692 KB 
#include "teams.h"
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define chmax(x, v) x = max(x, v)
#define chmin(x, v) x = min(x, v)
#define pii pair<int, int>
#define pb push_back
#define sz(x) (int)x.size()
#define x first
#define y second
//#define int long long
using namespace std;

const int N_ELEVES = 3e5;

int nInters;
vector<int> fins[N_ELEVES];

void init(int N, int A[], int B[]) {
	nInters = N;
	for (int i = 0; i < N; ++i)
		fins[A[i]].pb(B[i]);
	nInters++;
}

int can(int M, int K[]) {
	int nReqs[nInters];
	for (int i = 0; i < nInters; ++i)
		nReqs[i] = 0;
	for (int iReq = 0; iReq < M; ++iReq)
		nReqs[K[iReq]]++;
	
	priority_queue<int> actus;
	for (int i = 0; i < nInters; ++i){
		for (int fin : fins[i])
			actus.push(-fin);
		while (nReqs[i]--){
			int nb = 0;
			while (!actus.empty() && nb != i){
				nb += (-actus.top() >= i);
				actus.pop();
			}

			if (nb < i)
				return 0;
		}
	}
	return 1;
}

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 11424 KB Output is correct
2 Correct 21 ms 11388 KB Output is correct
3 Correct 42 ms 12084 KB Output is correct
4 Correct 19 ms 12044 KB Output is correct
5 Correct 11 ms 9912 KB Output is correct
6 Correct 12 ms 9940 KB Output is correct
7 Correct 10 ms 10024 KB Output is correct
8 Correct 9 ms 9932 KB Output is correct
9 Correct 13 ms 10572 KB Output is correct
10 Correct 11 ms 10188 KB Output is correct
11 Correct 11 ms 10296 KB Output is correct
12 Correct 14 ms 10352 KB Output is correct
13 Correct 16 ms 10540 KB Output is correct
14 Correct 20 ms 11212 KB Output is correct
15 Correct 23 ms 11896 KB Output is correct
16 Correct 18 ms 11268 KB Output is correct
17 Correct 15 ms 10364 KB Output is correct
18 Correct 17 ms 10388 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 12300 KB Output is correct
2 Correct 29 ms 12212 KB Output is correct
3 Execution timed out 4027 ms 12776 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 45 ms 28692 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -