oj.uz

Submission #933660

# Submission time Handle Problem Language Result Execution time Memory
933660 2024-02-26T04:16:28 Z NeroZein Jail (JOI22_jail) C++17
49 / 100
 5000 ms 28252 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif

const int LOG = 18;
const int N = 120005;

bool tv[N];
int cnt[N]; 
int dep[N];
bool busy[N];
int s[N], t[N];
int up[LOG][N];
vector<int> g[N];

void dfs(int v, int p) {
  for (int u : g[v]) {
    if (u == p) continue;
    up[0][u] = v;
    for (int j = 1; j < LOG; ++j) {
      up[j][u] = up[j - 1][up[j - 1][u]];
    }
    dep[u] = dep[v] + 1;
    dfs(u, v);
  }
}

int lca(int u, int v) {
  if (dep[u] < dep[v]) swap(u, v);
  for (int j = 0; j < LOG; ++j) {
    if ((dep[u] - dep[v]) >> j & 1) {
      u = up[j][u];
    }
  }
  if (u == v) return v;
  for (int j = LOG - 1; j >= 0; --j) {
    if (up[j][u] != up[j][v]) {
      u = up[j][u]; v = up[j][v];
    }
  }
  return up[0][v];
}

void mark(int u, int v, int w) {
  vector<int> tmp;
  int lc = lca(u, v);
  while (true) {
    tmp.push_back(u);
    tv[u] = true;
    cnt[u] += w;
    if (u == lc) break;
    u = up[0][u];
  }
  while (!tv[v]) {
    cnt[v] += w;
    v = up[0][v];
  }
  for (int i : tmp) tv[i] = false; 
}

bool check(int u, int v) {
  bool ok = cnt[v] == 1; 
  int lc = lca(u, v);
  while (u != lc) {
    u = up[0][u];
    ok &= !busy[u];
  }
  while (v != lc) {
    ok &= !busy[v]; 
    v = up[0][v];
  }
  return ok;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    for(int i = 0; i < n - 1; ++i) {
      int u, v;
      cin >> u >> v;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    dfs(1, 0);
    int m;
    cin >> m;
    for (int i = 0; i < m; ++i) {
      cin >> s[i] >> t[i];
      mark(s[i], t[i], 1);
      busy[s[i]] = true; 
    }
    bool ok = true; 
    for (int rep = 0; rep < m; ++rep) {
      bool f = false; 
      for (int i = 0; i < m; ++i) {
        if (!busy[s[i]]) continue; 
        if (check(s[i], t[i])) {
          f = true;
          busy[s[i]] = false; 
          mark(s[i], t[i], -1);
          break; 
        }
      }
      if (!f) {
        ok = false;
        break;
      }
    }
    for (int i = 1; i <= n; ++i) {
      g[i].clear();
      cnt[i] = 0; 
      busy[i] = false; 
    }
    cout << (ok ? "Yes" : "No") << '\n';
  }
  return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 9 ms 13144 KB Output is correct
5 Correct 19 ms 13716 KB Output is correct
6 Correct 3 ms 13016 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 5 ms 12892 KB Output is correct
9 Correct 1471 ms 14904 KB Output is correct
10 Execution timed out 5039 ms 28240 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12952 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 13008 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12952 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 13008 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 2 ms 12892 KB Output is correct
24 Correct 2 ms 12892 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12944 KB Output is correct
27 Correct 3 ms 12984 KB Output is correct
28 Correct 3 ms 12888 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12952 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 13008 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 2 ms 12892 KB Output is correct
24 Correct 2 ms 12892 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12944 KB Output is correct
27 Correct 3 ms 12984 KB Output is correct
28 Correct 3 ms 12888 KB Output is correct
29 Correct 6 ms 12892 KB Output is correct
30 Correct 4 ms 12892 KB Output is correct
31 Correct 4 ms 12888 KB Output is correct
32 Correct 4 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 4 ms 12892 KB Output is correct
35 Correct 4 ms 12960 KB Output is correct
36 Correct 4 ms 12892 KB Output is correct
37 Correct 4 ms 12888 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12952 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 13008 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 2 ms 12892 KB Output is correct
24 Correct 2 ms 12892 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12944 KB Output is correct
27 Correct 3 ms 12984 KB Output is correct
28 Correct 3 ms 12888 KB Output is correct
29 Correct 6 ms 12892 KB Output is correct
30 Correct 4 ms 12892 KB Output is correct
31 Correct 4 ms 12888 KB Output is correct
32 Correct 4 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 4 ms 12892 KB Output is correct
35 Correct 4 ms 12960 KB Output is correct
36 Correct 4 ms 12892 KB Output is correct
37 Correct 4 ms 12888 KB Output is correct
38 Correct 1472 ms 14904 KB Output is correct
39 Execution timed out 5060 ms 28252 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12932 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 2 ms 12948 KB Output is correct
5 Correct 6 ms 12952 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12960 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12888 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 4 ms 12892 KB Output is correct
13 Correct 24 ms 13488 KB Output is correct
14 Correct 34 ms 13660 KB Output is correct
15 Correct 26 ms 13584 KB Output is correct
16 Correct 2463 ms 19452 KB Output is correct
17 Correct 114 ms 19728 KB Output is correct
18 Correct 144 ms 20504 KB Output is correct
19 Correct 3591 ms 19404 KB Output is correct
20 Execution timed out 5012 ms 19216 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 3 ms 12892 KB Output is correct
4 Correct 9 ms 13144 KB Output is correct
5 Correct 19 ms 13716 KB Output is correct
6 Correct 3 ms 13016 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 5 ms 12892 KB Output is correct
9 Correct 1471 ms 14904 KB Output is correct
10 Execution timed out 5039 ms 28240 KB Time limit exceeded
11 Halted 0 ms 0 KB -