# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165698 | JelalTkm | Toll (APIO13_toll) | C++20 | 1000 ms | 23700 KiB |
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define int long long int
const int N = 1e5 + 10;
const int md = 1e9 + 7;
const int INF = 1e18;
class DisjointSets {
private:
vector<int> p, sz;
public:
DisjointSets(int n) : p(n), sz(n) {
for (int i = 0; i < n; i++) { p[i] = i; sz[i] = 1;}
}
int get(int u) {
return p[u] = (u == p[u] ? u : get(p[u]));
}
void init() {
for (int i = 0; i < (int) p.size(); i++) {
p[i] = i; sz[i] = 1;
}
# | 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... |