oj.uz

Submission #955729

# Submission time Handle Problem Language Result Execution time Memory
955729 2024-03-31T11:21:58 Z aymanrs Jail (JOI22_jail) C++14
61 / 100
 1031 ms 1048576 KB 
#include<bits/stdc++.h>
using namespace std;
bool f; int T;
void dfs(int n, vector<int> g[], int p, bool path[]){
    path[n] = true;
    if(n == T){
        f = true;
        return;
    }
    for(int c : g[n]){
        if(f) break;
        if(c == p) continue;
        dfs(c, g, n, path);
    }
    if(!f) path[n] = false;
}
struct node {
    vector<node*> l;
    bool v = false, c = false;
};
bool ans;
void dfs(node* n){
    n->v = n->c = true;
    for(node* c : n->l){
        if(!ans) break;
        if(c->c){
            ans = false;
            break;
        }
        if(!c->v) dfs(c);
    }
    n->c = false;
}
void solve(){
    int n,m;cin >> n;
    vector<int> g[n+1];
    for(int i = 1;i < n;i++){
        int u, v;cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    cin >> m;
    bool path[m][n+1];
    int s[m], t[m];
    int o[m];for(int i = 0;i < m;i++) o[i] = i;
    for(int i = 0;i < m;i++){
        memset(path[i], 0, sizeof(path[i]));
        cin >> s[i] >> t[i];f = false;T = t[i];
        dfs(s[i], g, -1, path[i]);
    }
    node mg[m];
    for(int i = 0;i < m;i++){
        for(int j = i+1;j < m;j++){
            if(path[i][s[j]]) mg[i].l.push_back(&mg[j]);
            if(path[i][t[j]]) mg[j].l.push_back(&mg[i]);
            swap(i,j);
            if(path[i][s[j]]) mg[i].l.push_back(&mg[j]);
            if(path[i][t[j]]) mg[j].l.push_back(&mg[i]);
            swap(i,j);
        }
    }
    ans = true;
    for(int i = 0;i < m && ans;i++){
        if(!mg[i].v) dfs(&mg[i]);
    }
    if(ans)cout << "Yes\n";
    else cout << "No\n";
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t;cin >> t;
    while(t--) solve();
}

Compilation message

jail.cpp: In function 'void solve()':
jail.cpp:45:9: warning: variable 'o' set but not used [-Wunused-but-set-variable]
   45 |     int o[m];for(int i = 0;i < m;i++) o[i] = i;
      |         ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 8 ms 808 KB Output is correct
5 Correct 18 ms 1220 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 235 ms 7384 KB Output is correct
10 Correct 764 ms 78584 KB Output is correct
11 Correct 6 ms 600 KB Output is correct
12 Correct 55 ms 1592 KB Output is correct
13 Runtime error 757 ms 1048576 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 492 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 6 ms 672 KB Output is correct
30 Correct 2 ms 352 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 5 ms 604 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 348 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 6 ms 672 KB Output is correct
30 Correct 2 ms 352 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 5 ms 604 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 247 ms 7936 KB Output is correct
39 Correct 769 ms 79072 KB Output is correct
40 Correct 359 ms 6064 KB Output is correct
41 Correct 331 ms 4948 KB Output is correct
42 Correct 189 ms 5608 KB Output is correct
43 Correct 40 ms 2140 KB Output is correct
44 Correct 53 ms 1360 KB Output is correct
45 Correct 969 ms 67208 KB Output is correct
46 Correct 1031 ms 67212 KB Output is correct
47 Correct 481 ms 71760 KB Output is correct
48 Correct 485 ms 71864 KB Output is correct
49 Correct 685 ms 67416 KB Output is correct
50 Correct 655 ms 67460 KB Output is correct
51 Correct 197 ms 37040 KB Output is correct
52 Correct 204 ms 36996 KB Output is correct
53 Correct 42 ms 1892 KB Output is correct
54 Correct 880 ms 67156 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 30 ms 860 KB Output is correct
14 Correct 35 ms 1112 KB Output is correct
15 Correct 37 ms 1116 KB Output is correct
16 Runtime error 551 ms 1048576 KB Execution killed with signal 9
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 8 ms 808 KB Output is correct
5 Correct 18 ms 1220 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 235 ms 7384 KB Output is correct
10 Correct 764 ms 78584 KB Output is correct
11 Correct 6 ms 600 KB Output is correct
12 Correct 55 ms 1592 KB Output is correct
13 Runtime error 757 ms 1048576 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -