# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
895443 | MilosMilutinovic | Circle selection (APIO18_circle_selection) | C++14 | 3100 ms | 869544 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 N = 4e6;
int len;
vector<pair<long long, int>> vec[N];
vector<int> qv;
vector<int> mn[N];
vector<int> mx[N];
vector<int> fa[N];
vector<bool> rem[N];
void Insert(int i, pair<long long, int> v) {
for (int x = i + len; x > 0; x >>= 1) {
vec[x].push_back(v);
}
}
void Build() {
for (int x = 1; x < 2 * len; x++) {
sort(vec[x].begin(), vec[x].end());
int k = (int) vec[x].size();
mn[x] = vector<int>(k);
mx[x] = vector<int>(k);
fa[x] = vector<int>(k);
rem[x] = vector<bool>(k);
iota(mn[x].begin(), mn[x].end(), 0);
iota(mx[x].begin(), mx[x].end(), 0);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |