oj.uz

Submission #705595

# Submission time Handle Problem Language Result Execution time Memory
705595 2023-03-04T18:00:29 Z Kahou Mousetrap (CEOI17_mousetrap) C++14
65 / 100
 725 ms 161892 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] + (int)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] = (int)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 id = 0;
        int tmp = 0;
        for (pii p:vc) {
                while (id < p.F) {
                        ps[id+1] = ps[id];
                        tmp = ps[id];
                        id++;
                }
                if (tmp+p.S > x) {
                        ps[id]++;
                }
        }
        for (int i = 1; i <= k; i++) {
                if (ps[i] > i || ps[i] > 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 = 1e9;
        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

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23920 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23748 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23708 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 62952 KB Output is correct
2 Correct 240 ms 58940 KB Output is correct
3 Correct 723 ms 64052 KB Output is correct
4 Correct 326 ms 43948 KB Output is correct
5 Correct 648 ms 64104 KB Output is correct
6 Correct 725 ms 64052 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23920 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23748 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23708 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 14 ms 23764 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 13 ms 23952 KB Output is correct
15 Correct 13 ms 23892 KB Output is correct
16 Correct 13 ms 23764 KB Output is correct
17 Correct 12 ms 23916 KB Output is correct
18 Correct 13 ms 23840 KB Output is correct
19 Correct 12 ms 23764 KB Output is correct
20 Correct 12 ms 23800 KB Output is correct
21 Correct 12 ms 23764 KB Output is correct
22 Correct 12 ms 23764 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23920 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23748 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23708 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 316 ms 62952 KB Output is correct
12 Correct 240 ms 58940 KB Output is correct
13 Correct 723 ms 64052 KB Output is correct
14 Correct 326 ms 43948 KB Output is correct
15 Correct 648 ms 64104 KB Output is correct
16 Correct 725 ms 64052 KB Output is correct
17 Correct 14 ms 23764 KB Output is correct
18 Correct 13 ms 23764 KB Output is correct
19 Correct 12 ms 23764 KB Output is correct
20 Correct 13 ms 23952 KB Output is correct
21 Correct 13 ms 23892 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 12 ms 23916 KB Output is correct
24 Correct 13 ms 23840 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 12 ms 23800 KB Output is correct
27 Correct 12 ms 23764 KB Output is correct
28 Correct 12 ms 23764 KB Output is correct
29 Correct 12 ms 23764 KB Output is correct
30 Correct 284 ms 62872 KB Output is correct
31 Correct 269 ms 62964 KB Output is correct
32 Correct 338 ms 161892 KB Output is correct
33 Correct 307 ms 156812 KB Output is correct
34 Correct 649 ms 64116 KB Output is correct
35 Correct 648 ms 64056 KB Output is correct
36 Correct 676 ms 76856 KB Output is correct
37 Correct 720 ms 76856 KB Output is correct
38 Correct 537 ms 78488 KB Output is correct
39 Incorrect 561 ms 78136 KB Output isn't correct
40 Halted 0 ms 0 KB -