oj.uz

답안 #1057104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057104 2024-08-13T14:10:30 Z Boas Jail (JOI22_jail) C++17
11 / 100
 694 ms 593252 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

template <typename T1, typename T2>
using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using indexed_set = indexed_map<T, null_type>;

#define loop(x, i) for (int i = 0; i < (x); i++)
#define loop1(x, i) for (int i = 1; i <= (x); i++)
#define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--)
#define itloop(x) for (auto it = begin(x); x != end(x); it++)
#define itrev(x) for (auto it = rbegin(x); x != rend(x); it++)
#define int long long
#define INF ((int64_t)(4e18 + 1))
#define INF32 ((int32_t)(2e9 + 1))
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define existsIn(x, l) (count(ALL(l), x) > 0)
#define removeIn(x, l) l.erase(find(ALL(l), x))
#define pb push_back
#define sz(x) (int)(x).size()
#define F first
#define S second
#define var const auto &
#define foreach(l) for (var e : l)

typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vii> vvii;
typedef vector<viii> vviii;
typedef set<int> si;
typedef set<ii> sii;
typedef set<iii> siii;
typedef vector<si> vsi;
typedef vector<sii> vsii;
typedef vector<vsi> vvsi;
typedef vector<string> vstr;
typedef vector<vector<string>> vvstr;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vi::iterator viit;
typedef si::iterator siit;
typedef int8_t in8;
typedef int16_t in16;
typedef int32_t in32;
typedef int64_t in64;

typedef vector<vsi> vvsi;

#define merge(a) insert(ALL(a))

void solve()
{
    int n, m;
    cin >> n;
    vvi adj(n);
    loop(n - 1, i)
    {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    cin >> m;
    // vi mIx(n);
    vvsi bedRooms(7, vsi(n));
    vvsi workRooms(7, vsi(n));
    vvi p(7, vi(n));
    vi s(m), t(m), d(n);
    loop(m, i)
    {
        cin >> s[i] >> t[i];
        s[i]--;
        t[i]--;
        // mIx[s[i]] = i;
        bedRooms[0][s[i]].insert(i);
        workRooms[0][t[i]].insert(i);
    }
    auto dfs = [&](auto &&self, int i, int prev) -> void
    {
        for (int j : adj[i])
        {
            if (j == prev)
                continue;
            d[j] = d[i] + 1;
            p[0][j] = i;
            self(self, j, i);
        }
    };
    dfs(dfs, 0, 0);
    loop1(6, x)
    {
        loop(n, i)
        {
            int half = p[x - 1][i];
            p[x][i] = p[x - 1][half];
            bedRooms[x][i] = bedRooms[x - 1][i];
            bedRooms[x][i].merge(bedRooms[x - 1][half]);
            workRooms[x][i] = workRooms[x - 1][i];
            workRooms[x][i].merge(workRooms[x - 1][half]);
        }
    }
    typedef tuple<int, si, si> isi;
    auto getParent = [&](int i, int k) -> isi
    {
        si bedrms;
        si workrms;
        loop(6, x)
        {
            if ((1 << x) & k)
            {
                bedrms.merge(bedRooms[x][i]);
                workrms.merge(workRooms[x][i]);
                i = p[x][i];
            }
        }
        // bedrms.merge(bedRooms[0][i];
        return {i, bedrms, workrms};
    };
    auto LCA = [&](int A, int b) -> isi
    {
        if (d[A] - d[b] < 0)
            swap(A, b);
        auto [a, bedrms, workrms] = getParent(A, d[A] - d[b]);
        if (a == b)
        {
            bedrms.merge(bedRooms[0][a]);
            workrms.merge(workRooms[0][a]);
            return {a, bedrms, workrms};
        }
        rev(6, x)
        {
            if (p[x][a] != p[x][b])
            {
                bedrms.merge(bedRooms[x][a]);
                bedrms.merge(bedRooms[x][b]);
                workrms.merge(workRooms[x][a]);
                workrms.merge(workRooms[x][b]);
                a = p[x][a];
                b = p[x][b];
            }
        }
        bedrms.merge(bedRooms[1][a]);   // voor de laatste erbij
        workrms.merge(workRooms[1][a]); // voor de laatste erbij
        bedrms.merge(bedRooms[0][b]);
        workrms.merge(workRooms[0][b]);
        return {p[0][a], bedrms, workrms};
    };
    int done = 0;
    vvi inPad(m);
    vi ervoor(m);
    loop(m, i)
    {
        auto [lca, bedrms, workrms] = LCA(s[i], t[i]);
        for (int j : bedrms)
        {
            if (j == i)
                continue;
            if (workrms.count(j))
            {
                cout << "No" << endl;
                return;
            }
            ervoor[i]++;
            inPad[j].pb(i);
        }
        for (int j : workrms)
        {
            if (j == i)
                continue;
            ervoor[j]++;
            inPad[i].pb(j);
        }
    }
    stack<int> q;
    loop(m, i)
    {
        if (ervoor[i] == 0)
            q.push(i);
    }
    while (!q.empty())
    {
        int i = q.top();
        q.pop();
        done++;
        for (int j : inPad[i])
        {
            ervoor[j]--;
            if (ervoor[j] == 0)
            {
                q.push(j);
            }
        }
    }
    if (done == m)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 26 ms 580 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

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 Incorrect 2 ms 604 KB Output isn't correct
4 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 Incorrect 2 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
11.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 344 KB Output is correct
5 Correct 38 ms 528 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 80 ms 776 KB Output is correct
14 Correct 66 ms 600 KB Output is correct
15 Correct 109 ms 604 KB Output is correct
16 Correct 115 ms 127076 KB Output is correct
17 Correct 302 ms 297808 KB Output is correct
18 Correct 694 ms 593252 KB Output is correct
19 Correct 104 ms 110168 KB Output is correct
20 Correct 91 ms 115168 KB Output is correct
21 Correct 97 ms 112512 KB Output is correct
22 Correct 319 ms 338004 KB Output is correct
23 Correct 304 ms 336936 KB Output is correct
24 Correct 436 ms 348756 KB Output is correct
25 Correct 348 ms 348240 KB Output is correct
26 Correct 423 ms 351568 KB Output is correct
27 Correct 328 ms 241740 KB Output is correct
28 Correct 324 ms 241864 KB Output is correct
29 Correct 310 ms 241868 KB Output is correct
30 Correct 202 ms 185140 KB Output is correct
31 Correct 215 ms 185276 KB Output is correct
32 Correct 205 ms 185212 KB Output is correct
33 Correct 236 ms 185296 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 26 ms 580 KB Output isn't correct
5 Halted 0 ms 0 KB -