제출 #495138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495138		Ziel	Evacuation plan (IZhO18_plan)	C++17	23 / 100	502 ms	19708 KiB

plan

/**
 * LES GREATEABLES BRO TEAM
**/

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define sz(x) (int)x.size()
const bool FLAG = false;
void setIO(const string &f = "");

signed main() {
    setIO();
    
    int n, m;
    cin >> n >> m;
    vector<vector<pair<int, int>>> adj(n + 1);
    for (int i = 0, x, y, z; i < m; i++) {
    	cin >> x >> y >> z;
    	adj[x].push_back({y, z});
    	adj[y].push_back({x, z});
    }

    int k;
    cin >> k;
    vector<int> g(k + 1), d(n + 1, 1e9 + 17);
    for (int i = 1; i <= k; i++)
    	cin >> g[i];

    {
    	set<pair<int, int>> q;
    	for (int i = 1; i <= k; i++) {
    		q.insert({0, g[i]});
    		d[g[i]] = 0;
    	}
		while (sz(q)) {
			int v = q.begin()->second;
			q.erase(q.begin());

			for (auto [to, len]: adj[v]) {
				if (d[to] > d[v] + len) {
					q.erase({d[to], to});
					d[to] = d[v] + len;
					q.insert({d[to], to});
				}
			}
		}
    }

    int q;
    cin >> q;
    while (q--) {
    	int s, t;
    	cin >> s >> t;
    	cout << min(d[s], d[t]) << '\n';
    }

    
    return 0;
}

void setIO(const string &f) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen((f + ".in").c_str(), "r")) {
        freopen((f + ".in").c_str(), "r", stdin);
        freopen((f + ".out").c_str(), "w", stdout);
    }
}

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

plan.cpp: In function 'void setIO(const string&)':
plan.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         freopen((f + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:69:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         freopen((f + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 46