oj.uz

Submission #379930

# Submission time Handle Problem Language Result Execution time Memory
379930 2021-03-19T17:54:12 Z SavicS Ferries (NOI13_ferries) C++14
40 / 40
 300 ms 19824 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#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 rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, m;

vector<int> g[maxn];
vector<ll> cost[maxn];

ll dist[maxn];
void dij(int s){
	ff(i,1,n)dist[i] = inf;
	priority_queue<pii, vector<pii>, greater<pii>> pq;
	pq.push({dist[s] = 0, s});
	while(!pq.empty()){
		pii v = pq.top(); pq.pop();
		if(dist[v.se] < v.fi)continue;
		for(auto u : g[v.se]){
			ll w = cost[u].back(); cost[u].pop_back();
			if(dist[u] > v.fi + w){
				dist[u] = v.fi + w;
				pq.push({dist[u], u});
			}
		}
	}
}

int main()
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
	cin >> n >> m;
	ff(i,1,m){
		int u, v;
		ll w;
		cin >> u >> v >> w;
		g[v].pb(u);
		cost[u].pb(w);
	}
	ff(i,1,n)sort(all(cost[i]));
	dij(n);
	cout << dist[1] << endl;
    return 0;
}
/**

4 5
1 2 2
2 4 2
1 3 10
3 4 7
1 4 7

// probati bojenje sahovski ili slicno

**/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5248 KB Output is correct
3 Correct 13 ms 6400 KB Output is correct
4 Correct 116 ms 17760 KB Output is correct
5 Correct 117 ms 17760 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 13 ms 6264 KB Output is correct
4 Correct 56 ms 11364 KB Output is correct
5 Correct 106 ms 14316 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 6508 KB Output is correct
2 Correct 18 ms 6380 KB Output is correct
3 Correct 242 ms 19052 KB Output is correct
4 Correct 276 ms 19308 KB Output is correct
5 Correct 283 ms 18540 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 19308 KB Output is correct
2 Correct 241 ms 19052 KB Output is correct
3 Correct 300 ms 19692 KB Output is correct
4 Correct 265 ms 19696 KB Output is correct
5 Correct 290 ms 19824 KB Output is correct