oj.uz

답안 #1082490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082490 2024-08-31T13:26:41 Z underwaterkillerwhale Jail (JOI22_jail) C++17
100 / 100
 748 ms 100088 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 vis[N << 3];

bool Ans;

struct Segment_Tree {
private:
    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 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;
        add_edge (id << 1, l, mid, u, v, clab, typ);
        add_edge (id << 1 | 1, mid + 1, r, u, v, clab, typ);
    }
public:
    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;
        }
        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) {
    vis[u] = 1;
    iter (&v, ke2[u]) {
        if (vis[v] == 1) {
            Ans = 0;
            return;
        }
        if (!vis[v]) dfs(v);
    }
    vis[u] = 2;
}

void solution () {
    rep (i, 1, num_Ver) vector<int> ().swap(ke[i]), vector<int> ().swap(ke2[i]), vis[i] = 0;
    time_dfs = 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 (!vis[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::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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 42840 KB Output is correct
2 Correct 9 ms 43100 KB Output is correct
3 Correct 9 ms 43088 KB Output is correct
4 Correct 26 ms 42864 KB Output is correct
5 Correct 38 ms 43612 KB Output is correct
6 Correct 11 ms 43096 KB Output is correct
7 Correct 10 ms 44380 KB Output is correct
8 Correct 10 ms 43096 KB Output is correct
9 Correct 58 ms 46928 KB Output is correct
10 Correct 60 ms 73300 KB Output is correct
11 Correct 21 ms 43096 KB Output is correct
12 Correct 58 ms 44052 KB Output is correct
13 Correct 107 ms 78160 KB Output is correct
14 Correct 104 ms 77904 KB Output is correct
15 Correct 209 ms 83028 KB Output is correct
16 Correct 413 ms 97592 KB Output is correct
17 Correct 123 ms 85800 KB Output is correct
18 Correct 109 ms 79440 KB Output is correct
19 Correct 116 ms 84560 KB Output is correct
20 Correct 125 ms 84640 KB Output is correct
21 Correct 162 ms 85660 KB Output is correct
22 Correct 89 ms 76280 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 43096 KB Output is correct
2 Correct 8 ms 42920 KB Output is correct
3 Correct 8 ms 43000 KB Output is correct
4 Correct 8 ms 44380 KB Output is correct
5 Correct 10 ms 43100 KB Output is correct
6 Correct 9 ms 43100 KB Output is correct
7 Correct 8 ms 43100 KB Output is correct
8 Correct 9 ms 43180 KB Output is correct
9 Correct 9 ms 43168 KB Output is correct
10 Correct 9 ms 43100 KB Output is correct
11 Correct 9 ms 43100 KB Output is correct
12 Correct 8 ms 43100 KB Output is correct
13 Correct 8 ms 44380 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 43096 KB Output is correct
2 Correct 8 ms 42920 KB Output is correct
3 Correct 8 ms 43000 KB Output is correct
4 Correct 8 ms 44380 KB Output is correct
5 Correct 10 ms 43100 KB Output is correct
6 Correct 9 ms 43100 KB Output is correct
7 Correct 8 ms 43100 KB Output is correct
8 Correct 9 ms 43180 KB Output is correct
9 Correct 9 ms 43168 KB Output is correct
10 Correct 9 ms 43100 KB Output is correct
11 Correct 9 ms 43100 KB Output is correct
12 Correct 8 ms 43100 KB Output is correct
13 Correct 8 ms 44380 KB Output is correct
14 Correct 7 ms 43100 KB Output is correct
15 Correct 8 ms 43100 KB Output is correct
16 Correct 11 ms 43096 KB Output is correct
17 Correct 9 ms 43152 KB Output is correct
18 Correct 12 ms 43048 KB Output is correct
19 Correct 9 ms 43100 KB Output is correct
20 Correct 9 ms 43172 KB Output is correct
21 Correct 10 ms 43096 KB Output is correct
22 Correct 9 ms 43116 KB Output is correct
23 Correct 8 ms 43100 KB Output is correct
24 Correct 8 ms 43100 KB Output is correct
25 Correct 9 ms 43100 KB Output is correct
26 Correct 8 ms 43096 KB Output is correct
27 Correct 10 ms 43096 KB Output is correct
28 Correct 8 ms 42956 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 43096 KB Output is correct
2 Correct 8 ms 42920 KB Output is correct
3 Correct 8 ms 43000 KB Output is correct
4 Correct 8 ms 44380 KB Output is correct
5 Correct 10 ms 43100 KB Output is correct
6 Correct 9 ms 43100 KB Output is correct
7 Correct 8 ms 43100 KB Output is correct
8 Correct 9 ms 43180 KB Output is correct
9 Correct 9 ms 43168 KB Output is correct
10 Correct 9 ms 43100 KB Output is correct
11 Correct 9 ms 43100 KB Output is correct
12 Correct 8 ms 43100 KB Output is correct
13 Correct 8 ms 44380 KB Output is correct
14 Correct 7 ms 43100 KB Output is correct
15 Correct 8 ms 43100 KB Output is correct
16 Correct 11 ms 43096 KB Output is correct
17 Correct 9 ms 43152 KB Output is correct
18 Correct 12 ms 43048 KB Output is correct
19 Correct 9 ms 43100 KB Output is correct
20 Correct 9 ms 43172 KB Output is correct
21 Correct 10 ms 43096 KB Output is correct
22 Correct 9 ms 43116 KB Output is correct
23 Correct 8 ms 43100 KB Output is correct
24 Correct 8 ms 43100 KB Output is correct
25 Correct 9 ms 43100 KB Output is correct
26 Correct 8 ms 43096 KB Output is correct
27 Correct 10 ms 43096 KB Output is correct
28 Correct 8 ms 42956 KB Output is correct
29 Correct 10 ms 43096 KB Output is correct
30 Correct 11 ms 43100 KB Output is correct
31 Correct 10 ms 43192 KB Output is correct
32 Correct 11 ms 43100 KB Output is correct
33 Correct 10 ms 43100 KB Output is correct
34 Correct 13 ms 44376 KB Output is correct
35 Correct 9 ms 43100 KB Output is correct
36 Correct 10 ms 43196 KB Output is correct
37 Correct 9 ms 43100 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 43096 KB Output is correct
2 Correct 8 ms 42920 KB Output is correct
3 Correct 8 ms 43000 KB Output is correct
4 Correct 8 ms 44380 KB Output is correct
5 Correct 10 ms 43100 KB Output is correct
6 Correct 9 ms 43100 KB Output is correct
7 Correct 8 ms 43100 KB Output is correct
8 Correct 9 ms 43180 KB Output is correct
9 Correct 9 ms 43168 KB Output is correct
10 Correct 9 ms 43100 KB Output is correct
11 Correct 9 ms 43100 KB Output is correct
12 Correct 8 ms 43100 KB Output is correct
13 Correct 8 ms 44380 KB Output is correct
14 Correct 7 ms 43100 KB Output is correct
15 Correct 8 ms 43100 KB Output is correct
16 Correct 11 ms 43096 KB Output is correct
17 Correct 9 ms 43152 KB Output is correct
18 Correct 12 ms 43048 KB Output is correct
19 Correct 9 ms 43100 KB Output is correct
20 Correct 9 ms 43172 KB Output is correct
21 Correct 10 ms 43096 KB Output is correct
22 Correct 9 ms 43116 KB Output is correct
23 Correct 8 ms 43100 KB Output is correct
24 Correct 8 ms 43100 KB Output is correct
25 Correct 9 ms 43100 KB Output is correct
26 Correct 8 ms 43096 KB Output is correct
27 Correct 10 ms 43096 KB Output is correct
28 Correct 8 ms 42956 KB Output is correct
29 Correct 10 ms 43096 KB Output is correct
30 Correct 11 ms 43100 KB Output is correct
31 Correct 10 ms 43192 KB Output is correct
32 Correct 11 ms 43100 KB Output is correct
33 Correct 10 ms 43100 KB Output is correct
34 Correct 13 ms 44376 KB Output is correct
35 Correct 9 ms 43100 KB Output is correct
36 Correct 10 ms 43196 KB Output is correct
37 Correct 9 ms 43100 KB Output is correct
38 Correct 58 ms 45724 KB Output is correct
39 Correct 65 ms 73448 KB Output is correct
40 Correct 67 ms 45520 KB Output is correct
41 Correct 71 ms 45264 KB Output is correct
42 Correct 64 ms 45312 KB Output is correct
43 Correct 45 ms 46428 KB Output is correct
44 Correct 25 ms 43356 KB Output is correct
45 Correct 76 ms 65940 KB Output is correct
46 Correct 77 ms 66128 KB Output is correct
47 Correct 62 ms 69400 KB Output is correct
48 Correct 63 ms 69456 KB Output is correct
49 Correct 68 ms 66384 KB Output is correct
50 Correct 76 ms 65876 KB Output is correct
51 Correct 54 ms 66896 KB Output is correct
52 Correct 57 ms 67404 KB Output is correct
53 Correct 30 ms 44880 KB Output is correct
54 Correct 80 ms 66072 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 42840 KB Output is correct
2 Correct 8 ms 42900 KB Output is correct
3 Correct 7 ms 44120 KB Output is correct
4 Correct 7 ms 42844 KB Output is correct
5 Correct 15 ms 43100 KB Output is correct
6 Correct 9 ms 43100 KB Output is correct
7 Correct 7 ms 43100 KB Output is correct
8 Correct 7 ms 43100 KB Output is correct
9 Correct 8 ms 42936 KB Output is correct
10 Correct 8 ms 44124 KB Output is correct
11 Correct 8 ms 44208 KB Output is correct
12 Correct 9 ms 43096 KB Output is correct
13 Correct 42 ms 43612 KB Output is correct
14 Correct 76 ms 43724 KB Output is correct
15 Correct 60 ms 43820 KB Output is correct
16 Correct 103 ms 67408 KB Output is correct
17 Correct 326 ms 76884 KB Output is correct
18 Correct 555 ms 89884 KB Output is correct
19 Correct 151 ms 68944 KB Output is correct
20 Correct 150 ms 68948 KB Output is correct
21 Correct 161 ms 69168 KB Output is correct
22 Correct 294 ms 75508 KB Output is correct
23 Correct 201 ms 75592 KB Output is correct
24 Correct 220 ms 75472 KB Output is correct
25 Correct 216 ms 75368 KB Output is correct
26 Correct 213 ms 75976 KB Output is correct
27 Correct 243 ms 75464 KB Output is correct
28 Correct 248 ms 83652 KB Output is correct
29 Correct 278 ms 78024 KB Output is correct
30 Correct 190 ms 72848 KB Output is correct
31 Correct 191 ms 76048 KB Output is correct
32 Correct 197 ms 73164 KB Output is correct
33 Correct 185 ms 76616 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 42840 KB Output is correct
2 Correct 9 ms 43100 KB Output is correct
3 Correct 9 ms 43088 KB Output is correct
4 Correct 26 ms 42864 KB Output is correct
5 Correct 38 ms 43612 KB Output is correct
6 Correct 11 ms 43096 KB Output is correct
7 Correct 10 ms 44380 KB Output is correct
8 Correct 10 ms 43096 KB Output is correct
9 Correct 58 ms 46928 KB Output is correct
10 Correct 60 ms 73300 KB Output is correct
11 Correct 21 ms 43096 KB Output is correct
12 Correct 58 ms 44052 KB Output is correct
13 Correct 107 ms 78160 KB Output is correct
14 Correct 104 ms 77904 KB Output is correct
15 Correct 209 ms 83028 KB Output is correct
16 Correct 413 ms 97592 KB Output is correct
17 Correct 123 ms 85800 KB Output is correct
18 Correct 109 ms 79440 KB Output is correct
19 Correct 116 ms 84560 KB Output is correct
20 Correct 125 ms 84640 KB Output is correct
21 Correct 162 ms 85660 KB Output is correct
22 Correct 89 ms 76280 KB Output is correct
23 Correct 8 ms 43096 KB Output is correct
24 Correct 8 ms 42920 KB Output is correct
25 Correct 8 ms 43000 KB Output is correct
26 Correct 8 ms 44380 KB Output is correct
27 Correct 10 ms 43100 KB Output is correct
28 Correct 9 ms 43100 KB Output is correct
29 Correct 8 ms 43100 KB Output is correct
30 Correct 9 ms 43180 KB Output is correct
31 Correct 9 ms 43168 KB Output is correct
32 Correct 9 ms 43100 KB Output is correct
33 Correct 9 ms 43100 KB Output is correct
34 Correct 8 ms 43100 KB Output is correct
35 Correct 8 ms 44380 KB Output is correct
36 Correct 7 ms 43100 KB Output is correct
37 Correct 8 ms 43100 KB Output is correct
38 Correct 11 ms 43096 KB Output is correct
39 Correct 9 ms 43152 KB Output is correct
40 Correct 12 ms 43048 KB Output is correct
41 Correct 9 ms 43100 KB Output is correct
42 Correct 9 ms 43172 KB Output is correct
43 Correct 10 ms 43096 KB Output is correct
44 Correct 9 ms 43116 KB Output is correct
45 Correct 8 ms 43100 KB Output is correct
46 Correct 8 ms 43100 KB Output is correct
47 Correct 9 ms 43100 KB Output is correct
48 Correct 8 ms 43096 KB Output is correct
49 Correct 10 ms 43096 KB Output is correct
50 Correct 8 ms 42956 KB Output is correct
51 Correct 10 ms 43096 KB Output is correct
52 Correct 11 ms 43100 KB Output is correct
53 Correct 10 ms 43192 KB Output is correct
54 Correct 11 ms 43100 KB Output is correct
55 Correct 10 ms 43100 KB Output is correct
56 Correct 13 ms 44376 KB Output is correct
57 Correct 9 ms 43100 KB Output is correct
58 Correct 10 ms 43196 KB Output is correct
59 Correct 9 ms 43100 KB Output is correct
60 Correct 58 ms 45724 KB Output is correct
61 Correct 65 ms 73448 KB Output is correct
62 Correct 67 ms 45520 KB Output is correct
63 Correct 71 ms 45264 KB Output is correct
64 Correct 64 ms 45312 KB Output is correct
65 Correct 45 ms 46428 KB Output is correct
66 Correct 25 ms 43356 KB Output is correct
67 Correct 76 ms 65940 KB Output is correct
68 Correct 77 ms 66128 KB Output is correct
69 Correct 62 ms 69400 KB Output is correct
70 Correct 63 ms 69456 KB Output is correct
71 Correct 68 ms 66384 KB Output is correct
72 Correct 76 ms 65876 KB Output is correct
73 Correct 54 ms 66896 KB Output is correct
74 Correct 57 ms 67404 KB Output is correct
75 Correct 30 ms 44880 KB Output is correct
76 Correct 80 ms 66072 KB Output is correct
77 Correct 8 ms 42840 KB Output is correct
78 Correct 8 ms 42900 KB Output is correct
79 Correct 7 ms 44120 KB Output is correct
80 Correct 7 ms 42844 KB Output is correct
81 Correct 15 ms 43100 KB Output is correct
82 Correct 9 ms 43100 KB Output is correct
83 Correct 7 ms 43100 KB Output is correct
84 Correct 7 ms 43100 KB Output is correct
85 Correct 8 ms 42936 KB Output is correct
86 Correct 8 ms 44124 KB Output is correct
87 Correct 8 ms 44208 KB Output is correct
88 Correct 9 ms 43096 KB Output is correct
89 Correct 42 ms 43612 KB Output is correct
90 Correct 76 ms 43724 KB Output is correct
91 Correct 60 ms 43820 KB Output is correct
92 Correct 103 ms 67408 KB Output is correct
93 Correct 326 ms 76884 KB Output is correct
94 Correct 555 ms 89884 KB Output is correct
95 Correct 151 ms 68944 KB Output is correct
96 Correct 150 ms 68948 KB Output is correct
97 Correct 161 ms 69168 KB Output is correct
98 Correct 294 ms 75508 KB Output is correct
99 Correct 201 ms 75592 KB Output is correct
100 Correct 220 ms 75472 KB Output is correct
101 Correct 216 ms 75368 KB Output is correct
102 Correct 213 ms 75976 KB Output is correct
103 Correct 243 ms 75464 KB Output is correct
104 Correct 248 ms 83652 KB Output is correct
105 Correct 278 ms 78024 KB Output is correct
106 Correct 190 ms 72848 KB Output is correct
107 Correct 191 ms 76048 KB Output is correct
108 Correct 197 ms 73164 KB Output is correct
109 Correct 185 ms 76616 KB Output is correct
110 Correct 65 ms 43924 KB Output is correct
111 Correct 39 ms 43752 KB Output is correct
112 Correct 229 ms 82192 KB Output is correct
113 Correct 134 ms 73552 KB Output is correct
114 Correct 199 ms 76492 KB Output is correct
115 Correct 60 ms 66000 KB Output is correct
116 Correct 197 ms 69108 KB Output is correct
117 Correct 748 ms 100088 KB Output is correct
118 Correct 83 ms 65876 KB Output is correct
119 Correct 80 ms 65876 KB Output is correct
120 Correct 21 ms 45356 KB Output is correct
121 Correct 216 ms 70700 KB Output is correct
122 Correct 223 ms 70736 KB Output is correct
123 Correct 143 ms 75576 KB Output is correct
124 Correct 135 ms 75348 KB Output is correct
125 Correct 151 ms 76112 KB Output is correct
126 Correct 382 ms 97104 KB Output is correct
127 Correct 216 ms 85548 KB Output is correct
128 Correct 189 ms 86792 KB Output is correct
129 Correct 168 ms 85544 KB Output is correct
130 Correct 176 ms 86316 KB Output is correct