Submission #959115

# Submission time Handle Problem Language Result Execution time Memory
959115 2024-04-07T13:48:22 Z Mizo_Compiler Teams (IOI15_teams) C++17
0 / 100
4000 ms 17164 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[]) {
	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);
}*/
# 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 14 ms 3536 KB Output is correct
2 Correct 14 ms 3496 KB Output is correct
3 Correct 14 ms 3384 KB Output is correct
4 Correct 15 ms 3540 KB Output is correct
5 Incorrect 10 ms 3024 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 42 ms 3688 KB Output is correct
2 Correct 41 ms 3808 KB Output is correct
3 Execution timed out 4056 ms 4420 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 173 ms 16316 KB Output is correct
2 Correct 199 ms 16412 KB Output is correct
3 Execution timed out 4096 ms 17164 KB Time limit exceeded
4 Halted 0 ms 0 KB -