oj.uz

답안 #575591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
575591 2022-06-11T06:06:54 Z InternetPerson10 Jail (JOI22_jail) C++17
21 / 100
 5000 ms 956 KB 
#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

vector<vector<int>> adj;
vector<bool> taken;
vector<vector<int>> paths;

bool dfs(int n, int tar) {
    taken[n] = true;
    if(n == tar) {
        paths.back().push_back(n);
        return true;
    }
    for(int ch : adj[n]) {
        if(taken[ch]) continue;
        if(dfs(ch, tar)) {
            paths.back().push_back(n);
            return true;
        }
    }
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        adj.resize(n);
        taken.resize(n);
        for(int i = 1; i < n; i++) {
            int x, y;
            cin >> x >> y;
            x--; y--;
            adj[x].push_back(y);
            adj[y].push_back(x);
        }
        int m;
        cin >> m;
        vector<int> perm(m);
        for(int i = 0; i < m; i++) {
            paths.push_back(vector<int>());
            int x, y;
            cin >> x >> y;
            dfs(x-1, y-1);
            for(int j = 0; j < n; j++) {
                taken[j] = false;
            }
            reverse(paths[i].begin(), paths[i].end());
            perm[i] = i;
        }
        bool ok = false;
        do {
            bool good = true;
            for(vector<int> v : paths) {
                taken[v[0]] = true;
            }
            for(int g : perm) {
                for(int i = 1; i < paths[g].size(); i++) {
                    good &= (!taken[paths[g][i]]);
                }
                taken[paths[g][0]] = false;
                taken[paths[g].back()] = true;
            }
            if(good) ok = true;
            for(int i = 0; i < n; i++) {
                taken[i] = false;
            }
        } while(next_permutation(perm.begin(), perm.end()));
        cout << (ok ? "Yes\n" : "No\n");
        adj.clear();
        paths.clear();
        taken.clear();
    }
}

Compilation message

jail.cpp: In function 'int main()':
jail.cpp:64:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |                 for(int i = 1; i < paths[g].size(); i++) {
      |                                ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 14 ms 592 KB Output is correct
5 Correct 29 ms 956 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 20 ms 392 KB Output is correct
8 Execution timed out 5048 ms 340 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 324 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 372 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 324 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 372 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 19 ms 400 KB Output is correct
17 Correct 5 ms 332 KB Output is correct
18 Correct 17 ms 468 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 16 ms 380 KB Output is correct
21 Correct 12 ms 340 KB Output is correct
22 Correct 15 ms 388 KB Output is correct
23 Correct 5 ms 212 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 18 ms 340 KB Output is correct
26 Correct 6 ms 324 KB Output is correct
27 Correct 13 ms 372 KB Output is correct
28 Correct 5 ms 212 KB Output is correct

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 324 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 372 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 19 ms 400 KB Output is correct
17 Correct 5 ms 332 KB Output is correct
18 Correct 17 ms 468 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 16 ms 380 KB Output is correct
21 Correct 12 ms 340 KB Output is correct
22 Correct 15 ms 388 KB Output is correct
23 Correct 5 ms 212 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 18 ms 340 KB Output is correct
26 Correct 6 ms 324 KB Output is correct
27 Correct 13 ms 372 KB Output is correct
28 Correct 5 ms 212 KB Output is correct
29 Execution timed out 5059 ms 340 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 324 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 372 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 19 ms 400 KB Output is correct
17 Correct 5 ms 332 KB Output is correct
18 Correct 17 ms 468 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 16 ms 380 KB Output is correct
21 Correct 12 ms 340 KB Output is correct
22 Correct 15 ms 388 KB Output is correct
23 Correct 5 ms 212 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 18 ms 340 KB Output is correct
26 Correct 6 ms 324 KB Output is correct
27 Correct 13 ms 372 KB Output is correct
28 Correct 5 ms 212 KB Output is correct
29 Execution timed out 5059 ms 340 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Execution timed out 5068 ms 416 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 14 ms 592 KB Output is correct
5 Correct 29 ms 956 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 20 ms 392 KB Output is correct
8 Execution timed out 5048 ms 340 KB Time limit exceeded
9 Halted 0 ms 0 KB -