Submission #531003

#	Time	Username	Problem	Language	Result	Execution time	Memory
531003		mat50013	Crocodile's Underground City (IOI11_crocodile)	C++11	89 / 100	510 ms	47648 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int MAX_N(100005);
vector<pair<int, int> > G[MAX_N + 5];
ll distF[MAX_N + 5], distS[MAX_N + 5];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    for(int i = 0; i < M; ++i)
        G[R[i][0]].push_back({R[i][1], L[i]}), G[R[i][1]].push_back({R[i][0], L[i]});
    for(int i = 0; i < N; ++i)
        distF[i] = 1e9 + 5, distS[i] = 1e9 + 5;
    priority_queue<pair<ll, int>, vector<pair<ll, int> > , greater<pair<ll, int> > > q;
    for(int i = 0; i < K; ++i)
    {
        distF[P[i]] = distS[P[i]] = 0;
        q.push({0, P[i]});
    }
    while(!q.empty())
    {
        int nd = q.top().second;
        ll dist = q.top().first;
        q.pop();
        if(distS[nd] < dist)
            continue;
        for(auto it: G[nd])
            if(distF[it.first] == 1e9 + 5)
                distF[it.first] = dist + it.second;
            else if(distS[it.first] == 1e9 + 5 || dist + it.second < distS[it.first]){
                distS[it.first] = dist + it.second;
                if(distF[it.first] > distS[it.first])
                    swap(distF[it.first], distS[it.first]);
                q.push({distS[it.first], it.first});
            }
    }
    return distS[0];
}

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