# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966259 | AkibAzmain | Distributing Candies (IOI21_candies) | C++17 | 579 ms | 49072 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 "candies.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll sts = 1;
vector < ll > pf;
vector < pair < ll, ll > > stn, stx;
void
pfa (ll i, ll x)
{
while (i < pf.size ())
{
pf[i] += x;
i += (i + 1) & -(i + 1);
}
}
ll
pfs (ll i)
{
ll sum = 0;
while (i >= 0)
{
sum += pf[i];
i -= (i + 1) & -(i + 1);
}
return sum;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |