# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
739031 | PoonYaPat | Passport (JOI23_passport) | C++14 | 837 ms | 96648 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 <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
int n,pos[200001],dis[3][1<<20];
bool vis[3][1<<20],leaf[1<<20];
vector<pii> adj[1<<20];
void build(int idx, int l, int r) {
if (l==r) {
pos[l]=idx;
leaf[idx]=true;
} else {
adj[2*idx].push_back(pii(idx,0));
adj[2*idx+1].push_back(pii(idx,0));
int mid=(l+r)/2;
build(2*idx,l,mid);
build(2*idx+1,mid+1,r);
}
}
void add(int l, int r, int idx, int x, int y, int i) {
if (x>r || y<l) return;
if (x<=l && r<=y) {
adj[idx].push_back({pos[i],1});
} else {
int mid=(l+r)/2;
add(l,mid,2*idx,x,y,i);
add(mid+1,r,2*idx+1,x,y,i);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |