# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
144672 | TadijaSebez | Examination (JOI19_examination) | C++11 | 748 ms | 12604 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;
const int N=200050;
int a[N],b[N],c[N],t[N],p[N];
int cdq1[N],cdq2[N],tmp[N],ans[N];
void CDQ2D(int id[], int l, int r)
{
if(l>=r) return;
int mid=l+r>>1;
CDQ2D(id,l,mid);CDQ2D(id,mid+1,r);
int i=l,j=mid+1,k=l;
int sum=0;
while(k<=r)
{
if(j>r || (i<=mid && c[id[i]]>=c[id[j]]))
{
if(t[id[i]]==0 && p[id[i]]==0) sum++;
tmp[k++]=id[i++];
}
else
{
if(t[id[j]]==1 && p[id[j]]==1) ans[id[j]]+=sum;
tmp[k++]=id[j++];
}
}
for(int z=l;z<=r;z++) id[z]=tmp[z];
}
void CDQ1D(int id[], int l, int r)
{
if(l>=r) return;
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... |