#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;
}
void merge() {
sum = 0;
if(l) sum += l -> sum;
if(r) sum += r -> sum;
}
} *t[500010];
typedef node* pnode;
void insert(vector <int> &upd, pnode &cur, pnode &prev, int b, int e) {
cur = new node();
if(b == e) {
cur -> sum = prev -> sum + upd.size();
return ;
}
int m = (b + e) >> 1;
vector <int> L, R;
for(int i : upd) {
if(i <= m) L.push_back(i);
else R.push_back(i);
}
upd.clear();
if(R.empty()) {
cur -> r = prev -> r;
insert(L, cur -> l, prev -> l, b, m);
} else if (L.empty()) {
cur -> l = prev -> l;
insert(R, cur -> r, prev -> r, m+1, e);
} else {
insert(L, cur -> l, prev -> l, b, m);
insert(R, 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) - (prev -> r)) + 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++) {
insert(g[i], 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]);
}
return (ans >= 0);
}
Compilation message
teams.cpp: In function 'void insert(std::vector<int>&, node*&, node*&, int, int)':
teams.cpp:30:14: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
cur -> sum = prev -> sum + upd.size();
^
teams.cpp: In function 'int count(int, int, int, pnode, pnode, int, int)':
teams.cpp:68:79: warning: conversion to 'int' from 'long int' may alter its value [-Wconversion]
return ((cur -> r) - (prev -> r)) + count(x, y, k, cur -> l, prev -> l, b, m);
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
23512 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
353 ms |
108248 KB |
Output is correct |
2 |
Correct |
403 ms |
108248 KB |
Output is correct |
3 |
Correct |
373 ms |
108248 KB |
Output is correct |
4 |
Execution timed out |
4000 ms |
108640 KB |
Execution timed out |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1516 ms |
108644 KB |
Output is correct |
2 |
Correct |
1383 ms |
108644 KB |
Output is correct |
3 |
Incorrect |
543 ms |
111416 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
4000 ms |
496288 KB |
Execution timed out |
2 |
Halted |
0 ms |
0 KB |
- |