Submission #462502

#	Time	Username	Problem	Language	Result	Execution time	Memory
462502		fuad27	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	597 ms	61208 KiB

crocodile

    #include<bits/stdc++.h>
#include"crocodile.h"
    using namespace std;
    int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    	vector<vector<pair<int, int>>> adj(N);
    	for(int i = 0; i < M; i++) {
    		int u = R[i][0], v = R[i][1];
    		adj[u].emplace_back(v, L[i]);
    		adj[v].emplace_back(u, L[i]);
    	}
     
    	vector<int> visited(N);
    	priority_queue<pair<int, int>> q;
    	for(int i = 0; i < K; i++) {
    		visited[P[i]]++;
    		q.emplace(0, P[i]);
    	}
     
    	while(!q.empty()) {
    		auto [d, v] = q.top();
    		q.pop();
    		if(visited[v]++ == 1) {
    			if(v == 0) return -d;
    			for(auto &[u, w] : adj[v])
    				q.emplace(d - w, u);
    		}
    	}
	return -1; 
    }

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:20:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   20 |       auto [d, v] = q.top();
      |            ^
crocodile.cpp:24:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |        for(auto &[u, w] : adj[v])
      |                  ^

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