oj.uz

답안 #994254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994254 2024-06-07T09:56:58 Z vjudge1 Jail (JOI22_jail) C++17
61 / 100
 5000 ms 28784 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 120'001, mbit = 18;
int n, m;
int dth[maxn];
int S[maxn], T[maxn];
vector <vector <int> > G;
vector <int> w;
vector <vector <int> > g;
vector <vector <int> > stp;

void dfs_lca(int u = 1){
    for(int i = 1; i < mbit; i++){
        stp[u][i] = stp[stp[u][i - 1]][i - 1];
    }
    for(auto v : G[u]){
        if(v != stp[u][0]){
            stp[v][0] = u;
            dth[v] = dth[u] + 1;
            dfs_lca(v);
        }
    }
}

int LCA(int u, int v){
    if(dth[u] < dth[v]) swap(u, v);
    for(int i = mbit - 1; i >= 0; i--){
        if(dth[u] - dth[v] >= (1 << i)) u = stp[u][i];
    }
    if(u == v) return u;
    for(int i = mbit - 1; i >= 0; i--){
        if(stp[u][i] != stp[v][i]){
            u = stp[u][i];
            v = stp[v][i];
        }
    }
    return stp[u][0];
}

bool mid(int u, int v, int M){
    return ((LCA(u, M) == M) || (LCA(v, M) == M)) && (dth[M] >= dth[LCA(u, v)]);
}

bool dfs_loop(int u){
    if(w[u] == 1) return 1;
    if(w[u] == 2) return 0;
    w[u] = 1;
    for(auto v : g[u]){
        if(dfs_loop(v)) return 1;
    }
    w[u] = 2;
    return 0;
}

bool sol(){
    cin >> n;
    G.assign(n + 1, vector<int>());
    stp.assign(n + 1, vector<int>(mbit));
    for(int i = 1; i < n; i++){
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dth[1] = 0;
    dfs_lca();
    //===============
    cin >> m;
    g.assign(m + 1, vector<int>());
    for(int i = 0; i < m; i++){
        cin >> S[i] >> T[i];
    }
    for(int i = 0; i < m; i++){
        for(int j = 0; j < m; j++){
            if(i == j) continue;
            if(mid(S[i], T[i], S[j])) g[i].push_back(j);
            if(mid(S[i], T[i], T[j])) g[j].push_back(i);
        }
    }
    w.assign(m + 1, 0);
    for(int i = 0; i < m; i++){
        if(dfs_loop(i)) return 0;
    }
    return 1;
}

int main(){
    int Q;
    cin >> Q;
    while(Q--){
        cout << (sol() ? "Yes" : "No") << endl;
    }
    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 16 ms 348 KB Output is correct
5 Correct 34 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 32 ms 528 KB Output is correct
9 Correct 1382 ms 3612 KB Output is correct
10 Correct 128 ms 28380 KB Output is correct
11 Correct 17 ms 348 KB Output is correct
12 Correct 435 ms 464 KB Output is correct
13 Execution timed out 5039 ms 28784 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
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 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 360 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 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 2 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 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 2 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 33 ms 600 KB Output is correct
30 Correct 18 ms 348 KB Output is correct
31 Correct 21 ms 348 KB Output is correct
32 Correct 13 ms 344 KB Output is correct
33 Correct 4 ms 344 KB Output is correct
34 Correct 31 ms 348 KB Output is correct
35 Correct 46 ms 348 KB Output is correct
36 Correct 26 ms 348 KB Output is correct
37 Correct 22 ms 508 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 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 2 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 33 ms 600 KB Output is correct
30 Correct 18 ms 348 KB Output is correct
31 Correct 21 ms 348 KB Output is correct
32 Correct 13 ms 344 KB Output is correct
33 Correct 4 ms 344 KB Output is correct
34 Correct 31 ms 348 KB Output is correct
35 Correct 46 ms 348 KB Output is correct
36 Correct 26 ms 348 KB Output is correct
37 Correct 22 ms 508 KB Output is correct
38 Correct 1379 ms 3664 KB Output is correct
39 Correct 122 ms 28500 KB Output is correct
40 Correct 1559 ms 2532 KB Output is correct
41 Correct 1058 ms 1368 KB Output is correct
42 Correct 946 ms 2908 KB Output is correct
43 Correct 60 ms 1368 KB Output is correct
44 Correct 701 ms 604 KB Output is correct
45 Correct 231 ms 19540 KB Output is correct
46 Correct 216 ms 19740 KB Output is correct
47 Correct 307 ms 23380 KB Output is correct
48 Correct 306 ms 23304 KB Output is correct
49 Correct 282 ms 19908 KB Output is correct
50 Correct 251 ms 19856 KB Output is correct
51 Correct 102 ms 20820 KB Output is correct
52 Correct 105 ms 20864 KB Output is correct
53 Correct 601 ms 1848 KB Output is correct
54 Correct 172 ms 19536 KB Output is correct

Subtask #6
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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 17 ms 464 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 26 ms 504 KB Output is correct
13 Correct 354 ms 344 KB Output is correct
14 Correct 187 ms 344 KB Output is correct
15 Correct 266 ms 344 KB Output is correct
16 Execution timed out 5067 ms 20232 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 16 ms 348 KB Output is correct
5 Correct 34 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 32 ms 528 KB Output is correct
9 Correct 1382 ms 3612 KB Output is correct
10 Correct 128 ms 28380 KB Output is correct
11 Correct 17 ms 348 KB Output is correct
12 Correct 435 ms 464 KB Output is correct
13 Execution timed out 5039 ms 28784 KB Time limit exceeded
14 Halted 0 ms 0 KB -