# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1004384 | PenguinsAreCute | Flooding Wall (BOI24_wall) | C++17 | 2568 ms | 99964 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;
const int HALF = 5e8 + 4;
vector<int> disc;
struct seg {
int n, h; vector<int> v, lazy;
seg(int _n): n(_n), h(64-__builtin_clzll(_n)), lazy(2*_n,1), v(2*_n) {
for(int i=0;i<n;i++) v[i+n]=disc[i+1]-disc[i];
for(int i=n;i--;) {v[i]=v[i<<1]+v[i<<1|1]; if(v[i]>=MOD) v[i]-=MOD;}
}
void calc(int x) {v[x]=(v[x<<1]+v[x<<1|1])*lazy[x]%MOD;}
void app(int x, int k) {
(v[x]*=k)%=MOD;
if(x<n) (lazy[x]*=k)%=MOD;
}
void push(int x) {
int s=h;
for(x+=n;s;s--) {
int i=x>>s;
app(i<<1,lazy[i]);
app(i<<1|1,lazy[i]);
lazy[i]=1;
}
}
void build(int x) {for(x+=n;x>>=1;) calc(x);}
void up(int x, int y, int m) {
push(x); push(y-1);
int x0 = x, y0 = y;
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... |