# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56477 | aquablitz11 | Teleporters (IOI08_teleporters) | C++14 | 689 ms | 66560 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;
const int N = 1000010;
int n, m;
int A[N], B[N], pos[2*N], coord[2*N], nxt[2*N], cycle[N], cc;
bool vis[2*N];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%d%d", &A[i], &B[i]);
coord[2*i+1] = A[i];
coord[2*i+2] = B[i];
}
sort(coord, coord+2*n+1);
for (int i = 0; i < 2*n+1; ++i)
pos[coord[i]] = i;
for (int i = 0; i < n; ++i) {
nxt[pos[A[i]]-1] = pos[B[i]];
nxt[pos[B[i]]-1] = pos[A[i]];
}
int ans = 0;
for (int s = 0; s < 2*n; ++s) {
if (vis[s]) continue;
for (int u = s, c = 1; ; ++c) {
vis[u] = true;
u = nxt[u];
if (vis[u]) {
cycle[cc++] = c;
break;
} else if (u == 2*n) {
ans = c;
break;
}
}
}
sort(cycle, cycle+cc);
while (m--) {
if (cc > 0) {
ans += cycle[--cc]+2;
} else {
++ans;
cycle[cc++] = 1;
}
}
printf("%d\n", ans);
return 0;
}
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... |
# | 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... |
# | 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... |
# | 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... |