# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
749197 | beepbeepsheep | Sequence (APIO23_sequence) | C++17 | 1448 ms | 125516 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 "sequence.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
const ll maxn=5e5+5;
ll pref[maxn][2];
ll suff[maxn][2];
vector<int> adj[maxn];
struct node{
ll s,e,m,mn,mx,flag;
node *l,*r;
node(ll _s, ll _e){
s=_s,e=_e,m=(s+e)>>1,mn=0,mx=0,flag=0;
if (s!=e){
l=new node(s,m);
r=new node(m+1,e);
}
}
void prop(){
if (!flag) return;
mn+=flag;
mx+=flag;
if (s==e){
flag=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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |