oj.uz

답안 #1000220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000220 2024-06-17T06:34:50 Z onbert Jail (JOI22_jail) C++17
49 / 100
 5000 ms 27228 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 120005, maxN = 480005, lgn = 17, INF = 1e18;
int n, m;
vector<int> ADJ[maxn], adj[maxn];
pair<int,int> a[maxn];
int sz[maxn], fa[maxn], d[maxn], newid[maxn], lim[maxn], cnter = 0;

void dfs1(int u) {
    sz[u] = 1;
    int f = -1;
    for (int v:ADJ[u]) {
        if (sz[v]) {
            f = v;
            continue;
        }
        dfs1(v);
        sz[u] += sz[v];
    }
    if (f!=-1) ADJ[u].erase(find(ADJ[u].begin(), ADJ[u].end(), f));
    // cout << u << endl;
    // for (int v:ADJ[u]) cout << v << " "; cout << endl;
    for (int j=1;j<ADJ[u].size();j++) if (sz[ADJ[u][j]] > sz[ADJ[u][0]]) swap(ADJ[u][0], ADJ[u][j]);
}
void dfs2(int u) {
    cnter++;
    newid[u] = cnter;
    for (int v:ADJ[u]) {
        d[cnter+1] = d[newid[u]] + 1;
        dfs2(v);
        fa[newid[v]] = newid[u];
    }
    lim[newid[u]] = cnter;
}

void solve() {
    cin >> n;
    for (int i=1;i<=n;i++) sz[i] = 0, adj[i].clear(), ADJ[i].clear();
    cnter = 0;
    for (int i=1;i<=n-1;i++) {
        int u, v;
        cin >> u >> v;
        ADJ[u].push_back(v);
        ADJ[v].push_back(u);
    }
    fa[1] = 0, d[1] = 0;
    dfs1(1); dfs2(1);
    bool guy[n+1];
    for (int i=1;i<=n;i++) guy[i] = 0;
    for (int i=1;i<=n;i++) a[i] = {-1, -1};
    cin >> m;
    for (int i=1;i<=m;i++) {
        int s, t;
        cin >> s >> t;
        s = newid[s], t = newid[t];
        a[t] = {s, t};
        guy[s] = true;
    }
    // for (int i=1;i<=n;i++) cout << newid[i] << " "; cout << endl;
    // for (int i=1;i<=n;i++) cout << d[i] << " "; cout << endl;
    bool yes[n+1], no[n+1];
    for (int cnt = 0; cnt < m; cnt++) {
        for (int i=1;i<=n;i++) yes[i] = (a[i].first!=-1), no[i] = 0;
        for (int i=1;i<=n;i++) {
            if (a[i].first==-1) continue;
            auto [u, v] = a[i];
            auto [s, t] = a[i];
            yes[i] = !guy[t];
            no[s] = true;
            // cout << i << " " << a[i].first << " " << a[i].second << endl;
            while (u!=v) {
                if (d[u] > d[v]) swap(u, v);
                v = fa[v];
                // cout << u << " " << v << endl;
                if (v != t) no[v] = true;
                if (v != s) yes[i] &= (!guy[v]);
            }
        }
        bool ok = false;
        for (int i=1;i<=n;i++) if (yes[i] && !no[i]) {
            // cout << a[i].first << " " << a[i].second << endl;
            guy[i] = true;
            guy[a[i].first] = false;
            a[i] = {-1, -1};
            ok = true;
            break;
        }
        if (!ok) {cout << "No\n"; return;}
    }
    cout << "Yes\n";
}

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

Compilation message

jail.cpp: In function 'void dfs1(long long int)':
jail.cpp:24:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for (int j=1;j<ADJ[u].size();j++) if (sz[ADJ[u][j]] > sz[ADJ[u][0]]) swap(ADJ[u][0], ADJ[u][j]);
      |                  ~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 8 ms 6484 KB Output is correct
5 Correct 14 ms 6872 KB Output is correct
6 Correct 3 ms 5980 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 6 ms 5976 KB Output is correct
9 Correct 2116 ms 8112 KB Output is correct
10 Execution timed out 5066 ms 26996 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5980 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 4 ms 5980 KB Output is correct
4 Correct 5 ms 5980 KB Output is correct
5 Correct 3 ms 5980 KB Output is correct
6 Correct 3 ms 5980 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5976 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 3 ms 5976 KB Output is correct
11 Correct 3 ms 5976 KB Output is correct
12 Correct 3 ms 5976 KB Output is correct
13 Correct 3 ms 5976 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5980 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 4 ms 5980 KB Output is correct
4 Correct 5 ms 5980 KB Output is correct
5 Correct 3 ms 5980 KB Output is correct
6 Correct 3 ms 5980 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5976 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 3 ms 5976 KB Output is correct
11 Correct 3 ms 5976 KB Output is correct
12 Correct 3 ms 5976 KB Output is correct
13 Correct 3 ms 5976 KB Output is correct
14 Correct 3 ms 5976 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 3 ms 6204 KB Output is correct
17 Correct 3 ms 6196 KB Output is correct
18 Correct 4 ms 5976 KB Output is correct
19 Correct 3 ms 5976 KB Output is correct
20 Correct 3 ms 5980 KB Output is correct
21 Correct 3 ms 5976 KB Output is correct
22 Correct 3 ms 5980 KB Output is correct
23 Correct 2 ms 5980 KB Output is correct
24 Correct 3 ms 5980 KB Output is correct
25 Correct 3 ms 5980 KB Output is correct
26 Correct 2 ms 6000 KB Output is correct
27 Correct 3 ms 5976 KB Output is correct
28 Correct 3 ms 5980 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5980 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 4 ms 5980 KB Output is correct
4 Correct 5 ms 5980 KB Output is correct
5 Correct 3 ms 5980 KB Output is correct
6 Correct 3 ms 5980 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5976 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 3 ms 5976 KB Output is correct
11 Correct 3 ms 5976 KB Output is correct
12 Correct 3 ms 5976 KB Output is correct
13 Correct 3 ms 5976 KB Output is correct
14 Correct 3 ms 5976 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 3 ms 6204 KB Output is correct
17 Correct 3 ms 6196 KB Output is correct
18 Correct 4 ms 5976 KB Output is correct
19 Correct 3 ms 5976 KB Output is correct
20 Correct 3 ms 5980 KB Output is correct
21 Correct 3 ms 5976 KB Output is correct
22 Correct 3 ms 5980 KB Output is correct
23 Correct 2 ms 5980 KB Output is correct
24 Correct 3 ms 5980 KB Output is correct
25 Correct 3 ms 5980 KB Output is correct
26 Correct 2 ms 6000 KB Output is correct
27 Correct 3 ms 5976 KB Output is correct
28 Correct 3 ms 5980 KB Output is correct
29 Correct 8 ms 5976 KB Output is correct
30 Correct 3 ms 5980 KB Output is correct
31 Correct 3 ms 6100 KB Output is correct
32 Correct 7 ms 6236 KB Output is correct
33 Correct 4 ms 5980 KB Output is correct
34 Correct 6 ms 5980 KB Output is correct
35 Correct 7 ms 5980 KB Output is correct
36 Correct 3 ms 5980 KB Output is correct
37 Correct 4 ms 5980 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5980 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 4 ms 5980 KB Output is correct
4 Correct 5 ms 5980 KB Output is correct
5 Correct 3 ms 5980 KB Output is correct
6 Correct 3 ms 5980 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5976 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 3 ms 5976 KB Output is correct
11 Correct 3 ms 5976 KB Output is correct
12 Correct 3 ms 5976 KB Output is correct
13 Correct 3 ms 5976 KB Output is correct
14 Correct 3 ms 5976 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 3 ms 6204 KB Output is correct
17 Correct 3 ms 6196 KB Output is correct
18 Correct 4 ms 5976 KB Output is correct
19 Correct 3 ms 5976 KB Output is correct
20 Correct 3 ms 5980 KB Output is correct
21 Correct 3 ms 5976 KB Output is correct
22 Correct 3 ms 5980 KB Output is correct
23 Correct 2 ms 5980 KB Output is correct
24 Correct 3 ms 5980 KB Output is correct
25 Correct 3 ms 5980 KB Output is correct
26 Correct 2 ms 6000 KB Output is correct
27 Correct 3 ms 5976 KB Output is correct
28 Correct 3 ms 5980 KB Output is correct
29 Correct 8 ms 5976 KB Output is correct
30 Correct 3 ms 5980 KB Output is correct
31 Correct 3 ms 6100 KB Output is correct
32 Correct 7 ms 6236 KB Output is correct
33 Correct 4 ms 5980 KB Output is correct
34 Correct 6 ms 5980 KB Output is correct
35 Correct 7 ms 5980 KB Output is correct
36 Correct 3 ms 5980 KB Output is correct
37 Correct 4 ms 5980 KB Output is correct
38 Correct 2083 ms 8476 KB Output is correct
39 Execution timed out 5047 ms 27228 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 5 ms 6068 KB Output is correct
6 Correct 3 ms 5980 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 2 ms 5980 KB Output is correct
9 Correct 2 ms 5976 KB Output is correct
10 Correct 2 ms 5980 KB Output is correct
11 Correct 2 ms 5964 KB Output is correct
12 Correct 4 ms 5980 KB Output is correct
13 Correct 13 ms 6632 KB Output is correct
14 Correct 28 ms 7004 KB Output is correct
15 Correct 24 ms 6748 KB Output is correct
16 Execution timed out 5078 ms 19028 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 8 ms 6484 KB Output is correct
5 Correct 14 ms 6872 KB Output is correct
6 Correct 3 ms 5980 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 6 ms 5976 KB Output is correct
9 Correct 2116 ms 8112 KB Output is correct
10 Execution timed out 5066 ms 26996 KB Time limit exceeded
11 Halted 0 ms 0 KB -