# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990854 | Pacybwoah | Fish 3 (JOI24_fish3) | C++17 | 368 ms | 59320 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<iostream>
#include<algorithm>
#include<vector>
#include<utility>
using namespace std;
typedef long long ll;
struct node{
ll val=0,tag=0;
};
vector<ll> vec;
vector<node> seg;
void build(int l,int r,int ind){
if(l==r){
seg[ind].val=vec[l];
return;
}
int mid=(l+r)>>1;
build(l,mid,ind*2);
build(mid+1,r,ind*2+1);
seg[ind].val=seg[ind*2].val+seg[ind*2+1].val;
}
void push(int l,int r,int ind){
if(l==r) return;
int mid=(l+r)>>1;
seg[ind*2].val+=seg[ind].tag*(mid-l+1);
seg[ind*2+1].val+=seg[ind].tag*(r-mid);
seg[ind*2].tag+=seg[ind].tag;
seg[ind*2+1].tag+=seg[ind].tag;
seg[ind].tag=0;
}
# | 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... |