oj.uz

답안 #817045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
817045 2023-08-09T08:48:03 Z KoD 수천개의 섬 (IOI22_islands) C++17
100 / 100
 131 ms 19028 KB 
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;

void append(vector<int>& a, vector<int> b) { copy(b.begin(), b.end(), back_inserter(a)); }
vector<int> cut(const vector<int>& a, int l, int r) { return vector<int>(a.begin() + l, a.begin() + r); }
vector<int> rev(const vector<int>& a) { return vector<int>(a.rbegin(), a.rend()); }

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
  const auto other = [&](int u, int e) { return U[e] ^ V[e] ^ u; };
  vector<vector<int>> G(N), rG(N);
  for (int i = 0; i < M; ++i) {
    G[U[i]].push_back(i);
    rG[V[i]].push_back(i);
  }
  vector<int> out(N);
  vector<char> dead(N);
  queue<int> que;
  const auto clean = [&] {
    while (!que.empty()) {
      const int u = que.front();
      que.pop();
      dead[u] = true;
      for (const int e : rG[u]) {
        const int v = other(u, e);
        if ((--out[v]) == 0) que.push(v);
      }
    }
  };
  for (int i = 0; i < N; ++i) {
    out[i] = (int)G[i].size();
    if (out[i] == 0) que.push(i);
  }
  clean();
  vector<int> path;
  for (int u = 0;;) {
    if (dead[u]) return false;
    vector<int> next;
    for (const int e : G[u]) {
      if (!dead[other(u, e)]) next.emplace_back(e);
    }
    if (next.size() >= 2) {
      vector<int> state(N), depth(N);
      vector<int> cycle1, cycle2;
      int length = -1;
      for (int v = u, e = next[0];;) {
        state[v] = 1;
        v = other(v, e);
        cycle1.push_back(e);
        if (state[v]) {
          append(cycle1, rev(cut(cycle1, 0, depth[v])));
          length = depth[v];
          break;
        } else {
          depth[v] = depth[other(v, e)] + 1;
          for (const int f : G[v]) {
            if (!dead[other(v, f)]) e = f;
          }
        }
      }
      vector<int> cycle;
      for (int v = u, e = next[1];;) {
        state[v] = 2;
        v = other(v, e);
        cycle2.push_back(e);
        if (state[v] == 1) {
          append(cycle, cycle1);
          append(cycle, cycle2);
          if (depth[v] <= length) {
            append(cycle, cut(cycle1, depth[v], length));
          } else {
            append(cycle, rev(cut(cycle1, length, depth[v])));
          }
          append(cycle, rev(cut(cycle1, depth[v], (int)cycle1.size() - length)));
          append(cycle, rev(cycle2));
          break;
        } else if (state[v] == 2) {
          append(cycle2, rev(cut(cycle2, 0, depth[v])));
          append(cycle, cycle1);
          append(cycle, cycle2);
          append(cycle, rev(cycle1));
          append(cycle, rev(cycle2));
          break;
        } else {
          depth[v] = depth[other(v, e)] + 1;
          for (const int f : G[v]) {
            if (!dead[other(v, f)]) e = f;
          }
        }
      }
      vector<int> ret;
      append(ret, path);
      append(ret, cycle);
      append(ret, rev(path));
      return ret;
    } else {
      out[u] = 0;
      que.push(u);
      clean();
      const int e = next[0];
      path.push_back(e);
      u = other(u, e);
    }
  }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 30 ms 5756 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 22 ms 4488 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 14 ms 3016 KB Output is correct
18 Correct 14 ms 2736 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 29 ms 4484 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 26 ms 5036 KB Output is correct
4 Correct 27 ms 5296 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 30 ms 5720 KB Output is correct
21 Correct 29 ms 5352 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 29 ms 5508 KB Output is correct
28 Correct 27 ms 5504 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 30 ms 6224 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 34 ms 5552 KB Output is correct
33 Correct 27 ms 5564 KB Output is correct
34 Correct 18 ms 3012 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 23 ms 4820 KB Output is correct
37 Correct 27 ms 6020 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 22 ms 4800 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 29 ms 6224 KB Output is correct
42 Correct 30 ms 5580 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 19 ms 2728 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 30 ms 5756 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 22 ms 4488 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 14 ms 3016 KB Output is correct
31 Correct 14 ms 2736 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 29 ms 4484 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 12 ms 2768 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 28 ms 7744 KB Output is correct
44 Correct 30 ms 7736 KB Output is correct
45 Correct 29 ms 8100 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 94 ms 17944 KB Output is correct
51 Correct 131 ms 15272 KB Output is correct
52 Correct 99 ms 15180 KB Output is correct
53 Correct 84 ms 16040 KB Output is correct
54 Correct 99 ms 15196 KB Output is correct
55 Correct 87 ms 15276 KB Output is correct
56 Correct 63 ms 15940 KB Output is correct
57 Correct 75 ms 12436 KB Output is correct
58 Correct 82 ms 19028 KB Output is correct
59 Correct 130 ms 14360 KB Output is correct
60 Correct 115 ms 13672 KB Output is correct
61 Correct 79 ms 13788 KB Output is correct
62 Correct 18 ms 4564 KB Output is correct
63 Correct 56 ms 13820 KB Output is correct
64 Correct 26 ms 3396 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 96 ms 14928 KB Output is correct
68 Correct 45 ms 6208 KB Output is correct
69 Correct 49 ms 11336 KB Output is correct
70 Correct 2 ms 468 KB Output is correct
71 Correct 71 ms 8660 KB Output is correct
72 Correct 0 ms 232 KB Output is correct
73 Correct 68 ms 11740 KB Output is correct
74 Correct 89 ms 18296 KB Output is correct
75 Correct 4 ms 724 KB Output is correct
76 Correct 44 ms 8524 KB Output is correct
77 Correct 42 ms 13268 KB Output is correct
78 Correct 75 ms 13680 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 103 ms 17980 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 27 ms 5428 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 48 ms 8568 KB Output is correct
86 Correct 2 ms 488 KB Output is correct
87 Correct 3 ms 4820 KB Output is correct
88 Correct 2 ms 640 KB Output is correct
89 Correct 77 ms 13600 KB Output is correct
90 Correct 95 ms 13744 KB Output is correct
91 Correct 85 ms 16912 KB Output is correct
92 Correct 0 ms 212 KB Output is correct