oj.uz

답안 #601133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601133 2022-07-21T11:51:27 Z dxz05 Jail (JOI22_jail) C++14
72 / 100
 5000 ms 669108 KB 
//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e5 + 3e2;
const int M = 5555;

vector<int> g[N];

int tin[N], tout[N], timer = 0;
int up[N][18], depth[N];

inline void dfs(int v, int p){
    tin[v] = ++timer;
    depth[v] = depth[p] + 1;

    up[v][0] = p;
    for (int i = 1; i < 18; i++){
        up[v][i] = up[up[v][i - 1]][i - 1];
    }
    for (int u : g[v]){
        if (u != p) dfs(u, v);
    }
    tout[v] = ++timer;
}

inline bool upper(int u, int v){
    return tin[u] <= tin[v] && tout[v] <= tout[u];
}

inline int lca(int u, int v){
    if (upper(u, v)) return u;
    if (upper(v, u)) return v;
    for (int i = 17; i >= 0; i--){
        if (!upper(up[u][i], v)) u = up[u][i];
    }
    return up[u][0];
}

inline int dist(int u, int v){
    return depth[u] + depth[v] - 2 * depth[lca(u, v)];
}

inline bool in(int a, int b, int c){
    return dist(a, c) == dist(a, b) + dist(b, c);
}

vector<int> gg[N];

int color[N];
bool dfs(int v){
    color[v] = 1;
    for (int u : gg[v]){
        if (color[u] == 1) return true;
        if (color[u] == 0 && dfs(u)) return true;
    }
    color[v] = 2;
    return false;
}

