# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600210 | Bench0310 | Teams (IOI15_teams) | C++17 | 1207 ms | 128580 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>
#include "teams.h"
using namespace std;
typedef long long ll;
const int N=500000;
int n;
vector<int> tree[4*N];
void update(int idx,int l,int r,int pos,int x)
{
tree[idx].push_back(x);
if(l<r)
{
int m=(l+r)/2;
if(pos<=m) update(2*idx,l,m,pos,x);
else update(2*idx+1,m+1,r,pos,x);
}
}
int query(int idx,int l,int r,int ql,int qr,int lim)
{
if(ql>qr) return 0;
if(l==ql&&r==qr) return (upper_bound(tree[idx].begin(),tree[idx].end(),lim)-tree[idx].begin());
int m=(l+r)/2;
return query(2*idx,l,m,ql,min(qr,m),lim)+query(2*idx+1,m+1,r,max(ql,m+1),qr,lim);
}
void init(int tn,int A[],int B[])
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... |