oj.uz

Submission #655373

# Submission time Handle Problem Language Result Execution time Memory
655373 2022-11-04T03:20:03 Z Lobo Thousands Islands (IOI22_islands) C++17
100 / 100
 196 ms 30132 KB 
#include "islands.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(),x.end()

const int maxn = 2e5+10;

int n, m, Ug[maxn], Vg[maxn], grin[maxn], grout[maxn], atv[maxn], atvedg[maxn], pos[maxn];
vector<int> gin[maxn], gout[maxn], g[maxn];  
vector<int> ans;

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
    n = N;
    m = M;
    for(int i = 0; i < m; i++) {
        Ug[i] = U[i];
        Vg[i] = V[i];
        gout[Ug[i]].pb(i);
        gin[Vg[i]].pb(i);
    }

    queue<int> qout0;
    for(int i = 0; i < m; i++) {
        grin[Vg[i]]++;
        grout[Ug[i]]++;
    }

    for(int i = 0; i < n; i++) {
        atv[i] = 1;
        if(grout[i] == 0) qout0.push(i);
    }
    int x = 0;
    while(x != -1) {
        while(qout0.size()) {
            int v = qout0.front();
            atv[v] = 0;
            qout0.pop();
            // delete v, I just need to delete the in edges
            for(auto id : gin[v]) {
                int u = Ug[id];
                grout[u]--;
                if(grout[u] == 0) {
                    qout0.push(u);
                }
            }
        }


        if(grout[x] == 0) {
            x = -1;
            ans.clear();
        }
        else if(grout[x] == 1) {
            //just use it
            // delete the out edge, them it will delete the in edges automatically
            for(auto id : gout[x]) {
                int v = Vg[id];
                if(atv[v]) {
                    grin[v]--;
                    grout[x]--;
                    qout0.push(x);
                    ans.pb(id);
                    x = v;
                    break;
                }
            }
        }
        else {
            int szant = ans.size();
            for(auto id : gout[x]) {
                int v = Vg[id];
                if(atv[v]) {
                    g[x].pb(id);
                    g[v].pb(id);
                    pos[id] = x;
                    if(g[x].size() == 2) break;
                }
            }
            for(int i = 0; i < n; i++) {
                if(i == x || atv[i] == 0) continue;
                for(auto id : gout[i]) {
                    int v = Vg[id];
                    if(atv[v]) {
                        g[i].pb(id);
                        g[v].pb(id);
                        pos[id] = i;
                        break;
                    }
                }
            }
            int u = x;
            int last = -1;
            int cnt = 0;
            int cntt = 0;
            while(!(u == x && last != -1 && cnt == 0)) {
                for(auto id : g[u]) {
                    if(u != pos[id] || id == last) continue;
                    int v;
                    if(u == Ug[id]) {
                        cnt++;
                        v = Vg[id];
                    }
                    else {
                        cnt--;
                        v = Ug[id];
                    }

                    ans.pb(id);
                    pos[id] = v;
                    last = id;
                    u = v;
                }
            }
            if(szant != 0) {
                for(int i = szant-1; i >= 0; i--) ans.pb(ans[i]);
            }
            break;
        }
    }

    if(ans.size()) {
        return ans;
    }
    return false;

}

Compilation message

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:98:17: warning: unused variable 'cntt' [-Wunused-variable]
   98 |             int cntt = 0;
      |                 ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 43 ms 20768 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14428 KB Output is correct
3 Correct 7 ms 14376 KB Output is correct
4 Correct 7 ms 14352 KB Output is correct
5 Correct 8 ms 14392 KB Output is correct
6 Correct 42 ms 19968 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14548 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 8 ms 14388 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 11 ms 14540 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 7 ms 14376 KB Output is correct
10 Correct 8 ms 14580 KB Output is correct
11 Correct 7 ms 14304 KB Output is correct
12 Correct 8 ms 14556 KB Output is correct
13 Correct 9 ms 14428 KB Output is correct
14 Correct 8 ms 14368 KB Output is correct
15 Correct 7 ms 14372 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 29 ms 17872 KB Output is correct
18 Correct 33 ms 17456 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 42 ms 19892 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14344 KB Output is correct
2 Correct 12 ms 14548 KB Output is correct
3 Correct 44 ms 20448 KB Output is correct
4 Correct 44 ms 20928 KB Output is correct
5 Correct 8 ms 14548 KB Output is correct
6 Correct 10 ms 14596 KB Output is correct
7 Correct 7 ms 14396 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 12 ms 14420 KB Output is correct
10 Correct 9 ms 14612 KB Output is correct
11 Correct 12 ms 14528 KB Output is correct
12 Correct 11 ms 14548 KB Output is correct
13 Correct 11 ms 14676 KB Output is correct
14 Correct 10 ms 14548 KB Output is correct
15 Correct 9 ms 14692 KB Output is correct
16 Correct 8 ms 14492 KB Output is correct
17 Correct 8 ms 14372 KB Output is correct
18 Correct 12 ms 14640 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 46 ms 21452 KB Output is correct
21 Correct 58 ms 21032 KB Output is correct
22 Correct 8 ms 14548 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 7 ms 14420 KB Output is correct
25 Correct 8 ms 14404 KB Output is correct
26 Correct 9 ms 14548 KB Output is correct
27 Correct 53 ms 21264 KB Output is correct
28 Correct 47 ms 21324 KB Output is correct
29 Correct 7 ms 14420 KB Output is correct
30 Correct 50 ms 21860 KB Output is correct
31 Correct 11 ms 14432 KB Output is correct
32 Correct 47 ms 21196 KB Output is correct
33 Correct 42 ms 21068 KB Output is correct
34 Correct 28 ms 17988 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 44 ms 20396 KB Output is correct
37 Correct 70 ms 21768 KB Output is correct
38 Correct 8 ms 14420 KB Output is correct
39 Correct 40 ms 20144 KB Output is correct
40 Correct 8 ms 14608 KB Output is correct
41 Correct 57 ms 21836 KB Output is correct
42 Correct 61 ms 21400 KB Output is correct
43 Correct 8 ms 14420 KB Output is correct
44 Correct 9 ms 14544 KB Output is correct
45 Correct 9 ms 14548 KB Output is correct
46 Correct 26 ms 17444 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 43 ms 20768 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 7 ms 14376 KB Output is correct
11 Correct 7 ms 14352 KB Output is correct
12 Correct 8 ms 14392 KB Output is correct
13 Correct 42 ms 19968 KB Output is correct
14 Correct 8 ms 14548 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 8 ms 14388 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 11 ms 14540 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 7 ms 14376 KB Output is correct
23 Correct 8 ms 14580 KB Output is correct
24 Correct 7 ms 14304 KB Output is correct
25 Correct 8 ms 14556 KB Output is correct
26 Correct 9 ms 14428 KB Output is correct
27 Correct 8 ms 14368 KB Output is correct
28 Correct 7 ms 14372 KB Output is correct
29 Correct 8 ms 14420 KB Output is correct
30 Correct 29 ms 17872 KB Output is correct
31 Correct 33 ms 17456 KB Output is correct
32 Correct 7 ms 14420 KB Output is correct
33 Correct 7 ms 14420 KB Output is correct
34 Correct 7 ms 14420 KB Output is correct
35 Correct 7 ms 14420 KB Output is correct
36 Correct 42 ms 19892 KB Output is correct
37 Correct 8 ms 14420 KB Output is correct
38 Correct 8 ms 14428 KB Output is correct
39 Correct 9 ms 14420 KB Output is correct
40 Correct 11 ms 14384 KB Output is correct
41 Correct 30 ms 17576 KB Output is correct
42 Correct 10 ms 14548 KB Output is correct
43 Correct 49 ms 20756 KB Output is correct
44 Correct 53 ms 20656 KB Output is correct
45 Correct 54 ms 20684 KB Output is correct
46 Correct 8 ms 14420 KB Output is correct
47 Correct 8 ms 14420 KB Output is correct
48 Correct 8 ms 14420 KB Output is correct
49 Correct 8 ms 14548 KB Output is correct
50 Correct 169 ms 29516 KB Output is correct
51 Correct 112 ms 26980 KB Output is correct
52 Correct 128 ms 26964 KB Output is correct
53 Correct 107 ms 27364 KB Output is correct
54 Correct 104 ms 27020 KB Output is correct
55 Correct 110 ms 26996 KB Output is correct
56 Correct 120 ms 27080 KB Output is correct
57 Correct 89 ms 27716 KB Output is correct
58 Correct 162 ms 29548 KB Output is correct
59 Correct 101 ms 26100 KB Output is correct
60 Correct 111 ms 25492 KB Output is correct
61 Correct 104 ms 25588 KB Output is correct
62 Correct 22 ms 17228 KB Output is correct
63 Correct 94 ms 25664 KB Output is correct
64 Correct 34 ms 18544 KB Output is correct
65 Correct 7 ms 14424 KB Output is correct
66 Correct 7 ms 14420 KB Output is correct
67 Correct 129 ms 29328 KB Output is correct
68 Correct 54 ms 21892 KB Output is correct
69 Correct 60 ms 22308 KB Output is correct
70 Correct 8 ms 14548 KB Output is correct
71 Correct 66 ms 22032 KB Output is correct
72 Correct 7 ms 14420 KB Output is correct
73 Correct 103 ms 24708 KB Output is correct
74 Correct 139 ms 30132 KB Output is correct
75 Correct 12 ms 14876 KB Output is correct
76 Correct 49 ms 21160 KB Output is correct
77 Correct 72 ms 24268 KB Output is correct
78 Correct 103 ms 25480 KB Output is correct
79 Correct 8 ms 14320 KB Output is correct
80 Correct 196 ms 29820 KB Output is correct
81 Correct 9 ms 14548 KB Output is correct
82 Correct 46 ms 21068 KB Output is correct
83 Correct 9 ms 14420 KB Output is correct
84 Correct 8 ms 14420 KB Output is correct
85 Correct 53 ms 21456 KB Output is correct
86 Correct 8 ms 14548 KB Output is correct
87 Correct 11 ms 15824 KB Output is correct
88 Correct 10 ms 14696 KB Output is correct
89 Correct 112 ms 25492 KB Output is correct
90 Correct 104 ms 25588 KB Output is correct
91 Correct 137 ms 29448 KB Output is correct
92 Correct 9 ms 14420 KB Output is correct