# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710767 | Jarif_Rahman | Thousands Islands (IOI22_islands) | C++17 | 536 ms | 52356 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>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
int n, m;
vector<int> U, V;
vector<vector<int>> initial_graph, initial_graph_r;
vector<bool> reachable;
vector<set<int>> in(n), out(n);
set<pair<int, int>> st;
void dfs_reachability(int nd){
if(reachable[nd]) return;
reachable[nd] = 1;
for(int x: initial_graph[nd]) dfs_reachability(x);
}
void remove_node(int nd){
st.erase({out[nd].size(), nd});
for(int i: in[nd]){
st.erase({out[U[i]].size(), U[i]});
out[U[i]].erase(i);
st.insert({out[U[i]].size(), U[i]});
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... |