# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
884455 | cabbit | Cake 3 (JOI19_cake3) | C++14 | 597 ms | 17528 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 <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#define SIZE 200005
#define BT 256*1024*2
#define INF 1000000000000000LL
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
typedef pair <P,P> PP;
vector <P> vx;
struct segtree
{
ll seg[BT];
int cnt[BT];
int mum;
void init(int n)
{
mum=1;
while(mum<n) mum<<=1;
for(int i=0;i<mum*2;i++) seg[i]=0,cnt[i]=0;
}
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... |