oj.uz

답안 #629581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629581 2022-08-14T16:35:09 Z abeker 수천개의 섬 (IOI22_islands) C++17
100 / 100
 328 ms 33776 KB 
#include <bits/stdc++.h>
#include "islands.h"
using namespace std;

typedef pair <vector <int>, vector <int>> pvv;

vector <int> min_rot(vector <int> v) {
  rotate(v.begin(), min_element(v.begin(), v.end()), v.end());
  return v;
}

variant <bool, vector <int>> find_journey(int N, int M, vector <int> u, vector <int> v) {
  queue <int> sinks;
  vector <set <int>> in(N), out(N);
  for (int i = 0; i < M; i++) {
    out[u[i]].insert(i);
    in[v[i]].insert(i);
  }
  auto refresh = [&](int x) {
    if (out[x].empty())
      sinks.push(x);
  };
  for (int i = 0; i < N; i++)
    refresh(i);
  int curr = 0;
  vector <int> sofar;
  while (1) {
    auto remove = [&](int x) {
      for (auto it : in[x]) {
        out[u[it]].erase(it);
        refresh(u[it]);
      }
      for (auto it : out[x])
        in[v[it]].erase(it);
    };
    for (; !sinks.empty(); sinks.pop()) {
      if (sinks.front() == curr)
        return false;
      remove(sinks.front());
    }
    if (out[curr].size() == 1) {
      int edge = *out[curr].begin();
      remove(curr);
      curr = v[edge];
      sofar.push_back(edge);
    }
    else {
      auto find_cycle = [&](int x, int e, bool b) {
        int y = v[e];
        vector <bool> bio(N);
        vector <int> path = {e};
        bio[x] = b;
        for (; !bio[y]; y = v[e]) {
          path.push_back(e = *out[y].begin());
          bio[y] = true;
        }
        int last = -1;
        for (int i = 0; i < path.size(); i++) {
          if (x == y)
            last = i;
          x = v[path[i]];
        }
        vector <int> tail, cycle;
        for (int i = 0; i < path.size(); i++)
          (i < last ? tail : cycle).push_back(path[i]);
        return pvv(tail, cycle);
      };
      auto it = out[curr].begin();
      pvv cyc1 = find_cycle(curr, *it++, true);
      pvv cyc2 = find_cycle(curr, *it++, false);
      vector <int> sol;
      auto append = [&](vector <int> &v) {
        sol.insert(sol.end(), v.begin(), v.end());
        reverse(v.begin(), v.end());
      };
      append(sofar);
      bool equal = min_rot(cyc1.second) == min_rot(cyc2.second);
      for (int i = 0; i < 2; i++) {
        auto traverse = [&](pvv &p1, pvv &p2) {
          append(p1.first);
          append(p1.second);
          if (equal)
            reverse(p2.second.begin(), p2.second.end());
          append(p1.first);
        };
        traverse(cyc1, cyc2);
        traverse(cyc2, cyc1);
      }
      append(sofar);
      return sol;
    }
  }
}

Compilation message

islands.cpp: In lambda function:
islands.cpp:58:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int i = 0; i < path.size(); i++) {
      |                         ~~^~~~~~~~~~~~~
islands.cpp:64:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         for (int i = 0; i < path.size(); i++)
      |                         ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 114 ms 22088 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 155 ms 17820 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 724 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 596 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 468 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 0 ms 212 KB Output is correct
12 Correct 1 ms 596 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 0 ms 212 KB Output is correct
17 Correct 84 ms 11256 KB Output is correct
18 Correct 78 ms 9168 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 150 ms 17800 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 174 ms 20028 KB Output is correct
4 Correct 209 ms 20120 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 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 0 ms 212 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 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 1052 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 212 ms 22220 KB Output is correct
21 Correct 197 ms 20056 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 204 ms 21192 KB Output is correct
28 Correct 197 ms 21176 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 228 ms 22304 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 189 ms 20132 KB Output is correct
33 Correct 198 ms 21244 KB Output is correct
34 Correct 76 ms 11332 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 159 ms 17964 KB Output is correct
37 Correct 178 ms 21220 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 162 ms 17228 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 228 ms 22216 KB Output is correct
42 Correct 212 ms 21248 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 47 ms 9108 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 114 ms 22088 KB Output is correct
8 Correct 0 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 155 ms 17820 KB Output is correct
14 Correct 3 ms 724 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 596 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 468 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 0 ms 212 KB Output is correct
25 Correct 1 ms 596 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 0 ms 212 KB Output is correct
30 Correct 84 ms 11256 KB Output is correct
31 Correct 78 ms 9168 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 150 ms 17800 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 84 ms 10088 KB Output is correct
42 Correct 3 ms 944 KB Output is correct
43 Correct 102 ms 15940 KB Output is correct
44 Correct 103 ms 15952 KB Output is correct
45 Correct 128 ms 15932 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 162 ms 24788 KB Output is correct
51 Correct 279 ms 31564 KB Output is correct
52 Correct 296 ms 31596 KB Output is correct
53 Correct 276 ms 31560 KB Output is correct
54 Correct 273 ms 31588 KB Output is correct
55 Correct 262 ms 31560 KB Output is correct
56 Correct 280 ms 31632 KB Output is correct
57 Correct 158 ms 27768 KB Output is correct
58 Correct 138 ms 22932 KB Output is correct
59 Correct 272 ms 31692 KB Output is correct
60 Correct 289 ms 31652 KB Output is correct
61 Correct 270 ms 31696 KB Output is correct
62 Correct 22 ms 8088 KB Output is correct
63 Correct 208 ms 30484 KB Output is correct
64 Correct 120 ms 11468 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 230 ms 31756 KB Output is correct
68 Correct 328 ms 22392 KB Output is correct
69 Correct 128 ms 20808 KB Output is correct
70 Correct 2 ms 596 KB Output is correct
71 Correct 206 ms 21472 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 287 ms 29036 KB Output is correct
74 Correct 183 ms 24920 KB Output is correct
75 Correct 6 ms 1492 KB Output is correct
76 Correct 52 ms 11832 KB Output is correct
77 Correct 105 ms 20588 KB Output is correct
78 Correct 299 ms 31816 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 327 ms 33776 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 212 ms 22208 KB Output is correct
83 Correct 1 ms 468 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 65 ms 11324 KB Output is correct
86 Correct 2 ms 724 KB Output is correct
87 Correct 7 ms 8148 KB Output is correct
88 Correct 3 ms 980 KB Output is correct
89 Correct 281 ms 31692 KB Output is correct
90 Correct 302 ms 31780 KB Output is correct
91 Correct 307 ms 33344 KB Output is correct
92 Correct 0 ms 212 KB Output is correct