oj.uz

답안 #628843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
628843 2022-08-13T18:14:49 Z vovamr Autobus (COCI22_autobus) C++17
15 / 70
 150 ms 6484 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n, m;
	cin >> n >> m;
	ve<ve<int>> c(n,ve<int>(n,iinf));
	for (int i = 0; i < m; ++i) {
		int v, u, w;
		cin >> v >> u >> w;
		chmin(c[--v][--u], w);
	}

	ve<ve<pii>> gr(n);
	for (int v = 0; v < n; ++v) {
		for (int u = 0; u < n; ++u) {
			if (c[v][u] == iinf) continue;
			gr[v].pb({u, c[v][u]});
		}
	}

	ve<ve<ve<ll>>>dist(n,ve<ve<ll>>(n,ve<ll>(n+1,inf)));
	for (int s = 0; s < n; ++s) {
		auto &d = dist[s];
		d[s][0] = 0;
		set<pair<int,pii>> st;
		st.insert({0, {s, 0}});
		while (sz(st)) {
			auto [v, c] = st.begin()->se;
			st.erase(st.begin());
			for (auto &[to, w] : gr[v]) {
				if (d[to][c + 1] > d[v][c] + w) {
					st.erase({d[to][c + 1], {to, c + 1}});
					d[to][c + 1] = d[v][c] + w;
					st.insert({d[to][c + 1], {to, c + 1}});
				}
			}
		}
	}

	int k, q;
	cin >> k >> q;
	chmin(k, n);

	for (int s = 0; s < n; ++s) {
		for (int to = 0; to < n; ++to) {
			for (int t = 1; t <= n; ++t) {
				chmin(dist[s][to][t], dist[s][to][t - 1]);
			}
		}
	}

	while (q--) {
		int v, u;
		cin >> v >> u;
		ll ans = dist[--v][--u][k];
		if (ans == inf) ans = -1;
		cout << ans << '\n';
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 3396 KB Output is correct
2 Correct 147 ms 3308 KB Output is correct
3 Correct 136 ms 3308 KB Output is correct
4 Runtime error 7 ms 6484 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 145 ms 3468 KB Output is correct
8 Correct 150 ms 3408 KB Output is correct
9 Runtime error 7 ms 6484 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 142 ms 3396 KB Output is correct
8 Correct 147 ms 3308 KB Output is correct
9 Correct 136 ms 3308 KB Output is correct
10 Runtime error 7 ms 6484 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -