# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175722 | manowo | Addk (eJOI21_addk) | C++20 | 1480 ms | 4724 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 1;
int t[4 * N], a[N];
void upd( int v, int tl, int tr, int pos )
{
if( tl == tr )
{
t[v] = a[tl];
return;
}
int m = (tl + tr) / 2;
if( pos <= m )
upd(v + v, tl, m, pos);
else
upd(v + v + 1, m + 1, tr, pos);
t[v] = t[v + v] + t[v + v + 1];
}
int get( int v, int tl, int tr, int l, int r )
{
if( l > tr || tl > r )
return 0;
if( l <= tl && tr <= r )
return t[v];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |