oj.uz

Submission #764411

# Submission time Handle Problem Language Result Execution time Memory
764411 2023-06-23T11:29:52 Z raysh07 Thousands Islands (IOI22_islands) C++17
24 / 100
 74 ms 7160 KB 
#include "islands.h"
#include <variant>
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1001;
const int M = 2e5 + 69;
vector <pair<int, int>> adj[N];
bool v1[N], vis[N];
int curr;
int n;
vector <int> path, ok[N], ok1;
pair <int, int> bruh[M];
int dep[N];

void dfs(int u){
    vis[u] = true;
    
    for (auto [v, i] : adj[u]){
        if (v == curr && ok1.size() == 0){
            path.push_back(i);
            ok1 = path;
        } else if (!vis[v]){
            path.push_back(i);
            dfs(v);
            path.pop_back();
        } 
    }
}

void dfs1(int u){
    v1[u] = true;
    ok[u] = path;
    for (auto [v, i] : adj[u]){
        if (!v1[v]){
            dep[v] = dep[u] + 1;
            path.push_back(i);
            dfs1(v);
            path.pop_back();
        }
    }
}

void add(vector <int> &a, vector <int> b, bool rev, int xo = 0){
    if (rev) reverse(b.begin(), b.end());
    for (auto x : b) a.push_back(x ^ xo);
}

vector <int> get(int i){
    vector <int> ans;
    int ong = 0;
    add(ans, ok[i], false);
    
    add(ans, ok1, false);
    add(ans, ok1, false, 1);
    
    add(ans, ok1, true);
    add(ans, ok1, true, 1);
    add(ans, ok[i], true);
    
    for (auto x : ans){
        if (ong != bruh[x].first) assert(false);
        ong = bruh[x].second;
        swap(bruh[x].first, bruh[x].second);
    }
    assert(ong == 0);
    
    return ans;
}

bool comp(int x, int y) {
    return dep[x] < dep[y];
}

variant<bool, vector<int>> find_journey(int nn, int m, vector<int> u, vector<int> v) {
    n = nn;
    for (int i = 0; i < m; i++){
        bruh[i] = {u[i], v[i]};
    }
    for (int i = 0; i < m; i += 2){
        adj[u[i]].push_back({v[i], i});
    }
    
    dfs1(0);
    vector <int> perm;
    for (int i = 0; i < n; i++) perm.push_back(i);
    sort(perm.begin(), perm.end(), comp);
    
    for (auto i : perm){
        if (v1[i]){
            curr = i;
            path.clear();
            //look for cycle starting and ending at i 
            //good if someone can reach curr 
            
            for (int j = 0; j < n; j++) vis[j] = false;
            dfs(i);
            if (ok1.size()) return get(i);
        }
    }
    return false;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

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

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1876 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 24 ms 5480 KB Output is correct
4 Correct 26 ms 5604 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 8 ms 2388 KB Output is correct
11 Correct 7 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 2 ms 2388 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 1620 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 2 ms 980 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 30 ms 6184 KB Output is correct
21 Correct 26 ms 5616 KB Output is correct
22 Correct 7 ms 2388 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 3 ms 2516 KB Output is correct
27 Correct 28 ms 6580 KB Output is correct
28 Correct 28 ms 6860 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 70 ms 6404 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 27 ms 6772 KB Output is correct
33 Correct 26 ms 5844 KB Output is correct
34 Correct 16 ms 5332 KB Output is correct
35 Correct 3 ms 852 KB Output is correct
36 Correct 29 ms 5968 KB Output is correct
37 Correct 30 ms 6068 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 40 ms 5076 KB Output is correct
40 Correct 2 ms 2388 KB Output is correct
41 Correct 74 ms 6404 KB Output is correct
42 Correct 28 ms 7160 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 6 ms 2388 KB Output is correct
46 Correct 13 ms 4844 KB Output is correct

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -