# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
957476 | Mizo_Compiler | Synchronization (JOI13_synchronization) | C++17 | 411 ms | 60308 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;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int32_t(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
const int N = 2e5+1;
int n, m, q, p[N][18], cur = 0, par[N], sz[N], idx[N];
vector<int> adj[N], edg[(1 << 19)];
vector<pair<int, int>> ed;
bool vis[int(2e5)], qr[N];
ll ans[N], tk[N];
vector<pair<int, int>> vv;
int findp(int u) {
return (par[u] == u ? u : findp(par[u]));
}
void merge(int u, int v) {
u = findp(u), v = findp(v);
if (u == v)return;
cur++;
if (sz[u] < sz[v])swap(u, v);
sz[u] += sz[v];
par[v] = u;
vv.pb({u, v});
}
# | 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... |