oj.uz

Submission #1000410

# Submission time Handle Problem Language Result Execution time Memory
1000410 2024-06-17T12:58:45 Z onbert Jail (JOI22_jail) C++17
72 / 100
 2326 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 120005, maxN = 480005, lgn = 17, INF = 1e18;
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;
 
void dfs1(int u) {
    sz[u] = 1;
    int f = -1;
    for (int v:ADJ[u]) {
        if (sz[v]) {
            f = v;
            continue;
        }
        dfs1(v);
        sz[u] += sz[v];
    }
    if (f!=-1) ADJ[u].erase(find(ADJ[u].begin(), ADJ[u].end(), f));
    // cout << u << endl;
    // for (int v:ADJ[u]) cout << v << " "; cout << endl;
    for (int j=1;j<ADJ[u].size();j++) if (sz[ADJ[u][j]] > sz[ADJ[u][0]]) swap(ADJ[u][0], ADJ[u][j]);
}
void dfs2(int u) {
    cnter++;
    newid[u] = cnter;
    for (int v:ADJ[u]) {
        d[cnter+1] = d[newid[u]] + 1;
        dfs2(v);
        fa[newid[v]] = newid[u];
    }
    lim[newid[u]] = cnter;
}
 
int S[maxn], T[maxn],  vis[maxn];
bool die = false;
vector<int> dep[maxn];
 
void dfs3(int u) {
    vis[u] = 1;
    for (int v:dep[u]) {
        if (!vis[v]) dfs3(v);
        else if (vis[v]==1) die = true;
    }
    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++) 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] = i;
        T[t] = i;
    }
    for (int i=1;i<=m;i++) dep[i].clear();
    for (int i=1;i<=m;i++) {
        int u = a[i].first, v = a[i].second;
        vector<int> path;
        while (u != v) {
            if (d[u] > d[v]) swap(u, v);
            path.push_back(v);
            v = fa[v];
        }
        path.push_back(u);
        for (int j:path) {
            if (S[j]!=-1) dep[i].push_back(S[j]);
            if (T[j]!=-1) dep[T[j]].push_back(i);
        }
    }
    for (int i=1;i<=m;i++) {
        sort(dep[i].begin(), dep[i].end());
        dep[i].erase(unique(dep[i].begin(), dep[i].end()), dep[i].end());
        dep[i].erase(find(dep[i].begin(), dep[i].end(), i));
        // for (int j:dep[i]) cout << j << " "; cout << endl;
    }
    for (int i=1;i<=m;i++) vis[i] = 0;
    die = false;
    for (int i=1;i<=m;i++) if (!vis[i]) dfs3(i);
    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();
}

Compilation message

jail.cpp: In function 'void dfs1(long long int)':
jail.cpp:24:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for (int j=1;j<ADJ[u].size();j++) if (sz[ADJ[u][j]] > sz[ADJ[u][0]]) swap(ADJ[u][0], ADJ[u][j]);
      |                  ~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18264 KB Output is correct
