oj.uz

Submission #770275

# Submission time Handle Problem Language Result Execution time Memory
770275 2023-07-01T04:21:26 Z horiiseun Ferries (NOI13_ferries) C++17
40 / 40
 155 ms 18824 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

int n, m;
vector<int> costs[100005], adj[100005];
ll dist[100005];
bool seen[100005];
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for (int i = 0, a, b, c; i < m; i++) {
		cin >> a >> b >> c;
		costs[a].push_back(c);
		adj[b].push_back(a);
	}

	for (int i = 0; i < 100005; i++) {
		sort(costs[i].begin(), costs[i].end());
	}
	fill(dist, dist + 100005, 1e18);
	dist[n] = 0;
	pq.push({0, n});

	while (!pq.empty()) {
		int curr = pq.top().s;
		pq.pop();

		if (seen[curr]) continue;
		seen[curr] = true;
		for (int i : adj[curr]) {
			if (dist[curr] + costs[i].back() < dist[i]) {
				dist[i] = dist[curr] + costs[i].back();
				pq.push({dist[i], i});
			}
			costs[i].pop_back();
		}
	}
	
	cout << dist[1] << "\n";

}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 5844 KB Output is correct
3 Correct 9 ms 7088 KB Output is correct
4 Correct 71 ms 17980 KB Output is correct
5 Correct 70 ms 17980 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5788 KB Output is correct
2 Correct 3 ms 5844 KB Output is correct
3 Correct 12 ms 7084 KB Output is correct
4 Correct 36 ms 11900 KB Output is correct
5 Correct 62 ms 14372 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6868 KB Output is correct
2 Correct 12 ms 6856 KB Output is correct
3 Correct 107 ms 17584 KB Output is correct
4 Correct 127 ms 17892 KB Output is correct
5 Correct 145 ms 17252 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 17576 KB Output is correct
2 Correct 110 ms 17616 KB Output is correct
3 Correct 124 ms 18748 KB Output is correct
4 Correct 155 ms 18824 KB Output is correct
5 Correct 120 ms 18676 KB Output is correct