제출 #526655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526655		LucaDantas	Robot (JOI21_ho_t4)	C++17	100 / 100	1644 ms	114936 KiB

Main

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

constexpr int maxn = 2e5+10;

struct Edge { int a, b, c, p; } edges[maxn];

vector<pair<int,int>> g[maxn];

map<pair<int,int>, long long> dp;
set<pair<int,int>> mark;

map<int, vector<pair<int,int>>> viz[maxn];
map<int,long long> soma[maxn];

priority_queue<pair<long long,pair<int,int>>> q;

inline void add(const pair<int,int>& p, long long val) { if(!dp.count(p) || val < dp[p]) dp[p] = val, q.push({-val, p}); }

void dijkstra() {
	dp[{1,0}] = 0;

	// dp[index][cor]
	q.push({0, {1,0}});

	while(q.size()) {
		auto [u, cor] = q.top().second;
		long long val = -q.top().first; q.pop();

		if(mark.count({u, cor})) continue;
		mark.insert({u, cor});

		if(!cor) {
			for(auto [v, id] : g[u]) {
				int c = edges[id].c, p = edges[id].p;
				add({v, c}, val);
				add({v, 0}, min(val + soma[u][c] - p, val + p));
			}
		} else {
			vector<pair<int,int>>& adj = viz[u][cor];
			for(auto [v, p] : adj)
				add({v, 0}, val + soma[u][cor] - p);
		}
	}
}

int main() {
	int n, m; scanf("%d %d", &n, &m);
	for(int i = 0, a, b, c, p; i < m; i++) {
		scanf("%d %d %d %d", &a, &b, &c, &p), edges[i] = {a, b, c, p};
		g[a].push_back({b, i}), g[b].push_back({a, i});
		viz[a][c].push_back({b, p});
		viz[b][c].push_back({a, p});
		soma[a][c] += p;
		soma[b][c] += p;
	}
	dijkstra();
	printf("%lld\n", dp.count({n, 0}) ? dp[{n, 0}] : -1);
}

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

Main.cpp: In function 'int main()':
Main.cpp:48:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  int n, m; scanf("%d %d", &n, &m);
      |            ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |   scanf("%d %d %d %d", &a, &b, &c, &p), edges[i] = {a, b, c, p};
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 34 / 34
• Subtask 2: 24 / 24
• Subtask 3: 42 / 42