# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064255 | MarwenElarbi | Thousands Islands (IOI22_islands) | C++17 | 24 ms | 6228 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define fi first
#define se second
vector<pair<int,int>> adj[405];
std::variant<bool, std::vector<int>> find_journey(
int N, int M, std::vector<int> U, std::vector<int> V) {
vector<int> a;
vector<int> b;
for (int i = 0; i < M; ++i)
{
(U[i]==0 ? a : b).pb(i);
adj[U[i]].pb({V[i],i});
}
if(a.size()>=2&&b.size()>=1){
if(N==2) return vector<int> ({a[0],b[0],a[1],a[0],b[0],a[1]});
else{
int x=adj[0][0].fi;
int y=adj[0][1].fi;
int c,d;
for(auto u:adj[x]) if(u.fi==0) c=u.se;
for(auto u:adj[y]) if(u.fi==0) d=u.se;
return vector<int> ({adj[0][0].se,c,adj[0][1].se,d,c,adj[0][0].se,d,adj[0][1].se});
}
}
return false;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |