# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
722775 | Mr_Husanboy | Distributing Candies (IOI21_candies) | C++17 | 1243 ms | 41968 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;
template<typename T>
int len(T &a){
return a.size();
}
const ll infl = 1e8;
struct Segtree{
struct node{
ll mx = 0, mn = 0, add = 0;
void apply(ll x){
mn += x; mx += x;
add += x;
}
};
vector<node> t;
int n;
Segtree(int _n){
n = _n;
t.resize(4 * n);
}
void push(int x){
# | 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... |