# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731344 | ogibogi2004 | Holiday (IOI14_holiday) | C++14 | 235 ms | 32596 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<bits/stdc++.h>
using namespace std;
const int MAXN=2e5+5e4+6;
const int INF=2e9;
int att[MAXN];
int low[MAXN],high[MAXN],n1,start1,d1;
priority_queue<int> pq;
int cur_sum;
int fr[MAXN],ansr[MAXN];
int fl[MAXN],ansl[MAXN];
//start1 will be in left
int what_to_check[MAXN];
struct node
{
int cnt_cities;
int sum;
};
struct segment_tree
{
node tree[4*MAXN];
void init()
{
for(int j=0;j<4*MAXN;j++)
{
tree[j].cnt_cities=0;
tree[j].sum=0;
}
}
void update(int l,int r,int idx,int pos,int val)
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... |