# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1000898 | 0pt1mus23 | Monkey and Apple-trees (IZhO12_apple) | C++14 | 217 ms | 100692 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.
#pragma GCC optimize("O3", "inline")
#include <bits/stdc++.h>
using namespace std;
#define ins insert
#define pb push_back
// #define int long long int
#define pii pair<int, int>
#define endl '\n'
#define drop(x) cout<<(x)<<endl; goto bitir;
#define all(x) x.begin(),x.end()
const int mod = 1e9 +7,
sze = 8*1e6 +10;
// inf = 2e18,
// prime = 4567896467;
int L[sze];
int R[sze];
int nxt =1;
int T[sze];
int Laz[sze];
void push(int node,int l,int r){
// cout<<l<<" -> "<<r<<" pushlayiram"<<endl;
if(Laz[node]){
// cout<<l<<":"<<r<<" node:"<< node<<endl;
T[node]= r-l+1;
// cout<<"val "<<T[node]<<endl;
if(l!=r){
if(!L[node]){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |