제출 #967037

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
967037		Syrius	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	32 ms	8788 KiB

cyberland

#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define ll long long
#define ff first
#define ss second
#define pint pair < int , int >
#define vint vector < int >
#define fast ios_base::sync_with_stdio(NULL); cin.tie(NULL)

const int inf = 1e9 + 9;
const int mxn = 2e5 + 2;
const int mod = 1e9 + 7;

vector < vector < pint > > adj(mxn);
int dis[mxn];

double solve(int n , int m , int k , int H , vint x , vint y , vint c , vint arr) {

	for (int i = 0; i < n; i++) {
		adj[i].clear();
		dis[i] = inf;
	}

	for (int i = 0; i < m; i++) {
		adj[x[i]].push_back({y[i] , c[i]});
		adj[y[i]].push_back({x[i] , c[i]});
	}

	priority_queue < pint > q;
	q.push({0 , 0});

	while (!q.empty()) {
		pint p = q.top();
		q.pop();
		if (dis[p.ss] != inf) continue;
		dis[p.ss] = -p.ff;
		if (p.ss == H) return dis[H];
		for (pint i : adj[p.ss]) {
			q.push({p.ff - i.ss , i.ff});
		}
	}

	return -1;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3