oj.uz

Submission #26978

# Submission time Handle Problem Language Result Execution time Memory
26978 2017-07-08T06:34:53 Z Bruteforceman Teams (IOI15_teams) C++11
21 / 100
 4000 ms 11796 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
int n;
pii range[500010];
int dp[500010];
const int inf = 1e9;

int count(int x, int y, int k) {
	int cnt = 0;
	for(int i = 0; i < n; i++) {
		if(x <= range[i].first && range[i].first <= y && k <= range[i].second) {
			++cnt;
		}
	}
	return cnt;
}
void init(int N, int A[], int B[]) {
	n = N;
	for(int i = 0; i < n; i++) {
		range[i] = pii(A[i], B[i]);
	}	
}

int can(int M, int K[]) {
	sort(K, K+M);
	int sum = 0;
	for(int i = 0; i < M; i++) {
		sum += K[i];
		if(sum > n) return false;
	}
	for(int i = 0; i < M; i++) {
		dp[i] = count(1, K[i], K[i]) - K[i];
		for(int j = 0; j < i; j++) {
			dp[i] = min(dp[i], dp[j] + count(K[j] + 1, K[i], K[i]) - K[i]);
		}
	}	
	int ans = inf;
	for(int i = 0; i < M; i++) {
		ans = min(ans, dp[i]);
	}
	return (ans >= 0);
}

Subtask #1
21.0 / 21.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4000 ms 8668 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4000 ms 8668 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4000 ms 11796 KB Execution timed out
2 Halted 0 ms 0 KB -