# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1022040 | huutuan | Flooding Wall (BOI24_wall) | C++14 | 3851 ms | 237212 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 int long long
const int mod=1e9+7, N=1e6+10;
int power2[N], invpower2[N];
struct Node{
int len, l, r, lr, lazyl, lazyr;
Node (){
len=lazyl=lazyr=0;
l=r=lr=0;
}
Node operator+(const Node &b){
Node ans;
ans.len=len+b.len;
ans.l=(l+b.l)%mod;
ans.r=(r+b.r)%mod;
ans.lr=(lr+b.lr)%mod;
return ans;
}
int get_l(){
return (mod-(l-len+mod)%mod)%mod;
}
int get_r(){
return (mod-(r-len+mod)%mod)%mod;
}
int get_lr(){
# | 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... |