| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 44614 |
2018-04-03T21:54:53 Z |
ulna |
Paprike (COI18_paprike) |
C++11 |
|
93 ms |
28488 KB |
#include <bits/stdc++.h>
using namespace std;
// why am I so weak
int n;
long long k;
int a[100055];
int cut[100055];
long long dp[100055];
int pt[100055];
vector<int> g[100055];
typedef pair<long long, int> P;
#define ft first
#define sd second
bool cutted[100055];
void dfs(int v, int par = -1) {
dp[v] = a[v];
for (auto u : g[v]) if (u != par) {
dfs(u, v);
dp[v] += dp[u];
cut[v] += cut[u];
}
sort(g[v].begin(), g[v].end(), [&] (int u, int v) {
return dp[u] > dp[v];
});
pt[v] = 0;
for (int i = 0; i < (int)g[v].size(); i++) {
int u = g[v][i];
if (u == par) continue;
if (dp[v] <= k) {
pt[v] = i;
break;
}
cut[v]++;
cutted[u] = true;
dp[v] -= dp[u];
}
}
int res = INT_MAX;
void rdfs(int v, int par = -1, P ac = P(0, 0)) {
dp[v] += ac.ft;
int sub = 0;
bool cut_p = false;
if (dp[v] > k) {
sub = ac.sd + cut[v] + 1;
long long high = 0;
int id = -1;
for (auto u : g[v]) if (u != par && !cutted[u]) {
if (dp[u] > high) high = dp[u], id = u;
}
high = max(high, ac.ft);
dp[v] -= high;
if (high > ac.ft) cutted[id] = true;
else cut_p = true;
} else {
sub = ac.sd + cut[v];
}
res = min(res, sub);
long long low = LLONG_MAX;
for (auto u : g[v]) if (u != par) {
if (cutted[u]) {
low = min(low, dp[u]);
rdfs(u, v, P(dp[v], sub - cut[u] - 1));
} else {
int spe = 0;
long long sl = LLONG_MAX;
if (low != LLONG_MAX) sl = min(sl, low);
if (cut_p) sl = min(sl, ac.ft);
long long cur = dp[v] - dp[u];
if (sl != LLONG_MAX && cur + sl <= k) {
cur += sl;
spe = 1;
}
rdfs(u, v, P(cur, sub - cut[u] - spe));
}
}
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i + 1 < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
x--, y--;
g[x].push_back(y);
g[y].push_back(x);
}
dfs(0);
rdfs(0);
printf("%d\n", res);
return 0;
}
Compilation message
paprike.cpp: In function 'int main()':
paprike.cpp:110:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
~~~~~^~~~~~~~~~~~~
paprike.cpp:114:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &x, &y);
~~~~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2680 KB |
Output is correct |
| 2 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 3 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 4 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 5 |
Correct |
3 ms |
2836 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2836 KB |
Output is correct |
| 7 |
Correct |
4 ms |
2844 KB |
Output is correct |
| 8 |
Correct |
3 ms |
2900 KB |
Output is correct |
| 9 |
Correct |
3 ms |
2924 KB |
Output is correct |
| 10 |
Correct |
4 ms |
2940 KB |
Output is correct |
| 11 |
Correct |
4 ms |
2940 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 16 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 17 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 18 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 19 |
Correct |
4 ms |
2944 KB |
Output is correct |
| 20 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 21 |
Correct |
4 ms |
2944 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
74 ms |
19068 KB |
Output is correct |
| 2 |
Correct |
73 ms |
19068 KB |
Output is correct |
| 3 |
Correct |
83 ms |
19068 KB |
Output is correct |
| 4 |
Correct |
77 ms |
19068 KB |
Output is correct |
| 5 |
Correct |
72 ms |
19068 KB |
Output is correct |
| 6 |
Correct |
73 ms |
19068 KB |
Output is correct |
| 7 |
Correct |
72 ms |
19072 KB |
Output is correct |
| 8 |
Correct |
66 ms |
19072 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2680 KB |
Output is correct |
| 2 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 3 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 4 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 5 |
Correct |
3 ms |
2836 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2836 KB |
Output is correct |
| 7 |
Correct |
4 ms |
2844 KB |
Output is correct |
| 8 |
Correct |
3 ms |
2900 KB |
Output is correct |
| 9 |
Correct |
3 ms |
2924 KB |
Output is correct |
| 10 |
Correct |
4 ms |
2940 KB |
Output is correct |
| 11 |
Correct |
4 ms |
2940 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 16 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 17 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 18 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 19 |
Correct |
4 ms |
2944 KB |
Output is correct |
| 20 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 21 |
Correct |
4 ms |
2944 KB |
Output is correct |
| 22 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 23 |
Correct |
5 ms |
19072 KB |
Output is correct |
| 24 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 25 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 26 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 27 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 28 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 29 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 30 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 31 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 32 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 33 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 34 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 35 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 36 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 37 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 38 |
Correct |
4 ms |
19072 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2680 KB |
Output is correct |
| 2 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 3 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 4 |
Correct |
3 ms |
2792 KB |
Output is correct |
| 5 |
Correct |
3 ms |
2836 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2836 KB |
Output is correct |
| 7 |
Correct |
4 ms |
2844 KB |
Output is correct |
| 8 |
Correct |
3 ms |
2900 KB |
Output is correct |
| 9 |
Correct |
3 ms |
2924 KB |
Output is correct |
| 10 |
Correct |
4 ms |
2940 KB |
Output is correct |
| 11 |
Correct |
4 ms |
2940 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2940 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 16 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 17 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 18 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 19 |
Correct |
4 ms |
2944 KB |
Output is correct |
| 20 |
Correct |
3 ms |
2944 KB |
Output is correct |
| 21 |
Correct |
4 ms |
2944 KB |
Output is correct |
| 22 |
Correct |
74 ms |
19068 KB |
Output is correct |
| 23 |
Correct |
73 ms |
19068 KB |
Output is correct |
| 24 |
Correct |
83 ms |
19068 KB |
Output is correct |
| 25 |
Correct |
77 ms |
19068 KB |
Output is correct |
| 26 |
Correct |
72 ms |
19068 KB |
Output is correct |
| 27 |
Correct |
73 ms |
19068 KB |
Output is correct |
| 28 |
Correct |
72 ms |
19072 KB |
Output is correct |
| 29 |
Correct |
66 ms |
19072 KB |
Output is correct |
| 30 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 31 |
Correct |
5 ms |
19072 KB |
Output is correct |
| 32 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 33 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 34 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 35 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 36 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 37 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 38 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 39 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 40 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 41 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 42 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 43 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 44 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 45 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 46 |
Correct |
4 ms |
19072 KB |
Output is correct |
| 47 |
Correct |
75 ms |
19072 KB |
Output is correct |
| 48 |
Correct |
72 ms |
19072 KB |
Output is correct |
| 49 |
Correct |
79 ms |
19072 KB |
Output is correct |
| 50 |
Correct |
79 ms |
19072 KB |
Output is correct |
| 51 |
Correct |
92 ms |
19072 KB |
Output is correct |
| 52 |
Correct |
88 ms |
20316 KB |
Output is correct |
| 53 |
Correct |
89 ms |
22284 KB |
Output is correct |
| 54 |
Correct |
88 ms |
24052 KB |
Output is correct |
| 55 |
Correct |
93 ms |
25564 KB |
Output is correct |
| 56 |
Correct |
77 ms |
26884 KB |
Output is correct |
| 57 |
Correct |
53 ms |
28488 KB |
Output is correct |
