oj.uz

답안 #875978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875978 2023-11-21T01:21:19 Z Darren0724 철로 (IOI14_rail) C++17
8 / 100
 43 ms 604 KB 
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
void findLocation(int n, int first, int ans[], int type[]) {
    ans[0] = first;
    vector<int> a(n), b(n);
    type[0] = 1;
    int mn = 1e9;
    for (int i = 1; i < n; i++) {
        a[i] = getDistance(0, i);
        b[i] = getDistance(i, 0);
        if (a[i] == b[i]) {
            type[i] = 2;
            ans[i] = first + a[i];
            mn = min(mn, a[i]);
        } else {
            type[i] = 1;
        }
    }
    for (int i = 1; i < n; i++) {
        if (type[i] == 1) {
            if (a[i] > b[i]) {
                ans[i] = first - b[i];
            } else {
                ans[i] = first + a[i];
            }
        }
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 504 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 42 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -