# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
368059 | arnold518 | Specijacija (COCI20_specijacija) | C++14 | 4093 ms | 155772 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>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e5;
int N, Q, T;
ll A[MAXN+10];
struct BIT
{
int tree[MAXN+10];
void update(int i, int k)
{
for(; i<=N+1; i+=(i&-i))
{
tree[i]+=k;
}
}
int query(int i)
{
int ret=0;
for(; i>0; i-=(i&-i))
{
ret+=tree[i];
}
return ret;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |