# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
429071 | 2021-06-15T17:09:42 Z | _ani | 철로 (IOI14_rail) | C++17 | 88 ms | 488 KB |
#include "rail.h" #include <iostream> #include <algorithm> void findLocation(int N, int first, int location[], int stype[]) { location[0] = first; stype[0] = 1; int mi = 500002, mii; for (int i = 1; i < N; i++) { int dist = getDistance(0, i); if (dist < mi) { mi = dist; mii = i; } } location[mii] = first + mi; stype[mii] = 2; for (int i = 1; i < N; i++) if (i != mii) { int dist = getDistance(i, mii); if (dist == getDistance(i, 0) + mi) { location[i] = first + getDistance(i, 0); stype[i] = 2; } else { location[i] = mii - dist; stype[i] = 1; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 372 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 372 KB | Output is correct |
7 | Correct | 1 ms | 332 KB | Output is correct |
8 | Correct | 1 ms | 332 KB | Output is correct |
9 | Correct | 1 ms | 332 KB | Output is correct |
10 | Correct | 1 ms | 332 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 86 ms | 460 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 88 ms | 488 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |