# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148132 | WhipppedCream | Holiday (IOI14_holiday) | C++17 | 125 ms | 65540 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.
//Power Of Ninja Go
#include <bits/stdc++.h>
#include "holiday.h"
using namespace std;
typedef long long ll; typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vii vector< ii >
#define pb push_back
int *arr, N, st, D;
int cnt = 0;
struct node
{
ll v;
int v2;
node *left, *right;
node(ll a, int a2, node *b, node *c)
{
v = a; v2 = a2;
left = b; right = c;
}
node* update(int L, int R, int x, int dx)
{
//printf("%d %d %d\n", L, R, x);
if(L> x || R< x) return this;
if(L == x && x == R)
{
cnt++;
return new node(this->v+dx, this->v2+1, NULL, NULL);
# | 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... |