제출 #1337371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1337371		hauserl	Mousetrap (CEOI17_mousetrap)	C++20	45 / 100	487 ms	86492 KiB

mousetrap

#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll n,t,m; 

vector<vector<ll>> adj;
vector<ll> countSubtrees;
vector<ll> dp;
vector<ll> parent;
vector<bool> onMainPath;
vector<ll> mainPath;

bool dfs(int u, int p) {
    parent[u] = p;
    bool isOnMP = u == m;
    

    ll max1 = 0;
    ll max2 = 0;

    for (const auto& v : adj[u]) {
        if (v == p) continue;
        isOnMP |= dfs(v, u);

        if (dp[v] > max1) {
            max2 = max1;
            max1 = dp[v];
        } else if (dp[v] > max2) {
            max2 = dp[v];
        }
    } 

    // dp
    if (adj[u].size() == 1) dp[u] = 0;
    else dp[u] = max2 + adj[u].size() - 2 + 1;

    if (isOnMP) mainPath.push_back(u);

    return onMainPath[u] = isOnMP;
}

bool checkMid(ll x) {
    if (countSubtrees[mainPath[0]] > x) return false;

    ll blocks = 0;
    for (ll i = 0; i < mainPath.size()-1; i++) {
        if (mainPath[i] == t) break;
        
        int dangerousChildren = 0;
        for (const auto& v : adj[mainPath[i]]) {
            if (onMainPath[v] || v == parent[mainPath[i]]) continue;
            if (dp[v] + countSubtrees[mainPath[i]] > x) dangerousChildren++;
        }

        blocks += dangerousChildren;

        if (blocks > i + 1) return false;
    }

    return blocks <= x;
}

int main() {

    scanf("%lld %lld %lld",&n,&t,&m);
    adj.resize(n+1, vector<ll>());
    countSubtrees.resize(n+1, 0);
    dp.resize(n+1, -1);
    parent.resize(n+1, -1);
    onMainPath.resize(n+1, false);

    for (int i = 1; i < n; i++) {
        ll a,b; scanf("%lld %lld",&a,&b);
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    dfs(t, -1);

    // subtrees
    for (int i = mainPath.size() -1; i >= 0; i--) {
        ll u = mainPath[i];
        ll tN = adj[u].size();
        if (u == m) countSubtrees[u] = tN - 1 + countSubtrees[parent[u]];
        else if (u == t) countSubtrees[u] = 0;
        else countSubtrees[u] = tN - 2 + countSubtrees[parent[u]];
    }
    



    ll l = -1;
    ll r = n +1;

    while (l + 1 < r) {
        ll mid = l + (r-l)/2;

        if (checkMid(mid)) r = mid;
        else l = mid;
    }

    printf("%lld", r);

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

mousetrap.cpp: In function 'int main()':
mousetrap.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     scanf("%lld %lld %lld",&n,&t,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
mousetrap.cpp:74:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         ll a,b; scanf("%lld %lld",&a,&b);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 25 / 25
• Subtask 3: 0 / 20
• Subtask 4: 0 / 35