oj.uz

Submission #417832

# Submission time Handle Problem Language Result Execution time Memory
417832 2021-06-04T11:17:24 Z egekabas Mousetrap (CEOI17_mousetrap) C++14
45 / 100
 1022 ms 78540 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<ll, ll> pii;
typedef pair<ld, ld> pld;
ll n, t, m;
vector<ll> g[1000009];
ll trap[1000009];
ll dp[1000009];
 
ll ans[1000009];   
void dfs(ll v, ll prt){
    if(v == t){
        trap[v] = 1;
        return;
    }
    for(auto u : g[v])
        if(u != prt){
            dfs(u, v);
            if(trap[u])
                trap[v] = 1;
        }
    pii maxi = {0, 0};
    ll edgecnt = 0;
    for(auto u : g[v])
        if(u != prt && trap[u] == 0){
            if(dp[u] >= maxi.ff){
                maxi.ss = maxi.ff;
                maxi.ff = dp[u];
            }
            else if(dp[u] >= maxi.ss)
                maxi.ss = dp[u];
            ++edgecnt;
        }
    dp[v] = edgecnt+maxi.ss;
    ans[v] = edgecnt;
    if(v == m)
        ans[v] += maxi.ss;
    for(auto u : g[v])
        if(u != prt && trap[u]){
            dp[v] += dp[u];
            ans[v] += ans[u];
        }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    cin >> n >> t >> m;
    for(ll i = 0; i < n-1; ++i){
        ll x, y;
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    dfs(m, 0);
    cout << ans[m] << '\n';
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23820 KB Output is correct
2 Correct 14 ms 23780 KB Output is correct
3 Correct 16 ms 23812 KB Output is correct
4 Correct 14 ms 23808 KB Output is correct
5 Correct 14 ms 23812 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Correct 15 ms 23812 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 15 ms 23736 KB Output is correct
10 Correct 14 ms 23796 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 361 ms 78540 KB Output is correct
2 Correct 327 ms 73124 KB Output is correct
3 Correct 1022 ms 76864 KB Output is correct
4 Correct 505 ms 50268 KB Output is correct
5 Correct 1012 ms 76884 KB Output is correct
6 Correct 998 ms 76844 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23820 KB Output is correct
2 Correct 14 ms 23780 KB Output is correct
3 Correct 16 ms 23812 KB Output is correct
4 Correct 14 ms 23808 KB Output is correct
5 Correct 14 ms 23812 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Correct 15 ms 23812 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 15 ms 23736 KB Output is correct
10 Correct 14 ms 23796 KB Output is correct
11 Incorrect 16 ms 23756 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23820 KB Output is correct
2 Correct 14 ms 23780 KB Output is correct
3 Correct 16 ms 23812 KB Output is correct
4 Correct 14 ms 23808 KB Output is correct
5 Correct 14 ms 23812 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Correct 15 ms 23812 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 15 ms 23736 KB Output is correct
10 Correct 14 ms 23796 KB Output is correct
11 Correct 361 ms 78540 KB Output is correct
12 Correct 327 ms 73124 KB Output is correct
13 Correct 1022 ms 76864 KB Output is correct
14 Correct 505 ms 50268 KB Output is correct
15 Correct 1012 ms 76884 KB Output is correct
16 Correct 998 ms 76844 KB Output is correct
17 Incorrect 16 ms 23756 KB Output isn't correct
18 Halted 0 ms 0 KB -