oj.uz

Submission #837598

# Submission time Handle Problem Language Result Execution time Memory
837598 2023-08-25T12:38:42 Z tengiz05 Thousands Islands (IOI22_islands) C++17
29 / 100
 27 ms 4432 KB 
#include "islands.h"

#include <bits/stdc++.h>

using namespace std;

std::variant<bool, vector<int>> find_journey(int n, int m, vector<int> U, vector<int> V) {
    if (n == 2) {
        vector<int> e[n];
        for (int i = 0; i < m; i++) {
            e[U[i]].push_back(i);
        }
        if (e[0].size() >= 2 && e[1].size() >= 1) {
            return vector<int>{e[0][0], e[1][0], e[0][1], e[0][0], e[1][0], e[0][1]};
        } else {
            return false;
        }
    }
    vector<vector<int>> adj(n);
    for (int i = 0; i < m; i += 2) {
        adj[U[i]].push_back(i);
    }
    vector<int> path;
    vector<int> dep(n);
    vector<int> vis(n);
    bool found = false;
    vector<int> ans;
    function<void(int)> dfs = [&](int u) {
        vis[u] = 1;
        for (int i : adj[u]) {
            if (vis[V[i]] == 2) {
                continue;
            }
            if (vis[V[i]] == 1) {
                vector<int> cycle;
                for (int j = 0; j < dep[u] - dep[V[i]]; j++) {
                    cycle.push_back(path.back());
                    path.pop_back();
                }
                reverse(cycle.begin(), cycle.end());
                cycle.push_back(i);
                for (int x : path) {
                    ans.push_back(x);
                }
                for (int x : cycle) {
                    ans.push_back(x);
                }
                for (int x : cycle) {
                    ans.push_back(x ^ 1);
                }
                reverse(cycle.begin(), cycle.end());
                for (int x : cycle) {
                    ans.push_back(x);
                }
                for (int x : cycle) {
                    ans.push_back(x ^ 1);
                }
                reverse(path.begin(), path.end());
                for (int x : path) {
                    ans.push_back(x);
                }
                found = true;
                return;
            }
            dep[V[i]] = dep[u] + 1;
            path.push_back(i);
            dfs(V[i]);
            if (found) return;
            path.pop_back();
        }
        vis[u] = 2;
    };
    dfs(0);
    if (ans.empty()) {
        return false;
    } else {
        return ans;
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 24 ms 4432 KB Output is correct

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 340 KB Output is partially correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Partially correct 1 ms 212 KB Output is partially correct
5 Correct 1 ms 468 KB Output is correct
6 Partially correct 0 ms 212 KB Output is partially correct
7 Correct 1 ms 340 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 23 ms 3540 KB Output is correct
4 Correct 23 ms 3660 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 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 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 24 ms 4044 KB Output is correct
21 Correct 23 ms 3668 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 24 ms 3924 KB Output is correct
28 Correct 24 ms 3844 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 25 ms 4172 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 23 ms 3796 KB Output is correct
33 Correct 27 ms 3796 KB Output is correct
34 Correct 13 ms 2116 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 20 ms 3284 KB Output is correct
37 Correct 24 ms 3916 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 20 ms 3308 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 26 ms 4180 KB Output is correct
42 Correct 24 ms 3836 KB Output is correct
43 Correct 0 ms 336 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 11 ms 1832 KB Output is correct

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 24 ms 4432 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -