# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1219453 | sleepntsheep | Portal (BOI24_portal) | C11 | 0 ms | 328 KiB |
#include <stdio.h>
#include <stdlib.h>
#define N 200000
int n, x[N], y[N];
int main() {
puts("-1");return 0;
scanf("%d", &n);
if (n == 1) {
puts("-1");
return 0;
}
for (int i = 0; i < n; ++i)
scanf("%d%d", x + i, y + i);
printf("%d\n", abs(x[0] - x[1]) + abs(y[0] - y[1]));
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... |