Submission #182612

#	Time	Username	Problem	Language	Result	Execution time	Memory
182612		tri	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	826 ms	88476 KiB

crocodile

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

typedef pair<pl, int> state;

#define pb push_back
#define f first
#define s second

namespace debug {
    const int DEBUG = true;

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x);

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x);

    template<class T>
    void pr(const vector<T> &x);

    template<class T>
    void pr(const set<T> &x);

    template<class T1, class T2>
    void pr(const map<T1, T2> &x);

    template<class T>
    void pr(const T &x) { if (DEBUG) cout << x; }

    template<class T, class... Ts>
    void pr(const T &first, const Ts &... rest) { pr(first), pr(rest...); }

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }

    template<class T>
    void prIn(const T &x) {
        pr("{");
        bool fst = 1;
        for (auto &a : x) {
            pr(fst ? "" : ", ", a), fst = 0;
        }
        pr("}");
    }

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x) { prIn(x); }

    template<class T>
    void pr(const vector<T> &x) { prIn(x); }

    template<class T>
    void pr(const set<T> &x) { prIn(x); }

    template<class T1, class T2>
    void pr(const map<T1, T2> &x) { prIn(x); }

    void ps() { pr("\n"), cout << flush; }

    template<class Arg, class... Args>
    void ps(const Arg &first, const Args &... rest) {
        pr(first, " ");
        ps(rest...);
    }
}
using namespace debug;

const int MAXN = 1e6 + 100;
const ll INF = 1e15;

int vis[MAXN];

pl bTimes[MAXN];
ll eTime[MAXN];

bool update(pl &p, int x) {
    if (x <= p.s) {
        p.f = p.s;
        p.s = x;
        return p.f != INF;
    }
    if (x <= p.f) {
        p.f = x;
        return true;
    }
    return false;
}

vector<pi> aL[MAXN];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    for (int i = 0; i < M; i++) {
        aL[R[i][0]].pb({R[i][1], L[i]});
        aL[R[i][1]].pb({R[i][0], L[i]});
    }

    priority_queue<state, vector<state>, greater<state>> queue;

    for (int i = 0; i < N; i++) {
        vis[i] = false;
        bTimes[i] = {INF, INF};
        eTime[i] = INF;
    }

    for (int i = 0; i < K; i++) {
        int cV = P[i];
        vis[cV] = true;
        eTime[cV] = 0;

        for (pi aE : aL[cV]) {
            int aV = aE.f;
            if (!vis[aV]) {
                ll nxtTime = eTime[cV] + aE.s;
                if (update(bTimes[aV], nxtTime)) {
                    queue.push({{bTimes[aV]}, aV});
                }
            }
        }
    }

    while (!queue.empty()) {
        state cState = queue.top();
        queue.pop();

        int cV = cState.s;
        if (vis[cV]) {
            continue;
        }
        vis[cV] = true;

        eTime[cV] = cState.f.f;

        for (pi aE : aL[cV]) {
            int aV = aE.f;
            if (!vis[aV]) {
                ll nxtTime = eTime[cV] + aE.s;
                if (update(bTimes[aV], nxtTime)) {
                    queue.push({{bTimes[aV]}, aV});
                }
            }
        }
    }

    return eTime[0];
}

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11