Submission #518988

#	Time	Username	Problem	Language	Result	Execution time	Memory
518988		sudheerays123	Ferries (NOI13_ferries)	C++17	0 / 40	329 ms	65536 KiB

ferries

#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define tc ll test;cin >> test;while(test--)
#define vi vector<ll>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define INF 1e18
#define MOD 1000000007
#define ff first
#define ss second
#define in >>
#define out <<
#define space << " " <<
#define spacef << " "
#define fo(i,a,b) for(ll i = a; i <= b; i++)
#define nextline out "\n"
#define print(x) for(auto i : x ) cout out i spacef
#define mmax(x,i) x = max(x,i)
#define mmin(x,i) x = min(x,i)
#define N 105

int main() {
    
    fast;
 
    ll n,m;
    cin in n in m;
 
	vi radj[n+5];
	map<ll,multiset<ll>> weight;
 
    fo(i,1,m){
        ll a,b,c;
        cin in a in b in c;
 
		radj[b].pb(a);
		weight[a].insert(c);
    }

	vi dist(N,INF);
	priority_queue<pll> q;

	q.push(mp(0,n));
	dist[n] = 0;

	while(!q.empty()){

		ll a = q.top().second;
		q.pop();

		for(auto u : radj[a]){

			ll maxi = *(weight[u].rbegin());

			if(dist[a]+maxi < dist[u]){
				dist[u] = dist[a]+maxi;
				q.push(mp(-dist[u],u));

			}
			
			weight[u].erase(*(weight[u].rbegin()));
		}
	}	

	cout out dist[1];

    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12