oj.uz

Submission #244033

# Submission time Handle Problem Language Result Execution time Memory
244033 2020-07-02T13:35:30 Z PeppaPig Rail (IOI14_rail) C++14
100 / 100
 118 ms 5372 KB 
#include "rail.h"
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 5e3 + 5;
const int M = 1e6 + 5;

int chk[M];
map<pii, int> mp;

int get_dist(int a, int b) {
    if(mp.count(pii(a, b))) return mp[pii(a, b)];
    return mp[pii(a, b)] = getDistance(a, b);
}

void findLocation(int n, int first, int location[], int stype[]) {
    chk[location[0] = first] = stype[0] = 1;

    int mn = 1e9, A = -1;
    for(int i = 1; i < n; i++) if(get_dist(0, i) < mn)
        mn = get_dist(0, i), A = i;
    chk[location[A] = first + get_dist(0, A)] = stype[A] = 2;
    mp[pii(A, 0)] = mp[pii(0, A)];

    vector<int> L, R;
    for(int i = 1; i < n; i++) if(i != A) {
        if(get_dist(0, i) - get_dist(0, A) == get_dist(A, i))
            L.emplace_back(i);
        else R.emplace_back(i);
    }
    sort(L.begin(), L.end(), [&](int a, int b) {
        return get_dist(A, a) < get_dist(A, b);
    });
    sort(R.begin(), R.end(), [&](int a, int b) {
        return get_dist(0, a) < get_dist(0, b);
    });

    int pv = 0;
    for(int i : L) {
        if(chk[location[pv] + (get_dist(A, pv) + get_dist(pv, i) - get_dist(A, i)) / 2] == 1)
            chk[location[i] = location[pv] + get_dist(pv, i)] = stype[i] = 2;
        else chk[location[i] = location[A] - get_dist(A, i)] = stype[i] = 1, pv = i;
    }
    pv = A;
    for(int i : R) {
        if(chk[location[pv] - (get_dist(0, pv) + get_dist(pv, i) - get_dist(0, i)) / 2] == 2)
            chk[location[i] = location[pv] - get_dist(pv, i)] = stype[i] = 1;
        else chk[location[i] = location[0] + get_dist(0, i)] = stype[i] = 2, pv = i;
    }
}

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 5112 KB Output is correct
2 Correct 116 ms 5088 KB Output is correct
3 Correct 110 ms 5368 KB Output is correct
4 Correct 115 ms 5240 KB Output is correct
5 Correct 116 ms 5244 KB Output is correct
6 Correct 114 ms 5112 KB Output is correct
7 Correct 113 ms 5112 KB Output is correct
8 Correct 111 ms 5148 KB Output is correct
9 Correct 114 ms 5112 KB Output is correct
10 Correct 111 ms 5368 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 4984 KB Output is correct
2 Correct 112 ms 5172 KB Output is correct
3 Correct 112 ms 5240 KB Output is correct
4 Correct 113 ms 5240 KB Output is correct
5 Correct 109 ms 5240 KB Output is correct
6 Correct 114 ms 5240 KB Output is correct
7 Correct 118 ms 5112 KB Output is correct
8 Correct 114 ms 5112 KB Output is correct
9 Correct 115 ms 5244 KB Output is correct
10 Correct 112 ms 5252 KB Output is correct
11 Correct 115 ms 5112 KB Output is correct
12 Correct 115 ms 5240 KB Output is correct
13 Correct 114 ms 5124 KB Output is correct
14 Correct 114 ms 5240 KB Output is correct
15 Correct 111 ms 5120 KB Output is correct
16 Correct 113 ms 5344 KB Output is correct
17 Correct 112 ms 5240 KB Output is correct
18 Correct 111 ms 5240 KB Output is correct
19 Correct 112 ms 5372 KB Output is correct
20 Correct 112 ms 5112 KB Output is correct