#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;
vector <int> g[500010];
struct node {
node *l, *r;
int sum;
node () {
l = NULL;
r = NULL;
sum = 0;
}
void merge() {
sum = 0;
if(l) sum += l -> sum;
if(r) sum += r -> sum;
}
} *t[500010];
typedef node* pnode;
void insert(int x, pnode &cur, int b, int e) {
if(!cur) cur = new node();
if(b == e) {
cur -> sum += 1;
return ;
}
int m = (b + e) >> 1;
if(x <= m) insert(x, cur -> l, b, m);
else insert(x, cur -> r, m+1, e);
}
void correct(pnode &cur, pnode &prev, int b, int e) {
if(!cur) {
cur = prev;
return ;
}
if(b == e) {
cur -> sum += prev -> sum;
return ;
}
int m = (b + e) >> 1;
correct(cur -> l, prev -> l, b, m);
correct(cur -> r, prev -> r, m+1, e);
cur -> merge();
}
void init(pnode &cur, int b, int e) {
cur = new node();
if(b == e) {
return ;
}
int m = (b + e) >> 1;
init(cur -> l, b, m);
init(cur -> r, m+1, e);
}
int count(int x, int y, int k, pnode cur, pnode prev, int b, int e) {
if(b == e) {
return (cur -> sum) - (prev -> sum);
}
int m = (b + e) >> 1;
if(k <= m) {
return ((cur -> r -> sum) - (prev -> r -> sum)) + count(x, y, k, cur -> l, prev -> l, b, m);
} else {
return count(x, y, k, cur -> r, prev -> r, m+1, e);
}
}
int count(int x, int y, int k) {
if(x > y) return 0;
return count(x, y, k, t[y], t[x-1], 1, n);
}
void init(int N, int A[], int B[]) {
n = N;
for(int i = 0; i < n; i++) {
g[A[i]].push_back(B[i]);
}
for(int i = 1; i <= n; i++) {
sort(g[i].begin(), g[i].end());
}
for(int i = 0; i <= n; i++) {
t[i] = NULL;
}
init(t[0], 1, n);
for(int i = 1; i <= n; i++) {
for(auto j : g[i]) {
insert(j, t[i], 1, n);
}
correct(t[i], t[i - 1], 1, n);
}
}
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]);
}
// cout << (ans >= 0) << endl;
return (ans >= 0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
23512 KB |
Output is correct |
2 |
Correct |
0 ms |
23512 KB |
Output is correct |
3 |
Correct |
6 ms |
23512 KB |
Output is correct |
4 |
Correct |
3 ms |
23512 KB |
Output is correct |
5 |
Correct |
0 ms |
23512 KB |
Output is correct |
6 |
Correct |
0 ms |
23656 KB |
Output is correct |
7 |
Correct |
3 ms |
23512 KB |
Output is correct |
8 |
Correct |
3 ms |
23512 KB |
Output is correct |
9 |
Correct |
0 ms |
23512 KB |
Output is correct |
10 |
Correct |
0 ms |
23512 KB |
Output is correct |
11 |
Correct |
0 ms |
23512 KB |
Output is correct |
12 |
Correct |
6 ms |
23512 KB |
Output is correct |
13 |
Correct |
0 ms |
23512 KB |
Output is correct |
14 |
Correct |
9 ms |
23512 KB |
Output is correct |
15 |
Correct |
3 ms |
23512 KB |
Output is correct |
16 |
Correct |
3 ms |
23512 KB |
Output is correct |
17 |
Correct |
3 ms |
23512 KB |
Output is correct |
18 |
Correct |
0 ms |
23512 KB |
Output is correct |
19 |
Correct |
3 ms |
23512 KB |
Output is correct |
20 |
Correct |
3 ms |
23512 KB |
Output is correct |
21 |
Correct |
0 ms |
23512 KB |
Output is correct |
22 |
Correct |
0 ms |
23512 KB |
Output is correct |
23 |
Correct |
6 ms |
23512 KB |
Output is correct |
24 |
Correct |
0 ms |
23512 KB |
Output is correct |
25 |
Correct |
3 ms |
23512 KB |
Output is correct |
26 |
Correct |
0 ms |
23512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
189 ms |
83960 KB |
Output is correct |
2 |
Correct |
186 ms |
83960 KB |
Output is correct |
3 |
Correct |
223 ms |
83960 KB |
Output is correct |
4 |
Execution timed out |
4000 ms |
84352 KB |
Execution timed out |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1083 ms |
84356 KB |
Output is correct |
2 |
Correct |
969 ms |
84356 KB |
Output is correct |
3 |
Correct |
233 ms |
87128 KB |
Output is correct |
4 |
Execution timed out |
4000 ms |
84352 KB |
Execution timed out |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4000 ms |
361516 KB |
Execution timed out |
2 |
Halted |
0 ms |
0 KB |
- |