oj.uz

Submission #634761

# Submission time Handle Problem Language Result Execution time Memory
634761 2022-08-24T20:41:39 Z JeanBombeur Thousands Islands (IOI22_islands) C++17
100 / 100
 129 ms 23960 KB 
#include "islands.h"
#include <variant>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;

//  <|°_°|>

//  JeanBombeur & M. Broccoli

//  The hardest choices require the strongest wills

//  What is better - to be born good, or to overcome your evil nature with great effort ?

const int MAX_ISLANDS = (1e5);

vector <pair <int, int>> Adj[MAX_ISLANDS];
vector <int> Up[MAX_ISLANDS];

int nbIslands, nbCanoes;

vector <int> Path[3];

vector <int> Cycle[2];

vector <int> Ans;

int Seen[MAX_ISLANDS];

int Deg[MAX_ISLANDS];

int Queue[MAX_ISLANDS];
int deb = 0, fin = 0;

int Dfs(int node, int id, int root) {
    if (Seen[node])
        return node;
    Seen[node] = 1;
    for (pair <int, int> dest : Adj[node])
    {
        if (Seen[dest.first] >= 0)
        {
            Path[id].push_back(dest.second);
            int up = Dfs(dest.first, id, root);
            if (!id)
            {
                if (up >= 0)
                {
                    Cycle[id].push_back(dest.second);
                    Seen[node] = 2;
                    Path[id].pop_back();
                }
                else
                    Seen[node] = 0;
                if (node != root)
                    return up == node ? -1 : up;
            }
            if (up >= 0 && Seen[up] == 1)
            {
                Path[id].pop_back();
                Cycle[id].push_back(dest.second);
                if (node != root)
                    return up == node ? -1 : up;
            }
            if (node != root || id)
                return up;
            id ++;
        }
    }
    return -1;
}

void Add(vector <int> &a, int rev = 0) {
    if (rev)
        for (vector <int>::reverse_iterator it = a.rbegin(); it != a.rend(); it ++)
            Ans.push_back(*it);
    else
        for (vector <int>::iterator it = a.begin(); it != a.end(); it ++)
            Ans.push_back(*it);
    return;
}

int Clear() {
    for (int i = 0; i < nbIslands; i ++)
    {
        if (!Deg[i])
            Queue[fin ++] = i;
    }
    int start = 0;
    while (deb < fin || Deg[start] <= 1)
    {
        if (deb < fin)
        {
            int node = Queue[deb ++];
            Seen[node] = -1;
            for (int dest : Up[node])
                if (!(-- Deg[dest]))
                    Queue[fin ++] = dest;
        }
        while (Deg[start] <= 1)
        {
            pair <int, int> next = {-1, 0};
            Seen[start] = -1;
            Deg[start] = 0;
            for (int dest : Up[start])
                if (!(-- Deg[dest]))
                    Queue[fin ++] = dest;
            
            for (pair <int, int> dest : Adj[start])
                if (!Seen[dest.first])
                    next = dest;
            if (~next.first)
                start = next.first, Path[2].push_back(next.second);
            else
                return -1;
        }
    }
    return start;
}

