oj.uz

Submission #627259

# Submission time Handle Problem Language Result Execution time Memory
627259 2022-08-12T11:44:55 Z model_code Thousands Islands (IOI22_islands) C++17
100 / 100
 448 ms 33592 KB 
// correct/solution-prabowo-ac.cpp
#include "islands.h"

#include <algorithm>
#include <functional>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
#include <variant>
#include <vector>

std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V) {
  std::vector<std::set<std::pair<int, int>>> adj(N), radj(N);
  for (int j = 0; j < M; ++j) {
    adj[U[j]].emplace(V[j], j);
    radj[V[j]].emplace(U[j], j);
  }

  std::queue<int> q;
  for (int i = 0; i < N; ++i) {
    if (adj[i].empty()) {
      q.push(i);
    }
  }

  auto clearQueue = [&]() {
    while (!q.empty()) {
      int u = q.front();
      q.pop();
      for (auto [v, j] : radj[u]) {
        adj[v].erase({u, j});
        if (adj[v].empty()) {
          q.push(v);
        }
      }
      radj[u].clear();
    }
  };

  std::vector<int> ans, beforeCycle;
  for (int u = 0;;) {
    clearQueue();
    if (adj[u].empty()) {
      return false;
    }

    if (static_cast<int>(adj[u].size()) == 1) {
      auto [v, j] = *adj[u].begin();
      ans.push_back(j);
      beforeCycle.push_back(j);
      radj[v].erase({u, j});
      adj[u].clear();
      q.push(u);
      u = v;
      continue;
    }

    for (int i = 0; i < N; ++i) {
      if (i != u && static_cast<int>(adj[i].size()) > 1) {
        adj[i].erase(std::next(adj[i].begin()), adj[i].end());
      }
    }
    adj[u].erase(std::next(adj[u].begin(), 2), adj[u].end());

    int invertCount = 0;
    std::vector<int> inverted(M);
    int lstEdge = -1;
    do {
      auto [v, j] = *adj[u].begin();
      if (lstEdge != -1) {
        adj[U[lstEdge]].emplace(V[lstEdge], lstEdge);
      }

      ans.push_back(j);

      lstEdge = j;
      adj[U[j]].erase({V[j], j});
      std::swap(U[j], V[j]);
      if (inverted[j] ^= 1) {
        ++invertCount;
      } else {
        --invertCount;
      }

      u = v;
    } while (invertCount != 0);
    break;
  }

  while (!beforeCycle.empty()) {
    ans.push_back(beforeCycle.back());
    beforeCycle.pop_back();
  }

  return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 232 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 134 ms 22956 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 225 ms 18360 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 126 ms 11632 KB Output is correct
18 Correct 102 ms 9412 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 225 ms 18320 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 254 ms 20652 KB Output is correct
4 Correct 212 ms 20692 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 3 ms 980 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 1 ms 556 KB Output is correct
20 Correct 254 ms 22200 KB Output is correct
21 Correct 214 ms 20740 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 275 ms 21948 KB Output is correct
28 Correct 224 ms 21904 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 218 ms 22300 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 298 ms 20772 KB Output is correct
33 Correct 237 ms 21740 KB Output is correct
34 Correct 103 ms 11608 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 189 ms 18424 KB Output is correct
37 Correct 220 ms 21896 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 172 ms 17172 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 259 ms 22184 KB Output is correct
42 Correct 282 ms 21844 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 96 ms 9464 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 232 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 134 ms 22956 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 225 ms 18360 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 500 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 488 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 612 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 126 ms 11632 KB Output is correct
31 Correct 102 ms 9412 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 225 ms 18320 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 103 ms 10168 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 121 ms 15916 KB Output is correct
44 Correct 116 ms 15884 KB Output is correct
45 Correct 125 ms 15920 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 219 ms 22972 KB Output is correct
51 Correct 369 ms 31520 KB Output is correct
52 Correct 321 ms 31588 KB Output is correct
53 Correct 330 ms 32356 KB Output is correct
54 Correct 382 ms 31600 KB Output is correct
55 Correct 342 ms 31604 KB Output is correct
56 Correct 408 ms 31556 KB Output is correct
57 Correct 298 ms 28428 KB Output is correct
58 Correct 219 ms 23204 KB Output is correct
59 Correct 310 ms 31692 KB Output is correct
60 Correct 282 ms 31744 KB Output is correct
61 Correct 292 ms 31740 KB Output is correct
62 Correct 28 ms 8020 KB Output is correct
63 Correct 260 ms 30376 KB Output is correct
64 Correct 181 ms 11728 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 2 ms 340 KB Output is correct
67 Correct 295 ms 32360 KB Output is correct
68 Correct 448 ms 22304 KB Output is correct
69 Correct 133 ms 20772 KB Output is correct
70 Correct 2 ms 596 KB Output is correct
71 Correct 189 ms 21412 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 323 ms 28844 KB Output is correct
74 Correct 194 ms 22136 KB Output is correct
75 Correct 10 ms 1576 KB Output is correct
76 Correct 73 ms 11272 KB Output is correct
77 Correct 100 ms 20688 KB Output is correct
78 Correct 306 ms 31740 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 387 ms 33592 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 223 ms 22084 KB Output is correct
83 Correct 1 ms 468 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 101 ms 11292 KB Output is correct
86 Correct 2 ms 596 KB Output is correct
87 Correct 9 ms 8148 KB Output is correct
88 Correct 3 ms 980 KB Output is correct
89 Correct 346 ms 31744 KB Output is correct
90 Correct 317 ms 31712 KB Output is correct
91 Correct 332 ms 32964 KB Output is correct
92 Correct 0 ms 212 KB Output is correct