oj.uz

Submission #852342

# Submission time Handle Problem Language Result Execution time Memory
852342 2023-09-21T15:56:23 Z EJIC_B_KEDAX Jail (JOI22_jail) C++14
72 / 100
 5000 ms 52468 KB 
#include <bits/stdc++.h>
#include <random>

#ifndef LOCAL
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
typedef long long ll;
typedef double dd;
typedef long double ld;
typedef unsigned int uii;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


void solve();

mt19937_64 mt(1);

int32_t main() {
#ifdef LOCAL
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
#else
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    //freopen("amusing.in", "r", stdin);
    //freopen("amusing.out", "w", stdout);
#endif
    cout << fixed << setprecision(30);
    int tests = 1;
    cin >> tests;
    while (tests--) {
        solve();
    }
}

int tim = 0;

bool ans = true;

void dfs(int s, int p, vector<vector<int>>& g, vector<int>& tin, vector<int>& tout, vector<int>& pr) {
    tin[s] = tim++;
    pr[s] = p;
    for (int i : g[s]) {
        if (i != p) {
            dfs(i, s, g, tin, tout, pr);
        }
    }
    tout[s] = tim++;
}

void find_cycle(int s, vector<vector<int>>& g, vector<int>& used) {
    used[s] = 1;
    for (int i : g[s]) {
        if (used[i] == 1) {
            ans = false;
        }
        if (!used[i]) {
            find_cycle(i, g, used);
        }
    }
    used[s] = 2;
}

bool a_p_b(int a, int b, vector<int>& tin, vector<int>& tout) {
    return tin[a] <= tin[b] && tout[a] >= tout[b];
}

struct path {
    int u, v;
};

void solve() {
    tim = 0;
    int n;
    cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v; v--; u--;
        g[v].push_back(u);
        g[u].push_back(v);
    }
    vector<int> s(n, -1), t(n, -1), tin(n), tout(n), pr(n), cnt(n, 0);
    dfs(0, -1, g, tin, tout, pr);
    int q;
    cin >> q;
    ans = true;
    vector<int> u, used(q, 0);
    vector<path> z;
    vector<vector<int>> h(q);
    for (int i = 0; i < q; i++) {
        int a, b;
        cin >> a >> b; a--; b--;
        s[a] = i;
        t[b] = i;
        z.push_back({a, b});
    }
    for (int ii = 0; ii < q; ii++) {
        int a, b;
        a = z[ii].u;
        b = z[ii].v;
        int a1 = a, b1 = b;
        while (!a_p_b(a1, b, tin, tout)) {
            if (s[a1] != -1) {
                cnt[s[a1]] += 2;
                u.push_back(s[a1]);
            }
            if (t[a1] != -1) {
                cnt[t[a1]]++;
                u.push_back(t[a1]);
            }
            a1 = pr[a1];
        }
        while (!a_p_b(b1, a, tin, tout)) {
            if (s[b1] != -1) {
                cnt[s[b1]] += 2;
                u.push_back(s[b1]);
            }
            if (t[b1] != -1) {
                cnt[t[b1]]++;
                u.push_back(t[b1]);
            }
            b1 = pr[b1];
        }
        if (s[b1] != -1) {
            cnt[s[b1]] += 2;
            u.push_back(s[b1]);
        }
        if (t[b1] != -1) {
            cnt[t[b1]]++;
            u.push_back(t[b1]);
        }
        for (int i : u) {
            if (!cnt[i]) {
                continue;
            }
            if (cnt[i] == 1) {
                if (a_p_b(b, z[i].u, tin, tout) ^ a_p_b(b, a, tin, tout)) {
                    cout << "No\n";
                    return;
                }
            }
            if (cnt[i] > 2 && i != ii) {
                cout << "No\n";
                return;
            }
            cnt[i] = 0;
        }
        u.clear();
    }
    for (int ii = 0; ii < q; ii++) {
        int a, b;
        a = z[ii].u;
        b = z[ii].v;
        int a1 = a, b1 = b;
        while (!a_p_b(a1, b, tin, tout)) {
            if (s[a1] != -1) {
                cnt[s[a1]] += 2;
                u.push_back(s[a1]);
            }
            if (t[a1] != -1) {
                cnt[t[a1]]++;
                u.push_back(t[a1]);
            }
            a1 = pr[a1];
        }
        while (!a_p_b(b1, a, tin, tout)) {
            if (s[b1] != -1) {
                cnt[s[b1]] += 2;
                u.push_back(s[b1]);
            }
            if (t[b1] != -1) {
                cnt[t[b1]]++;
                u.push_back(t[b1]);
            }
            b1 = pr[b1];
        }
        if (s[b1] != -1) {
            cnt[s[b1]] += 2;
            u.push_back(s[b1]);
        }
        if (t[b1] != -1) {
            cnt[t[b1]]++;
            u.push_back(t[b1]);
        }
        for (int i : u) {
            if (!cnt[i]) {
                continue;
            }
            if (cnt[i] == 2 && z[i].u != z[ii].v) {
                h[ii].push_back(i);
            }
            if (cnt[i] == 1) {
                h[i].push_back(ii);
            }
            cnt[i] = 0;
        }
        u.clear();
    }
    ans = true;
    for (int i = 0; i < q; i++) {
        if (!used[i]) {
            find_cycle(i, h, used);
            if (!ans) {
                cout << "No\n";
                return;
            }
        }
    }
    if (ans) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 21 ms 476 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 60 ms 2836 KB Output is correct
10 Correct 307 ms 22496 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 27 ms 344 KB Output is correct
13 Correct 144 ms 52468 KB Output is correct
14 Correct 38 ms 23496 KB Output is correct
15 Correct 40 ms 23132 KB Output is correct
16 Correct 51 ms 26092 KB Output is correct
17 Execution timed out 5028 ms 25800 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 356 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 356 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 356 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 2 ms 344 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 356 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 2 ms 344 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 55 ms 2740 KB Output is correct
39 Correct 316 ms 22352 KB Output is correct
40 Correct 27 ms 1168 KB Output is correct
41 Correct 26 ms 968 KB Output is correct
42 Correct 20 ms 1224 KB Output is correct
43 Correct 22 ms 1112 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 30 ms 9920 KB Output is correct
46 Correct 31 ms 9816 KB Output is correct
47 Correct 73 ms 15452 KB Output is correct
48 Correct 74 ms 15520 KB Output is correct
49 Correct 38 ms 10320 KB Output is correct
50 Correct 38 ms 10072 KB Output is correct
51 Correct 29 ms 11620 KB Output is correct
52 Correct 26 ms 11600 KB Output is correct
53 Correct 10 ms 1112 KB Output is correct
54 Correct 31 ms 9816 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 15 ms 344 KB Output is correct
14 Correct 28 ms 344 KB Output is correct
15 Correct 23 ms 348 KB Output is correct
16 Correct 35 ms 10328 KB Output is correct
17 Correct 48 ms 12240 KB Output is correct
18 Correct 50 ms 14548 KB Output is correct
19 Correct 40 ms 10956 KB Output is correct
20 Correct 33 ms 10836 KB Output is correct
21 Correct 40 ms 10956 KB Output is correct
22 Correct 43 ms 12240 KB Output is correct
23 Correct 38 ms 12248 KB Output is correct
24 Correct 77 ms 18124 KB Output is correct
25 Correct 45 ms 12288 KB Output is correct
26 Correct 74 ms 18216 KB Output is correct
27 Correct 72 ms 22340 KB Output is correct
28 Correct 82 ms 23840 KB Output is correct
29 Correct 74 ms 20804 KB Output is correct
30 Correct 54 ms 16200 KB Output is correct
31 Correct 59 ms 16964 KB Output is correct
32 Correct 58 ms 16032 KB Output is correct
33 Correct 52 ms 16748 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 21 ms 476 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 60 ms 2836 KB Output is correct
10 Correct 307 ms 22496 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 27 ms 344 KB Output is correct
13 Correct 144 ms 52468 KB Output is correct
14 Correct 38 ms 23496 KB Output is correct
15 Correct 40 ms 23132 KB Output is correct
16 Correct 51 ms 26092 KB Output is correct
17 Execution timed out 5028 ms 25800 KB Time limit exceeded
18 Halted 0 ms 0 KB -