oj.uz

답안 #677289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677289 2023-01-02T17:55:37 Z PositiveDelta Jail (JOI22_jail) C++17
26 / 100
 99 ms 10692 KB 
#include <bits/stdc++.h>
using namespace std;

struct LCA {
  int n;
  vector<int> depth;
  vector<vector<int>> g, dp;

  void dfs(int u) {
    depth[u] = (u == 0 ? 0 : depth[dp[0][u]] + 1);
    for (int i = 0; i + 1 < 20; i++)
      dp[i + 1][u] = dp[i][dp[i][u]];

    for (int v : g[u])
      if (v != dp[0][u]) {
        dp[0][v] = u;
        dfs(v);
      }
  }

  LCA(vector<vector<int>> g) : g(g) {
    n = g.size();
    depth.resize(n);
    dp.assign(20, vector<int>(n, 0));
    dfs(0);
  }

  int lca(int u, int v) {
    if (depth[u] < depth[v])
      swap(u, v);

    for (int i = 20 - 1; i >= 0; i--)
      if (depth[u] - (1 << i) >= depth[v])
        u = dp[i][u];

    if (u == v)
      return u;

    for (int i = 20 - 1; i >= 0; i--)
      if (dp[i][u] != dp[i][v]) {
        u = dp[i][u];
        v = dp[i][v];
      }

    return dp[0][u];
  }

  int dist(int u, int v) {
    return depth[u] + depth[v] - 2 * depth[lca(u, v)];
  }
};

void solve() {
  int n;
  cin >> n;
  vector<vector<int>> g(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }

  int m;
  cin >> m;
  vector<pair<int, int>> p(m);
  for (auto &[a, b] : p) {
    cin >> a >> b;
    a--, b--;
  }

  if (n <= 250 && m <= 6) {
    vector<int> order(m);
    iota(order.begin(), order.end(), 0);
    LCA l(g);
    do {
      vector<bool> occupied(n, false);
      for (auto [a, b] : p)
        occupied[a] = true;

      bool bad = false;
      for (int i : order) {
        auto [a, b] = p[i];
        int lca = l.lca(a, b);
        vector<int> p1, p2;
        while (a != lca) {
          p1.push_back(a);
          a = l.dp[0][a];
        }

        while (b != lca) {
          p2.push_back(b);
          b = l.dp[0][b];
        }

        p2.push_back(lca);
        reverse(p2.begin(), p2.end());
        vector<int> path;
        for (int v : p1)
          path.push_back(v);

        for (int v : p2)
          path.push_back(v);

        int k = path.size();
        for (int j = 0; j + 1 < k; j++)
          if (occupied[path[j + 1]])
            bad = true;

        occupied[path[0]] = false;
        occupied[path.back()] = true;
      }

      if (!bad) {
        cout << "Yes\n";
        return;
      }
    } while (next_permutation(order.begin(), order.end()));
    cout << "No\n";
  } else {
    sort(p.begin(), p.end());
    for (int i = 0; i + 1 < m; i++)
      if (p[i + 1].second <= p[i].second) {
        cout << "No\n";
        return;
      }
    
    cout << "Yes\n";
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int q;
  cin >> q;
  while (q--)
    solve();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 27 ms 576 KB Output is correct
5 Correct 68 ms 588 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 87 ms 408 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 31 ms 1868 KB Output is correct
10 Correct 29 ms 8288 KB Output is correct
11 Correct 84 ms 468 KB Output is correct
12 Correct 81 ms 1328 KB Output is correct
13 Correct 42 ms 9300 KB Output is correct
14 Correct 51 ms 9304 KB Output is correct
15 Correct 53 ms 9252 KB Output is correct
16 Correct 56 ms 10692 KB Output is correct
17 Correct 41 ms 9500 KB Output is correct
18 Correct 56 ms 10640 KB Output is correct
19 Correct 47 ms 9396 KB Output is correct
20 Correct 42 ms 9420 KB Output is correct
21 Correct 43 ms 9408 KB Output is correct
22 Correct 45 ms 9396 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 328 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 71 ms 416 KB Output is correct
17 Correct 5 ms 468 KB Output is correct
18 Correct 54 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 28 ms 400 KB Output is correct
21 Correct 19 ms 340 KB Output is correct
22 Correct 27 ms 332 KB Output is correct
23 Correct 13 ms 324 KB Output is correct
24 Correct 12 ms 320 KB Output is correct
25 Correct 81 ms 408 KB Output is correct
26 Correct 11 ms 340 KB Output is correct
27 Correct 11 ms 340 KB Output is correct
28 Correct 44 ms 320 KB Output is correct

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 328 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 71 ms 416 KB Output is correct
17 Correct 5 ms 468 KB Output is correct
18 Correct 54 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 28 ms 400 KB Output is correct
21 Correct 19 ms 340 KB Output is correct
22 Correct 27 ms 332 KB Output is correct
23 Correct 13 ms 324 KB Output is correct
24 Correct 12 ms 320 KB Output is correct
25 Correct 81 ms 408 KB Output is correct
26 Correct 11 ms 340 KB Output is correct
27 Correct 11 ms 340 KB Output is correct
28 Correct 44 ms 320 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Incorrect 3 ms 380 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 328 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 71 ms 416 KB Output is correct
17 Correct 5 ms 468 KB Output is correct
18 Correct 54 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 28 ms 400 KB Output is correct
21 Correct 19 ms 340 KB Output is correct
22 Correct 27 ms 332 KB Output is correct
23 Correct 13 ms 324 KB Output is correct
24 Correct 12 ms 320 KB Output is correct
25 Correct 81 ms 408 KB Output is correct
26 Correct 11 ms 340 KB Output is correct
27 Correct 11 ms 340 KB Output is correct
28 Correct 44 ms 320 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Incorrect 3 ms 380 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 99 ms 468 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 404 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 15 ms 212 KB Output is correct
10 Correct 13 ms 340 KB Output is correct
11 Correct 46 ms 212 KB Output is correct
12 Incorrect 3 ms 340 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 27 ms 576 KB Output is correct
5 Correct 68 ms 588 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 87 ms 408 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 31 ms 1868 KB Output is correct
10 Correct 29 ms 8288 KB Output is correct
11 Correct 84 ms 468 KB Output is correct
12 Correct 81 ms 1328 KB Output is correct
13 Correct 42 ms 9300 KB Output is correct
14 Correct 51 ms 9304 KB Output is correct
15 Correct 53 ms 9252 KB Output is correct
16 Correct 56 ms 10692 KB Output is correct
17 Correct 41 ms 9500 KB Output is correct
18 Correct 56 ms 10640 KB Output is correct
19 Correct 47 ms 9396 KB Output is correct
20 Correct 42 ms 9420 KB Output is correct
21 Correct 43 ms 9408 KB Output is correct
22 Correct 45 ms 9396 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 4 ms 328 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 3 ms 328 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 71 ms 416 KB Output is correct
39 Correct 5 ms 468 KB Output is correct
40 Correct 54 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 28 ms 400 KB Output is correct
43 Correct 19 ms 340 KB Output is correct
44 Correct 27 ms 332 KB Output is correct
45 Correct 13 ms 324 KB Output is correct
46 Correct 12 ms 320 KB Output is correct
47 Correct 81 ms 408 KB Output is correct
48 Correct 11 ms 340 KB Output is correct
49 Correct 11 ms 340 KB Output is correct
50 Correct 44 ms 320 KB Output is correct
51 Correct 2 ms 340 KB Output is correct
52 Incorrect 3 ms 380 KB Output isn't correct
53 Halted 0 ms 0 KB -