| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1337256 | vahagng | 철로 (IOI14_rail) | C++20 | 31 ms | 588 KiB |
#include <bits/stdc++.h>
#include "rail.h"
using namespace std;
void findLocation(int n, int first, int location[], int stype[]) {
for(int i = 1; i < n; i++){
stype[i] = 2;
}
location[0] = first;
stype[0] = 1;
for (int i = 1; i < n; i++) {
int D0_i = getDistance(0, i);
int Di_0 = getDistance(i, 0);
if (Di_0 != D0_i) {
location[i] = first - Di_0;
}
else {
location[i] = first + D0_i;
}
}
}| # | 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... | ||||
