# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48869 | kriii | New Home (APIO18_new_home) | C++17 | 4988 ms | 249688 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 <stdio.h>
#include <algorithm>
#include <functional>
#include <vector>
#include <map>
#include <set>
using namespace std;
int N,K,Q;
int C,XP[1001001];
struct query{
int y,o,x,t;
bool operator <(const query &t)const{
if (y == t.y) return o < t.o;
return y < t.y;
};
}qs[900900]; int qc;
map<int, int> make[300300];
int ans[300300];
const int non = 500000000;
const int Z = 1<<20;
map<int, int> upc[Z];
map<int, int, greater<int> > downc[Z];
int up[Z*2],down[Z*2];
void push(int v, int u, int d, bool in)
{
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... |