Submission #979889

#	Time	Username	Problem	Language	Result	Execution time	Memory
979889		SmuggingSpun	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	414 ms	37664 KiB

crocodile

#include "crocodile.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
struct Data{
	int vertex;
	pair<int, int>value;
	Data(int vertex, pair<ll, ll>value){
		this->vertex = vertex;
		this->value = value;
	}
	friend bool operator <(const Data a, const Data b){
		return a.value.second > b.value.second;
	}
};
template<class T>bool minimize(T& a, T b){
	if(a > b){
		a = b;
		return true;
	}
	return false;
}
const int lim = 1e5 + 5;
int travel_plan(int n, int m, int R[][2], int L[], int k, int P[]){
	vector<vector<int>>e(n);
	vector<pair<int, int>>dp(n, make_pair(INF, INF));
	for(int i = 0; i < m; i++){
		e[R[i][0]].emplace_back(i);
		e[R[i][1]].emplace_back(i);
	}
	priority_queue<Data>pq;
	for(int i = 0; i < k; i++){
		pq.emplace(P[i], dp[P[i]] = make_pair(0, 0));
	}
	while(!pq.empty()){
		auto [u, W] = pq.top();
		pq.pop();
		if(W == dp[u]){
			for(int i = 0; i < e[u].size(); i++){
				int v = R[e[u][i]][0] ^ R[e[u][i]][1] ^ u, w = W.second + L[e[u][i]];
				if(minimize(dp[v], make_pair(w, dp[v].first)) || minimize(dp[v], make_pair(dp[v].first, w))){
					pq.emplace(v, dp[v]);
				}
			}
		}
	}
	return dp[0].second;
}

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:37:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   37 |   auto [u, W] = pq.top();
      |        ^
crocodile.cpp:40:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |    for(int i = 0; i < e[u].size(); i++){
      |                   ~~^~~~~~~~~~~~~

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