# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
793670 | vjudge1 | Passport (JOI23_passport) | C++17 | 1056 ms | 98264 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>
#define fi first
#define se second
const int N = 200200;
const int mod = 1e9 + 7;
using namespace std;
int n;
int S;
int a[N], b[N];
vector<pair<int, int>> v[4 * N];
void upd(int x, int l, int r, int tl, int tr, int g)
{
if (tl > tr) {
return;
} else if (l == tl && r == tr) {
v[x].push_back({g, 1});
return;
}
int m = (l + r) / 2;
upd(x * 2, l, m, tl, min(m, tr), g);
upd(x * 2 + 1, m + 1, r, max(m + 1, tl), tr, g);
}
void solve(vector<int> &d)
{
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... |