# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
932235 | beepbeepsheep | Circle selection (APIO18_circle_selection) | C++17 | 1380 ms | 1048576 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;
#define ll long long
#define ii pair<ll,ll>
#define iii tuple<ll,ll,ll>
#define iiii tuple<ll,ll,ll,ll>
const ll maxn=3e5+5;
const ll mod=1e9+7;
const ll inf=1e15;
iii arr[maxn];
ll ans[maxn];
iiii ord[maxn];
struct node{
ll s,e,m,val,flag;
node *l,*r;
node(ll _s, ll _e){
s=_s,e=_e,m=(s+e)>>1,val=0,flag=inf;
l=nullptr,r=nullptr;
}
void create(){
if (l) return;
if (s==e) return;
l=new node(s,m),r=new node(m+1,e);
}
void prop(){
if (!flag) return;
val+=flag;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |