# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31054 | zscoder | Port Facility (JOI17_port_facility) | C++14 | 4316 ms | 611436 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<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
using namespace std;
#define SIZE (1<<21)
int toz[SIZE];
class segtree
{
public:
int seg1[22][SIZE];
int seg2[22][SIZE];
int low[SIZE*2],u1[SIZE*2],u2[SIZE*2];
int x[SIZE * 2];
int pt;
void init()
{
for(int i=0;i<SIZE;i++)low[i+SIZE]=u1[i+SIZE]=u2[i+SIZE]=i;
for(int i=SIZE-1;i>=1;i--)low[i]=low[i*2],u1[i]=u1[i*2],u2[i]=u2[i*2];
}
void add1(int beg, int end)
{
int node = 1;
int lb = 0, ub = SIZE - 1;
int dep=0;
for (;;)
{
seg1[dep][u1[node]++]=end;
if (lb == ub)break;
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... |