# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108038 | dragonslayerit | Cake 3 (JOI19_cake3) | C++14 | 918 ms | 17220 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 <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <cassert>
#include <set>
#include <stdint.h>
#include <map>
const int64_t INF=1e15+7;
std::vector<std::pair<int,int> > cake;
int cps[200005];
int N,M;
const int MAXN=1<<18;
struct Node{
int cnt;
int64_t sum;
Node():cnt(0),sum(0){
}
}st[MAXN*2];
void st_add(int i,int c,int64_t v){
//printf("st_add(%d,%d,%ld)\n",i,c,v);
for(i+=MAXN;i>0;i>>=1){
st[i].cnt+=c;
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... |