# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
937609 | guechotjrhh | Unique Cities (JOI19_ho_t5) | C++14 | 451 ms | 51280 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<iostream>
#include<vector>
using namespace std;
#include<iostream>
#include<vector>
#include<set>
#include<stack>
using namespace std;
#define pi pair<int,int>
#define x first
#define y second
#define maxn (1<<17)
vector<int> v(2 * maxn, 1e9), l(2 * maxn), r(2 * maxn);
void bld() {
for (int i = maxn; i < 2 * maxn; i++) {
l[i] = r[i] = i - maxn;
}
for (int i = maxn - 1; i > 0; i--) {
l[i] = l[2 * i];
r[i] = r[2 * i + 1];
}
}
void up(int i, int u) {
i += maxn;
v[i] = u;
while (i >>= 1) v[i] = min(v[i << 1], v[(i << 1) + 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... |