답안 #817040

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
817040	2023-08-09T08:45:11 Z	KoD	수천개의 섬 (IOI22_islands)	C++17	100 / 100	130 ms	19220 KB

islands

#include "islands.h"

#include <algorithm>
#include <array>
#include <cassert>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <variant>
#include <vector>

using std::array;
using std::pair;
using std::string;
using std::tuple;
using std::vector;

using ll = long long;
constexpr int inf = (1 << 30) - 1;
constexpr ll infll = (1ll << 62) - 1;

template <class F> struct make_fixed : private F {
  explicit make_fixed(F&& f) : F(std::forward<F>(f)) {}
  template <class... Args> decltype(auto) operator()(Args&&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <class T, class... Args> void DBG(const T& x, const Args&... args) {
  std::cerr << x;
  if constexpr (sizeof...(args)) {
    std::cerr << ' ';
    DBG(args...);
  } else {
    std::cerr << std::endl;
  }
}

template <class T> void DBG(const vector<T>& v) {
  std::cerr << '[';
  bool f = false;
  for (const T& x : v) {
    if (f) std::cerr << ", ";
    f = true;
    std::cerr << x;
  }
  std::cerr << ']' << std::endl;
}

void append(vector<int>& a, vector<int> b) {
  std::copy(b.begin(), b.end(), std::back_inserter(a));
}
vector<int> slice(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());
}

std::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);
  std::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(slice(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, slice(cycle1, depth[v], length));
          } else {
            append(cycle, rev(slice(cycle1, length, depth[v])));
          }
          append(cycle, rev(slice(cycle1, depth[v], (int)cycle1.size() - length)));
          append(cycle, rev(cycle2));
          break;
        } else if (state[v] == 2) {
          append(cycle2, rev(slice(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	0 ms	212 KB	Output is correct
2	Correct	1 ms	280 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	27 ms	5848 KB	Output is correct

Subtask #2

5.0 / 5.0

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

Subtask #3

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 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	0 ms	212 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	300 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	15 ms	3104 KB	Output is correct
18	Correct	13 ms	2828 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	300 KB	Output is correct
23	Correct	22 ms	4684 KB	Output is correct

Subtask #4

24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	32 ms	5168 KB	Output is correct
4	Correct	29 ms	5348 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	304 KB	Output is correct
8	Correct	0 ms	296 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	432 KB	Output is correct
12	Correct	2 ms	468 KB	Output is correct
13	Correct	2 ms	468 KB	Output is correct
14	Correct	1 ms	488 KB	Output is correct
15	Correct	3 ms	500 KB	Output is correct
16	Correct	1 ms	444 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	27 ms	6032 KB	Output is correct
21	Correct	30 ms	5628 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	300 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	444 KB	Output is correct
27	Correct	29 ms	5744 KB	Output is correct
28	Correct	27 ms	5764 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	30 ms	6500 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	26 ms	5832 KB	Output is correct
33	Correct	25 ms	5728 KB	Output is correct
34	Correct	19 ms	3284 KB	Output is correct
35	Correct	1 ms	436 KB	Output is correct
36	Correct	23 ms	5000 KB	Output is correct
37	Correct	27 ms	6228 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	24 ms	5060 KB	Output is correct
40	Correct	1 ms	468 KB	Output is correct
41	Correct	35 ms	6496 KB	Output is correct
42	Correct	29 ms	5880 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	2 ms	468 KB	Output is correct
45	Correct	1 ms	444 KB	Output is correct
46	Correct	14 ms	2988 KB	Output is correct

Subtask #5

45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	280 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	27 ms	5848 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 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	4760 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	296 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	300 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	15 ms	3104 KB	Output is correct
31	Correct	13 ms	2828 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	300 KB	Output is correct
36	Correct	22 ms	4684 KB	Output is correct
37	Correct	1 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	1 ms	304 KB	Output is correct
41	Correct	13 ms	2940 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	39 ms	8040 KB	Output is correct
44	Correct	40 ms	7800 KB	Output is correct
45	Correct	35 ms	8252 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	95 ms	18064 KB	Output is correct
51	Correct	89 ms	15404 KB	Output is correct
52	Correct	119 ms	15356 KB	Output is correct
53	Correct	81 ms	16068 KB	Output is correct
54	Correct	64 ms	15288 KB	Output is correct
55	Correct	86 ms	15400 KB	Output is correct
56	Correct	73 ms	16308 KB	Output is correct
57	Correct	46 ms	12488 KB	Output is correct
58	Correct	114 ms	19220 KB	Output is correct
59	Correct	64 ms	14516 KB	Output is correct
60	Correct	68 ms	13764 KB	Output is correct
61	Correct	72 ms	13936 KB	Output is correct
62	Correct	11 ms	4772 KB	Output is correct
63	Correct	65 ms	14004 KB	Output is correct
64	Correct	18 ms	3508 KB	Output is correct
65	Correct	1 ms	212 KB	Output is correct
66	Correct	1 ms	340 KB	Output is correct
67	Correct	92 ms	15136 KB	Output is correct
68	Correct	30 ms	6348 KB	Output is correct
69	Correct	48 ms	11452 KB	Output is correct
70	Correct	1 ms	440 KB	Output is correct
71	Correct	43 ms	8728 KB	Output is correct
72	Correct	1 ms	256 KB	Output is correct
73	Correct	83 ms	11852 KB	Output is correct
74	Correct	97 ms	18392 KB	Output is correct
75	Correct	3 ms	852 KB	Output is correct
76	Correct	27 ms	8652 KB	Output is correct
77	Correct	64 ms	13476 KB	Output is correct
78	Correct	67 ms	13788 KB	Output is correct
79	Correct	0 ms	212 KB	Output is correct
80	Correct	130 ms	18152 KB	Output is correct
81	Correct	1 ms	468 KB	Output is correct
82	Correct	28 ms	5528 KB	Output is correct
83	Correct	1 ms	340 KB	Output is correct
84	Correct	0 ms	212 KB	Output is correct
85	Correct	29 ms	8652 KB	Output is correct
86	Correct	1 ms	444 KB	Output is correct
87	Correct	3 ms	4820 KB	Output is correct
88	Correct	2 ms	596 KB	Output is correct
89	Correct	77 ms	13784 KB	Output is correct
90	Correct	69 ms	13900 KB	Output is correct
91	Correct	107 ms	16972 KB	Output is correct
92	Correct	0 ms	212 KB	Output is correct