# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059902 | AmirAli_H1 | Thousands Islands (IOI22_islands) | C++17 | 1036 ms | 25172 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.
// In the name of Allah
#include <bits/stdc++.h>
#include "islands.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define endl '\n'
#define sep ' '
#define F first
#define S second
#define Mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define len(x) ((ll) (x).size())
const int maxn = 2e5 + 7;
int n, m;
vector<pii> adj[maxn], adjr[maxn];
int mark[maxn], col[maxn], c;
vector<int> ls[maxn], vc; bool ok[maxn];
int D[maxn]; queue<int> qu;
void dfs(int v) {
mark[v] = 1;
for (auto f : adj[v]) {
int u = f.F, j = f.S;
if (!mark[u]) dfs(u);
}
vc.pb(v);
}
void dfsr(int v) {
mark[v] = 1;
col[v] = c; ls[c].pb(v);
for (auto f : adjr[v]) {
int u = f.F, j = f.S;
if (!mark[u]) dfsr(u);
}
}
void scc() {
fill(mark, mark + n, 0); vc.clear();
for (int i = 0; i < n; i++) {
if (!mark[i]) dfs(i);
}
reverse(all(vc));
fill(mark, mark + n, 0); c = 0;
for (int i : vc) {
if (!mark[i]) {
dfsr(i); c++;
}
}
}
void del(int v) {
D[v] = 0;
for (auto f : adjr[v]) {
int u = f.F, j = f.S;
D[u]--;
if (D[u] == 0) qu.push(u);
}
}
void fix_vc() {
while (!qu.empty()) {
int v = qu.front(); qu.pop();
del(v);
}
}
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++) {
int u = U[i], v = V[i]; D[u]++;
adj[u].pb(Mp(v, i)); adjr[v].pb(Mp(u, i));
}
for (int i = 0; i < n; i++) {
if (D[i] == 0) qu.push(i);
}
fix_vc();
int vx = 0;
while (D[vx] <= 1) {
if (D[vx] == 0) return false;
int ux = -1;
for (auto f : adj[vx]) {
int u = f.F, j = f.S;
if (D[u] != 0) ux = u;
}
del(vx); fix_vc();
vx = ux;
}
return true;
}
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... |