oj.uz

답안 #1000550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000550 2024-06-17T17:22:19 Z onbert Jail (JOI22_jail) C++17
21 / 100
 5000 ms 152516 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 120005, maxN = 480005, lgn = 17, INF = 1e6;
int n, m;
vector<int> ADJ[maxn], adj[maxn];
pair<int,int> a[maxn];
int sz[maxn], fa[maxn], d[maxn], newid[maxn], lim[maxn], cnter = 0;

bool cmp(int &x, int &y) {
    return sz[x] > sz[y];
}

void dfs1(int u) {
    sz[u] = 1;
    for (int v:ADJ[u]) {
        ADJ[v].erase(find(ADJ[v].begin(), ADJ[v].end(), u));
        dfs1(v);
        sz[u] += sz[v];
    }
    sort(ADJ[u].begin(), ADJ[u].end(), cmp);
}
void dfs2(int u) {
    cnter++;
    newid[u] = cnter;
    for (int v:ADJ[u]) {
        d[cnter+1] = d[newid[u]] + 1;
        fa[cnter+1] = newid[u];
        dfs2(v);
    }
    lim[newid[u]] = cnter;
}

int skip[maxn];
void dfs3(int u) {
    for (int v:adj[u]) {
        if (v == adj[u][0]) skip[v] = skip[u];
        else skip[v] = v;
        dfs3(v);
    }
}

vector<pair<int,int>> path;
void PATH(int u, int v) {
    path.clear();
    if (d[u] > d[v]) swap(u, v);
    path = {{skip[u], u}};
    u = skip[u];
    while (u>v || v>lim[u]) {
        u = fa[u];
        path.push_back({skip[u], u});
        u = skip[u];
    }
    auto [l, r] = path.back();
    while (l<r) {
        int mid = (l+r+1)/2;
        if (mid<=v && v<=lim[mid]) l = mid;
        else r = mid-1;
    }
    path.back().first = u = l;

    path.push_back({skip[v], v});
    v = skip[v];
    while (d[fa[v]] > d[u]) {
        v = fa[v];
        path.push_back({skip[v], v});
        v = skip[v];
    }
    path.back().first += d[u] - d[v] + 1;
}

set<int> seg[maxN];
void build(int id, int l, int r) {
    seg[id].clear();
    if (l==r) return;
    int mid = (l+r)/2;
    build(id*2, l, mid); build(id*2+1, mid+1, r);
}
void update(int id, int l, int r, int &findl, int &findr, int &val, bool addd) {
    if (r<findl || findr<l) return;
    if (findl<=l && r<=findr) {
        if (addd) seg[id].insert(val);
        else seg[id].erase(val);
        return;
    }
    int mid = (l+r)/2;
    update(id*2, l, mid, findl, findr, val, addd);
    update(id*2+1, mid+1, r, findl, findr, val, addd);
}
vector<int> nxt;
void qry(int id, int l, int r, int &target) {
    if (r<target || target<l) return;
    for (int i:seg[id]) nxt.push_back(i);
    if (l==r) return;
    int mid = (l+r)/2;
    qry(id*2, l, mid, target); qry(id*2+1, mid+1, r, target);
}

int S[maxn], T[maxn], vis[maxn];
bool die = false;
set<int> exist;

void dfs4(int &u) {
    int s = a[u].first, t = a[u].second;
    vis[u] = 1;
    PATH(s, t);
    for (auto [L, R]:path) {
        int cur = L-1;
        while (exist.size() > 1) {
            cur = *exist.upper_bound(cur);
            if (cur > R) break;
            if (cur==s) continue;
            int v = S[cur];
            // cout << u << " " << v << endl;
            if (!vis[v]) dfs4(v);
            else if (vis[v]==1) die = true;
            if (die) return;
        }
    }
    nxt.clear();
    qry(1, 1, n, t);
    for (int v:nxt) if (v!=u) {
        // cout << u << " " << v << endl;
        if (!vis[v]) dfs4(v);
        else if (vis[v]==1) die = true;
        if (die) return;
    }
    for (auto [L, R]:path) update(1, 1, n, L, R, u, 0);
    exist.erase(s);
    vis[u] = 2;
}

void solve() {
    cin >> n;
    for (int i=1;i<=n;i++) sz[i] = 0, adj[i].clear(), ADJ[i].clear();
    cnter = 0;
    for (int i=1;i<=n-1;i++) {
        int u, v;
        cin >> u >> v;
        ADJ[u].push_back(v);
        ADJ[v].push_back(u);
    }
    fa[1] = 0, d[1] = 0;
    dfs1(1); dfs2(1);
    for (int i=1;i<=n;i++) for (int j:ADJ[i]) adj[newid[i]].push_back(newid[j]);
    skip[1] = 1;
    dfs3(1);
    // PATH(2, 6);
    // for (auto [L, R]:path) cout << L << " " << R << endl;
    // return;
    exist = {INF};
    build(1, 1, n);
    for (int i=1;i<=n;i++) S[i] = -1, T[i] = -1;
    cin >> m;
    for (int i=1;i<=m;i++) {
        int s, t;
        cin >> s >> t;
        s = newid[s], t = newid[t];
        a[i] = {s, t};
        S[s] = T[t] = i;
        exist.insert(s);
        PATH(s, t);
        for (auto [L, R]:path) update(1, 1, n, L, R, i, 1);
    }
    for (int i=1;i<=m;i++) vis[i] = 0;
    die = false;
    for (int i=1;i<=m;i++) if (!vis[i]) {
        dfs4(i);
        if (die) break;
    }
    if (die) cout << "No\n";
    else cout << "Yes\n";
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t;
    cin >> t;
    while (t--) solve();
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 28504 KB Output is correct
2 Correct 13 ms 28644 KB Output is correct
3 Correct 19 ms 28508 KB Output is correct
4 Correct 19 ms 29020 KB Output is correct
5 Correct 28 ms 29276 KB Output is correct
6 Correct 19 ms 28764 KB Output is correct
7 Correct 12 ms 28760 KB Output is correct
8 Correct 13 ms 28760 KB Output is correct
9 Correct 44 ms 31460 KB Output is correct
10 Correct 60 ms 54884 KB Output is correct
11 Correct 23 ms 28760 KB Output is correct
12 Correct 66 ms 29524 KB Output is correct
13 Correct 172 ms 75604 KB Output is correct
14 Correct 137 ms 76116 KB Output is correct
15 Correct 417 ms 95316 KB Output is correct
16 Correct 1159 ms 152516 KB Output is correct
17 Execution timed out 5087 ms 106484 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28508 KB Output is correct
2 Correct 14 ms 28508 KB Output is correct
3 Correct 15 ms 28760 KB Output is correct
4 Correct 18 ms 28508 KB Output is correct
5 Correct 12 ms 28764 KB Output is correct
6 Correct 13 ms 28676 KB Output is correct
7 Correct 14 ms 28764 KB Output is correct
8 Correct 13 ms 28504 KB Output is correct
9 Correct 18 ms 28764 KB Output is correct
10 Correct 18 ms 28504 KB Output is correct
11 Correct 16 ms 28508 KB Output is correct
12 Correct 12 ms 28508 KB Output is correct
13 Correct 16 ms 28508 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28508 KB Output is correct
2 Correct 14 ms 28508 KB Output is correct
3 Correct 15 ms 28760 KB Output is correct
4 Correct 18 ms 28508 KB Output is correct
5 Correct 12 ms 28764 KB Output is correct
6 Correct 13 ms 28676 KB Output is correct
7 Correct 14 ms 28764 KB Output is correct
8 Correct 13 ms 28504 KB Output is correct
9 Correct 18 ms 28764 KB Output is correct
10 Correct 18 ms 28504 KB Output is correct
11 Correct 16 ms 28508 KB Output is correct
12 Correct 12 ms 28508 KB Output is correct
13 Correct 16 ms 28508 KB Output is correct
14 Correct 12 ms 28760 KB Output is correct
15 Correct 12 ms 28508 KB Output is correct
16 Correct 12 ms 28784 KB Output is correct
17 Correct 15 ms 28508 KB Output is correct
18 Correct 13 ms 28764 KB Output is correct
19 Correct 15 ms 28648 KB Output is correct
20 Correct 11 ms 28764 KB Output is correct
21 Correct 14 ms 28768 KB Output is correct
22 Correct 13 ms 28760 KB Output is correct
23 Correct 12 ms 28680 KB Output is correct
24 Correct 12 ms 28508 KB Output is correct
25 Correct 18 ms 28764 KB Output is correct
26 Correct 16 ms 28504 KB Output is correct
27 Correct 17 ms 28764 KB Output is correct
28 Correct 13 ms 28460 KB Output is correct

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28508 KB Output is correct
2 Correct 14 ms 28508 KB Output is correct
3 Correct 15 ms 28760 KB Output is correct
4 Correct 18 ms 28508 KB Output is correct
5 Correct 12 ms 28764 KB Output is correct
6 Correct 13 ms 28676 KB Output is correct
7 Correct 14 ms 28764 KB Output is correct
8 Correct 13 ms 28504 KB Output is correct
9 Correct 18 ms 28764 KB Output is correct
10 Correct 18 ms 28504 KB Output is correct
11 Correct 16 ms 28508 KB Output is correct
12 Correct 12 ms 28508 KB Output is correct
13 Correct 16 ms 28508 KB Output is correct
14 Correct 12 ms 28760 KB Output is correct
15 Correct 12 ms 28508 KB Output is correct
16 Correct 12 ms 28784 KB Output is correct
17 Correct 15 ms 28508 KB Output is correct
18 Correct 13 ms 28764 KB Output is correct
19 Correct 15 ms 28648 KB Output is correct
20 Correct 11 ms 28764 KB Output is correct
21 Correct 14 ms 28768 KB Output is correct
22 Correct 13 ms 28760 KB Output is correct
23 Correct 12 ms 28680 KB Output is correct
24 Correct 12 ms 28508 KB Output is correct
25 Correct 18 ms 28764 KB Output is correct
26 Correct 16 ms 28504 KB Output is correct
27 Correct 17 ms 28764 KB Output is correct
28 Correct 13 ms 28460 KB Output is correct
29 Correct 14 ms 28764 KB Output is correct
30 Correct 18 ms 28764 KB Output is correct
31 Correct 14 ms 28680 KB Output is correct
32 Correct 14 ms 28764 KB Output is correct
33 Correct 13 ms 28764 KB Output is correct
34 Correct 17 ms 28876 KB Output is correct
35 Correct 15 ms 28764 KB Output is correct
36 Correct 13 ms 28764 KB Output is correct
37 Runtime error 31 ms 57804 KB Execution killed with signal 11
38 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 28508 KB Output is correct
2 Correct 14 ms 28508 KB Output is correct
3 Correct 15 ms 28760 KB Output is correct
4 Correct 18 ms 28508 KB Output is correct
5 Correct 12 ms 28764 KB Output is correct
6 Correct 13 ms 28676 KB Output is correct
7 Correct 14 ms 28764 KB Output is correct
8 Correct 13 ms 28504 KB Output is correct
9 Correct 18 ms 28764 KB Output is correct
10 Correct 18 ms 28504 KB Output is correct
11 Correct 16 ms 28508 KB Output is correct
12 Correct 12 ms 28508 KB Output is correct
13 Correct 16 ms 28508 KB Output is correct
14 Correct 12 ms 28760 KB Output is correct
15 Correct 12 ms 28508 KB Output is correct
16 Correct 12 ms 28784 KB Output is correct
17 Correct 15 ms 28508 KB Output is correct
18 Correct 13 ms 28764 KB Output is correct
19 Correct 15 ms 28648 KB Output is correct
20 Correct 11 ms 28764 KB Output is correct
21 Correct 14 ms 28768 KB Output is correct
22 Correct 13 ms 28760 KB Output is correct
23 Correct 12 ms 28680 KB Output is correct
24 Correct 12 ms 28508 KB Output is correct
25 Correct 18 ms 28764 KB Output is correct
26 Correct 16 ms 28504 KB Output is correct
27 Correct 17 ms 28764 KB Output is correct
28 Correct 13 ms 28460 KB Output is correct
29 Correct 14 ms 28764 KB Output is correct
30 Correct 18 ms 28764 KB Output is correct
31 Correct 14 ms 28680 KB Output is correct
32 Correct 14 ms 28764 KB Output is correct
33 Correct 13 ms 28764 KB Output is correct
34 Correct 17 ms 28876 KB Output is correct
35 Correct 15 ms 28764 KB Output is correct
36 Correct 13 ms 28764 KB Output is correct
37 Runtime error 31 ms 57804 KB Execution killed with signal 11
38 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 28504 KB Output is correct
2 Correct 12 ms 28496 KB Output is correct
3 Correct 14 ms 28684 KB Output is correct
4 Correct 13 ms 28540 KB Output is correct
5 Correct 20 ms 28764 KB Output is correct
6 Correct 15 ms 28504 KB Output is correct
7 Correct 14 ms 28508 KB Output is correct
8 Correct 12 ms 28640 KB Output is correct
9 Correct 11 ms 28508 KB Output is correct
10 Correct 17 ms 28704 KB Output is correct
11 Correct 11 ms 28708 KB Output is correct
12 Correct 16 ms 28764 KB Output is correct
13 Incorrect 43 ms 29092 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 28504 KB Output is correct
2 Correct 13 ms 28644 KB Output is correct
3 Correct 19 ms 28508 KB Output is correct
4 Correct 19 ms 29020 KB Output is correct
5 Correct 28 ms 29276 KB Output is correct
6 Correct 19 ms 28764 KB Output is correct
7 Correct 12 ms 28760 KB Output is correct
8 Correct 13 ms 28760 KB Output is correct
9 Correct 44 ms 31460 KB Output is correct
10 Correct 60 ms 54884 KB Output is correct
11 Correct 23 ms 28760 KB Output is correct
12 Correct 66 ms 29524 KB Output is correct
13 Correct 172 ms 75604 KB Output is correct
14 Correct 137 ms 76116 KB Output is correct
15 Correct 417 ms 95316 KB Output is correct
16 Correct 1159 ms 152516 KB Output is correct
17 Execution timed out 5087 ms 106484 KB Time limit exceeded
18 Halted 0 ms 0 KB -