oj.uz

Submission #948681

# Submission time Handle Problem Language Result Execution time Memory
948681 2024-03-18T10:57:29 Z GrindMachine Mousetrap (CEOI17_mousetrap) C++17
25 / 100
 735 ms 73348 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<int> adj[N];
vector<int> dp(N);

void dfs1(int u, int p){
    int deg = sz(adj[u])-(p != -1);
    dp[u] = deg;
    vector<int> vals;
    vals.pb(0), vals.pb(0);

    trav(v,adj[u]){
        if(v == p) conts;
        dfs1(v,u);
        vals.pb(dp[v]);
    }

    sort(rall(vals));
    dp[u] += vals[1];
}

void solve(int test_case)
{
    int n,t,m; cin >> n >> t >> m;
    rep1(i,n-1){
        int u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    dfs1(m,-1);

    int ans = dp[m]-1;
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 27740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 72528 KB Output is correct
2 Correct 244 ms 67924 KB Output is correct
3 Correct 698 ms 73340 KB Output is correct
4 Correct 271 ms 50324 KB Output is correct
5 Correct 679 ms 73296 KB Output is correct
6 Correct 735 ms 73348 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 27740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 27740 KB Output isn't correct
2 Halted 0 ms 0 KB -