제출 #599746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599746		Meloric	악어의 지하 도시 (IOI11_crocodile)	C++14	100 / 100	922 ms	75528 KiB

crocodile

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

#define pb push_back
//#define int int64_t
#define pii pair<int, int>
#define X first
#define Y second
#define all(x) (x).begin(),(x).end()
#define lb lower_bound
#define ub upper_bound

using namespace std;

void p(auto A){
	for(auto e : A)cout << e << ' ';
	cout << '\n';
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
	/*
	int n, m, k; cin >> n >> m >> k;
	vector<vector<int>>R(m, vector<int>(2));
	vector<int>L(m), P(k);
	
	for(int i = 0; i< m; i++)cin >> R[i][0] >> R[i][1] >> L[i];
	for(int i = 0; i< k; i++)cin >> P[i];
	*/
	int n = N;
	int m = M;
	int k = K;
	
	vector<vector<pii>> g(n, vector<pii>());
	for(int i = 0; i< m; i++){
		int c = R[i][0];
		int d = R[i][1];
		int w = L[i];
		g[c].pb({d, w});
		g[d].pb({c, w});
	}
	vector<int>v1(n,-1), v2(n,-1);
	priority_queue<pii> pq;
	for(int i = 0; i< k; i++){
		int c = P[i];
		v1[c] = 0;
		pq.push({0, c});
	}
	while(pq.size()){
		auto [d, u] = pq.top(); d = -d;
		pq.pop();
		if(v2[u] != -1)continue;
		if(v1[u] == -1){
			v1[u] = d;
			continue;
		}
		v2[u] = d;
		for(auto [v, w] : g[u])pq.push({-(w+d), v});
	}
    return v2[0];
}

/*
void solve(){
	cout << travel_plan();
}
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t = 1;
	//cin >> t;
	while(t--)solve();
}
*/

컴파일 시 표준 에러 (stderr) 메시지

crocodile.cpp:15:8: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   15 | void p(auto A){
      |        ^~~~
crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:49:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   49 |   auto [d, u] = pq.top(); d = -d;
      |        ^
crocodile.cpp:57:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |   for(auto [v, w] : g[u])pq.push({-(w+d), v});
      |            ^

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