2 Correct 3 ms 18268 KB Output is correct
3 Correct 3 ms 18268 KB Output is correct
4 Correct 8 ms 18576 KB Output is correct
5 Correct 16 ms 19036 KB Output is correct
6 Correct 3 ms 18268 KB Output is correct
7 Correct 3 ms 18268 KB Output is correct
8 Correct 6 ms 18524 KB Output is correct
9 Correct 142 ms 24080 KB Output is correct
10 Correct 661 ms 37656 KB Output is correct
11 Correct 7 ms 18268 KB Output is correct
12 Correct 53 ms 19432 KB Output is correct
13 Correct 182 ms 93088 KB Output is correct
14 Correct 264 ms 121620 KB Output is correct
15 Runtime error 2326 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18520 KB Output is correct
2 Correct 3 ms 18524 KB Output is correct
3 Correct 4 ms 18268 KB Output is correct
4 Correct 4 ms 18268 KB Output is correct
5 Correct 4 ms 18268 KB Output is correct
6 Correct 3 ms 18360 KB Output is correct
7 Correct 3 ms 18268 KB Output is correct
8 Correct 4 ms 18308 KB Output is correct
9 Correct 3 ms 18268 KB Output is correct
10 Correct 4 ms 18268 KB Output is correct
11 Correct 3 ms 18268 KB Output is correct
12 Correct 3 ms 18268 KB Output is correct
13 Correct 3 ms 18312 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18520 KB Output is correct
2 Correct 3 ms 18524 KB Output is correct
3 Correct 4 ms 18268 KB Output is correct
4 Correct 4 ms 18268 KB Output is correct
5 Correct 4 ms 18268 KB Output is correct
6 Correct 3 ms 18360 KB Output is correct
7 Correct 3 ms 18268 KB Output is correct
8 Correct 4 ms 18308 KB Output is correct
9 Correct 3 ms 18268 KB Output is correct
10 Correct 4 ms 18268 KB Output is correct
11 Correct 3 ms 18268 KB Output is correct
12 Correct 3 ms 18268 KB Output is correct
13 Correct 3 ms 18312 KB Output is correct
14 Correct 3 ms 18268 KB Output is correct
15 Correct 3 ms 18268 KB Output is correct
16 Correct 3 ms 18268 KB Output is correct
17 Correct 3 ms 18268 KB Output is correct
18 Correct 4 ms 18260 KB Output is correct
19 Correct 3 ms 18268 KB Output is correct
20 Correct 3 ms 18268 KB Output is correct
21 Correct 4 ms 18372 KB Output is correct
22 Correct 4 ms 18264 KB Output is correct
23 Correct 2 ms 18304 KB Output is correct
24 Correct 3 ms 18264 KB Output is correct
25 Correct 4 ms 18268 KB Output is correct
26 Correct 3 ms 18268 KB Output is correct
27 Correct 4 ms 18268 KB Output is correct
28 Correct 3 ms 18268 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18520 KB Output is correct
2 Correct 3 ms 18524 KB Output is correct
3 Correct 4 ms 18268 KB Output is correct
4 Correct 4 ms 18268 KB Output is correct
5 Correct 4 ms 18268 KB Output is correct
6 Correct 3 ms 18360 KB Output is correct
7 Correct 3 ms 18268 KB Output is correct
8 Correct 4 ms 18308 KB Output is correct
9 Correct 3 ms 18268 KB Output is correct
10 Correct 4 ms 18268 KB Output is correct
11 Correct 3 ms 18268 KB Output is correct
12 Correct 3 ms 18268 KB Output is correct
13 Correct 3 ms 18312 KB Output is correct
14 Correct 3 ms 18268 KB Output is correct
15 Correct 3 ms 18268 KB Output is correct
16 Correct 3 ms 18268 KB Output is correct
17 Correct 3 ms 18268 KB Output is correct
18 Correct 4 ms 18260 KB Output is correct
19 Correct 3 ms 18268 KB Output is correct
20 Correct 3 ms 18268 KB Output is correct
21 Correct 4 ms 18372 KB Output is correct
22 Correct 4 ms 18264 KB Output is correct
23 Correct 2 ms 18304 KB Output is correct
24 Correct 3 ms 18264 KB Output is correct
25 Correct 4 ms 18268 KB Output is correct
26 Correct 3 ms 18268 KB Output is correct
27 Correct 4 ms 18268 KB Output is correct
28 Correct 3 ms 18268 KB Output is correct
29 Correct 5 ms 18524 KB Output is correct
30 Correct 5 ms 18264 KB Output is correct
31 Correct 5 ms 18268 KB Output is correct
32 Correct 4 ms 18268 KB Output is correct
33 Correct 4 ms 18264 KB Output is correct
34 Correct 4 ms 18264 KB Output is correct
35 Correct 6 ms 18268 KB Output is correct
36 Correct 4 ms 18268 KB Output is correct
37 Correct 3 ms 18268 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18520 KB Output is correct
2 Correct 3 ms 18524 KB Output is correct
3 Correct 4 ms 18268 KB Output is correct
4 Correct 4 ms 18268 KB Output is correct
5 Correct 4 ms 18268 KB Output is correct
6 Correct 3 ms 18360 KB Output is correct
7 Correct 3 ms 18268 KB Output is correct
8 Correct 4 ms 18308 KB Output is correct
9 Correct 3 ms 18268 KB Output is correct
10 Correct 4 ms 18268 KB Output is correct
11 Correct 3 ms 18268 KB Output is correct
12 Correct 3 ms 18268 KB Output is correct
13 Correct 3 ms 18312 KB Output is correct
14 Correct 3 ms 18268 KB Output is correct
15 Correct 3 ms 18268 KB Output is correct
16 Correct 3 ms 18268 KB Output is correct
17 Correct 3 ms 18268 KB Output is correct
18 Correct 4 ms 18260 KB Output is correct
19 Correct 3 ms 18268 KB Output is correct
20 Correct 3 ms 18268 KB Output is correct
21 Correct 4 ms 18372 KB Output is correct
22 Correct 4 ms 18264 KB Output is correct
23 Correct 2 ms 18304 KB Output is correct
24 Correct 3 ms 18264 KB Output is correct
25 Correct 4 ms 18268 KB Output is correct
26 Correct 3 ms 18268 KB Output is correct
27 Correct 4 ms 18268 KB Output is correct
28 Correct 3 ms 18268 KB Output is correct
29 Correct 5 ms 18524 KB Output is correct
30 Correct 5 ms 18264 KB Output is correct
31 Correct 5 ms 18268 KB Output is correct
32 Correct 4 ms 18268 KB Output is correct
33 Correct 4 ms 18264 KB Output is correct
34 Correct 4 ms 18264 KB Output is correct
35 Correct 6 ms 18268 KB Output is correct
36 Correct 4 ms 18268 KB Output is correct
37 Correct 3 ms 18268 KB Output is correct
38 Correct 147 ms 23536 KB Output is correct
39 Correct 684 ms 37164 KB Output is correct
40 Correct 70 ms 21588 KB Output is correct
41 Correct 24 ms 19292 KB Output is correct
42 Correct 60 ms 21892 KB Output is correct
43 Correct 22 ms 19544 KB Output is correct
44 Correct 11 ms 18776 KB Output is correct
45 Correct 34 ms 23660 KB Output is correct
46 Correct 40 ms 23656 KB Output is correct
47 Correct 117 ms 29308 KB Output is correct
48 Correct 122 ms 29340 KB Output is correct
49 Correct 38 ms 23892 KB Output is correct
50 Correct 33 ms 23892 KB Output is correct
51 Correct 27 ms 25180 KB Output is correct
52 Correct 27 ms 25180 KB Output is correct
53 Correct 9 ms 19008 KB Output is correct
54 Correct 37 ms 24156 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18268 KB Output is correct
2 Correct 3 ms 18288 KB Output is correct
3 Correct 3 ms 18268 KB Output is correct
4 Correct 3 ms 18268 KB Output is correct
5 Correct 7 ms 18264 KB Output is correct
6 Correct 3 ms 18268 KB Output is correct
7 Correct 3 ms 18268 KB Output is correct
8 Correct 3 ms 18300 KB Output is correct
9 Correct 3 ms 18268 KB Output is correct
10 Correct 3 ms 18268 KB Output is correct
11 Correct 3 ms 18264 KB Output is correct
12 Correct 4 ms 18268 KB Output is correct
13 Correct 20 ms 18840 KB Output is correct
14 Correct 23 ms 19036 KB Output is correct
15 Correct 22 ms 18660 KB Output is correct
16 Correct 40 ms 24492 KB Output is correct
17 Correct 106 ms 35976 KB Output is correct
18 Correct 294 ms 76168 KB Output is correct
19 Correct 41 ms 24400 KB Output is correct
20 Correct 47 ms 24660 KB Output is correct
21 Correct 47 ms 24652 KB Output is correct
22 Correct 89 ms 36652 KB Output is correct
23 Correct 72 ms 36168 KB Output is correct
24 Correct 83 ms 36556 KB Output is correct
25 Correct 91 ms 37060 KB Output is correct
26 Correct 89 ms 36928 KB Output is correct
27 Correct 77 ms 35376 KB Output is correct
28 Correct 77 ms 36784 KB Output is correct
29 Correct 89 ms 33836 KB Output is correct
30 Correct 56 ms 29132 KB Output is correct
31 Correct 56 ms 29640 KB Output is correct
32 Correct 67 ms 28616 KB Output is correct
33 Correct 74 ms 29184 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18264 KB Output is correct
2 Correct 3 ms 18268 KB Output is correct
3 Correct 3 ms 18268 KB Output is correct
4 Correct 8 ms 18576 KB Output is correct
5 Correct 16 ms 19036 KB Output is correct
6 Correct 3 ms 18268 KB Output is correct
7 Correct 3 ms 18268 KB Output is correct
8 Correct 6 ms 18524 KB Output is correct
9 Correct 142 ms 24080 KB Output is correct
10 Correct 661 ms 37656 KB Output is correct
11 Correct 7 ms 18268 KB Output is correct
12 Correct 53 ms 19432 KB Output is correct
13 Correct 182 ms 93088 KB Output is correct
14 Correct 264 ms 121620 KB Output is correct
15 Runtime error 2326 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -