Submission #594727

#	Time	Username	Problem	Language	Result	Execution time	Memory
594727		skittles1412	Rail (IOI14_rail)	C++17	30 / 100	66 ms	884 KiB

rail

#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__);
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

extern "C" int getDistance(int i, int j);

extern "C" void findLocation(int n, int first, int loc[], int type[]) {
    int dist[n];
    dist[0] = 0;
    for (int i = 1; i < n; i++) {
        dist[i] = getDistance(0, i);
    }
    int ord[n - 1];
    iota(ord, ord + n - 1, 1);
    sort(ord, ord + n - 1, [&](int a, int b) -> bool {
        return dist[a] < dist[b];
    });
    loc[0] = first;
    type[0] = 1;
    map<int, bool> m;
    auto meq = [&](int k, bool v) -> bool {
        auto it = m.find(k);
        return it != m.end() && it->second == v;
    };
    m[first] = false;
    dbg(meq(first, false));
    int l = 0, r = -1;
    for (auto& a : ord) {
        if (r == -1) {
            r = a;
            loc[a] = first + dist[a];
            type[a] = 2;
            m[loc[a]] = 2;
            continue;
        }
        int ql = getDistance(l, a), qr = getDistance(r, a);
        bool cl = false, cr = false;
        {
            int pos = loc[l] + ql, mid = loc[r] + pos - qr;
            cl = mid % 2 == 0 && meq(mid / 2, false);
        }
        {
            int pos = loc[r] - qr, mid = loc[l] + pos + ql;
            cr = mid % 2 == 0 && meq(mid / 2, true);
        }
        assert(cl + cr == 1);
        if (cl) {
            loc[a] = loc[l] + ql;
            type[a] = 2;
            if (loc[a] > loc[r]) {
                r = a;
            }
        } else {
            loc[a] = loc[r] - qr;
            type[a] = 1;
            if (loc[a] < loc[l]) {
                l = a;
            }
        }
        m[loc[a]] = type[a] == 2;
    }
    for (int i = 0; i < n; i++) {
        dbg(loc[i], type[i]);
    }
}

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44