#include "islands.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
const int M=2e5+5;
int n,m;
vector<pair<int,int>> adj[N];
vector<int> path;
bool vis[N],vis2[N];
int dfs(int u){
if(vis2[u])return u;
if(vis[u])return -1;
vis[u]=vis2[u]=true;
for(auto [v,id]:adj[u]){
path.emplace_back(id);
int res=dfs(v);
if(res!=-1)return res;
path.pop_back();
}
vis2[u]=false;
return -1;
}
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+=2)adj[U[i]].emplace_back(V[i],i);
int res=dfs(0);
if(res==-1)return false;
auto ans=path;
vector<int> path2;
stack<int> rev;
int cur=0;
bool ok=false;
for(auto i:path){
if(cur==res)ok=true;
if(!ok){
rev.emplace(i);
}else{
path2.emplace_back(i);
}
cur=V[i];
}
for(auto i:path2){
ans.emplace_back(i+1);
}
reverse(path2.begin(),path2.end());
for(auto i:path2){
ans.emplace_back(i);
}
for(auto i:path2){
ans.emplace_back(i+1);
}
while(!rev.empty()){
ans.emplace_back(rev.top());
rev.pop();
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
2908 KB |
Output is partially correct |
2 |
Correct |
1 ms |
2648 KB |
Output is correct |
3 |
Correct |
1 ms |
2652 KB |
Output is correct |
4 |
Partially correct |
1 ms |
2652 KB |
Output is partially correct |
5 |
Correct |
1 ms |
2904 KB |
Output is correct |
6 |
Partially correct |
1 ms |
2652 KB |
Output is partially correct |
7 |
Correct |
1 ms |
2652 KB |
Output is correct |
8 |
Incorrect |
1 ms |
2904 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2816 KB |
Output is correct |
2 |
Correct |
1 ms |
2908 KB |
Output is correct |
3 |
Correct |
23 ms |
7532 KB |
Output is correct |
4 |
Correct |
29 ms |
7788 KB |
Output is correct |
5 |
Correct |
3 ms |
2908 KB |
Output is correct |
6 |
Correct |
2 ms |
2908 KB |
Output is correct |
7 |
Correct |
1 ms |
2652 KB |
Output is correct |
8 |
Correct |
1 ms |
2812 KB |
Output is correct |
9 |
Correct |
1 ms |
2652 KB |
Output is correct |
10 |
Correct |
2 ms |
2908 KB |
Output is correct |
11 |
Correct |
2 ms |
2868 KB |
Output is correct |
12 |
Correct |
2 ms |
2824 KB |
Output is correct |
13 |
Correct |
2 ms |
2908 KB |
Output is correct |
14 |
Correct |
2 ms |
2908 KB |
Output is correct |
15 |
Correct |
2 ms |
2908 KB |
Output is correct |
16 |
Correct |
1 ms |
2652 KB |
Output is correct |
17 |
Correct |
1 ms |
2648 KB |
Output is correct |
18 |
Correct |
1 ms |
2824 KB |
Output is correct |
19 |
Correct |
2 ms |
2652 KB |
Output is correct |
20 |
Correct |
36 ms |
8080 KB |
Output is correct |
21 |
Correct |
25 ms |
8048 KB |
Output is correct |
22 |
Correct |
1 ms |
2908 KB |
Output is correct |
23 |
Correct |
2 ms |
2652 KB |
Output is correct |
24 |
Correct |
1 ms |
2648 KB |
Output is correct |
25 |
Correct |
1 ms |
2652 KB |
Output is correct |
26 |
Correct |
2 ms |
2904 KB |
Output is correct |
27 |
Correct |
31 ms |
8276 KB |
Output is correct |
28 |
Correct |
33 ms |
8252 KB |
Output is correct |
29 |
Correct |
1 ms |
2652 KB |
Output is correct |
30 |
Correct |
27 ms |
8796 KB |
Output is correct |
31 |
Correct |
2 ms |
2648 KB |
Output is correct |
32 |
Correct |
25 ms |
8284 KB |
Output is correct |
33 |
Correct |
27 ms |
7760 KB |
Output is correct |
34 |
Correct |
14 ms |
5636 KB |
Output is correct |
35 |
Correct |
2 ms |
2908 KB |
Output is correct |
36 |
Correct |
23 ms |
7516 KB |
Output is correct |
37 |
Correct |
26 ms |
8516 KB |
Output is correct |
38 |
Correct |
1 ms |
2652 KB |
Output is correct |
39 |
Correct |
21 ms |
7260 KB |
Output is correct |
40 |
Correct |
2 ms |
2908 KB |
Output is correct |
41 |
Correct |
28 ms |
8844 KB |
Output is correct |
42 |
Correct |
26 ms |
8256 KB |
Output is correct |
43 |
Correct |
1 ms |
2652 KB |
Output is correct |
44 |
Correct |
2 ms |
2776 KB |
Output is correct |
45 |
Correct |
2 ms |
2824 KB |
Output is correct |
46 |
Correct |
14 ms |
5212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |