oj.uz

답안 #1116694

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116694 2024-11-22T08:12:13 Z Zero_OP Jail (JOI22_jail) C++14
77 / 100
 5000 ms 939160 KB 
#include <bits/stdc++.h>

using namespace std;

#define dbg(x) "[" #x " = " << (x) << "]"

bool cycle_detection(vector<vector<int>>& adj){
    int N = (int)adj.size();
    vector<int> vis(N);

    function<bool(int)> dfs = [&](int u){
        vis[u] = 1;
        for(auto v : adj[u]){
            if(!vis[v]){
                if(dfs(v)) return true;
            } else if(vis[v] == 1){
                return true;
            }
        }
        vis[u] = 2;
        return false;
    };

    for(int i = 0; i < N; ++i){
        if(!vis[i] && dfs(i)) return true;
    }
    return false;
}

struct path_decomposition_tree{
    int N, timerHLD, num;
    vector<int> par, depth, sz, tin, tout, head, idx, ln, rn;
    vector<vector<int>> adj;
    vector<pair<int, int>> edges;

    path_decomposition_tree(int N) :
         timerHLD(0), num(0), N(N), depth(N), sz(N), tin(N, -1), tout(N, -1), par(N), head(N), adj(N), edges(), idx(N),
         ln(4 * N, -1), rn(4 * N, -1) {}

    void add_edge(int u, int v){
        adj[u].emplace_back(v);
        adj[v].emplace_back(u);
    }

    void dfs_sz(int u){
        sz[u] = 1;
        for(auto& v : adj[u]){
            adj[v].erase(find(adj[v].begin(), adj[v].end(), u));
            depth[v] = depth[u] + 1;
            par[v] = u;
            dfs_sz(v);
            if(sz[adj[u][0]] < sz[v]) swap(adj[u][0], v);
            sz[u] += sz[v];
        }
    }

    void dfs_hld(int u, int hd){
        head[u] = hd;
        tin[u] = timerHLD++;
        for(auto v : adj[u]){
            if(v == adj[u][0]) dfs_hld(v, hd);
            else dfs_hld(v, v);
        }
        tout[u] = timerHLD - 1;
    }

    int build(int l, int r){
        if(l == r){
            idx[l] = num++;
            return idx[l];
        } else{
            int mid = l + r >> 1, cur = num++;
            ln[cur] = build(l, mid);
            rn[cur] = build(mid + 1, r);

            edges.emplace_back(cur, ln[cur]);
            edges.emplace_back(cur, rn[cur]);
            return cur;
        }
    }

    void preprocess(int rt){
        dfs_sz(rt);
        dfs_hld(rt, rt);
        assert(timerHLD == N);
        build(0, N - 1);
    }

    int auxiliary_nodes(){ return num; }
    bool in_subtree(int u, int v){ return tin[u] <= tin[v] && tout[v] <= tout[u]; }

    void query_auxiliary_nodes(int cur, int l, int r, int u, int v, vector<int>& ans){
        if(u <= l && r <= v){
            ans.emplace_back(cur);
        } else{
            int mid = l + r >> 1;
            if(u <= mid) query_auxiliary_nodes(ln[cur], l, mid, u, v, ans);
            if(mid < v) query_auxiliary_nodes(rn[cur], mid + 1, r, u, v, ans);
        }
    }

    vector<int> query(int u, int v){ //ignore u, v
        if(u == v) assert(false);
        vector<int> cur;

        if(tin[u] > tin[v]) swap(u, v);

        if(in_subtree(u, v)){
            v = par[v];
            while(head[u] != head[v]){
                if(depth[head[u]] < depth[head[v]]) swap(u, v);
                query_auxiliary_nodes(0, 0, N - 1, tin[head[u]], tin[u], cur);
                u = par[head[u]];
            }

            if(tin[u] > tin[v]) swap(u, v);
            if(tin[u] < tin[v]) query_auxiliary_nodes(0, 0, N - 1, tin[u] + 1, tin[v], cur);
            return cur;
        } else{
            u = par[u];
            v = par[v];
        }

        while(head[u] != head[v]){
            if(depth[head[u]] < depth[head[v]]) swap(u, v);
            query_auxiliary_nodes(0, 0, N - 1, tin[head[u]], tin[u], cur);
            u = par[head[u]];
        }

        if(tin[u] > tin[v]) swap(u, v);
        query_auxiliary_nodes(0, 0, N - 1, tin[u], tin[v], cur);
        return cur;
    }

    int get(int u){
        return idx[tin[u]];
    }
};

void testcase(){
    int N;
    cin >> N;

    path_decomposition_tree tr(N);
    for(int i = 1; i < N; ++i){
        int u, v;
        cin >> u >> v;
        --u, --v;
        tr.add_edge(u, v);
    }

    int M;
    cin >> M;

    tr.preprocess(0);
    int offset = tr.auxiliary_nodes();
    int nodes = 2 * offset + M;
    vector<vector<int>> G(nodes);

    for(auto [u, v] : tr.edges){
        G[u].emplace_back(v); //for T
        G[v + offset].emplace_back(u + offset); //for S
    }

    for(int i = 0; i < M; ++i){
        int s, t;
        cin >> s >> t;

        --s, --t;
        int loc = 2 * offset + i;
        vector<int> compress_nodes = tr.query(s, t); //auxiliary nodes without s, t
        for(auto it : compress_nodes){
            G[loc].emplace_back(it);
            G[it + offset].emplace_back(loc);
        }

        int pS = tr.get(s);
        G[loc].emplace_back(pS + offset);
        G[loc].emplace_back(pS);

        int pT = tr.get(t);
        G[pT].emplace_back(loc);
        G[pT + offset].emplace_back(loc);
    }

    cout << (cycle_detection(G) ? "No\n" : "Yes\n");
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

#ifdef LOCAL
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
#endif // LOCAL

    int T;
    cin >> T;
    while(T--) testcase();

    return 0;
}

Compilation message

jail.cpp: In constructor 'path_decomposition_tree::path_decomposition_tree(int)':
jail.cpp:31:22: warning: 'path_decomposition_tree::num' will be initialized after [-Wreorder]
   31 |     int N, timerHLD, num;
      |                      ^~~
jail.cpp:31:9: warning:   'int path_decomposition_tree::N' [-Wreorder]
   31 |     int N, timerHLD, num;
      |         ^
jail.cpp:36:5: warning:   when initialized here [-Wreorder]
   36 |     path_decomposition_tree(int N) :
      |     ^~~~~~~~~~~~~~~~~~~~~~~
jail.cpp:32:38: warning: 'path_decomposition_tree::tout' will be initialized after [-Wreorder]
   32 |     vector<int> par, depth, sz, tin, tout, head, idx, ln, rn;
      |                                      ^~~~
jail.cpp:32:17: warning:   'std::vector<int> path_decomposition_tree::par' [-Wreorder]
   32 |     vector<int> par, depth, sz, tin, tout, head, idx, ln, rn;
      |                 ^~~
jail.cpp:36:5: warning:   when initialized here [-Wreorder]
   36 |     path_decomposition_tree(int N) :
      |     ^~~~~~~~~~~~~~~~~~~~~~~
jail.cpp:34:28: warning: 'path_decomposition_tree::edges' will be initialized after [-Wreorder]
   34 |     vector<pair<int, int>> edges;
      |                            ^~~~~
jail.cpp:32:50: warning:   'std::vector<int> path_decomposition_tree::idx' [-Wreorder]
   32 |     vector<int> par, depth, sz, tin, tout, head, idx, ln, rn;
      |                                                  ^~~
jail.cpp:36:5: warning:   when initialized here [-Wreorder]
   36 |     path_decomposition_tree(int N) :
      |     ^~~~~~~~~~~~~~~~~~~~~~~
jail.cpp: In member function 'int path_decomposition_tree::build(int, int)':
jail.cpp:72:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |             int mid = l + r >> 1, cur = num++;
      |                       ~~^~~
jail.cpp: In member function 'void path_decomposition_tree::query_auxiliary_nodes(int, int, int, int, int, std::vector<int>&)':
jail.cpp:96:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   96 |             int mid = l + r >> 1;
      |                       ~~^~~
jail.cpp: In function 'void testcase()':
jail.cpp:160:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  160 |     for(auto [u, v] : tr.edges){
      |              ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 24 ms 544 KB Output is correct
5 Correct 40 ms 544 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 51 ms 4712 KB Output is correct
10 Correct 104 ms 83756 KB Output is correct
11 Correct 10 ms 504 KB Output is correct
12 Correct 58 ms 504 KB Output is correct
13 Correct 158 ms 90296 KB Output is correct
14 Correct 149 ms 90596 KB Output is correct
15 Correct 197 ms 95172 KB Output is correct
16 Correct 330 ms 111800 KB Output is correct
17 Correct 179 ms 98844 KB Output is correct
18 Correct 153 ms 94392 KB Output is correct
19 Correct 182 ms 96696 KB Output is correct
20 Correct 191 ms 96696 KB Output is correct
21 Correct 174 ms 97604 KB Output is correct
22 Correct 121 ms 89108 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
28.0 / 28.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 2 ms 472 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 508 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 3 ms 592 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 3 ms 592 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 3 ms 764 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 3 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 4 ms 592 KB Output is correct
30 Correct 5 ms 592 KB Output is correct
31 Correct 4 ms 592 KB Output is correct
32 Correct 4 ms 592 KB Output is correct
33 Correct 3 ms 592 KB Output is correct
34 Correct 4 ms 592 KB Output is correct
35 Correct 4 ms 616 KB Output is correct
36 Correct 4 ms 592 KB Output is correct
37 Correct 3 ms 336 KB Output is correct
38 Correct 55 ms 5764 KB Output is correct
39 Correct 136 ms 85176 KB Output is correct
40 Correct 76 ms 5520 KB Output is correct
41 Correct 70 ms 3712 KB Output is correct
42 Correct 50 ms 4664 KB Output is correct
43 Correct 46 ms 4228 KB Output is correct
44 Correct 15 ms 1104 KB Output is correct
45 Correct 72 ms 42168 KB Output is correct
46 Correct 79 ms 42168 KB Output is correct
47 Correct 133 ms 71608 KB Output is correct
48 Correct 129 ms 71692 KB Output is correct
49 Correct 79 ms 44448 KB Output is correct
50 Correct 85 ms 44680 KB Output is correct
51 Correct 66 ms 48568 KB Output is correct
52 Correct 75 ms 48452 KB Output is correct
53 Correct 19 ms 3532 KB Output is correct
54 Correct 81 ms 42044 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 10 ms 476 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 37 ms 848 KB Output is correct
14 Correct 64 ms 1352 KB Output is correct
15 Correct 49 ms 1272 KB Output is correct
16 Correct 98 ms 43964 KB Output is correct
17 Correct 256 ms 54460 KB Output is correct
18 Correct 423 ms 67008 KB Output is correct
19 Correct 177 ms 46192 KB Output is correct
20 Correct 137 ms 46008 KB Output is correct
21 Correct 173 ms 46144 KB Output is correct
22 Correct 238 ms 53948 KB Output is correct
23 Correct 211 ms 54180 KB Output is correct
24 Correct 229 ms 54144 KB Output is correct
25 Correct 217 ms 54272 KB Output is correct
26 Correct 237 ms 54216 KB Output is correct
27 Correct 260 ms 61464 KB Output is correct
28 Correct 243 ms 70128 KB Output is correct
29 Correct 193 ms 58164 KB Output is correct
30 Correct 219 ms 51768 KB Output is correct
31 Correct 204 ms 55932 KB Output is correct
32 Correct 179 ms 52792 KB Output is correct
33 Correct 209 ms 56048 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 24 ms 544 KB Output is correct
5 Correct 40 ms 544 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 51 ms 4712 KB Output is correct
10 Correct 104 ms 83756 KB Output is correct
11 Correct 10 ms 504 KB Output is correct
12 Correct 58 ms 504 KB Output is correct
13 Correct 158 ms 90296 KB Output is correct
14 Correct 149 ms 90596 KB Output is correct
15 Correct 197 ms 95172 KB Output is correct
16 Correct 330 ms 111800 KB Output is correct
17 Correct 179 ms 98844 KB Output is correct
18 Correct 153 ms 94392 KB Output is correct
19 Correct 182 ms 96696 KB Output is correct
20 Correct 191 ms 96696 KB Output is correct
21 Correct 174 ms 97604 KB Output is correct
22 Correct 121 ms 89108 KB Output is correct
23 Correct 1 ms 504 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 3 ms 592 KB Output is correct
28 Correct 3 ms 592 KB Output is correct
29 Correct 3 ms 592 KB Output is correct
30 Correct 2 ms 592 KB Output is correct
31 Correct 3 ms 760 KB Output is correct
32 Correct 3 ms 592 KB Output is correct
33 Correct 2 ms 472 KB Output is correct
34 Correct 2 ms 336 KB Output is correct
35 Correct 2 ms 508 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 3 ms 592 KB Output is correct
39 Correct 3 ms 336 KB Output is correct
40 Correct 3 ms 592 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 3 ms 592 KB Output is correct
43 Correct 3 ms 592 KB Output is correct
44 Correct 3 ms 764 KB Output is correct
45 Correct 1 ms 336 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 3 ms 592 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 3 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 4 ms 592 KB Output is correct
52 Correct 5 ms 592 KB Output is correct
53 Correct 4 ms 592 KB Output is correct
54 Correct 4 ms 592 KB Output is correct
55 Correct 3 ms 592 KB Output is correct
56 Correct 4 ms 592 KB Output is correct
57 Correct 4 ms 616 KB Output is correct
58 Correct 4 ms 592 KB Output is correct
59 Correct 3 ms 336 KB Output is correct
60 Correct 55 ms 5764 KB Output is correct
61 Correct 136 ms 85176 KB Output is correct
62 Correct 76 ms 5520 KB Output is correct
63 Correct 70 ms 3712 KB Output is correct
64 Correct 50 ms 4664 KB Output is correct
65 Correct 46 ms 4228 KB Output is correct
66 Correct 15 ms 1104 KB Output is correct
67 Correct 72 ms 42168 KB Output is correct
68 Correct 79 ms 42168 KB Output is correct
69 Correct 133 ms 71608 KB Output is correct
70 Correct 129 ms 71692 KB Output is correct
71 Correct 79 ms 44448 KB Output is correct
72 Correct 85 ms 44680 KB Output is correct
73 Correct 66 ms 48568 KB Output is correct
74 Correct 75 ms 48452 KB Output is correct
75 Correct 19 ms 3532 KB Output is correct
76 Correct 81 ms 42044 KB Output is correct
77 Correct 1 ms 336 KB Output is correct
78 Correct 1 ms 336 KB Output is correct
79 Correct 1 ms 336 KB Output is correct
80 Correct 1 ms 336 KB Output is correct
81 Correct 10 ms 476 KB Output is correct
82 Correct 2 ms 508 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 1 ms 336 KB Output is correct
86 Correct 1 ms 336 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 3 ms 592 KB Output is correct
89 Correct 37 ms 848 KB Output is correct
90 Correct 64 ms 1352 KB Output is correct
91 Correct 49 ms 1272 KB Output is correct
92 Correct 98 ms 43964 KB Output is correct
93 Correct 256 ms 54460 KB Output is correct
94 Correct 423 ms 67008 KB Output is correct
95 Correct 177 ms 46192 KB Output is correct
96 Correct 137 ms 46008 KB Output is correct
97 Correct 173 ms 46144 KB Output is correct
98 Correct 238 ms 53948 KB Output is correct
99 Correct 211 ms 54180 KB Output is correct
100 Correct 229 ms 54144 KB Output is correct
101 Correct 217 ms 54272 KB Output is correct
102 Correct 237 ms 54216 KB Output is correct
103 Correct 260 ms 61464 KB Output is correct
104 Correct 243 ms 70128 KB Output is correct
105 Correct 193 ms 58164 KB Output is correct
106 Correct 219 ms 51768 KB Output is correct
107 Correct 204 ms 55932 KB Output is correct
108 Correct 179 ms 52792 KB Output is correct
109 Correct 209 ms 56048 KB Output is correct
110 Correct 59 ms 1352 KB Output is correct
111 Correct 38 ms 1104 KB Output is correct
112 Execution timed out 5144 ms 939160 KB Time limit exceeded
113 Halted 0 ms 0 KB -