# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979677 | temporary1 | Passport (JOI23_passport) | C++17 | 624 ms | 78876 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;
#define f first
#define s second
vector<pair<int,int>> graph[800001];
int dist[3][800001];
int node[200001];
int max1 = 0;
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
int build(int n, int a, int b) {
if (a == b) {
max1 = max(max1,n);
return node[a] = n;
}
graph[build(2*n,a,(a+b)/2)].push_back({n,0});
graph[build(2*n+1,(a+b)/2+1,b)].push_back({n,0});
return n;
}
void upd(int n, int a, int b, int x, int y, int k) {
if (a > b || b < x || y < a)return;
if (x <= a && b <= y) {
graph[n].push_back({k,1});
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... |