oj.uz

Submission #384567

# Submission time Handle Problem Language Result Execution time Memory
384567 2021-04-01T20:53:09 Z morato Teams (IOI15_teams) C++17
0 / 100
 4000 ms 10308 KB 
#include <bits/stdc++.h>
#include "teams.h"

using namespace std;

const int MAXN = 1e5 + 5;

int n;

pair<int, int> segment[MAXN];

void init(int N, int A[], int B[]) {
	n = N;
	for (int i = 0; i < n; i++) {
		segment[i].first = A[i];
		segment[i].second = B[i];
	}
	sort(segment, segment + n);
}

int can(int M, int K[]) {
	sort(K, K + M);
	for (int i = 0, j = 0; i < M; i++) {
		int cnt = 0;
		for (; j < n; j++) {
			if (segment[j].first <= K[i] && K[i] <= segment[j].second) {
				cnt++;
			}
			if (cnt == K[i]) break;
		}
		if (cnt < K[i]) return 0;
	}	
	return 1;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1900 KB Output is correct
2 Correct 16 ms 1900 KB Output is correct
3 Correct 16 ms 1900 KB Output is correct
4 Incorrect 19 ms 2284 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 2284 KB Output is correct
2 Correct 52 ms 2256 KB Output is correct
3 Execution timed out 4019 ms 3972 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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