# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73594 | funcsr | Holiday (IOI14_holiday) | C++17 | 2907 ms | 66560 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 "holiday.h"
#include <vector>
#include <cassert>
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define index(x, y) (int)(lower_bound(all(x), y)-x.begin())
#define pb push_back
#define _1 first
#define _2 second
#define INF (1LL<<60)
using namespace std;
typedef pair<int, int> P;
int V=0;
const int MAX_V = (int)(18*100010);
struct SegTree;
SegTree *alloc(int n, long long v);
//#define MAX_N (1<<17)
const int MAX_N = 100001;
struct SegTree {
int num;
long long sum;
SegTree *left = NULL, *right = NULL;
SegTree(int n, long long s) : num(n), sum(s) {}
SegTree() : num(0), sum(0LL) {}
long long rsum(int n, int l=0, int r=MAX_N) {
Compilation message (stderr)
# | 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... |