Submission #1247555

#TimeUsernameProblemLanguageResultExecution timeMemory
1247555ereringThousands Islands (IOI22_islands)C++20
0 / 100
12 ms24136 KiB
#include <bits/stdc++.h> #include "islands.h" using namespace std; #define pb push_back const int MAXN=1000+5; vector<int> adj[MAXN][MAXN]; vector<int> path; bool dfs(int node,int par){ for(int j=0;j<MAXN;j++){ if(j==par)continue; if(adj[j][node].size()>0){ path.pb(adj[node][j][0]); path.pb(adj[j][node][0]); path.pb(adj[node][j][1]); path.pb(adj[node][j][0]); path.pb(adj[j][node][0]); path.pb(adj[node][j][1]); return 1; } } for(int j=0;j<MAXN;j++){ if(j==par)continue; if(adj[node][j].size()>0){ path.pb(adj[node][j][0]); bool flag=dfs(j,node); if(flag){ path.pb(adj[node][j][0]); return 1; } else path.pop_back(); } } return 0; } variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { for(int i=0;i<M;i++){ adj[U[i]][V[i]].pb(i); } bool flag=dfs(0,-1); if(!flag)return false; return path; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...