variant <bool, vector <int>> find_journey(int N, int M, vector <int> Start, vector <int> End) {
    nbIslands = N, nbCanoes = M;
    for (int i = 0; i < nbCanoes; i ++)
    {
        Adj[Start[i]].push_back({End[i], i});
        Deg[Start[i]] ++;
        Up[End[i]].push_back(Start[i]);
    }

    int start = -1;
    if ((start = Clear()) < 0)
        return false;
    
    Dfs(start, 0, start);
    
    Add(Path[2]);
    Add(Path[0]);
    Add(Cycle[0], 1);
    Add(Path[0], 1);
    Add(Path[1]);
    
    if (Cycle[1].empty())
    {
        int node = End[Path[1].back()];
        int id = 0;
        int sz = Cycle[0].size();
        for (int i = 0; i < sz; i ++)
        {
            if (End[Cycle[0][i]] == node)
                id = i;
        }
        for (int i = id; i < sz; i ++)
            Ans.push_back(Cycle[0][i]);
        for (int i = 0; i < id; i ++)
            Ans.push_back(Cycle[0][i]);
    }
    else
        Add(Cycle[1], 1);
    Add(Path[1], 1);
    
    if (!Cycle[1].empty())
    {
        Add(Path[0]);
        Add(Cycle[0]);
        Add(Path[0], 1);
        Add(Path[1]);
        Add(Cycle[1]);
        Add(Path[1], 1);
    }
    Add(Path[2], 1);
    
    return Ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 39 ms 10892 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 34 ms 10072 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5076 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 5104 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 5012 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 5 ms 5004 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 26 ms 8236 KB Output is correct
18 Correct 22 ms 8064 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 35 ms 10112 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 35 ms 10628 KB Output is correct
4 Correct 49 ms 11020 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 5 ms 5204 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 4 ms 5204 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 6 ms 5184 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 43 ms 11340 KB Output is correct
21 Correct 42 ms 11124 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 4 ms 5204 KB Output is correct
27 Correct 42 ms 11472 KB Output is correct
28 Correct 40 ms 11464 KB Output is correct
29 Correct 2 ms 4948 KB Output is correct
30 Correct 47 ms 11924 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 41 ms 11264 KB Output is correct
33 Correct 42 ms 10952 KB Output is correct
34 Correct 23 ms 8220 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 36 ms 10328 KB Output is correct
37 Correct 41 ms 11608 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 34 ms 10436 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 45 ms 11944 KB Output is correct
42 Correct 43 ms 11612 KB Output is correct
43 Correct 4 ms 4948 KB Output is correct
44 Correct 4 ms 5076 KB Output is correct
45 Correct 4 ms 5204 KB Output is correct
46 Correct 18 ms 7812 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 39 ms 10892 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 34 ms 10072 KB Output is correct
14 Correct 4 ms 5076 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 5104 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 3 ms 5012 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 5 ms 5004 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 4 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 26 ms 8236 KB Output is correct
31 Correct 22 ms 8064 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 35 ms 10112 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 20 ms 8036 KB Output is correct
42 Correct 4 ms 5164 KB Output is correct
43 Correct 39 ms 11032 KB Output is correct
44 Correct 47 ms 10960 KB Output is correct
45 Correct 42 ms 10692 KB Output is correct
46 Correct 2 ms 4948 KB Output is correct
47 Correct 2 ms 4948 KB Output is correct
48 Correct 3 ms 5000 KB Output is correct
49 Correct 3 ms 5076 KB Output is correct
50 Correct 110 ms 23836 KB Output is correct
51 Correct 97 ms 16232 KB Output is correct
52 Correct 99 ms 16284 KB Output is correct
53 Correct 129 ms 16268 KB Output is correct
54 Correct 91 ms 16280 KB Output is correct
55 Correct 90 ms 16248 KB Output is correct
56 Correct 95 ms 16252 KB Output is correct
57 Correct 67 ms 13628 KB Output is correct
58 Correct 117 ms 22156 KB Output is correct
59 Correct 94 ms 15564 KB Output is correct
60 Correct 95 ms 15020 KB Output is correct
61 Correct 95 ms 14976 KB Output is correct
62 Correct 14 ms 7380 KB Output is correct
63 Correct 81 ms 14320 KB Output is correct
64 Correct 26 ms 8604 KB Output is correct
65 Correct 3 ms 4948 KB Output is correct
66 Correct 3 ms 4948 KB Output is correct
67 Correct 106 ms 15260 KB Output is correct
68 Correct 42 ms 11924 KB Output is correct
69 Correct 62 ms 12120 KB Output is correct
70 Correct 3 ms 5204 KB Output is correct
71 Correct 54 ms 11944 KB Output is correct
72 Correct 2 ms 4948 KB Output is correct
73 Correct 83 ms 14364 KB Output is correct
74 Correct 99 ms 23960 KB Output is correct
75 Correct 6 ms 5460 KB Output is correct
76 Correct 38 ms 14016 KB Output is correct
77 Correct 71 ms 14116 KB Output is correct
78 Correct 91 ms 15148 KB Output is correct
79 Correct 2 ms 4948 KB Output is correct
80 Correct 128 ms 22460 KB Output is correct
81 Correct 3 ms 5076 KB Output is correct
82 Correct 37 ms 11152 KB Output is correct
83 Correct 3 ms 5040 KB Output is correct
84 Correct 2 ms 4948 KB Output is correct
85 Correct 40 ms 13604 KB Output is correct
86 Correct 3 ms 5076 KB Output is correct
87 Correct 4 ms 5716 KB Output is correct
88 Correct 6 ms 5312 KB Output is correct
89 Correct 93 ms 14996 KB Output is correct
90 Correct 91 ms 15000 KB Output is correct
91 Correct 114 ms 21988 KB Output is correct
92 Correct 3 ms 4948 KB Output is correct