oj.uz

Submission #836762

# Submission time Handle Problem Language Result Execution time Memory
836762 2023-08-24T15:16:51 Z becaido Thousands Islands (IOI22_islands) C++17
100 / 100
 262 ms 50092 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "islands.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() { cout << "\n"; }
template<typename T, typename...U>
void dout(T t, U...u) { cout << t << (sizeof...(u) ? ", " : ""), dout(u...); }
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for(int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1e5 + 5;

int n, m, s;
bool state[2 * SIZE];
vector<int> ans, chain;
set<pair<int, int>> adj[SIZE], rev[SIZE];

queue<int> q;
void deal() {
    while (q.size()) {
        int pos = q.front();
        q.pop();
        for (auto [np, id] : rev[pos]) if (adj[np].size()) {
            adj[np].erase({pos, id});
            if (adj[np].size() == 0) q.push(np);
        }
    }
}

int cnt;
void dfs(int pos, int last) {
    if (pos == s && last != -1 && cnt == 0) return;
    for (auto [np, id] : adj[pos]) if (id != last) {
        cnt -= state[id];
        adj[pos].erase({np, id});
        adj[np].emplace(pos, id);
        state[id] ^= 1;
        ans.pb(id);
        cnt += state[id];
        dfs(np, id);
        return;
    }
}

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
    n = N, m = M;
    FOR (i, 0, m - 1) {
        adj[U[i]].emplace(V[i], i);
        rev[V[i]].emplace(U[i], i);
    }

    FOR (i, 0, n - 1) if (adj[i].size() == 0) q.push(i);
    deal();

    while (adj[s].size() <= 1) {
        q.push(s), deal();
        if (adj[s].size() == 0) return false;
        auto [np, id] = *adj[s].begin();
        chain.pb(id);
        s = np;
    }

    FOR (i, 0, n - 1) while (adj[i].size() > 1 + (i == s)) adj[i].erase(adj[i].begin());
    dfs(s, -1);

    ans.insert(ans.begin(), chain.begin(), chain.end());
    reverse(chain.begin(), chain.end());
    ans.insert(ans.end(), chain.begin(), chain.end());
    return ans;
}

/*
in1
4 5
0 1
1 2
2 3
0 3
3 1
out1
1
10
0 1 2 4 0 3 2 1 4 3

in2
2 3
0 1
1 0
1 0
out2
0
0
*/

#ifdef WAIMAI
int main() {
  int N, M;
  assert(2 == scanf("%d %d", &N, &M));

  vector<int> U(M), V(M);
  for (int i = 0; i < M; ++i) {
    assert(2 == scanf("%d %d", &U[i], &V[i]));
  }

  variant<bool, vector<int>> result = find_journey(N, M, U, V);
  if (result.index() == 0) {
    printf("0\n");
    if (get<bool>(result)) {
      printf("1\n");
    } else {
      printf("0\n");
    }
  } else {
    printf("1\n");
    vector<int> &canoes = get<vector<int>>(result);
    printf("%d\n", static_cast<int>(canoes.size()));
    for (int i = 0; i < static_cast<int>(canoes.size()); ++i) {
      if (i > 0) {
        printf(" ");
      }
      printf("%d", canoes[i]);
    }
    printf("\n");
  }
  return 0;
}
#endif

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 95 ms 31696 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9808 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 119 ms 27344 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10068 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9940 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 6 ms 9700 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9904 KB Output is correct
11 Correct 4 ms 9704 KB Output is correct
12 Correct 5 ms 9940 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9808 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 57 ms 20756 KB Output is correct
18 Correct 48 ms 18632 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 4 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 114 ms 27344 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 7 ms 10068 KB Output is correct
3 Correct 143 ms 29516 KB Output is correct
4 Correct 144 ms 29644 KB Output is correct
5 Correct 6 ms 10068 KB Output is correct
6 Correct 7 ms 10224 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 7 ms 10324 KB Output is correct
11 Correct 7 ms 10068 KB Output is correct
12 Correct 6 ms 10068 KB Output is correct
13 Correct 6 ms 10196 KB Output is correct
14 Correct 6 ms 10096 KB Output is correct
15 Correct 7 ms 10324 KB Output is correct
16 Correct 7 ms 9940 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 6 ms 10068 KB Output is correct
19 Correct 6 ms 9812 KB Output is correct
20 Correct 165 ms 31820 KB Output is correct
21 Correct 150 ms 29796 KB Output is correct
22 Correct 7 ms 9812 KB Output is correct
23 Correct 6 ms 9812 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 5 ms 9812 KB Output is correct
26 Correct 6 ms 10080 KB Output is correct
27 Correct 176 ms 30924 KB Output is correct
28 Correct 156 ms 30764 KB Output is correct
29 Correct 5 ms 9684 KB Output is correct
30 Correct 177 ms 31856 KB Output is correct
31 Correct 5 ms 9684 KB Output is correct
32 Correct 144 ms 29860 KB Output is correct
33 Correct 151 ms 30664 KB Output is correct
34 Correct 54 ms 20772 KB Output is correct
35 Correct 5 ms 9940 KB Output is correct
36 Correct 114 ms 27532 KB Output is correct
37 Correct 160 ms 30668 KB Output is correct
38 Correct 6 ms 9812 KB Output is correct
39 Correct 124 ms 26664 KB Output is correct
40 Correct 6 ms 10068 KB Output is correct
41 Correct 181 ms 32076 KB Output is correct
42 Correct 153 ms 30752 KB Output is correct
43 Correct 5 ms 9684 KB Output is correct
44 Correct 6 ms 10068 KB Output is correct
45 Correct 7 ms 10068 KB Output is correct
46 Correct 41 ms 18636 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 95 ms 31696 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9808 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 119 ms 27344 KB Output is correct
14 Correct 6 ms 10068 KB Output is correct
15 Correct 4 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 5 ms 9940 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 5 ms 9812 KB Output is correct
21 Correct 6 ms 9700 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 6 ms 9904 KB Output is correct
24 Correct 4 ms 9704 KB Output is correct
25 Correct 5 ms 9940 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 5 ms 9684 KB Output is correct
28 Correct 5 ms 9808 KB Output is correct
29 Correct 5 ms 9684 KB Output is correct
30 Correct 57 ms 20756 KB Output is correct
31 Correct 48 ms 18632 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 4 ms 9684 KB Output is correct
34 Correct 6 ms 9684 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 114 ms 27344 KB Output is correct
37 Correct 4 ms 9684 KB Output is correct
38 Correct 5 ms 9684 KB Output is correct
39 Correct 4 ms 9684 KB Output is correct
40 Correct 5 ms 9936 KB Output is correct
41 Correct 71 ms 19660 KB Output is correct
42 Correct 7 ms 10268 KB Output is correct
43 Correct 83 ms 20812 KB Output is correct
44 Correct 84 ms 20876 KB Output is correct
45 Correct 81 ms 20860 KB Output is correct
46 Correct 5 ms 9684 KB Output is correct
47 Correct 5 ms 9684 KB Output is correct
48 Correct 5 ms 9696 KB Output is correct
49 Correct 5 ms 9940 KB Output is correct
50 Correct 129 ms 43344 KB Output is correct
51 Correct 249 ms 32020 KB Output is correct
52 Correct 232 ms 31840 KB Output is correct
53 Correct 249 ms 32104 KB Output is correct
54 Correct 250 ms 31964 KB Output is correct
55 Correct 254 ms 31760 KB Output is correct
56 Correct 248 ms 31968 KB Output is correct
57 Correct 174 ms 31284 KB Output is correct
58 Correct 134 ms 50092 KB Output is correct
59 Correct 229 ms 31992 KB Output is correct
60 Correct 235 ms 31948 KB Output is correct
61 Correct 204 ms 31948 KB Output is correct
62 Correct 24 ms 13260 KB Output is correct
63 Correct 161 ms 30924 KB Output is correct
64 Correct 85 ms 21068 KB Output is correct
65 Correct 5 ms 9684 KB Output is correct
66 Correct 5 ms 9812 KB Output is correct
67 Correct 169 ms 32304 KB Output is correct
68 Correct 223 ms 31820 KB Output is correct
69 Correct 77 ms 20968 KB Output is correct
70 Correct 6 ms 10068 KB Output is correct
71 Correct 113 ms 26324 KB Output is correct
72 Correct 4 ms 9684 KB Output is correct
73 Correct 204 ms 31820 KB Output is correct
74 Correct 123 ms 44052 KB Output is correct
75 Correct 9 ms 10964 KB Output is correct
76 Correct 44 ms 24012 KB Output is correct
77 Correct 70 ms 20808 KB Output is correct
78 Correct 220 ms 31948 KB Output is correct
79 Correct 5 ms 9684 KB Output is correct
80 Correct 262 ms 46812 KB Output is correct
81 Correct 6 ms 10068 KB Output is correct
82 Correct 152 ms 31796 KB Output is correct
83 Correct 5 ms 9812 KB Output is correct
84 Correct 6 ms 9808 KB Output is correct
85 Correct 49 ms 26184 KB Output is correct
86 Correct 5 ms 9940 KB Output is correct
87 Correct 6 ms 10224 KB Output is correct
88 Correct 8 ms 10448 KB Output is correct
89 Correct 200 ms 31936 KB Output is correct
90 Correct 202 ms 31976 KB Output is correct
91 Correct 245 ms 42200 KB Output is correct
92 Correct 5 ms 9684 KB Output is correct