# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
735152 | four_specks | Passport (JOI23_passport) | C++17 | 1055 ms | 141300 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;
namespace
{
} // namespace
void solve()
{
const long INF = LONG_MAX >> 2;
int n;
cin >> n;
int m = 1 << __lg(2 * n - 1);
vector<vector<pair<int, long>>> adj(2 * m + n);
for (int i = 1; i < m; i++)
{
adj[2 * i].emplace_back(i, 0);
adj[2 * i + 1].emplace_back(i, 0);
}
for (int i = 0; i < n; i++)
{
int l, r;
cin >> l >> r, --l;
adj[2 * m + i].emplace_back(i + m, 1);
# | 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... |