# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
669867 | victor_gao | Teams (IOI15_teams) | C++17 | 2221 ms | 174096 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 pii pair<int,int>
#define x first
#define y second
#define MAXN 500005
using namespace std;
pii stud[MAXN];
int n;
struct segtree{
vector<pii>seg[4*MAXN];
int out[4*MAXN];
bool era[4*MAXN];
int count(int i,int can){
int p=(upper_bound(seg[i].begin(),seg[i].end(),make_pair(can,2))-seg[i].begin())-out[i];
return max(p,0);
}
void build(int l,int r,int i){
era[i]=0; out[i]=0;
sort(seg[i].begin(),seg[i].end());
if (l==r)
return;
int mid=(l+r)>>1;
build(l,mid,2*i);
build(mid+1,r,2*i+1);
}
void add(int l,int r,int i,int p,int c){
if (l==r){
seg[i].push_back({c,0});
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... |