oj.uz

답안 #518991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518991 2022-01-25T10:06:12 Z sudheerays123 페리들 (NOI13_ferries) C++17
0 / 40
 505 ms 31516 KB 
#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+5,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]){

			if(weight[u].empty()) continue;
			
			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(maxi);
		}
	}	

	cout out dist[1];

    return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 2 ms 588 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Incorrect 12 ms 3388 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 3404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 505 ms 31516 KB Output isn't correct
2 Halted 0 ms 0 KB -