# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124495 | EntityIT | Bridges (APIO19_bridges) | C++14 | 2339 ms | 15624 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<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
const int N = (int)5e4 + 5, M = (int)1e5 + 5, Q = M, NGU = 320;
int n, m, q, ans[Q], nE, nVec, contain[N], nContain, lst[M];
vector<int> gr[N];
bool vis[N];
struct Edge {
int u, v, d;
Edge (int _u = 0, int _v = 0, int _d = 0) : u(_u), v(_v), d(_d) {}
bool operator< (const Edge &_) const { return d > _.d; }
} edge[M], edge_[M], e[M];
vector< pair<Edge, pair<int, int> > > vecEdge;
struct Query {
int t, id, r;
Query (int _t = 0, int _id = 0, int _r = 0) : t(_t), id(_id), r(_r) {}
bool operator< (const Query &_) const { return r > _.r; }
} query[Q];
pair<Query, int> vec[NGU + 5];
struct Dsu {
int pSet[N], szSet[N];
void init () {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |