oj.uz

Submission #955710

# Submission time Handle Problem Language Result Execution time Memory
955710 2024-03-31T11:00:22 Z aymanrs Jail (JOI22_jail) C++14
5 / 100
 5000 ms 250680 KB 
#include<bits/stdc++.h>
using namespace std;
bool f; int t;
void dfs(int n, vector<int> g[], int p, vector<int>& path){
    path.push_back(n);
    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.pop_back();
}
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;
    vector<int> path[m];
    int o[m];for(int i = 0;i < m;i++) o[i] = i;
    for(int i = 0;i < m;i++){
        int s;cin >> s >> t;f = false;
        dfs(s, g, -1, path[i]);
    }
    for(int i = 0;i < m;i++){
        for(int j = i+1;j < m;j++){
            f = !count(path[i].begin(), path[i].end(), path[j][0]) && !count(path[j].begin(), path[j].end(), path[i].back());
            if(!f) {
                swap(i,j);
                f = !count(path[i].begin(), path[i].end(), path[j][0]) && !count(path[j].begin(), path[j].end(), path[i].back());
                swap(i,j);
            }
            if(!f){
                cout << "No\n";
                return;
            }
        }
    }
    cout << "Yes\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:27:9: warning: variable 'o' set but not used [-Wunused-but-set-variable]
   27 |     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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 9 ms 704 KB Output is correct
5 Correct 18 ms 988 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 1528 ms 15600 KB Output is correct
10 Execution timed out 5038 ms 250680 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #2
5.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 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 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 348 KB Output is correct

Subtask #3
0 / 16.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 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 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 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 28.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 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 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 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 12.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 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 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 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 9 ms 704 KB Output is correct
5 Correct 18 ms 988 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 1528 ms 15600 KB Output is correct
10 Execution timed out 5038 ms 250680 KB Time limit exceeded
11 Halted 0 ms 0 KB -