# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696603 | SanguineChameleon | Autobus (COCI22_autobus) | C++17 | 177 ms | 10024 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// BEGIN BOILERPLATE CODE
#include <bits/stdc++.h>
using namespace std;
#ifdef KAMIRULEZ
const bool kami_loc = true;
const long long kami_seed = 69420;
#else
const bool kami_loc = false;
const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);
long long rand_range(long long rmin, long long rmax) {
uniform_int_distribution<long long> rdist(rmin, rmax);
return rdist(kami_gen);
}
long double rand_real(long double rmin, long double rmax) {
uniform_real_distribution<long double> rdist(rmin, rmax);
return rdist(kami_gen);
}
void file_io(string fi, string fo) {
if (fi != "" && (!kami_loc || fi == kami_fi)) {
freopen(fi.c_str(), "r", stdin);
}
if (fo != "" && (!kami_loc || fo == kami_fo)) {
freopen(fo.c_str(), "w", stdout);
}
}
void set_up() {
if (kami_loc) {
file_io(kami_fi, kami_fo);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void just_do_it();
void just_exec_it() {
if (kami_loc) {
auto pstart = chrono::steady_clock::now();
just_do_it();
auto pend = chrono::steady_clock::now();
long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
string bar(50, '=');
cout << '\n' << bar << '\n';
cout << "Time: " << ptime << " ms" << '\n';
}
else {
just_do_it();
}
}
int main() {
set_up();
just_exec_it();
return 0;
}
// END BOILERPLATE CODE
// BEGIN MAIN CODE
const long long inf = 1e18L + 20;
const int ms = 75;
long long dp[ms][ms][ms];
void just_do_it() {
fill_n(&dp[0][0][0], ms * ms * ms, inf);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
dp[i][i][0] = 0;
}
for (int i = 0; i < m; i++) {
int u, v;
long long w;
cin >> u >> v >> w;
dp[u][v][1] = min(dp[u][v][1], w);
}
for (int k = 1; k <= n; k++) {
for (int u = 1; u <= n; u++) {
for (int v = 1; v <= n; v++) {
dp[u][v][k] = min(dp[u][v][k], dp[u][v][k - 1]);
for (int x = 1; x <= n; x++) {
dp[u][v][k] = min(dp[u][v][k], dp[u][x][k - 1] + dp[x][v][1]);
}
}
}
}
int K, Q;
cin >> K >> Q;
K = min(K, n);
for (int i = 0; i < Q; i++) {
int u, v;
cin >> u >> v;
long long res = dp[u][v][K];
if (res == inf) {
cout << -1 << '\n';
}
else {
cout << res << '\n';
}
}
}
// END MAIN CODE
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |