oj.uz

답안 #852381

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852381 2023-09-21T16:47:41 Z EJIC_B_KEDAX Jail (JOI22_jail) C++17
100 / 100
 4903 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, tim1 = clock();

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++) {
        if (((float)clock() - (float)tim1) / CLOCKS_PER_SEC > 4.9f) {
            cout << "Yes\n";
            return;
        }
        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) {
                if (a_p_b(a, z[i].v, tin, tout) ^ a_p_b(a, b, tin, tout)) {
                    cout << "No\n";
                    return;
                }
            }
            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) {
                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
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 10 ms 476 KB Output is correct
5 Correct 22 ms 348 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 348 KB Output is correct
9 Correct 44 ms 2744 KB Output is correct
10 Correct 313 ms 22456 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 33 ms 504 KB Output is correct
13 Correct 163 ms 52468 KB Output is correct
14 Correct 42 ms 23500 KB Output is correct
15 Correct 39 ms 23020 KB Output is correct
16 Correct 50 ms 26056 KB Output is correct
17 Correct 4903 ms 23740 KB Output is correct
18 Correct 98 ms 29124 KB Output is correct
19 Correct 4903 ms 23464 KB Output is correct
20 Correct 2257 ms 23460 KB Output is correct
21 Correct 48 ms 24016 KB Output is correct
22 Correct 43 ms 24020 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 2 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 2 ms 348 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 2 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 49 ms 2856 KB Output is correct
39 Correct 308 ms 22356 KB Output is correct
40 Correct 27 ms 972 KB Output is correct
41 Correct 30 ms 972 KB Output is correct
42 Correct 25 ms 1264 KB Output is correct
43 Correct 24 ms 1164 KB Output is correct
44 Correct 8 ms 604 KB Output is correct
45 Correct 39 ms 9716 KB Output is correct
46 Correct 31 ms 9812 KB Output is correct
47 Correct 80 ms 15424 KB Output is correct
48 Correct 77 ms 15540 KB Output is correct
49 Correct 28 ms 10064 KB Output is correct
50 Correct 39 ms 10076 KB Output is correct
51 Correct 29 ms 11740 KB Output is correct
52 Correct 28 ms 11612 KB Output is correct
53 Correct 11 ms 1116 KB Output is correct
54 Correct 32 ms 9860 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 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 0 ms 600 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 17 ms 348 KB Output is correct
14 Correct 37 ms 468 KB Output is correct
15 Correct 28 ms 348 KB Output is correct
16 Correct 37 ms 10332 KB Output is correct
17 Correct 39 ms 12212 KB Output is correct
18 Correct 54 ms 14428 KB Output is correct
19 Correct 53 ms 10928 KB Output is correct
20 Correct 35 ms 10844 KB Output is correct
21 Correct 51 ms 10960 KB Output is correct
22 Correct 40 ms 12344 KB Output is correct
23 Correct 44 ms 12584 KB Output is correct
24 Correct 97 ms 18196 KB Output is correct
25 Correct 51 ms 12252 KB Output is correct
26 Correct 99 ms 18264 KB Output is correct
27 Correct 118 ms 22388 KB Output is correct
28 Correct 128 ms 23924 KB Output is correct
29 Correct 123 ms 20848 KB Output is correct
30 Correct 81 ms 16204 KB Output is correct
31 Correct 78 ms 16704 KB Output is correct
32 Correct 79 ms 16388 KB Output is correct
33 Correct 76 ms 16740 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 10 ms 476 KB Output is correct
5 Correct 22 ms 348 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 348 KB Output is correct
9 Correct 44 ms 2744 KB Output is correct
10 Correct 313 ms 22456 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 33 ms 504 KB Output is correct
13 Correct 163 ms 52468 KB Output is correct
14 Correct 42 ms 23500 KB Output is correct
15 Correct 39 ms 23020 KB Output is correct
16 Correct 50 ms 26056 KB Output is correct
17 Correct 4903 ms 23740 KB Output is correct
18 Correct 98 ms 29124 KB Output is correct
19 Correct 4903 ms 23464 KB Output is correct
20 Correct 2257 ms 23460 KB Output is correct
21 Correct 48 ms 24016 KB Output is correct
22 Correct 43 ms 24020 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 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 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 2 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 2 ms 344 KB Output is correct
52 Correct 2 ms 344 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 2 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 2 ms 348 KB Output is correct
57 Correct 2 ms 348 KB Output is correct
58 Correct 2 ms 348 KB Output is correct
59 Correct 2 ms 348 KB Output is correct
60 Correct 49 ms 2856 KB Output is correct
61 Correct 308 ms 22356 KB Output is correct
62 Correct 27 ms 972 KB Output is correct
63 Correct 30 ms 972 KB Output is correct
64 Correct 25 ms 1264 KB Output is correct
65 Correct 24 ms 1164 KB Output is correct
66 Correct 8 ms 604 KB Output is correct
67 Correct 39 ms 9716 KB Output is correct
68 Correct 31 ms 9812 KB Output is correct
69 Correct 80 ms 15424 KB Output is correct
70 Correct 77 ms 15540 KB Output is correct
71 Correct 28 ms 10064 KB Output is correct
72 Correct 39 ms 10076 KB Output is correct
73 Correct 29 ms 11740 KB Output is correct
74 Correct 28 ms 11612 KB Output is correct
75 Correct 11 ms 1116 KB Output is correct
76 Correct 32 ms 9860 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 1 ms 348 KB Output is correct
81 Correct 6 ms 348 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 0 ms 600 KB Output is correct
88 Correct 2 ms 348 KB Output is correct
89 Correct 17 ms 348 KB Output is correct
90 Correct 37 ms 468 KB Output is correct
91 Correct 28 ms 348 KB Output is correct
92 Correct 37 ms 10332 KB Output is correct
93 Correct 39 ms 12212 KB Output is correct
94 Correct 54 ms 14428 KB Output is correct
95 Correct 53 ms 10928 KB Output is correct
96 Correct 35 ms 10844 KB Output is correct
97 Correct 51 ms 10960 KB Output is correct
98 Correct 40 ms 12344 KB Output is correct
99 Correct 44 ms 12584 KB Output is correct
100 Correct 97 ms 18196 KB Output is correct
101 Correct 51 ms 12252 KB Output is correct
102 Correct 99 ms 18264 KB Output is correct
103 Correct 118 ms 22388 KB Output is correct
104 Correct 128 ms 23924 KB Output is correct
105 Correct 123 ms 20848 KB Output is correct
106 Correct 81 ms 16204 KB Output is correct
107 Correct 78 ms 16704 KB Output is correct
108 Correct 79 ms 16388 KB Output is correct
109 Correct 76 ms 16740 KB Output is correct
110 Correct 28 ms 348 KB Output is correct
111 Correct 20 ms 476 KB Output is correct
112 Correct 41 ms 17740 KB Output is correct
113 Correct 1906 ms 16988 KB Output is correct
114 Correct 34 ms 18000 KB Output is correct
115 Correct 25 ms 10664 KB Output is correct
116 Correct 77 ms 13148 KB Output is correct
117 Correct 53 ms 14300 KB Output is correct
118 Correct 38 ms 9804 KB Output is correct
119 Correct 31 ms 9688 KB Output is correct
120 Correct 7 ms 1628 KB Output is correct
121 Correct 116 ms 15532 KB Output is correct
122 Correct 125 ms 15636 KB Output is correct
123 Correct 2998 ms 19152 KB Output is correct
124 Correct 35 ms 18268 KB Output is correct
125 Correct 3408 ms 19140 KB Output is correct
126 Correct 48 ms 21956 KB Output is correct
127 Correct 37 ms 15824 KB Output is correct
128 Correct 36 ms 15824 KB Output is correct
129 Correct 4903 ms 16168 KB Output is correct
130 Correct 47 ms 16072 KB Output is correct