# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
735187 | arnold518 | Passport (JOI23_passport) | C++17 | 514 ms | 62324 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 long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e6;
int N, Q;
pii A[MAXN+10];
vector<int> adj[MAXN+10];
int init(int node, int tl, int tr)
{
if(tl==tr) return tl;
int mid=tl+tr>>1;
adj[init(node*2, tl, mid)].push_back(node+N);
adj[init(node*2+1, mid+1, tr)].push_back(node+N);
return node+N;
}
void query(int node, int tl, int tr, int l, int r, int k)
{
if(r<tl || tr<l) return;
if(l<=tl && tr<=r)
{
if(tl==tr) adj[tl].push_back(k);
else adj[node+N].push_back(k);
return;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |