# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
812537 | andrei_boaca | Thousands Islands (IOI22_islands) | C++17 | 66 ms | 36172 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 <variant>
#include <vector>
//#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
struct date
{
int nod,a,b;
};
vector<date> muchii[100005];
vector<int> c[1005][1005];
bool useedge[300005],usenod[300005];
int n,m;
bool good=0;
void dfs(int nod)
{
if(muchii[nod].size()>=3)
good=1;
usenod[nod]=1;
for(date i:muchii[nod])
if(!usenod[i.nod])
dfs(i.nod);
}
std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V)
{
n=N;
m=M;
for(int i=0;i<m;i++)
{
int a=U[i];
int b=V[i];
c[a][b].push_back(i);
}
if(n==2)
{
if(c[0][1].size()>=2&&c[1][0].size()>=1)
{
int A=c[1][0][0];
int B=c[0][1][0];
int C=c[0][1][1];
vector<int> sol={B,A,C,B,A,C};
return sol;
}
return false;
}
for(int a=0;a<n;a++)
for(int b=0;b<n;b++)
if(a!=b)
{
for(int i=0;i<c[a][b].size()&&i<c[b][a].size();i++)
{
int x=c[a][b][i];
int y=c[b][a][i];
muchii[a].push_back({b,x,y});
}
}
if(muchii[0].size()>=2)
return true;
dfs(0);
return good;
}
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... |