제출 #484769

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484769		BackNoob	Robot (JOI21_ho_t4)	C++14	34 / 100	3083 ms	142072 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1) 
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 3e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
struct item{
	int u;
	int pre;
	ll d;
};
 
struct cmp{
	bool operator()(const item &a , const item &b)
	{
		return a.d > b.d;
	}
};
 
struct EDGE{
	int v , color , cost;
};
 
int n , m;
vector<EDGE> adj[mxN];
ll dist[mxN];
unordered_map<int , ll> dp[mxN];
int cnt[mxN];
unordered_map<int , ll> sumcost[mxN];
unordered_map<int , vector<pair<int , int>>> adjcolor[mxN]; 

void solve()
{
	cin >> n >> m;
	for(int i = 1 ; i <= m ; i++) {
		int u , v , color , cost;
		cin >> u >> v >> color >> cost;
		adj[u].pb({v , color , cost});
		adj[v].pb({u , color , cost});
		adjcolor[u][color].pb({v , cost});
		adjcolor[v][color].pb({u , cost});
		sumcost[u][color] += cost;
		sumcost[v][color] += cost;
	}
 	
	memset(dist , 0x3f , sizeof(dist));
	priority_queue <tuple <ll, int, int>, vector <tuple <ll, int, int>>, greater <tuple <ll, int, int>>> pq;
	pq.push({dist[1] = 0 , 1 , 0});
	while(!pq.empty()) {
		int u , pre;
		ll d;
		tie(d , u , pre) = pq.top();
		pq.pop();
 
		if(pre == 0 && dist[u] != d) continue;
 

		if(pre == 0) {
			for(auto it : adj[u]) {
				if(!dp[it.v].count(u) || dp[it.v][it.color] > d) {
					dp[it.v][it.color] = d;
					pq.push({d , it.v , it.color});
				}
				if(minimize(dist[it.v] , d + sumcost[u][it.color] - it.cost) == true) {
					pq.push({d + sumcost[u][it.color] - it.cost , it.v , 0});
				}
				if(minimize(dist[it.v] , d + it.cost) == true) {
					pq.push({d + it.cost , it.v , 0});
				}
			}
		}
		if(pre != 0) {
			if(pre != 0 && dp[u][pre] != d) continue;
			for(auto it : adjcolor[u][pre]) { 

				if(minimize(dist[it.fi] , d + sumcost[u][pre] - it.se) == true) {
					pq.push({d + sumcost[u][pre] - it.se , it.fi , 0});
				}
			}
		}
 
	}
	ll ans = dist[n];
	if(ans == dist[0]) cout << -1;
	else cout << ans;
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //freopen(TASK".inp" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
    
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

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