oj.uz

Submission #631259

# Submission time Handle Problem Language Result Execution time Memory
631259 2022-08-18T01:06:00 Z iee Paprike (COI18_paprike) C++17
100 / 100
 43 ms 21836 KB 
// iee
#include <bits/stdc++.h>
#define int long long
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using db = double;
using ld = long double;
#define py puts("YES")
#define pn puts("NO")
#define pf puts("-1")
#define hh puts("")
#define fi first
#define se second
#define mkp make_pair
#define re =RD()
#define rd RD()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define ep emplace
#define ci const int
#define vi vector<int>
#define fn for(int i=1;i<=n;++i)
#define rep(stO,a,b) for(int stO=(a);stO<=(b);stO++)
#define Rep(stO,a,b) for(int stO=(a);stO<(b);stO++)
#define per(Orz,a,b) for(int Orz=(a);Orz>=(b);Orz--)
#define ina int n,a[N];
#define rna n=RD();fn a[i]=RD();
using namespace std;
void big(int &x,int y){if(y>x)x=y;}void sml(int &x,int y){if(y<x)x=y;}
int qpow(int a, int b, int p) { int res = 1 % p; while (b) { if (b % 2) res = 1ll * res * a % p; a = 1ll * a * a % p; b /= 2; } return res; }
int RD() { int x = 0, f = 1, ch = getchar(); while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + (ch - '0'); ch = getchar(); } return x * f; }
//ci p = 998244353 1000000007; int fac[N], inv[N], ifac[N]; int binom(int x, int y, int MOD = p) { if (x < y) return 0; return 1ll * fac[x] * ifac[y] % p * ifac[x - y] % p; } void init(int LIM = N - 1, int MOD = p) { fac[0] = ifac[0] = inv[1] = 1; rep(i, 1, LIM) fac[i] = 1ll * fac[i - 1] * i % MOD; rep(i, 2, LIM) inv[i] = 1ll * (MOD - MOD / i) * inv[MOD % i] % MOD; rep(i, 1, LIM) ifac[i] = 1ll * ifac[i - 1] * inv[i] % MOD; }
void work(int);

signed main() { int CASINPUT = 1;
  string op = R"(
                 )";if (op.size() == 19) cin >> CASINPUT; rep(CUR, 1, CASINPUT) work(CUR); }
ci N = 2e5 + 5;
vi e[N];
int h[N], n, k;
int ans;
int dfs(int u, int pr = 0) {
 int sum = h[u];
 vi v;
 for (int to: e[u]) {
  if (to == pr) continue;
  v.pb(dfs(to, u));
 }
 sort(all(v),greater<int>());
 sum += accumulate(all(v),0ll);
 Rep(i,0,v.size()) {
  if(sum <= k)break;
  ans++;
  sum -= v[i];
 }
 return sum;
}
void work(int CASE) {
 n re, k re;
 rep(i,1,n) h[i] re;
 rep(i, 1, n - 1) {
  int u re, v re;
  e[u].pb(v), e[v].pb(u);
 }
 dfs(1);
 cout << ans;
}

Compilation message

paprike.cpp: In function 'long long int dfs(long long int, long long int)':
paprike.cpp:27:41: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 | #define Rep(stO,a,b) for(int stO=(a);stO<(b);stO++)
      |                                         ^
paprike.cpp:54:2: note: in expansion of macro 'Rep'
   54 |  Rep(i,0,v.size()) {
      |  ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5004 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4892 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5008 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 4988 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 5004 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5004 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 21740 KB Output is correct
2 Correct 31 ms 21736 KB Output is correct
3 Correct 29 ms 21752 KB Output is correct
4 Correct 29 ms 21836 KB Output is correct
5 Correct 31 ms 21700 KB Output is correct
6 Correct 27 ms 21772 KB Output is correct
7 Correct 35 ms 21684 KB Output is correct
8 Correct 26 ms 21248 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5004 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4892 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5008 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 4988 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 5004 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5004 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 4 ms 5052 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 5016 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 3 ms 5028 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 4 ms 5012 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 4 ms 5012 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5004 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4892 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5008 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 4988 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 5004 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5004 KB Output is correct
22 Correct 29 ms 21740 KB Output is correct
23 Correct 31 ms 21736 KB Output is correct
24 Correct 29 ms 21752 KB Output is correct
25 Correct 29 ms 21836 KB Output is correct
26 Correct 31 ms 21700 KB Output is correct
27 Correct 27 ms 21772 KB Output is correct
28 Correct 35 ms 21684 KB Output is correct
29 Correct 26 ms 21248 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 4 ms 5052 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 5016 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 5028 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5012 KB Output is correct
44 Correct 3 ms 4948 KB Output is correct
45 Correct 3 ms 4948 KB Output is correct
46 Correct 4 ms 5012 KB Output is correct
47 Correct 30 ms 15240 KB Output is correct
48 Correct 28 ms 13516 KB Output is correct
49 Correct 28 ms 12788 KB Output is correct
50 Correct 29 ms 12492 KB Output is correct
51 Correct 40 ms 11360 KB Output is correct
52 Correct 43 ms 11476 KB Output is correct
53 Correct 35 ms 11336 KB Output is correct
54 Correct 38 ms 11416 KB Output is correct
55 Correct 34 ms 10836 KB Output is correct
56 Correct 34 ms 10896 KB Output is correct
57 Correct 18 ms 12888 KB Output is correct