# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435088 | Mamnoon_Siam | Distributing Candies (IOI21_candies) | C++17 | 938 ms | 276784 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;
#define INPUT "01.in"
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second
struct Node {
Node *l = 0, *r = 0;
int lo, hi;
int m = -1, b = 0; // f : [lo, hi] --> y, f(x) = mx + b
int y_mx = 0, y_mn = 0;
Node(int _lo, int _hi) : lo(_lo), hi(_hi) {
}
void upd_set(int _m, int _b) {
m = _m, b = _b;
y_mx = m * hi + b;
y_mn = m * lo + b;
}
void upd_add(int _b) {
b += _b;
y_mx += _b;
# | 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... |