# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515975 | apostoldaniel854 | Distributing Candies (IOI21_candies) | C++17 | 368 ms | 43272 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;
#define dbg(x) cerr << #x << " " << x << "\n
struct node_info {
ll sum;
ll sum_max;
ll sum_min;
};
class SegTree {
private:
vector <node_info> seg;
node_info join(node_info L, node_info R) {
node_info RES;
RES.sum = L.sum + R.sum;
RES.sum_max = max(L.sum_max, R.sum_max + L.sum);
RES.sum_min = min(L.sum_min, R.sum_min + L.sum);
return RES;
}
public:
SegTree(int n) {
seg.resize(1 + 4 * n);
}
void update_pos(int node, int lb, int rb, int pos, int val) {
if (lb == rb) {
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... |