# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093577 | Luvidi | Sličnost (COI23_slicnost) | C++17 | 0 ms | 600 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 ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back
const int maxn=1e5;
int n,k,q,a[maxn],b[maxn],idx[maxn];
pair<pll,ll> seg[4*maxn+31];
void build(int v,int l,int r){
seg[v]={{0,1},0};
if(l==r)return;
int m=(l+r)/2;
build(2*v+1,l,m);
build(2*v+2,m+1,r);
}
void prop(int v){
seg[2*v+1].fs.fs+=seg[v].sc;
seg[2*v+1].sc+=seg[v].sc;
seg[2*v+2].fs.fs+=seg[v].sc;
seg[2*v+2].sc+=seg[v].sc;
seg[v].sc=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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |