Submission #593638

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
5936382022-07-11 13:06:59AlesL0 Martian DNA (BOI18_dna)C++17
100 / 100
404 ms10880 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e10;
vector <ll> T;
ll k = 1;
void build(vector <ll> a){
ll n = a.size();
while (k < n)k *= 2;
T.resize(2*k);
for (int i = 0; i < n; i++)T[i+k] = a[i];
for (int i = n; i < k; i++)T[i+k] = INF;
for (int i = k-1; i > 0; i--)T[i] = min(T[2*i], T[2*i+1]);
}
void reset(vector <ll> a){
ll n = a.size();
for (int i = 0; i < n; i++)T[i+k] = a[i];
for (int i = n; i < k; i++)T[i+k] = INF;
for (int i = k-1; i > 0; i--)T[i] = min(T[2*i], T[2*i+1]);
}
void update(ll x, ll v){
x += k; T[x] += v; x >>= 1;
for (; x; x >>= 1){
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...