Submission #989889

#	Time	Username	Problem	Language	Result	Execution time	Memory
989889		SN0WM4N	Crocodile's Underground City (IOI11_crocodile)	C++14	Compilation error	0 ms	0 KiB

crocodile

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sort undefined_function // To use stable_sort instead sort 
#define bpc __builtin_popcount
#define ull unsigned long long
#define ld double
#define ll long long
#define mp make_pair
#define F first
#define S second

#pragma GCC optimize("O3")

using namespace __gnu_pbds;
using namespace std;

typedef tree<long long, null_type, less_equal<long long>,
    rb_tree_tag, tree_order_statistics_node_update> Tree;

const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MOD = 1e9 + 7; //[998244353, 1e9 + 7, 1e9 + 13]
const ld PI = acos(-1);
const ll NROOT = 500;

ll binpow(ll a, ll b, ll _MOD = -1) {
	if (_MOD == -1)
		_MOD = MOD;
	ll res = 1;
	for (; b; b /= 2, a *= a, a %= _MOD)
		if (b & 1) res *= a, res %= _MOD;
	return res;
}

bool dataOverflow(ll a, ll b) {return (log10(a) + log10(b) >= 18);}
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll ceil(ll a, ll b) {return (a + b - 1) / b;}
ll invmod(ll a) {return binpow(a, MOD - 2);}

int n, m, k;
vector<int> spec;
vector<vector<pair<int, ll>>> g; 

bool cmp(pair<int, ll> a, pair<int, ll> b) {
	if (a.S == b.S)
		return a.F < b.F;
	return a.S < b.S;
}

int solve() {
	vector<int> dis1(n + 1, inf);

	using T = pair<ll, int>;
	priority_queue<T, vector<T>, greater<T>> q;

	for (auto &x : g)
		stable_sort(x.begin(), x.end(), cmp);

	for (auto &x : spec)
		q.push({0, x});

	while (!q.empty()) {
		auto [d, x] = q.top();
		q.pop();

		if (dis1[x] <= d)
			continue;
		dis1[x] = d;

		dbg(x, d);

		for (auto &y : g[x])
			q.push({d + y.S, y.F});
	}

	vector<int> dis2(n + 1, inf);

	q.push({0, 1});
	while (!q.empty()) {
		auto [d, x] = q.top();
		q.pop();

		if (dis2[x] <= d)
			continue;
		dis2[x] = d;

		vector<pair<pair<ll, ll>, pair<int, ll>>> ways;

		for (auto &y : g[x]) 
			ways.push_back({{dis1[y.F], y.S}, y});
		stable_sort(ways.begin(), ways.end());

		for (int i = 1; i < (int)ways.size(); i ++) {
			pair<int, ll> y = ways[i].S;
			q.push({d + y.S, y.F});
		}
	}

	int ans = inf;
	for (auto &x : spec) 
		ans = min(ans, dis2[x]);

	return ans;
}

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	cin >> n >> m >> k;

	g.resize(n + 1);

	for (int i = 1; i <= m; i ++) {
		int a, b, c;
		cin >> a >> b >> c;
		a ++; b ++;

		g[a].push_back({b, c});
		g[b].push_back({a, c});
	}	

	for (int i = 1; i <= k; i ++) {
		int x;
		cin >> x;
		x ++;

		spec.push_back(x);
	}

	cout << solve() << "\n";

	return 0;
}

Compilation message (stderr)

crocodile.cpp: In function 'int solve()':
crocodile.cpp:65:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   65 |   auto [d, x] = q.top();
      |        ^
crocodile.cpp:72:3: error: 'dbg' was not declared in this scope
   72 |   dbg(x, d);
      |   ^~~
crocodile.cpp:82:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   82 |   auto [d, x] = q.top();
      |        ^