Submission #769944

#	Time	Username	Problem	Language	Result	Execution time	Memory
769944		adrilen	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	890 ms	123572 KiB

crocodile

#include "crocodile.h"
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using arr = array<ll, 2>;
using arrr = array<ll, 3>;

constexpr int maxn = 2e5;

basic_string <arr> adj[maxn];

int visited[maxn] = { 0 };

ll val[maxn] = { 0 };
 


int travel_plan(int n, int m, int R[][2], int L[], int k, int P[])
{
    for (int i = 0; i < m; i++) {
        adj[R[i][0]].push_back({R[i][1], L[i]});
        adj[R[i][1]].push_back({R[i][0], L[i]});
    }  

    priority_queue<arr, vector<arr>, greater<arr>> pq;

    for (int i = 0; i < k; i++) 
    {
        visited[P[i]] = 1;
        pq.emplace(arr{0, P[i]});
    }

    arr p;
    ll pos, value;
    while (!pq.empty())
    {
        p = pq.top();
        pq.pop();
        pos = p[1], value = p[0];

        visited[pos]++;
        // cout << value << " " << pos <<" " << visited[pos]<< "\n";

        if (visited[pos] != 2) continue;

        val[pos] = value;

        for (auto i : adj[pos])
        {
            pq.emplace(arr{value + i[1], i[0]});
        }
    }

    return val[0];
}

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