# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
720829 | lam | Thousands Islands (IOI22_islands) | C++17 | 36 ms | 6752 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>
using namespace std;
typedef pair<int,int> ii;
#define ff first
#define ss second
const int maxn = 2010;
const int maxm = 3e5+10;
int n,m;
bool ban[maxm];
bool vis[maxn];
bool check = 1;
vector <int> path;
vector <ii> adj[maxn];
int l[maxn],t[maxn],cnt;
int bridge;
void dfs(int x, int goal)
{
vis[x]=1;
if (x==goal)
{
check=1;
return;
}
for (ii i:adj[x])
{
# | 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... |