oj.uz

Submission #168058

# Submission time Handle Problem Language Result Execution time Memory
168058 2019-12-11T08:32:58 Z Atill83 Paprike (COI18_paprike) C++14
100 / 100
 71 ms 18808 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, k;
vector<int> adj[MAXN];
ll hot[MAXN];
pll dfs(int a, int par){
    if(adj[a].size() == 1 && par != -1){
        return {hot[a], 0};
    }else{
        vector<pll> ans;
        ll eko = 0;
        for(int i: adj[a]){
            if(i != par){
                pll dat = dfs(i, a);
                eko += dat.ss;
                ans.push_back(dat);
            }
        }
        sort(ans.begin(), ans. end());
        ll cur = hot[a];
        int i = 0;
        for(; i < ans.size(); i++){
            if(cur + ans[i].ff > k){
                break;
            }else{
                cur = cur + ans[i].ff;
            }
        }
        return {cur, eko + ans.size() - i};
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n>>k;
    for(int i = 1; i <= n; i++) cin>>hot[i];
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    ll ans = INF;
    unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
    std::mt19937 generator (seed);  
    for(int i = 0; i < 1; i++){
        ll a = generator()%n + 1;
        //cout<<a<<endl;
        ans = min(ans, dfs(a, -1).ss);
    }
    cout<<ans<<endl;

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

paprike.cpp: In function 'pll dfs(int, int)':
paprike.cpp:33:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(; i < ans.size(); i++){
               ~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 17720 KB Output is correct
2 Correct 65 ms 16376 KB Output is correct
3 Correct 64 ms 15992 KB Output is correct
4 Correct 62 ms 13560 KB Output is correct
5 Correct 65 ms 18808 KB Output is correct
6 Correct 64 ms 17656 KB Output is correct
7 Correct 61 ms 13048 KB Output is correct
8 Correct 58 ms 14300 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 5 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2684 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 66 ms 17720 KB Output is correct
23 Correct 65 ms 16376 KB Output is correct
24 Correct 64 ms 15992 KB Output is correct
25 Correct 62 ms 13560 KB Output is correct
26 Correct 65 ms 18808 KB Output is correct
27 Correct 64 ms 17656 KB Output is correct
28 Correct 61 ms 13048 KB Output is correct
29 Correct 58 ms 14300 KB Output is correct
30 Correct 4 ms 2808 KB Output is correct
31 Correct 4 ms 2808 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 4 ms 2812 KB Output is correct
34 Correct 4 ms 2812 KB Output is correct
35 Correct 4 ms 2808 KB Output is correct
36 Correct 4 ms 2808 KB Output is correct
37 Correct 4 ms 2808 KB Output is correct
38 Correct 4 ms 2808 KB Output is correct
39 Correct 5 ms 2808 KB Output is correct
40 Correct 4 ms 2680 KB Output is correct
41 Correct 4 ms 2808 KB Output is correct
42 Correct 4 ms 2780 KB Output is correct
43 Correct 4 ms 2808 KB Output is correct
44 Correct 4 ms 2680 KB Output is correct
45 Correct 4 ms 2808 KB Output is correct
46 Correct 4 ms 2808 KB Output is correct
47 Correct 64 ms 13020 KB Output is correct
48 Correct 61 ms 10704 KB Output is correct
49 Correct 61 ms 10360 KB Output is correct
50 Correct 62 ms 9372 KB Output is correct
51 Correct 71 ms 8848 KB Output is correct
52 Correct 71 ms 8660 KB Output is correct
53 Correct 67 ms 8568 KB Output is correct
54 Correct 71 ms 8568 KB Output is correct
55 Correct 65 ms 8172 KB Output is correct
56 Correct 65 ms 8144 KB Output is correct
57 Correct 47 ms 10860 KB Output is correct