# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435207 | CodePlatina | Distributing Candies (IOI21_candies) | C++17 | 868 ms | 51084 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 <vector>
#include <algorithm>
#include <tuple>
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
const long long INF = (long long)8e18 + 100;
struct Node
{
long long mx, mn, up, dn, l;
Node(void) : mx(0), mn(0), up(0), dn(0), l(0) {}
}seg[808080];
void prop(int ind)
{
if(!seg[ind].l) return;
seg[ind << 1].mx += seg[ind].l;
seg[ind << 1].mn += seg[ind].l;
seg[ind << 1].l += seg[ind].l;
seg[ind << 1 | 1].mx += seg[ind].l;
seg[ind << 1 | 1].mn += seg[ind].l;
seg[ind << 1 | 1].l += seg[ind].l;
seg[ind].l = 0;
}
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... |