# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226007 | Minnakhmetov | Sweeping (JOI20_sweeping) | C++14 | 3412 ms | 445224 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 ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 2e6 + 5;
struct Q {
int t, x, y, z;
};
struct DSU {
int val[N], a[N];
vector<int> v[N];
int find_set(int x) {
return a[x] < 0 ? x : a[x];
}
int get_val(int x) {
return val[find_set(x)];
}
void reset(int x, int y) {
a[x] = -1;
val[x] = y;
v[x] = {x};
}
# | 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... |