# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1149937 | heeheeheehaaw | Bridges (APIO19_bridges) | C++20 | 3094 ms | 9796 KiB |
#include <bits/stdc++.h>
using namespace std;
struct muchie
{
int a, b, id;
};
struct query
{
int tip, a, b, rez;
};
const int bsiz = 10000;
const int nmax = 100005;
muchie muc[nmax];
int val[nmax];
pair<int, int> mc[nmax];
bool aparemuc[nmax];
vector<int> adj[nmax];
query q[nmax];
int visited[nmax], pl;
bool apare[nmax];
int currval[nmax];
struct DSU
{
vector<int> parent, siz;
void init(int n)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |