# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766501 | MetalPower | Passport (JOI23_passport) | C++14 | 419 ms | 41404 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 pii pair<int, int>
#define fi first
#define se second
const int INF = 1e9 + 7;
const int MX = 2e5 + 10;
int N, Q, l[MX], r[MX], dist[MX][4];
bool vis[MX];
struct segtree{
vector<int> st[MX << 1];
void reset(){
for(int i = 0; i < (MX << 1); i++) st[i].clear();
}
void upd(int l, int r, int v){
for(l += MX, r += MX + 1; l < r; l >>= 1, r >>= 1){
if(l & 1){
st[l].push_back(v);
l++;
}
if(r & 1){
--r;
st[r].push_back(v);
}
# | 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... |