# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101737 | Bruteforceman | Land of the Rainbow Gold (APIO17_rainbow) | C++11 | 1713 ms | 149976 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 "rainbow.h"
#include "bits/stdc++.h"
using namespace std;
int N, M;
typedef pair <int, int> pii;
struct Container {
vector <int> t[200010 * 4];
void insert(int x, int y, int c, int b, int e) {
if(b == e) {
t[c].emplace_back(y);
return ;
}
int m = (b + e) >> 1;
int l = c << 1;
int r = l + 1;
if(x <= m) insert(x, y, l, b, m);
else insert(x, y, r, m + 1, e);
}
void build(int c, int b, int e) {
if(b == e) {
sort(t[c].begin(), t[c].end());
return ;
}
int m = (b + e) >> 1;
int l = c << 1;
int r = l + 1;
build(l, b, m);
build(r, m + 1, e);
# | 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... |