void solve(int TC) {
    int n;
    cin >> n;

    timer = 0;
    for (int i = 0; i < n; i++) g[i].clear();

    for (int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        --a, --b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    dfs(0, 0);

    int m;
    cin >> m;

    vector<int> S(m), T(m);
    vector<int> ids(n, -1), idt(n, -1);

    for (int i = 0; i < m; i++){
        cin >> S[i] >> T[i];
        S[i]--, T[i]--;
        ids[S[i]] = i;
        idt[T[i]] = i;
    }

    for (int i = 0; i < m; i++){
        gg[i].clear();
        color[i] = 0;
    }

    for (int i = 0; i < m; i++){
        int s = S[i], t = T[i];
        int l = lca(s, t);
        while (upper(l, s)){
            int j = ids[s];
            if (j != -1 && j != i) gg[j].push_back(i);
            j = idt[s];
            if (j != -1 && j != i) gg[i].push_back(j);
            if (s == 0) break;
            s = up[s][0];
        }

        while (upper(l, t)){
            int j = ids[t];
            if (j != -1 && j != i) gg[j].push_back(i);
            j = idt[t];
            if (j != -1 && j != i) gg[i].push_back(j);
            if (t == 0) break;
            t = up[t][0];
        }
    }

    for (int i = 0; i < m; i++){
        if (color[i] == 0 && dfs(i)){
            cout << "No\n";
            return;
        }
    }

    cout << "Yes\n";

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif

    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9744 KB Output is correct
3 Correct 5 ms 9716 KB Output is correct
4 Correct 15 ms 10020 KB Output is correct
5 Correct 28 ms 10504 KB Output is correct
6 Correct 7 ms 9812 KB Output is correct
7 Correct 7 ms 9812 KB Output is correct
8 Correct 8 ms 9884 KB Output is correct
9 Correct 99 ms 13840 KB Output is correct
10 Correct 458 ms 31040 KB Output is correct
11 Correct 12 ms 9812 KB Output is correct
12 Correct 52 ms 10828 KB Output is correct
13 Correct 138 ms 59944 KB Output is correct
14 Correct 160 ms 74412 KB Output is correct
15 Execution timed out 5070 ms 669108 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9748 KB Output is correct
2 Correct 6 ms 9752 KB Output is correct
3 Correct 7 ms 9756 KB Output is correct
4 Correct 8 ms 9764 KB Output is correct
5 Correct 10 ms 9812 KB Output is correct
6 Correct 8 ms 9832 KB Output is correct
7 Correct 7 ms 9812 KB Output is correct
8 Correct 8 ms 9828 KB Output is correct
9 Correct 8 ms 9812 KB Output is correct
10 Correct 10 ms 9764 KB Output is correct
11 Correct 8 ms 9776 KB Output is correct
12 Correct 8 ms 9764 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9748 KB Output is correct
2 Correct 6 ms 9752 KB Output is correct
3 Correct 7 ms 9756 KB Output is correct
4 Correct 8 ms 9764 KB Output is correct
5 Correct 10 ms 9812 KB Output is correct
6 Correct 8 ms 9832 KB Output is correct
7 Correct 7 ms 9812 KB Output is correct
8 Correct 8 ms 9828 KB Output is correct
9 Correct 8 ms 9812 KB Output is correct
10 Correct 10 ms 9764 KB Output is correct
11 Correct 8 ms 9776 KB Output is correct
12 Correct 8 ms 9764 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 7 ms 9684 KB Output is correct
16 Correct 7 ms 9812 KB Output is correct
17 Correct 8 ms 9720 KB Output is correct
18 Correct 6 ms 9756 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 8 ms 9812 KB Output is correct
21 Correct 7 ms 9756 KB Output is correct
22 Correct 6 ms 9760 KB Output is correct
23 Correct 7 ms 9684 KB Output is correct
24 Correct 5 ms 9752 KB Output is correct
25 Correct 7 ms 9736 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 7 ms 9812 KB Output is correct
28 Correct 8 ms 9748 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9748 KB Output is correct
2 Correct 6 ms 9752 KB Output is correct
3 Correct 7 ms 9756 KB Output is correct
4 Correct 8 ms 9764 KB Output is correct
5 Correct 10 ms 9812 KB Output is correct
6 Correct 8 ms 9832 KB Output is correct
7 Correct 7 ms 9812 KB Output is correct
8 Correct 8 ms 9828 KB Output is correct
9 Correct 8 ms 9812 KB Output is correct
10 Correct 10 ms 9764 KB Output is correct
11 Correct 8 ms 9776 KB Output is correct
12 Correct 8 ms 9764 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 7 ms 9684 KB Output is correct
16 Correct 7 ms 9812 KB Output is correct
17 Correct 8 ms 9720 KB Output is correct
18 Correct 6 ms 9756 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 8 ms 9812 KB Output is correct
21 Correct 7 ms 9756 KB Output is correct
22 Correct 6 ms 9760 KB Output is correct
23 Correct 7 ms 9684 KB Output is correct
24 Correct 5 ms 9752 KB Output is correct
25 Correct 7 ms 9736 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 7 ms 9812 KB Output is correct
28 Correct 8 ms 9748 KB Output is correct
29 Correct 8 ms 9948 KB Output is correct
30 Correct 8 ms 9764 KB Output is correct
31 Correct 8 ms 9812 KB Output is correct
32 Correct 10 ms 9684 KB Output is correct
33 Correct 8 ms 9760 KB Output is correct
34 Correct 7 ms 9760 KB Output is correct
35 Correct 10 ms 9812 KB Output is correct
36 Correct 8 ms 9760 KB Output is correct
37 Correct 8 ms 9940 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9748 KB Output is correct
2 Correct 6 ms 9752 KB Output is correct
3 Correct 7 ms 9756 KB Output is correct
4 Correct 8 ms 9764 KB Output is correct
5 Correct 10 ms 9812 KB Output is correct
6 Correct 8 ms 9832 KB Output is correct
7 Correct 7 ms 9812 KB Output is correct
8 Correct 8 ms 9828 KB Output is correct
9 Correct 8 ms 9812 KB Output is correct
10 Correct 10 ms 9764 KB Output is correct
11 Correct 8 ms 9776 KB Output is correct
12 Correct 8 ms 9764 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 7 ms 9684 KB Output is correct
16 Correct 7 ms 9812 KB Output is correct
17 Correct 8 ms 9720 KB Output is correct
18 Correct 6 ms 9756 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 8 ms 9812 KB Output is correct
21 Correct 7 ms 9756 KB Output is correct
22 Correct 6 ms 9760 KB Output is correct
23 Correct 7 ms 9684 KB Output is correct
24 Correct 5 ms 9752 KB Output is correct
25 Correct 7 ms 9736 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 7 ms 9812 KB Output is correct
28 Correct 8 ms 9748 KB Output is correct
29 Correct 8 ms 9948 KB Output is correct
30 Correct 8 ms 9764 KB Output is correct
31 Correct 8 ms 9812 KB Output is correct
32 Correct 10 ms 9684 KB Output is correct
33 Correct 8 ms 9760 KB Output is correct
34 Correct 7 ms 9760 KB Output is correct
35 Correct 10 ms 9812 KB Output is correct
36 Correct 8 ms 9760 KB Output is correct
37 Correct 8 ms 9940 KB Output is correct
38 Correct 119 ms 13844 KB Output is correct
39 Correct 511 ms 30988 KB Output is correct
40 Correct 84 ms 12876 KB Output is correct
41 Correct 50 ms 11568 KB Output is correct
42 Correct 64 ms 12904 KB Output is correct
43 Correct 33 ms 11676 KB Output is correct
44 Correct 14 ms 10216 KB Output is correct
45 Correct 97 ms 25740 KB Output is correct
46 Correct 80 ms 25728 KB Output is correct
47 Correct 154 ms 27720 KB Output is correct
48 Correct 151 ms 27740 KB Output is correct
49 Correct 75 ms 25772 KB Output is correct
50 Correct 79 ms 25724 KB Output is correct
51 Correct 67 ms 26084 KB Output is correct
52 Correct 58 ms 26412 KB Output is correct
53 Correct 16 ms 10964 KB Output is correct
54 Correct 84 ms 25676 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9692 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9744 KB Output is correct
4 Correct 6 ms 9700 KB Output is correct
5 Correct 11 ms 9812 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 6 ms 9808 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9712 KB Output is correct
10 Correct 5 ms 9748 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 8 ms 9812 KB Output is correct
13 Correct 28 ms 10400 KB Output is correct
14 Correct 38 ms 10644 KB Output is correct
15 Correct 33 ms 10508 KB Output is correct
16 Correct 99 ms 26404 KB Output is correct
17 Correct 183 ms 32332 KB Output is correct
18 Correct 357 ms 53728 KB Output is correct
19 Correct 93 ms 26340 KB Output is correct
20 Correct 119 ms 26168 KB Output is correct
21 Correct 104 ms 26524 KB Output is correct
22 Correct 133 ms 33248 KB Output is correct
23 Correct 119 ms 33744 KB Output is correct
24 Correct 128 ms 32268 KB Output is correct
25 Correct 124 ms 33332 KB Output is correct
26 Correct 139 ms 33344 KB Output is correct
27 Correct 154 ms 33052 KB Output is correct
28 Correct 154 ms 38344 KB Output is correct
29 Correct 178 ms 35444 KB Output is correct
30 Correct 112 ms 31456 KB Output is correct
31 Correct 111 ms 32008 KB Output is correct
32 Correct 118 ms 30644 KB Output is correct
33 Correct 115 ms 32080 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9744 KB Output is correct
3 Correct 5 ms 9716 KB Output is correct
4 Correct 15 ms 10020 KB Output is correct
5 Correct 28 ms 10504 KB Output is correct
6 Correct 7 ms 9812 KB Output is correct
7 Correct 7 ms 9812 KB Output is correct
8 Correct 8 ms 9884 KB Output is correct
9 Correct 99 ms 13840 KB Output is correct
10 Correct 458 ms 31040 KB Output is correct
11 Correct 12 ms 9812 KB Output is correct
12 Correct 52 ms 10828 KB Output is correct
13 Correct 138 ms 59944 KB Output is correct
14 Correct 160 ms 74412 KB Output is correct
15 Execution timed out 5070 ms 669108 KB Time limit exceeded
16 Halted 0 ms 0 KB -