# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
682654 | benson1029 | Examination (JOI19_examination) | C++14 | 734 ms | 103772 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;
struct entry{
int op;
int a,b,c;
int id;
};
bool cmpa(entry x, entry y) {
if(x.a == y.a) return x.op < y.op;
return x.a > y.a;
}
bool cmpb(entry x, entry y) {
if(x.b == y.b) return x.op < y.op;
return x.b > y.b;
}
struct node{
int v;
node *l, *r;
node(): v(0), l(NULL), r(NULL) {}
};
entry a[200005];
entry b[200005];
int ans[200005];
pair<int,int> c[200005];
int n,q;
int w,x,y;
void upd(node *x, long long l, long long r, int pos) {
if(l == r) {
x->v++;
} else {
# | 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... |