# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257727 | Bruteforceman | Sweeping (JOI20_sweeping) | C++11 | 18122 ms | 986784 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;
const int maxm = 1.5e6 + 10;
int X[maxm], Y[maxm];
pair <int, int> ans[maxm];
int n;
struct info {
int t, p;
int idx;
info () {}
};
info index(int i) {
info x;
x.t = 4;
x.idx = i;
return x;
}
struct ds {
map <int, int> par, value;
map <int, vector <int>> cont;
priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> Q;
ds () {}
int root(int x) {
if(par[x] == x) return x;
return par[x] = root(par[x]);
}
void joinIdx(int x, int y) {
x = root(x);
y = root(y);
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... |