oj.uz

답안 #890950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890950 2023-12-22T05:31:23 Z vjudge1 Jail (JOI22_jail) C++17
26 / 100
 5000 ms 8788 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
    return a > b && (a = b) == b;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
    return a < b && (a = b) == b;
}
const int inf = 1e9 + 7;
const int INF = 1e18 + 7;
const int mod = 998244353;

void Main() {
    int n;
    cin >> n;
    vector<int> g[n];
    bool bamboo = true;
    for (int i = 1; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        if (b != a + 1) {
            bamboo = false;
        }
        g[a].push_back(b);
        g[b].push_back(a);
    }
    if (bamboo) {
        vector<bool> used(n, false);
        bool flag = true;
        deque<pair<int, int>> l, r;
        int m;
        cin >> m;
        while (m--) {
            int s, t;
            cin >> s >> t;
            s--, t--;
            if (t > s) {
                r.push_back({t, s});
            } else {
                l.push_back({t, s});
            }
            used[s] = true;
        }
        sort(all(l)), sort(all(r));
        while (!l.empty()) {
            int s = l.front().second, t = l.front().first;
            l.pop_front();
            used[s] = false;
            while (s >= t) {
                if (used[s]) {
                    flag = false;
                    break;
                }
                s--;
            }
            used[t] = true;
        }
        while (!r.empty()) {
            int s = r.back().second, t = r.back().first;
            r.pop_back();
            used[s] = false;
            while (s <= t) {
                if (used[s]) {
                    flag = false;
                    break;
                }
                s++;
            }
            used[t] = true;
        }
        cout << (flag ? "Yes" : "No") << '\n';
    } else {
        int m;
        cin >> m;
        vector<vector<int>> path;
        vector<int> p(n, -1);
        vector<bool> vis(n);
        function<void(int, int)> dfs = [&](int v, int parent) {
            for (int to : g[v]) {
                if (to != parent) {
                    p[to] = v;
                    dfs(to, v);
                }
            }
        };
        while (m--) {
            int s, t;
            cin >> s >> t;
            s--, t--;
            vis[s] = true;
            dfs(s, -1);
            vector<int> cur;
            int x = t;
            while (x != -1) {
                cur.push_back(x);
                x = p[x];
            }
            reverse(all(cur));
            path.push_back(cur);
            fill(all(p), -1);
        }
        sort(all(path));
        bool flag = false;
        do {
            bool cur = true;
            auto used = vis;
            for (auto way : path) {
                used[way[0]] = false;
                for (int v : way) {
                    if (used[v]) {
                        cur = false;
                        break;
                    }
                }
                used[way.back()] = true;
            }
            flag |= cur;
        } while (next_permutation(all(path)));
        cout << (flag ? "Yes" : "No") << '\n';
    }
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int q;
    cin >> q;
    while (q--) {
        Main();
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 464 KB Output is correct
5 Correct 17 ms 456 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 348 KB Output is correct
9 Correct 25 ms 796 KB Output is correct
10 Correct 66 ms 6992 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 21 ms 348 KB Output is correct
13 Correct 36 ms 7764 KB Output is correct
14 Correct 38 ms 7844 KB Output is correct
15 Correct 35 ms 7760 KB Output is correct
16 Correct 50 ms 8788 KB Output is correct
17 Correct 2617 ms 8028 KB Output is correct
18 Correct 42 ms 8788 KB Output is correct
19 Correct 890 ms 8016 KB Output is correct
20 Correct 887 ms 8020 KB Output is correct
21 Correct 33 ms 7764 KB Output is correct
22 Correct 32 ms 7768 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 488 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 540 KB Output is correct
13 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 488 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 540 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 7 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 7 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 452 KB Output is correct
25 Correct 8 ms 500 KB Output is correct
26 Correct 4 ms 344 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 488 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 540 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 7 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 7 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 452 KB Output is correct
25 Correct 8 ms 500 KB Output is correct
26 Correct 4 ms 344 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Execution timed out 5084 ms 348 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 488 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 540 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 7 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 7 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 452 KB Output is correct
25 Correct 8 ms 500 KB Output is correct
26 Correct 4 ms 344 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Execution timed out 5084 ms 348 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 464 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Execution timed out 5077 ms 348 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 464 KB Output is correct
5 Correct 17 ms 456 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 348 KB Output is correct
9 Correct 25 ms 796 KB Output is correct
10 Correct 66 ms 6992 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 21 ms 348 KB Output is correct
13 Correct 36 ms 7764 KB Output is correct
14 Correct 38 ms 7844 KB Output is correct
15 Correct 35 ms 7760 KB Output is correct
16 Correct 50 ms 8788 KB Output is correct
17 Correct 2617 ms 8028 KB Output is correct
18 Correct 42 ms 8788 KB Output is correct
19 Correct 890 ms 8016 KB Output is correct
20 Correct 887 ms 8020 KB Output is correct
21 Correct 33 ms 7764 KB Output is correct
22 Correct 32 ms 7768 KB Output is correct
23 Correct 0 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 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 488 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 540 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 3 ms 348 KB Output is correct
40 Correct 7 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 7 ms 348 KB Output is correct
43 Correct 5 ms 348 KB Output is correct
44 Correct 6 ms 348 KB Output is correct
45 Correct 3 ms 348 KB Output is correct
46 Correct 3 ms 452 KB Output is correct
47 Correct 8 ms 500 KB Output is correct
48 Correct 4 ms 344 KB Output is correct
49 Correct 5 ms 348 KB Output is correct
50 Correct 4 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Execution timed out 5084 ms 348 KB Time limit exceeded
53 Halted 0 ms 0 KB -