oj.uz

답안 #705591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705591 2023-03-04T17:28:05 Z Kahou Mousetrap (CEOI17_mousetrap) C++14
65 / 100
 781 ms 162028 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 1e6 + 50;
ll n, t, m, val[N], dp[N], ps[N], k; 
bool mark[N];
vector<int> adj[N];
vector<int> vp;
vector<pii> vc;

void dfs(int u, int p=0) {
        if (u == t) return;
        int mx1 = 0, mx2 = 0;
        for (int v:adj[u]) {
                if (v == p) continue;
                dfs(v, u);
                if (mark[v]) {
                        mark[u] = 1;
                        val[u] = val[v] + adj[u].size()-1-(p>0);
                }
                else {
                        if (dp[v] > mx1) {
                                mx2 = mx1;
                                mx1 = dp[v];
                        }
                        else if (dp[v] > mx2) {
                                mx2 = dp[v];
                        }
                }
        }
        if (!mark[u]) {
                dp[u] = adj[u].size()-(p>0) + mx2;
        }
        else {
                vp.push_back(u);
                for (int v:adj[u]) {
                        if (v == p) continue;
                        if (mark[v]) continue;
                        vc.push_back({u, dp[v] + val[u]});
                }
        }
}

bool isval(ll x) {
        int prv = 0;
        int tmp = 0;
        for (pii p:vc) {
                if (p.F != prv) {
                        ps[p.F] = ps[prv];
                        tmp = ps[prv];
                        prv = p.F;
                }
                if (tmp+p.S > x) {
                        ps[p.F]++;
                }
                if (ps[p.F] > min(1ll*p.F, x)) return 0;
        }
        return 1;
}
void solve() {
        cin >> n >> t >> m;
        for (int i = 1; i <= n-1; i++) {
                int u, v;
                cin >> u >> v;
                adj[u].push_back(v);
                adj[v].push_back(u);
        }
        mark[t] = 1;
        dfs(m);
        reverse(vp.begin(), vp.end());
        reverse(vc.begin(), vc.end());
        for (pii &x : vc) {
                if (x.F != vp[k]) k++;
                x.F = k+1;
        }
        k = vp.size();
        ll dw = -1, up = 1e18;
        while (up-dw > 1) {
                ll md = (up+dw)>>1;
                if (isval(md)) up = md;
                else dw = md;
        }
        cout << up << endl;
}

int main() {
        ios::sync_with_stdio(0), cin.tie(0);
        solve();
        return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23800 KB Output is correct
2 Correct 14 ms 23816 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23820 KB Output is correct
5 Correct 12 ms 23816 KB Output is correct
6 Correct 16 ms 23876 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 14 ms 23816 KB Output is correct
9 Correct 12 ms 23720 KB Output is correct
10 Correct 15 ms 23924 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 62888 KB Output is correct
2 Correct 262 ms 62128 KB Output is correct
3 Correct 715 ms 65752 KB Output is correct
4 Correct 302 ms 44144 KB Output is correct
5 Correct 624 ms 64444 KB Output is correct
6 Correct 645 ms 64444 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23800 KB Output is correct
2 Correct 14 ms 23816 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23820 KB Output is correct
5 Correct 12 ms 23816 KB Output is correct
6 Correct 16 ms 23876 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 14 ms 23816 KB Output is correct
9 Correct 12 ms 23720 KB Output is correct
10 Correct 15 ms 23924 KB Output is correct
11 Correct 12 ms 23764 KB Output is correct
12 Correct 12 ms 23820 KB Output is correct
13 Correct 13 ms 23788 KB Output is correct
14 Correct 15 ms 23940 KB Output is correct
15 Correct 13 ms 23864 KB Output is correct
16 Correct 13 ms 23888 KB Output is correct
17 Correct 15 ms 23772 KB Output is correct
18 Correct 13 ms 23820 KB Output is correct
19 Correct 14 ms 23824 KB Output is correct
20 Correct 13 ms 23868 KB Output is correct
21 Correct 13 ms 23852 KB Output is correct
22 Correct 13 ms 23824 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23800 KB Output is correct
2 Correct 14 ms 23816 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23820 KB Output is correct
5 Correct 12 ms 23816 KB Output is correct
6 Correct 16 ms 23876 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 14 ms 23816 KB Output is correct
9 Correct 12 ms 23720 KB Output is correct
10 Correct 15 ms 23924 KB Output is correct
11 Correct 255 ms 62888 KB Output is correct
12 Correct 262 ms 62128 KB Output is correct
13 Correct 715 ms 65752 KB Output is correct
14 Correct 302 ms 44144 KB Output is correct
15 Correct 624 ms 64444 KB Output is correct
16 Correct 645 ms 64444 KB Output is correct
17 Correct 12 ms 23764 KB Output is correct
18 Correct 12 ms 23820 KB Output is correct
19 Correct 13 ms 23788 KB Output is correct
20 Correct 15 ms 23940 KB Output is correct
21 Correct 13 ms 23864 KB Output is correct
22 Correct 13 ms 23888 KB Output is correct
23 Correct 15 ms 23772 KB Output is correct
24 Correct 13 ms 23820 KB Output is correct
25 Correct 14 ms 23824 KB Output is correct
26 Correct 13 ms 23868 KB Output is correct
27 Correct 13 ms 23852 KB Output is correct
28 Correct 13 ms 23824 KB Output is correct
29 Correct 12 ms 23892 KB Output is correct
30 Correct 267 ms 63360 KB Output is correct
31 Correct 271 ms 63284 KB Output is correct
32 Correct 350 ms 162028 KB Output is correct
33 Correct 299 ms 156992 KB Output is correct
34 Correct 656 ms 64176 KB Output is correct
35 Correct 710 ms 64172 KB Output is correct
36 Correct 719 ms 76856 KB Output is correct
37 Correct 781 ms 76876 KB Output is correct
38 Correct 490 ms 78432 KB Output is correct
39 Incorrect 497 ms 78228 KB Output isn't correct
40 Halted 0 ms 0 KB -