oj.uz

답안 #519275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
519275 2022-01-26T07:05:13 Z sudheerays123 페리들 (NOI13_ferries) C++17
40 / 40
 226 ms 21628 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];
	vi weight[n+5];
 
    fo(i,1,m){
        ll a,b,c;
        cin in a in b in c;
 
		radj[b].pb(a);
		weight[a].pb(c);
    }

	fo(i,1,n) sort(weight[i].begin(),weight[i].end());

	vi dist(n+5,INF);
	priority_queue<pll> q;
	vector<bool> visited(n+5,false);

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

	while(!q.empty()){

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

		if(visited[a]) continue;
		visited[a] = true;

		for(auto u : radj[a]){

			ll maxi = weight[u].back();

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

	cout out dist[1];

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 8 ms 2208 KB Output is correct
4 Correct 104 ms 18304 KB Output is correct
5 Correct 101 ms 18208 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 8 ms 2224 KB Output is correct
4 Correct 55 ms 9512 KB Output is correct
5 Correct 88 ms 14488 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 2224 KB Output is correct
2 Correct 14 ms 2176 KB Output is correct
3 Correct 188 ms 20456 KB Output is correct
4 Correct 215 ms 20808 KB Output is correct
5 Correct 207 ms 20052 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 18120 KB Output is correct
2 Correct 202 ms 20392 KB Output is correct
3 Correct 226 ms 21576 KB Output is correct
4 Correct 226 ms 21628 KB Output is correct
5 Correct 219 ms 21604 KB Output is correct