oj.uz

Submission #261479

# Submission time Handle Problem Language Result Execution time Memory
261479 2020-08-11T18:50:35 Z zecookiez Triumphal arch (POI13_luk) C++14
100 / 100
 1000 ms 26488 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300005;
vector<int> adj[MAXN];
int helper(int node, int work, int prev = -1){
    int bleh = 0;
    for(auto i : adj[node]){
        if(i == prev) continue;
        ++bleh; bleh += helper(i, work, node);
    }
    return max(bleh - work, 0);
}
int main(){
    cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n; cin >> n;
    for(int a, b, i = 1; i < n; ++i){
        cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a);
    }
    int left = -1, right = n;
    while(right - left > 1){
        int mid = left + (right - left) / 2;
        if(helper(1, mid) != 0) left = mid;
        else right = mid;
    }
    cout << right << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 7808 KB Output is correct
2 Correct 13 ms 8064 KB Output is correct
3 Correct 10 ms 7808 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 8576 KB Output is correct
2 Correct 30 ms 9600 KB Output is correct
3 Correct 24 ms 8832 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 11000 KB Output is correct
2 Correct 235 ms 13688 KB Output is correct
3 Correct 65 ms 12152 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 626 ms 14436 KB Output is correct
2 Correct 544 ms 21244 KB Output is correct
3 Correct 178 ms 17144 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 17612 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 992 ms 17620 KB Output is correct
2 Correct 926 ms 26488 KB Output is correct
3 Correct 333 ms 22136 KB Output is correct