Submission #860525

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
8605252023-10-13 07:40:49VicBVicDeda (COCI17_deda)C++17
140 / 140
94 ms4632 KiB
#include <bits/stdc++.h>
using namespace std;
const int MN= 2e5+5;
const int MV= 1e9+5;
int arb[MN*4];
int n,m;
void update(int nod, int st, int dr, int poz, int val)
{
if(st==dr)
{
//cerr<<"here "<<nod<<','<<poz<<' '<<dr<<'\n';
arb[nod]=val;
return;
}
int mid=(st+dr)/2;
if(poz<=mid) update(nod*2, st, mid, poz, val);
else update(nod*2+1, mid+1, dr, poz, val);
arb[nod]=min(arb[nod*2], arb[nod*2+1]);
}
int query(int nod, int st, int dr, int qst, int val)
{
if(dr<qst) return dr+1;
if(qst<=st && arb[nod]>val)
{
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...