Submission #492764

#	Time	Username	Problem	Language	Result	Execution time	Memory
492764		inksamurai	Alias (COCI21_alias)	C++17	50 / 70	20 ms	716 KiB

alias

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3cSpNGp ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;

int main(){
_3cSpNGp;
	int n,m;
	cin>>n>>m;
	vec(string) tmp;
	vec(tuple<string,string,int>) inp;
	rep(i,m){
		string a,b;
		int t;
		cin>>a>>b>>t;
		inp.pb({a,b,t});
		tmp.pb(a);
		tmp.pb(b);
	}
	// ~
	sort(all(tmp));
	tmp.erase(unique(all(tmp)),tmp.end());
	std::map<string,int> mp;
	rep(i,sz(tmp)) mp[tmp[i]]=i;
	const int k=sz(tmp);
	// ~
	vec(vec(pii)) adj(k);	
	rep(i,sz(inp)){
		auto [a,b,t]=inp[i];
		adj[mp[a]].pb({mp[b],t});
	}
	auto dkst=[&](int hm,int need)->int{
		vi dp(k,1e9);
		dp[hm]=0;
		priority_queue<pii,vec(pii),greater<pii>> pq;
		pq.push({0,hm});
		while(sz(pq)){
			pii p=pq.top();
			int v=p.se,cost=p.fi;
			pq.pop();
			if(dp[v]!=cost) continue;
			for(auto edge : adj[v]){
				int u=edge.fi,now=edge.se;
				if(dp[u]>now+cost){
					dp[u]=now+cost;
					pq.push({now+cost,u});
				}
			}
		}
		return dp[need];
	};
	int q;
	cin>>q;
	rep(_,q){
		string a,b;
		cin>>a>>b;
		if(mp.find(a)==mp.end() or mp.find(b)==mp.end()){
			cout<<"Roger\n";
		}else{
			int val=dkst(mp[a],mp[b]);
			if(val==1e9) cout<<"Roger\n";
			else cout<<val<<"\n";
		}
	}
//	
	return 0;
}

• Subtask 1: 50 / 70