oj.uz

Submission #675170

# Submission time Handle Problem Language Result Execution time Memory
675170 2022-12-27T02:22:32 Z Cookie Paprike (COI18_paprike) C++14
100 / 100
 57 ms 21084 KB 
#include<bits/stdc++.h>

using namespace std;
#include<fstream>

#define ll long long
#define vt vector
#define pb push_back
#define fi first
#define se second
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
typedef unsigned long long ull;
#define pii pair<int, int>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
const ll mod=  1e9 + 7;
const int mxk = 1e3, sq = 750, mxn = 1e5;
const ll inf = -1e18;
ll n, k;
ll d[mxn + 1], w[mxn + 1], a[mxn + 1];
vt<int>adj[mxn + 1];
void dfs(int s, int pre){
    vt<ll>v;
    d[s] = 0;
    for(auto i: adj[s]){
        if(i != pre){
            dfs(i, s); d[s] += d[i];
            v.pb(w[i]);
        }
    }
    sort(v.begin(), v.end());
    w[s] = a[s]; int last = v.size();
    for(int i = 0; i < v.size(); i++){
        if(w[s] + v[i] <= k){
            w[s] += v[i];
        }else{
            last = i; break;
        }
    }
    d[s] += v.size() - last;
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n; i++)cin >> a[i];
    forr(i, 1, n){
        int u, v; cin >> u >> v;
        adj[u].pb(v); adj[v].pb(u);
    }
    dfs(1, -1);
    cout << d[1];
    return(0);
}

Compilation message

paprike.cpp: In function 'void dfs(int, int)':
paprike.cpp:34:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i = 0; i < v.size(); i++){
      |                    ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 20940 KB Output is correct
2 Correct 45 ms 21084 KB Output is correct
3 Correct 47 ms 20972 KB Output is correct
4 Correct 42 ms 21068 KB Output is correct
5 Correct 41 ms 20940 KB Output is correct
6 Correct 43 ms 21060 KB Output is correct
7 Correct 44 ms 21000 KB Output is correct
8 Correct 38 ms 20532 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 2 ms 2692 KB Output is correct
24 Correct 2 ms 2708 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 3 ms 2688 KB Output is correct
29 Correct 2 ms 2696 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 3 ms 2644 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 2 ms 2692 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 41 ms 20940 KB Output is correct
23 Correct 45 ms 21084 KB Output is correct
24 Correct 47 ms 20972 KB Output is correct
25 Correct 42 ms 21068 KB Output is correct
26 Correct 41 ms 20940 KB Output is correct
27 Correct 43 ms 21060 KB Output is correct
28 Correct 44 ms 21000 KB Output is correct
29 Correct 38 ms 20532 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2692 KB Output is correct
32 Correct 2 ms 2708 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 3 ms 2688 KB Output is correct
37 Correct 2 ms 2696 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 3 ms 2644 KB Output is correct
41 Correct 3 ms 2772 KB Output is correct
42 Correct 2 ms 2692 KB Output is correct
43 Correct 2 ms 2688 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2772 KB Output is correct
47 Correct 44 ms 14052 KB Output is correct
48 Correct 42 ms 12264 KB Output is correct
49 Correct 44 ms 11556 KB Output is correct
50 Correct 40 ms 11304 KB Output is correct
51 Correct 53 ms 10156 KB Output is correct
52 Correct 51 ms 10188 KB Output is correct
53 Correct 57 ms 10140 KB Output is correct
54 Correct 56 ms 10072 KB Output is correct
55 Correct 47 ms 9556 KB Output is correct
56 Correct 50 ms 9684 KB Output is correct
57 Correct 29 ms 11028 KB Output is correct