| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 915065 | boris_mihov | Candies (JOI18_candies) | C++17 | 249 ms | 18896 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 <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <set>
typedef long long llong;
const int MAXN = 200000 + 10;
const int INF = 1e9;
int n;
int a[MAXN];
llong answer[MAXN];
struct Range
{
int l, r;
llong sumActive;
llong sumIn;
friend bool operator < (const Range &a, const Range &b)
{
return a.l < b.l || (a.l == b.l && a.r < b.r);
}
};
struct Flip
{
llong add;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||