oj.uz

Submission #1082460

# Submission time Handle Problem Language Result Execution time Memory
1082460 2024-08-31T11:34:18 Z underwaterkillerwhale Jail (JOI22_jail) C++17
100 / 100
 870 ms 128592 KB 
#include <bits/stdc++.h>
#define ll long long
#define rep(i,m,n) for(int i=(m); i<=(n); i++)
#define reb(i,m,n) for(int i=(m); i>=(n); i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MP make_pair
#define fs first
#define se second
#define bit(msk, i) ((msk >> i) & 1)
#define iter(id, v) for(auto id : v)
#define pb push_back
#define SZ(v) (ll)v.size()
#define ALL(v) v.begin(),v.end()

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now ().time_since_epoch().count());
ll Rand (ll l, ll r) { return uniform_int_distribution<ll> (l, r) (rd); }

const int N = 2e5 + 7;
const int Mod = 1e9 + 7;
const int INF = 1e9;
const ll BASE = 137;
const int szBL = 320;

int n, m, Q;
vector<int> ke[N];
pii qr[N];

int high[N], nC[N], pa[N], time_dfs;

int ein[N], Head[N];

int num_Ver = 0;

vector<int> ke2[N << 3];

int num[N << 3], low[N << 3 ], del[N << 3], time_dfs2 = 0;///aware
stack<int> st;

bool Ans;

struct Segment_Tree {
    int m;
    int st[N << 2], lab[N << 2];

    void build (int id, int l, int r, int typ) {
        ++num_Ver;
        lab[id] = num_Ver;
        if (l == r) {
            return;
        }
        int mid = l + r >> 1;
        build (id << 1, l, mid, typ);
        build (id << 1 | 1, mid + 1, r, typ);
        if (typ == 0)
            ke2[lab[id << 1]].pb(lab[id]), ke2[lab[id << 1 | 1]].pb(lab[id]);
        else
            ke2[lab[id]].pb(lab[id << 1]), ke2[lab[id]].pb(lab[id << 1 | 1]);
    }

    int get (int id, int l, int r, int pos) {
        if (l > pos || r < pos) return -1;
        if (l == r) return lab[id];
        int mid = l + r >> 1;
        return max(get (id << 1, l, mid, pos), get (id << 1 | 1, mid + 1, r, pos));
    }

    void in_add_edge (int id, int l, int r, int u, int v, int clab, int typ) {
        if (l > v || r < u) return;
        if (l >= u && r <= v) {
            if (typ == 0) ke2[lab[id]].pb(clab);
            else ke2[clab].pb(lab[id]);
            return;
        }
        int mid = l + r >> 1;
        in_add_edge (id << 1, l, mid, u, v, clab, typ);
        in_add_edge (id << 1 | 1, mid + 1, r, u, v, clab, typ);
    }

    void add_edge (int u, int v, int clab, int st, int ed, int typ) {
        if (typ == 0) {
            if (u == ein[st]) ++u;
            if (v == ein[st]) --v;
        }
        else {
            if (u == ein[ed]) ++u;
            if (v == ein[ed]) --v;
        }
        in_add_edge (1, 1, m, u, v, clab, typ);
    }

    int get (int pos) {
        return get (1, 1, m, pos);
    }

    void init (int n, int typ) {
        m = n;
        build (1, 1, m, typ);
    }
}STs, STe;

void pdfs (int u, int p) {
    high[u] = high[p] + 1;
    pa[u] = p;
    nC[u] = 1;
    iter (&v, ke[u]) if (v != p) {
        pdfs (v, u);
        nC[u] += nC[v];
    }
}

void hld (int u, int p) {
    ein[u] = ++time_dfs;
    Head[u] = p;
    int mxV = -1;
    iter (&v, ke[u]) if (v != pa[u] && (mxV == -1 || nC[v] > nC[mxV])) mxV = v;
    if (mxV != -1) hld(mxV, p);
    iter (&v, ke[u]) {
        if (v == pa[u] || v == mxV) continue;
        hld(v, v);
    }
}

void query (int st, int ed) {
    int u = st, v = ed, labs = STs.get(ein[st]), labe = STe.get(ein[ed]);
    ke2[labe].pb(labs);
    for (; Head[u] != Head[v]; v = pa[Head[v]]) {
        if (high[Head[u]] > high[Head[v]]) swap(u, v);
        STs.add_edge (ein[Head[v]], ein[v], labe, st, ed, 0);
        STe.add_edge (ein[Head[v]], ein[v], labs, st, ed, 1);
    }
    if (high[u] > high[v]) swap(u, v);
    STs.add_edge (ein[u], ein[v], labe, st, ed, 0);
    STe.add_edge (ein[u], ein[v], labs, st, ed, 1);
}

void dfs (int u) {
    num[u] = low[u] = ++time_dfs2;
    st.push(u);
    iter (&v, ke2[u]) {
        if (del[v]) continue;
        if (!num[v]) {
            dfs(v);
            low[u] = min(low[u], low[v]);
        }
        else low[u] = min(low[u], num[v]);
    }
    if (num[u] == low[u]) {
        int v;
        int num_del = 0;
        do {
            v = st.top();
            st.pop();
            del[v] = 1;
            ++num_del;
        }while (v != u);
        if (num_del > 1) Ans = 0;
    }
}

void solution () {
    rep (i, 1, num_Ver) ke[i].clear(), ke2[i].clear(), num[i] = low[i] = del[i] = 0;
    time_dfs = time_dfs2 = 0, Ans = 1, num_Ver = 0;
    cin >> n;
    rep (i, 1, n - 1) {
        int u, v;
        cin >> u >> v;
        ke[u].pb(v);
        ke[v].pb(u);
    }
    pdfs(1, 0);
    hld (1, 1);
    STs.init(n, 0);
    STe.init(n, 1);
    cin >> m;
    rep (i, 1, m) {
        cin >> qr[i].fs >> qr[i].se;
        query (qr[i].fs, qr[i].se);
    }
    rep (i, 1, num_Ver) {
        if (!num[i]) dfs(i);
    }
    if (Ans) cout << "Yes\n";
    else cout << "No\n";
}

#define file(name) freopen(name".inp","r",stdin); \
freopen(name".out","w",stdout);
int main () {
//    file("c");
    ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int num_Test = 1;
    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
no bug challenge +4
mình có muốn dùng mảng này không?
4 5
1 3
4 1
1 2
3 2
2 1
return->break
*/

Compilation message

jail.cpp: In member function 'void Segment_Tree::build(int, int, int, int)':
jail.cpp:54:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |         int mid = l + r >> 1;
      |                   ~~^~~
jail.cpp: In member function 'int Segment_Tree::get(int, int, int, int)':
jail.cpp:66:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |         int mid = l + r >> 1;
      |                   ~~^~~
jail.cpp: In member function 'void Segment_Tree::in_add_edge(int, int, int, int, int, int, int)':
jail.cpp:77:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 56668 KB Output is correct
2 Correct 8 ms 56664 KB Output is correct
3 Correct 8 ms 56668 KB Output is correct
4 Correct 22 ms 56668 KB Output is correct
5 Correct 27 ms 56668 KB Output is correct
6 Correct 9 ms 56668 KB Output is correct
7 Correct 9 ms 56668 KB Output is correct
8 Correct 11 ms 56668 KB Output is correct
9 Correct 40 ms 58396 KB Output is correct
10 Correct 61 ms 83792 KB Output is correct
11 Correct 14 ms 56668 KB Output is correct
12 Correct 42 ms 56664 KB Output is correct
13 Correct 115 ms 87732 KB Output is correct
14 Correct 113 ms 89352 KB Output is correct
15 Correct 247 ms 101212 KB Output is correct
16 Correct 415 ms 128592 KB Output is correct
17 Correct 138 ms 95572 KB Output is correct
18 Correct 160 ms 88404 KB Output is correct
19 Correct 116 ms 94032 KB Output is correct
20 Correct 114 ms 94012 KB Output is correct
21 Correct 154 ms 96336 KB Output is correct
22 Correct 95 ms 87404 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 56668 KB Output is correct
2 Correct 8 ms 56668 KB Output is correct
3 Correct 10 ms 56688 KB Output is correct
4 Correct 9 ms 56668 KB Output is correct
5 Correct 9 ms 56668 KB Output is correct
6 Correct 10 ms 56664 KB Output is correct
7 Correct 10 ms 56712 KB Output is correct
8 Correct 10 ms 56668 KB Output is correct
9 Correct 10 ms 56668 KB Output is correct
10 Correct 9 ms 56668 KB Output is correct
11 Correct 8 ms 56668 KB Output is correct
12 Correct 9 ms 56692 KB Output is correct
13 Correct 8 ms 56668 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 56668 KB Output is correct
2 Correct 8 ms 56668 KB Output is correct
3 Correct 10 ms 56688 KB Output is correct
4 Correct 9 ms 56668 KB Output is correct
5 Correct 9 ms 56668 KB Output is correct
6 Correct 10 ms 56664 KB Output is correct
7 Correct 10 ms 56712 KB Output is correct
8 Correct 10 ms 56668 KB Output is correct
9 Correct 10 ms 56668 KB Output is correct
10 Correct 9 ms 56668 KB Output is correct
11 Correct 8 ms 56668 KB Output is correct
12 Correct 9 ms 56692 KB Output is correct
13 Correct 8 ms 56668 KB Output is correct
14 Correct 8 ms 56664 KB Output is correct
15 Correct 8 ms 56732 KB Output is correct
16 Correct 9 ms 56664 KB Output is correct
17 Correct 9 ms 56668 KB Output is correct
18 Correct 9 ms 56668 KB Output is correct
19 Correct 9 ms 56668 KB Output is correct
20 Correct 9 ms 56668 KB Output is correct
21 Correct 10 ms 56724 KB Output is correct
22 Correct 10 ms 56668 KB Output is correct
23 Correct 8 ms 56816 KB Output is correct
24 Correct 9 ms 56668 KB Output is correct
25 Correct 10 ms 56664 KB Output is correct
26 Correct 8 ms 56668 KB Output is correct
27 Correct 10 ms 56668 KB Output is correct
28 Correct 8 ms 56668 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 56668 KB Output is correct
2 Correct 8 ms 56668 KB Output is correct
3 Correct 10 ms 56688 KB Output is correct
4 Correct 9 ms 56668 KB Output is correct
5 Correct 9 ms 56668 KB Output is correct
6 Correct 10 ms 56664 KB Output is correct
7 Correct 10 ms 56712 KB Output is correct
8 Correct 10 ms 56668 KB Output is correct
9 Correct 10 ms 56668 KB Output is correct
10 Correct 9 ms 56668 KB Output is correct
11 Correct 8 ms 56668 KB Output is correct
12 Correct 9 ms 56692 KB Output is correct
13 Correct 8 ms 56668 KB Output is correct
14 Correct 8 ms 56664 KB Output is correct
15 Correct 8 ms 56732 KB Output is correct
16 Correct 9 ms 56664 KB Output is correct
17 Correct 9 ms 56668 KB Output is correct
18 Correct 9 ms 56668 KB Output is correct
19 Correct 9 ms 56668 KB Output is correct
20 Correct 9 ms 56668 KB Output is correct
21 Correct 10 ms 56724 KB Output is correct
22 Correct 10 ms 56668 KB Output is correct
23 Correct 8 ms 56816 KB Output is correct
24 Correct 9 ms 56668 KB Output is correct
25 Correct 10 ms 56664 KB Output is correct
26 Correct 8 ms 56668 KB Output is correct
27 Correct 10 ms 56668 KB Output is correct
28 Correct 8 ms 56668 KB Output is correct
29 Correct 13 ms 56668 KB Output is correct
30 Correct 11 ms 56668 KB Output is correct
31 Correct 10 ms 56708 KB Output is correct
32 Correct 11 ms 56664 KB Output is correct
33 Correct 10 ms 56668 KB Output is correct
34 Correct 11 ms 56696 KB Output is correct
35 Correct 10 ms 56704 KB Output is correct
36 Correct 10 ms 56668 KB Output is correct
37 Correct 9 ms 56668 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 56668 KB Output is correct
2 Correct 8 ms 56668 KB Output is correct
3 Correct 10 ms 56688 KB Output is correct
4 Correct 9 ms 56668 KB Output is correct
5 Correct 9 ms 56668 KB Output is correct
6 Correct 10 ms 56664 KB Output is correct
7 Correct 10 ms 56712 KB Output is correct
8 Correct 10 ms 56668 KB Output is correct
9 Correct 10 ms 56668 KB Output is correct
10 Correct 9 ms 56668 KB Output is correct
11 Correct 8 ms 56668 KB Output is correct
12 Correct 9 ms 56692 KB Output is correct
13 Correct 8 ms 56668 KB Output is correct
14 Correct 8 ms 56664 KB Output is correct
15 Correct 8 ms 56732 KB Output is correct
16 Correct 9 ms 56664 KB Output is correct
17 Correct 9 ms 56668 KB Output is correct
18 Correct 9 ms 56668 KB Output is correct
19 Correct 9 ms 56668 KB Output is correct
20 Correct 9 ms 56668 KB Output is correct
21 Correct 10 ms 56724 KB Output is correct
22 Correct 10 ms 56668 KB Output is correct
23 Correct 8 ms 56816 KB Output is correct
24 Correct 9 ms 56668 KB Output is correct
25 Correct 10 ms 56664 KB Output is correct
26 Correct 8 ms 56668 KB Output is correct
27 Correct 10 ms 56668 KB Output is correct
28 Correct 8 ms 56668 KB Output is correct
29 Correct 13 ms 56668 KB Output is correct
30 Correct 11 ms 56668 KB Output is correct
31 Correct 10 ms 56708 KB Output is correct
32 Correct 11 ms 56664 KB Output is correct
33 Correct 10 ms 56668 KB Output is correct
34 Correct 11 ms 56696 KB Output is correct
35 Correct 10 ms 56704 KB Output is correct
36 Correct 10 ms 56668 KB Output is correct
37 Correct 9 ms 56668 KB Output is correct
38 Correct 40 ms 58388 KB Output is correct
39 Correct 60 ms 83824 KB Output is correct
40 Correct 50 ms 58392 KB Output is correct
41 Correct 54 ms 58196 KB Output is correct
42 Correct 44 ms 58452 KB Output is correct
43 Correct 33 ms 57688 KB Output is correct
44 Correct 24 ms 57176 KB Output is correct
45 Correct 74 ms 76372 KB Output is correct
46 Correct 72 ms 76368 KB Output is correct
47 Correct 66 ms 79812 KB Output is correct
48 Correct 63 ms 79956 KB Output is correct
49 Correct 66 ms 76368 KB Output is correct
50 Correct 72 ms 76424 KB Output is correct
51 Correct 59 ms 77516 KB Output is correct
52 Correct 60 ms 77516 KB Output is correct
53 Correct 22 ms 57948 KB Output is correct
54 Correct 74 ms 76116 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 56668 KB Output is correct
2 Correct 8 ms 56708 KB Output is correct
3 Correct 9 ms 56668 KB Output is correct
4 Correct 8 ms 56668 KB Output is correct
5 Correct 13 ms 56728 KB Output is correct
6 Correct 10 ms 56664 KB Output is correct
7 Correct 9 ms 56720 KB Output is correct
8 Correct 8 ms 56664 KB Output is correct
9 Correct 8 ms 56708 KB Output is correct
10 Correct 9 ms 56668 KB Output is correct
11 Correct 9 ms 56804 KB Output is correct
12 Correct 10 ms 56668 KB Output is correct
13 Correct 33 ms 56872 KB Output is correct
14 Correct 48 ms 56668 KB Output is correct
15 Correct 38 ms 56668 KB Output is correct
16 Correct 111 ms 77652 KB Output is correct
17 Correct 345 ms 90160 KB Output is correct
18 Correct 626 ms 112008 KB Output is correct
19 Correct 174 ms 79316 KB Output is correct
20 Correct 173 ms 79272 KB Output is correct
21 Correct 159 ms 79440 KB Output is correct
22 Correct 303 ms 86632 KB Output is correct
23 Correct 224 ms 85544 KB Output is correct
24 Correct 215 ms 85204 KB Output is correct
25 Correct 228 ms 85456 KB Output is correct
26 Correct 287 ms 85440 KB Output is correct
27 Correct 271 ms 86824 KB Output is correct
28 Correct 299 ms 101432 KB Output is correct
29 Correct 284 ms 91076 KB Output is correct
30 Correct 197 ms 85700 KB Output is correct
31 Correct 185 ms 91088 KB Output is correct
32 Correct 205 ms 85708 KB Output is correct
33 Correct 216 ms 91732 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 56668 KB Output is correct
2 Correct 8 ms 56664 KB Output is correct
3 Correct 8 ms 56668 KB Output is correct
4 Correct 22 ms 56668 KB Output is correct
5 Correct 27 ms 56668 KB Output is correct
6 Correct 9 ms 56668 KB Output is correct
7 Correct 9 ms 56668 KB Output is correct
8 Correct 11 ms 56668 KB Output is correct
9 Correct 40 ms 58396 KB Output is correct
10 Correct 61 ms 83792 KB Output is correct
11 Correct 14 ms 56668 KB Output is correct
12 Correct 42 ms 56664 KB Output is correct
13 Correct 115 ms 87732 KB Output is correct
14 Correct 113 ms 89352 KB Output is correct
15 Correct 247 ms 101212 KB Output is correct
16 Correct 415 ms 128592 KB Output is correct
17 Correct 138 ms 95572 KB Output is correct
18 Correct 160 ms 88404 KB Output is correct
19 Correct 116 ms 94032 KB Output is correct
20 Correct 114 ms 94012 KB Output is correct
21 Correct 154 ms 96336 KB Output is correct
22 Correct 95 ms 87404 KB Output is correct
23 Correct 8 ms 56668 KB Output is correct
24 Correct 8 ms 56668 KB Output is correct
25 Correct 10 ms 56688 KB Output is correct
26 Correct 9 ms 56668 KB Output is correct
27 Correct 9 ms 56668 KB Output is correct
28 Correct 10 ms 56664 KB Output is correct
29 Correct 10 ms 56712 KB Output is correct
30 Correct 10 ms 56668 KB Output is correct
31 Correct 10 ms 56668 KB Output is correct
32 Correct 9 ms 56668 KB Output is correct
33 Correct 8 ms 56668 KB Output is correct
34 Correct 9 ms 56692 KB Output is correct
35 Correct 8 ms 56668 KB Output is correct
36 Correct 8 ms 56664 KB Output is correct
37 Correct 8 ms 56732 KB Output is correct
38 Correct 9 ms 56664 KB Output is correct
39 Correct 9 ms 56668 KB Output is correct
40 Correct 9 ms 56668 KB Output is correct
41 Correct 9 ms 56668 KB Output is correct
42 Correct 9 ms 56668 KB Output is correct
43 Correct 10 ms 56724 KB Output is correct
44 Correct 10 ms 56668 KB Output is correct
45 Correct 8 ms 56816 KB Output is correct
46 Correct 9 ms 56668 KB Output is correct
47 Correct 10 ms 56664 KB Output is correct
48 Correct 8 ms 56668 KB Output is correct
49 Correct 10 ms 56668 KB Output is correct
50 Correct 8 ms 56668 KB Output is correct
51 Correct 13 ms 56668 KB Output is correct
52 Correct 11 ms 56668 KB Output is correct
53 Correct 10 ms 56708 KB Output is correct
54 Correct 11 ms 56664 KB Output is correct
55 Correct 10 ms 56668 KB Output is correct
56 Correct 11 ms 56696 KB Output is correct
57 Correct 10 ms 56704 KB Output is correct
58 Correct 10 ms 56668 KB Output is correct
59 Correct 9 ms 56668 KB Output is correct
60 Correct 40 ms 58388 KB Output is correct
61 Correct 60 ms 83824 KB Output is correct
62 Correct 50 ms 58392 KB Output is correct
63 Correct 54 ms 58196 KB Output is correct
64 Correct 44 ms 58452 KB Output is correct
65 Correct 33 ms 57688 KB Output is correct
66 Correct 24 ms 57176 KB Output is correct
67 Correct 74 ms 76372 KB Output is correct
68 Correct 72 ms 76368 KB Output is correct
69 Correct 66 ms 79812 KB Output is correct
70 Correct 63 ms 79956 KB Output is correct
71 Correct 66 ms 76368 KB Output is correct
72 Correct 72 ms 76424 KB Output is correct
73 Correct 59 ms 77516 KB Output is correct
74 Correct 60 ms 77516 KB Output is correct
75 Correct 22 ms 57948 KB Output is correct
76 Correct 74 ms 76116 KB Output is correct
77 Correct 9 ms 56668 KB Output is correct
78 Correct 8 ms 56708 KB Output is correct
79 Correct 9 ms 56668 KB Output is correct
80 Correct 8 ms 56668 KB Output is correct
81 Correct 13 ms 56728 KB Output is correct
82 Correct 10 ms 56664 KB Output is correct
83 Correct 9 ms 56720 KB Output is correct
84 Correct 8 ms 56664 KB Output is correct
85 Correct 8 ms 56708 KB Output is correct
86 Correct 9 ms 56668 KB Output is correct
87 Correct 9 ms 56804 KB Output is correct
88 Correct 10 ms 56668 KB Output is correct
89 Correct 33 ms 56872 KB Output is correct
90 Correct 48 ms 56668 KB Output is correct
91 Correct 38 ms 56668 KB Output is correct
92 Correct 111 ms 77652 KB Output is correct
93 Correct 345 ms 90160 KB Output is correct
94 Correct 626 ms 112008 KB Output is correct
95 Correct 174 ms 79316 KB Output is correct
96 Correct 173 ms 79272 KB Output is correct
97 Correct 159 ms 79440 KB Output is correct
98 Correct 303 ms 86632 KB Output is correct
99 Correct 224 ms 85544 KB Output is correct
100 Correct 215 ms 85204 KB Output is correct
101 Correct 228 ms 85456 KB Output is correct
102 Correct 287 ms 85440 KB Output is correct
103 Correct 271 ms 86824 KB Output is correct
104 Correct 299 ms 101432 KB Output is correct
105 Correct 284 ms 91076 KB Output is correct
106 Correct 197 ms 85700 KB Output is correct
107 Correct 185 ms 91088 KB Output is correct
108 Correct 205 ms 85708 KB Output is correct
109 Correct 216 ms 91732 KB Output is correct
110 Correct 47 ms 56912 KB Output is correct
111 Correct 30 ms 56664 KB Output is correct
112 Correct 302 ms 100816 KB Output is correct
113 Correct 158 ms 83796 KB Output is correct
114 Correct 220 ms 90632 KB Output is correct
115 Correct 61 ms 76748 KB Output is correct
116 Correct 183 ms 78928 KB Output is correct
117 Correct 870 ms 123948 KB Output is correct
118 Correct 84 ms 76396 KB Output is correct
119 Correct 90 ms 76204 KB Output is correct
120 Correct 26 ms 58456 KB Output is correct
121 Correct 245 ms 80624 KB Output is correct
122 Correct 329 ms 80496 KB Output is correct
123 Correct 145 ms 85844 KB Output is correct
124 Correct 150 ms 85944 KB Output is correct
125 Correct 146 ms 86400 KB Output is correct
126 Correct 461 ms 125520 KB Output is correct
127 Correct 278 ms 98856 KB Output is correct
128 Correct 172 ms 97420 KB Output is correct
129 Correct 163 ms 95276 KB Output is correct
130 Correct 210 ms 96932 KB Output is correct