oj.uz

Submission #536432

# Submission time Handle Problem Language Result Execution time Memory
536432 2022-03-13T09:52:17 Z KoD Rail (IOI14_rail) C++17
100 / 100
 87 ms 844 KB 
#include "rail.h"
#include <bits/stdc++.h>

using std::vector;
using std::pair;

void findLocation(int N, int first, int location[], int stype[]) {
    vector<pair<int, int>> list(N - 1);
    for (int i = 1; i < N; ++i) {
        list[i - 1] = {getDistance(0, i), i};
    }
    std::sort(list.begin(), list.end());
    location[0] = first;
    stype[0] = 1;
    int L = 0, R = list[0].second;
    location[R] = location[0] + list[0].first;
    stype[R] = 2;
    std::map<int, int> map;
    map[location[L]] = 1;
    map[location[R]] = 2;
    for (int i = 1; i < N - 1; ++i) {
        const auto& [d0, id] = list[i];
        const int dL = getDistance(L, id);
        const int dR = getDistance(R, id);
        const int m = (dL - dR + location[L] + location[R]) / 2;
        if (const auto itr = map.find(m); (itr == map.end() and m > location[0]) or (itr != map.end() and itr->second == 1)) {
            location[id] = location[L] + dL;
            stype[id] = 2;
            if (location[R] < location[id]) {
                R = id;
            }
        } else {
            location[id] = location[R] - dR;
            stype[id] = 1;
            if (location[L] > location[id]) {
                L = id;
            }
        }
        map[location[id]] = stype[id];
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 712 KB Output is correct
2 Correct 73 ms 660 KB Output is correct
3 Correct 73 ms 772 KB Output is correct
4 Correct 82 ms 760 KB Output is correct
5 Correct 79 ms 776 KB Output is correct
6 Correct 69 ms 756 KB Output is correct
7 Correct 87 ms 772 KB Output is correct
8 Correct 71 ms 760 KB Output is correct
9 Correct 73 ms 756 KB Output is correct
10 Correct 73 ms 756 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 724 KB Output is correct
2 Correct 77 ms 752 KB Output is correct
3 Correct 73 ms 760 KB Output is correct
4 Correct 71 ms 772 KB Output is correct
5 Correct 73 ms 772 KB Output is correct
6 Correct 74 ms 752 KB Output is correct
7 Correct 75 ms 764 KB Output is correct
8 Correct 69 ms 776 KB Output is correct
9 Correct 77 ms 716 KB Output is correct
10 Correct 78 ms 760 KB Output is correct
11 Correct 80 ms 760 KB Output is correct
12 Correct 70 ms 772 KB Output is correct
13 Correct 69 ms 764 KB Output is correct
14 Correct 74 ms 716 KB Output is correct
15 Correct 76 ms 844 KB Output is correct
16 Correct 72 ms 768 KB Output is correct
17 Correct 69 ms 768 KB Output is correct
18 Correct 75 ms 776 KB Output is correct
19 Correct 74 ms 760 KB Output is correct
20 Correct 74 ms 752 KB Output is correct