Submission #400407

#	Time	Username	Problem	Language	Result	Execution time	Memory
400407		AmineWeslati	Robot (JOI21_ho_t4)	C++14	0 / 100	3094 ms	525828 KiB

Main

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

typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define sz(v) (int)v.size()
typedef pair<ll,ll> pi;
#define fi first 
#define se second

#define FOR(i,a,b) for(int i=a; i<b; i++)



void IO(){
#ifdef LOCAL
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
#endif
}
//------------------------------------------------------//

bool ckmin(ll &x, ll y){
	if(x<=y) return 0;
	x=y; return 1; 
}

struct state{
	int v,c,w; 
};

const int MX=2e3+10;
const ll INF=1e18;
int N,M;
vector<state> adj[MX];

int main(){
	IO();

	cin>>N>>M;
	FOR(i,0,M){
		int u,v,c,w; cin>>u>>v>>c>>w; u--; v--;
		adj[u].pb(state{v,c,w});
		adj[v].pb(state{u,c,w});
	}

	ll dist[N][N][2]; 
	FOR(i,0,N) FOR(j,0,N) FOR(k,0,2) dist[i][j][k]=INF; 
	dist[0][0][1]=0;
	//dist[0][0][0]=0;
	priority_queue<pair<pi,pi>,vector<pair<pi,pi>>,greater<pair<pi,pi>>> q;
	q.push({{0,0},{0,1}});
	//q.push({{0,0},{0,0}});

	while(sz(q)){
		pair<pi,pi>cur=q.top();
		q.pop();
		int u=cur.fi.se,p=cur.se.fi,st=cur.se.se; ll d=cur.fi.fi;
		if(d>dist[u][p][st]) continue;

		//cout << p << ' ' << u << ' ' << d << endl;

		unordered_map<int,int>mp,s;
		for(auto nxt: adj[u]){
			if(st && nxt.v==p) continue;
			if(!mp.count(nxt.c)) mp[nxt.c]=0;
			mp[nxt.c]++;
			s[nxt.c]+=nxt.w;
		}

		for(auto nxt: adj[u]) if(nxt.v!=p){
			int v=nxt.v,c=nxt.c,w=nxt.w;
			if(mp[c]>1){
				if(ckmin(dist[v][u][1],d+w)) q.push({{d+w,v},{u,1}});
				if(ckmin(dist[v][u][0],d+s[c]-w)) q.push({{d+s[c]-w,v},{u,0}});
			}
			else{
				if(ckmin(dist[v][u][1],d+w)) q.push({{d+w,v},{u,1}});
				if(ckmin(dist[v][u][0],d)) q.push({{d,v},{u,0}});
			}
		}
	}

	ll ans=INF; 
	FOR(i,0,N) FOR(j,0,2) ckmin(ans,dist[N-1][i][j]);

	if(ans==INF) ans=-1;
	cout << ans << endl;
}

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