Submission #402572

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
4025722021-05-12 00:56:53Talha_TakiIndex (COCI21_index)C++17
110 / 110
1244 ms137276 KiB
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
struct Vertex {
Vertex *l, *r;
int cnt;
Vertex(int val) : l(nullptr), r(nullptr), cnt(val) {}
Vertex(Vertex* l, Vertex* r) : l(l), r(r), cnt(0) {
if (l) cnt += l->cnt;
if (r) cnt += r->cnt;
}
};
struct persistenSegmentTree {
Vertex* build(int l, int r) {
if (l == r) return new Vertex(0);
int mid = (l+r)>>1;
return new Vertex(build(l, mid), build(mid+1, r));
}
Vertex* update(Vertex* v, int l, int r, const int val) {
if (l == r) return new Vertex(v->cnt+1);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...