# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625203 | QwertyPi | New Home (APIO18_new_home) | C++14 | 4959 ms | 459472 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>
const int N = 300013;
using namespace std;
struct Store{
int x, ty, a, b;
};
struct Query{
int t, ty, x, id;
};
struct Pair{
Pair() = default;
Pair(int _x, int _y, int _d) : x(_x), y(_y), d(_d){};
int x, y, d;
};
struct DS{
vector<int> sp[N], bits[N];
string name;
DS() = default;
DS(string _n) : name(_n){}
void insert(Pair p){
int x = p.x + 1, y = p.y + 1;
for(int i = x; i < N; i += i & -i){
sp[i].push_back(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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |