Submission #1153844

#	Time	Username	Problem	Language	Result	Execution time	Memory
1153844		murpyl	악어의 지하 도시 (IOI11_crocodile)	C++20	89 / 100	268 ms	46908 KiB

crocodile

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define endl "\n"
#define mp make_pair
void setIO(string name = "") {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if(sz(name)){
		freopen((name+".in").c_str(), "r", stdin); 
		freopen((name+".out").c_str(), "w", stdout);
	}
}
const int INF = 1e9;

int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
	vector<vector<pi>> adj(n);
	for (int i = 0; i < m; i++){
		adj[r[i][0]].pb({r[i][1], l[i]});
		adj[r[i][1]].pb({r[i][0], l[i]});
	}
	vector<pi> dist(n, {INF, INF});
	priority_queue<pi, vector<pi>, greater<pi>> pq;
	for (int i = 0; i < k; i++){
		pq.push({0, p[i]});
		dist[p[i]] = {0, 0};
	}
	while (!pq.empty()){
		auto [d, v] = pq.top();
		pq.pop();
		if (dist[v].second < d) continue;
		for (auto [u, w] : adj[v]){
			int new_weight = d+w;
			if (new_weight < dist[u].first){
				pq.push({dist[u].first, u});
				dist[u] = {new_weight, dist[u].first};
			}
			else if (new_weight < dist[u].second){
				pq.push({new_weight, u});
				dist[u].second = new_weight;
			}
			
		}
	}
	return dist[0].second;
}

Compilation message (stderr)

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

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