# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102202 | Pajaraja | Examination (JOI19_examination) | C++17 | 1035 ms | 28840 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>
#define MAXN 1000007
using namespace std;
int n,q,bit[2*MAXN],qx[MAXN],qy[MAXN],qxy[MAXN],x[MAXN],y[MAXN],a[MAXN],b[MAXN],c[MAXN],d[MAXN],sol[MAXN],ans[MAXN];
bool t[MAXN];
pair<int,int> r[2*MAXN];
pair<pair<int,int>,int> l[2*MAXN];
void upd(int x) {while(x<2*MAXN) {bit[x]++; x+=(x&-x);} }
int val(int x)
{
int s=0;
while(x)
{
s+=bit[x];
x-=(x&-x);
}
return s;
}
map<int,int> m;
void calc1()
{
for(int i=0;i<n;i++) r[i]=make_pair(a[i],1);
for(int i=0;i<q;i++) r[n+i]=make_pair(b[i],-i);
sort(r,r+n+q);
int cnt=0;
for(int i=0;i<n+q;i++)
{
if(r[i].second==1) cnt++;
else sol[-r[i].second]=cnt;
}
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... |