Submission #1244000

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244000		fskarica	Jail (JOI22_jail)	C++20	0 / 100	4 ms	4940 KiB

jail

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
#define pii pair<int, int>

const int MAX = 2e5 + 10;
int n, m;
int x, y;
vector <int> veze[MAX];
vector <pii> prisoner;
int bio[MAX];

void input() {
    cin >> n;

    for (int i = 0; i <= n; i++) {
        bio[i] = 0;
        veze[i].clear();
    }

    for (int i = 0; i < n - 1; i++) {
        cin >> x >> y;

        veze[x].push_back(y);
        veze[y].push_back(x);
    }

    cin >> m;
    prisoner.clear();
    for (int i = 0; i < m; i++) {
        cin >> x >> y;

        prisoner.push_back({x, y});
    }
}

void solve() {
    input();

    bool sol = true;
    for (auto e : prisoner) {
        for (int i = e.fi; i <= e.se; i++) {
            if (bio[i]) {
                sol = false;
                break;
            }

            bio[i] = 1;
        }
    }

    if (sol) cout << "YES\n";
    else cout << "NO\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 16
• Subtask 4: 0 / 28
• Subtask 5: 0 / 12
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23