# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
441889 | rainboy | Teleporters (IOI08_teleporters) | C11 | 736 ms | 37512 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <stdio.h>
#include <string.h>
#define N 1000000
#define X 2000000
int main() {
static int xx[N * 2], ii[N * 2], pp[N * 2], cc[N * 2], kk[X + 1];
static char visited[N * 2];
int n, n_, m, h, i, c, x, ans;
scanf("%d%d", &n, &m);
for (i = 0; i < n * 2; i++) {
scanf("%d", &xx[i]);
kk[xx[i]]++;
}
for (x = 1; x <= X; x++)
kk[x] += kk[x - 1];
for (i = 0; i < n * 2; i++)
ii[kk[xx[i] - 1]++] = i;
for (h = 0; h < n * 2; h++)
pp[ii[h]] = h + 1 == n * 2 ? -1 : ii[h + 1] ^ 1;
ans = 0;
for (i = ii[0] ^ 1; i != -1; i = pp[i])
visited[i] = 1, ans++;
memset(kk, 0, (n * 2 + 1) * sizeof *kk);
for (i = 0; i < n * 2; i++)
if (!visited[i]) {
c = 0;
while (!visited[i]) {
visited[i] = 1, c++;
i = pp[i];
}
kk[c]++;
while (visited[i] == 1) {
visited[i] = 2;
i = pp[i];
}
}
n_ = 0;
for (c = n * 2; c >= 1; c--)
while (kk[c]--)
cc[n_++] = c;
for (i = 0; i < n_ && i < m; i++)
ans += cc[i];
ans += m * 2 - (m > n_ ? (m - n_) % 2 : 0);
printf("%d\n", ans);
return 0;
}
컴파일 시 표준 에러 (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... |