oj.uz

Submission #632407

# Submission time Handle Problem Language Result Execution time Memory
632407 2022-08-20T00:54:30 Z lunchbox Thousands Islands (IOI22_islands) C++17
100 / 100
 359 ms 33880 KB 
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef pair<vi, vi> pvv;
 
vi min_rot(vi v) {
  rotate(v.begin(), min_element(v.begin(), v.end()), v.end());
  return v;
}
 
variant<bool, vi> find_journey(int N, int M, vi u, vi v) {
  queue<int> s;
  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 rf = [&](int x) {
    if (out[x].empty())
      s.push(x);
  };
  for (int i = 0; i < N; i++)
    rf(i);
  int q = 0;
  vi sf;
  while (1) {
    auto re = [&](int x) {
      for (auto it : in[x]) {
        out[u[it]].erase(it);
        rf(u[it]);
      }
      for (auto it : out[x])
        in[v[it]].erase(it);
    };
    for ( ; !s.empty(); s.pop()) {
      if (s.front() == q)
        return false;
      re(s.front());
    }
    if (out[q].size() == 1) {
      int edge = *out[q].begin();
      re(q);
      q = v[edge];
      sf.push_back(edge);
    } else {
      auto fnd = [&](int x, int e, bool b) {
        int y = v[e];
        vector<bool> z(N);
        vi p = {e};
        z[x] = b;
        for (; !z[y]; y = v[e]) {
          p.push_back(e = *out[y].begin());
          z[y] = true;
        }
        int last = -1;
        for (int i = 0; i < (int) p.size(); i++) {
          if (x == y)
            last = i;
          x = v[p[i]];
        }
        vi t, c;
        for (int i = 0; i < (int) p.size(); i++)
          if (i < last)
            t.push_back(p[i]);
          else
            c.push_back(p[i]);
        return pvv(t, c);
      };
      auto it = out[q].begin();
      pvv c1 = fnd(q, *it++, true), c2 = fnd(q, *it++, false);
      vi y;
      auto ad = [&](vi &v) {
        y.insert(y.end(), v.begin(), v.end());
        reverse(v.begin(), v.end());
      };
      ad(sf);
      bool eq = min_rot(c1.second) == min_rot(c2.second);
      for (int i = 0; i < 2; i++) {
        auto tr = [&](pvv &p1, pvv &p2) {
          ad(p1.first);
          ad(p1.second);
          if (eq)
            reverse(p2.second.begin(), p2.second.end());
          ad(p1.first);
        };
        tr(c1, c2);
        tr(c2, c1);
      }
      ad(sf);
      return y;
    }
  }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
7 Correct 116 ms 22228 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 149 ms 18220 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 0 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 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 0 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 91 ms 11268 KB Output is correct
18 Correct 53 ms 9376 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 152 ms 17884 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 208 ms 20268 KB Output is correct
4 Correct 185 ms 20728 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 724 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 3 ms 844 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 0 ms 212 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 206 ms 22296 KB Output is correct
21 Correct 198 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 1 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 226 ms 21880 KB Output is correct
28 Correct 197 ms 21584 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 238 ms 23204 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 202 ms 20876 KB Output is correct
33 Correct 203 ms 21732 KB Output is correct
34 Correct 66 ms 11484 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 168 ms 17820 KB Output is correct
37 Correct 186 ms 21216 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 203 ms 17264 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 211 ms 22308 KB Output is correct
42 Correct 199 ms 21104 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 836 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 68 ms 9172 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 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 116 ms 22228 KB Output is correct
8 Correct 1 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 149 ms 18220 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 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 0 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 91 ms 11268 KB Output is correct
31 Correct 53 ms 9376 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 152 ms 17884 KB Output is correct
37 Correct 1 ms 224 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 97 ms 10140 KB Output is correct
42 Correct 3 ms 852 KB Output is correct
43 Correct 113 ms 15932 KB Output is correct
44 Correct 121 ms 15948 KB Output is correct
45 Correct 107 ms 15952 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 154 ms 24740 KB Output is correct
51 Correct 272 ms 31600 KB Output is correct
52 Correct 282 ms 31600 KB Output is correct
53 Correct 291 ms 31608 KB Output is correct
54 Correct 255 ms 31568 KB Output is correct
55 Correct 283 ms 31616 KB Output is correct
56 Correct 261 ms 31568 KB Output is correct
57 Correct 168 ms 27748 KB Output is correct
58 Correct 157 ms 22800 KB Output is correct
59 Correct 275 ms 31736 KB Output is correct
60 Correct 295 ms 31792 KB Output is correct
61 Correct 272 ms 31664 KB Output is correct
62 Correct 26 ms 8080 KB Output is correct
63 Correct 211 ms 30484 KB Output is correct
64 Correct 108 ms 11448 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 253 ms 31680 KB Output is correct
68 Correct 348 ms 22316 KB Output is correct
69 Correct 117 ms 20784 KB Output is correct
70 Correct 2 ms 596 KB Output is correct
71 Correct 218 ms 21460 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 302 ms 28788 KB Output is correct
74 Correct 167 ms 24808 KB Output is correct
75 Correct 7 ms 1492 KB Output is correct
76 Correct 63 ms 11772 KB Output is correct
77 Correct 115 ms 20692 KB Output is correct
78 Correct 309 ms 31756 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 350 ms 33880 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 267 ms 22220 KB Output is correct
83 Correct 1 ms 472 KB Output is correct
84 Correct 1 ms 224 KB Output is correct
85 Correct 60 ms 11528 KB Output is correct
86 Correct 3 ms 600 KB Output is correct
87 Correct 8 ms 8276 KB Output is correct
88 Correct 5 ms 980 KB Output is correct
89 Correct 359 ms 31684 KB Output is correct
90 Correct 302 ms 31712 KB Output is correct
91 Correct 339 ms 33332 KB Output is correct
92 Correct 0 ms 212 KB Output is correct