# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626652 | tabr | Distributing Candies (IOI21_candies) | C++17 | 1311 ms | 33440 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 <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
// editorial
struct segtree {
using T = pair<long long, long long>;
using F = long long;
T e() {
return make_pair((long long) 1e18, (long long) -1e18);
}
F id() {
return 0;
}
T op(T a, T b) {
a.first = min(a.first, b.first);
a.second = max(a.second, b.second);
return a;
}
T mapping(F f, T x) {
x.first += f;
# | 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... |