# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435566 | joseacaz | Distributing Candies (IOI21_candies) | C++17 | 2604 ms | 33256 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>
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vpi = vector<pii>;
struct Node
{
int val, maxim, minim;
};
const int MAXN = (int)2e5 + 5, MAXQ = (int)2e5 + 5, INF = (1 << 30);
int N, Q;
vi c, v, ans;
vpi candy, in[MAXQ], out[MAXQ];
Node ST[4*MAXN];
int lazy[4*MAXN];
Node comb(Node a, Node b)
{
Node tmp;
tmp.val = 0;
tmp.maxim = max(a.maxim, b.maxim);
# | 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... |