oj.uz

답안 #601041

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601041 2022-07-21T10:25:30 Z dxz05 Jail (JOI22_jail) C++14
61 / 100
 5000 ms 32112 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);
    for (int i = 0; i < m; i++){
        cin >> S[i] >> T[i];
        S[i]--, T[i]--;
    }

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

    for (int i = 0; i < m; i++){
        for (int j = 0; j < m; j++){
            if (i == j) continue;
            if (in(S[i], S[j], T[i])) gg[j].push_back(i);
            if (in(S[i], T[j], T[i])) gg[i].push_back(j);
        }
    }

    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 9716 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 16 ms 9772 KB Output is correct
5 Correct 27 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9788 KB Output is correct
8 Correct 10 ms 9812 KB Output is correct
9 Correct 113 ms 12504 KB Output is correct
10 Correct 76 ms 28564 KB Output is correct
11 Correct 11 ms 9772 KB Output is correct
12 Correct 74 ms 9864 KB Output is correct
13 Execution timed out 5071 ms 32112 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 9 ms 9684 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 8 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9756 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 9 ms 9788 KB Output is correct
19 Correct 7 ms 9732 KB Output is correct
20 Correct 8 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 7 ms 9684 KB Output is correct
23 Correct 7 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 6 ms 9684 KB Output is correct
26 Correct 5 ms 9708 KB Output is correct
27 Correct 8 ms 9704 KB Output is correct
28 Correct 6 ms 9684 KB Output is correct
29 Correct 9 ms 9812 KB Output is correct
30 Correct 65 ms 9796 KB Output is correct
31 Correct 35 ms 9812 KB Output is correct
32 Correct 33 ms 9772 KB Output is correct
33 Correct 12 ms 9684 KB Output is correct
34 Correct 119 ms 9776 KB Output is correct
35 Correct 111 ms 9824 KB Output is correct
36 Correct 110 ms 9772 KB Output is correct
37 Correct 59 ms 9792 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 9 ms 9684 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 8 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9756 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 9 ms 9788 KB Output is correct
19 Correct 7 ms 9732 KB Output is correct
20 Correct 8 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 7 ms 9684 KB Output is correct
23 Correct 7 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 6 ms 9684 KB Output is correct
26 Correct 5 ms 9708 KB Output is correct
27 Correct 8 ms 9704 KB Output is correct
28 Correct 6 ms 9684 KB Output is correct
29 Correct 9 ms 9812 KB Output is correct
30 Correct 65 ms 9796 KB Output is correct
31 Correct 35 ms 9812 KB Output is correct
32 Correct 33 ms 9772 KB Output is correct
33 Correct 12 ms 9684 KB Output is correct
34 Correct 119 ms 9776 KB Output is correct
35 Correct 111 ms 9824 KB Output is correct
36 Correct 110 ms 9772 KB Output is correct
37 Correct 59 ms 9792 KB Output is correct
38 Correct 118 ms 12560 KB Output is correct
39 Correct 67 ms 28588 KB Output is correct
40 Correct 2810 ms 11664 KB Output is correct
41 Correct 3139 ms 10640 KB Output is correct
42 Correct 2814 ms 11844 KB Output is correct
43 Correct 51 ms 10520 KB Output is correct
44 Correct 2883 ms 10080 KB Output is correct
45 Correct 269 ms 23404 KB Output is correct
46 Correct 250 ms 23492 KB Output is correct
47 Correct 342 ms 25296 KB Output is correct
48 Correct 341 ms 25348 KB Output is correct
49 Correct 268 ms 23372 KB Output is correct
50 Correct 283 ms 23516 KB Output is correct
51 Correct 96 ms 24048 KB Output is correct
52 Correct 91 ms 24048 KB Output is correct
53 Correct 2637 ms 10840 KB Output is correct
54 Correct 256 ms 23328 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 16 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9760 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 114 ms 9772 KB Output is correct
13 Correct 1095 ms 9964 KB Output is correct
14 Correct 523 ms 9780 KB Output is correct
15 Correct 861 ms 9776 KB Output is correct
16 Execution timed out 5036 ms 23704 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9716 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 16 ms 9772 KB Output is correct
5 Correct 27 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9788 KB Output is correct
8 Correct 10 ms 9812 KB Output is correct
9 Correct 113 ms 12504 KB Output is correct
10 Correct 76 ms 28564 KB Output is correct
11 Correct 11 ms 9772 KB Output is correct
12 Correct 74 ms 9864 KB Output is correct
13 Execution timed out 5071 ms 32112 KB Time limit exceeded
14 Halted 0 ms 0 KB -