oj.uz

Submission #959117

# Submission time Handle Problem Language Result Execution time Memory
959117 2024-04-07T13:49:15 Z Mizo_Compiler Teams (IOI15_teams) C++17
0 / 100
 4000 ms 13504 KB 
#include <bits/stdc++.h>
#include "teams.h"
using namespace std;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int32_t(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
int n;
vector<pair<int, int>> v;
void init(int N, int A[], int B[]) {
	n = N;
	for (int i = 0; i < n; i++) {
		v.pb({B[i], A[i]});
	}
	sort(all(v));
}

int can(int M, int K[]) {
	sort(K, K+M);
	int id = 0, rem = K[0];
	for (int i = 0; i < n && id < M; i++) {
		if (v[i].S <= K[id] && K[id] <= v[i].F) {
			rem--;
			if (!rem) {
				id++;
				if (id < M)rem = K[id];
			}
		}
	}
	return (id == M);
}

/*int main () {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int a[] = {1, 2, 2, 2}, b[] = {2, 3, 3, 4};
	init(4, a, b);
	int c[] = {1, 3};
	cout << can(2, c);
}*/

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 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 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Incorrect 1 ms 436 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3028 KB Output is correct
2 Correct 15 ms 3028 KB Output is correct
3 Correct 14 ms 3120 KB Output is correct
4 Correct 16 ms 3284 KB Output is correct
5 Correct 10 ms 3028 KB Output is correct
6 Correct 10 ms 3000 KB Output is correct
7 Correct 10 ms 3104 KB Output is correct
8 Correct 11 ms 3024 KB Output is correct
9 Correct 8 ms 3540 KB Output is correct
10 Correct 6 ms 2772 KB Output is correct
11 Correct 6 ms 2868 KB Output is correct
12 Correct 7 ms 3028 KB Output is correct
13 Correct 12 ms 3256 KB Output is correct
14 Correct 12 ms 3284 KB Output is correct
15 Incorrect 15 ms 3284 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 3184 KB Output is correct
2 Correct 44 ms 3292 KB Output is correct
3 Execution timed out 4025 ms 3512 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 13188 KB Output is correct
2 Correct 221 ms 13504 KB Output is correct
3 Execution timed out 4048 ms 12736 KB Time limit exceeded
4 Halted 0 ms 0 KB -