oj.uz

Submission #122822

# Submission time Handle Problem Language Result Execution time Memory
122822 2019-06-29T10:41:21 Z popovicirobert Triumphal arch (POI13_luk) C++14
100 / 100
 1111 ms 28972 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

/*
const int MOD = ;

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}


inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}
*/

using namespace std;

vector < vector <int> > g;
vector <int> dp;

void dfs(int nod, int par, int delta) {
    dp[nod] = 0;
    for(auto it : g[nod]) {
        if(it != par) {
            dfs(it, nod, delta);
            dp[nod] += dp[it] + 1;
        }
    }
    dp[nod] = max(dp[nod] - delta, 0);
}

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n;

    g.resize(n + 1), dp.resize(n + 1);

    for(i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    int res = -1;
    for(int step = 1 << 18; step; step >>= 1) {
        dfs(1, 0, res + step);
        if(dp[1] > 0) {
            res += step;
        }
    }

    cout << res + 1;

    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 276 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 3 ms 392 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1016 KB Output is correct
2 Correct 14 ms 1272 KB Output is correct
3 Correct 8 ms 1144 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2424 KB Output is correct
2 Correct 38 ms 3556 KB Output is correct
3 Correct 22 ms 2552 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 7564 KB Output is correct
2 Correct 155 ms 9860 KB Output is correct
3 Correct 77 ms 7864 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 632 ms 14972 KB Output is correct
2 Correct 509 ms 20784 KB Output is correct
3 Correct 209 ms 15640 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 985 ms 22428 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1111 ms 22384 KB Output is correct
2 Correct 1000 ms 28972 KB Output is correct
3 Correct 352 ms 23252 KB Output is correct