oj.uz

Submission #826388

# Submission time Handle Problem Language Result Execution time Memory
826388 2023-08-15T14:01:30 Z alvingogo Thousands Islands (IOI22_islands) C++17
24 / 100
 30 ms 4820 KB 
#include "islands.h"
#include <bits/stdc++.h>
#include <variant>
#define fs first
#define sc second
using namespace std;

vector<vector<pair<int,int> > > e;
vector<int> dep,fa;
vector<int> ans;
int dfs(int r,int f){
    dep[r]=dep[f]+1;
    fa[r]=f;
    for(auto h:e[r]){
        if(dep[h.fs]==-1){
            if(dfs(h.fs,r)){
                return 1;
            }
        }
        else if(dep[h.fs]>=0){
            vector<int> bz;
            for(int i=0;i!=h.fs;){
                for(auto w:e[i]){
                    if(dep[w.fs]==dep[i]+1){
                        bz.push_back(w.sc);
                        i=w.fs;
                        break;
                    }
                }
            }
            vector<int> cz,dz;
            for(int i=h.fs;i!=r;){
                for(auto w:e[i]){
                    if(dep[w.fs]==dep[i]+1){
                        cz.push_back(w.sc);
                        dz.push_back(w.sc+1);
                        i=w.fs;
                        break;
                    }
                }
            }
            cz.push_back(h.sc);
            dz.push_back(h.sc+1);
            ans.insert(ans.end(),bz.begin(),bz.end());
            ans.insert(ans.end(),cz.begin(),cz.end());
            ans.insert(ans.end(),dz.begin(),dz.end());
            reverse(bz.begin(),bz.end());
            reverse(cz.begin(),cz.end());
            reverse(dz.begin(),dz.end());
            ans.insert(ans.end(),cz.begin(),cz.end());
            ans.insert(ans.end(),dz.begin(),dz.end());
            ans.insert(ans.end(),bz.begin(),bz.end());
            return 1;
        }
    }
    dep[r]=-2;
    return 0;
}
variant<bool, vector<int>> find_journey(
    int n, int m, vector<int> u, vector<int> v) {
    e.resize(n);
    fa.resize(n);
    dep.resize(n,-1);
    for(int i=0;i<m;i+=2){
        e[u[i]].push_back({v[i],i});
    }
    if(!dfs(0,0)){
        return false;
    }
    return ans;
}

Subtask #1
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 #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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Partially correct 0 ms 212 KB Output is partially correct
5 Correct 1 ms 468 KB Output is correct
6 Partially correct 1 ms 212 KB Output is partially correct
7 Correct 0 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 0 ms 212 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 22 ms 4024 KB Output is correct
4 Correct 24 ms 4148 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 424 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 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 25 ms 4560 KB Output is correct
21 Correct 23 ms 4144 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 340 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 26 ms 4564 KB Output is correct
28 Correct 24 ms 4472 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 26 ms 4816 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 23 ms 4396 KB Output is correct
33 Correct 23 ms 4396 KB Output is correct
34 Correct 13 ms 2372 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 21 ms 3744 KB Output is correct
37 Correct 30 ms 4564 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 20 ms 3816 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 26 ms 4820 KB Output is correct
42 Correct 24 ms 4564 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 11 ms 2132 KB Output is correct

Subtask #5
0.0 / 45.0

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