# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
818914 | vjudge1 | Poklon (COCI17_poklon) | C++17 | 717 ms | 48672 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>
#define pb push_back
#define ll long long
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
const int N = 1e6+7;
const int oo = 1e9+7;
int n, q;
int s[4 * N], a[N], pre[N], res[N],idx[N];
vector<pair<int, int>> v[N];
vector<int>b;
void update(int id, int l, int r, int x, int val)
{
if (l > x || r < x)
return;
if (l == r)
{
s[id] += val;
return;
}
int mid = (l + r) /2;
update(id * 2, l, mid, x, val);
update(id * 2 + 1, mid + 1, r, x, val);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |