# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827059 | Hanksburger | Passport (JOI23_passport) | C++17 | 2111 ms | 965952 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;
int dist[2505][2505], rdist[2505][2505], ans[200005];
vector<int> adj[200005], radj[200005];
queue<int> q;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, val;
cin >> n;
for (int i=1; i<=n; i++)
{
int l, r;
cin >> l >> r;
for (int j=l; j<=r; j++)
{
adj[i].push_back(j);
radj[j].push_back(i);
}
}
cin >> m >> val;
for (int i=1; i<=n; i++)
{
if (i!=1 && i!=n && i!=val)
continue;
for (int j=1; j<=n; j++)
dist[i][j]=1e8;
dist[i][i]=0;
# | 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... |