# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553122 | fuad27 | Addk (eJOI21_addk) | C++17 | 324 ms | 8012 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;
const int MAXN = 100'010;
vector<ll> fen1(MAXN, 0);
vector<ll> fen2(MAXN, 0);
void update(vector<ll> &bit, ll in, ll val)
{
while(in < MAXN)
{
bit[in]+=val;
in+=in&(-in);
}
}
long long query(vector<ll> &bit, ll in)
{
ll sum = 0;
while(in > 0)
{
sum+=bit[in];
in-=in&(-in);
}
return sum;
}
int main () {
int n, k;
cin >> n >> k;
long long arr[n+1];
//, prefix1[n+1] = {0}, prefix2[n+1] = {0};
for(int i = 1;i<=n;i++) {
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... |