oj.uz

Submission #698626

# Submission time Handle Problem Language Result Execution time Memory
698626 2023-02-14T05:43:57 Z Filya Autobus (COCI22_autobus) C++14
70 / 70
 156 ms 6820 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
const int N = 75;
int a[N];
vpi gr[N];
ll ans[N][N], newans[N][N];
ll n, m, k, q, x, y, l;

int main() {
    fastio;
    cin >> n >> m;
    for(x = 1; x <= n; x++) {
        for(y = 1; y <= n; y++) {
            if(x == y) continue;
            ans[x][y] = 1e18;
        }
    }
    fri(m) {
        cin >> x >> y >> l;
        ans[x][y] = min(ans[x][y], l);
    }
    for(x = 1; x <= n; x++) {
        for(y = 1; y <= n; y++) {
            if(x == y) continue;
            if(ans[x][y] != 1e18)
                gr[y].pb({x, ans[x][y]});
        }
    }
    cin >> k >> q;
    frr(2, min(n + 1, k + 1)) {
        for(x = 1; x <= n; x++) {
            for(y = 1; y <= n; y++) {
                newans[x][y] = ans[x][y];
            }
        }
        for(x = 1; x <= n; x++) {
            for(y = 1; y <= n; y++) {
                if(x == y) continue;
                for(auto z : gr[y]) {
                    newans[x][y] = min(newans[x][y], ans[x][z.ff] + z.ss);
                }
            }
        }
        for(x = 1; x <= n; x++) {
            for(y = 1; y <= n; y++) {
                ans[x][y] = newans[x][y];
            }
        }
    }
    while(q--) {
        cin >> x >> y;
        if(ans[x][y] == 1e18) cout << -1 << '\n';
        else cout << ans[x][y] << '\n';
    }
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 456 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 6 ms 472 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 15 ms 548 KB Output is correct
13 Correct 97 ms 3680 KB Output is correct
14 Correct 93 ms 3660 KB Output is correct
15 Correct 156 ms 3572 KB Output is correct
16 Correct 113 ms 3652 KB Output is correct
17 Correct 109 ms 3660 KB Output is correct
18 Correct 93 ms 3660 KB Output is correct
19 Correct 117 ms 3584 KB Output is correct
20 Correct 105 ms 3656 KB Output is correct
21 Correct 90 ms 3632 KB Output is correct
22 Correct 99 ms 3644 KB Output is correct
23 Correct 100 ms 3692 KB Output is correct
24 Correct 105 ms 3804 KB Output is correct
25 Correct 94 ms 3588 KB Output is correct
26 Correct 103 ms 3768 KB Output is correct
27 Correct 109 ms 3628 KB Output is correct
28 Correct 94 ms 3600 KB Output is correct
29 Correct 91 ms 3660 KB Output is correct
30 Correct 96 ms 3668 KB Output is correct
31 Correct 102 ms 3736 KB Output is correct
32 Correct 121 ms 3640 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 480 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 3 ms 456 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 5 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 6 ms 472 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 15 ms 548 KB Output is correct
20 Correct 97 ms 3680 KB Output is correct
21 Correct 93 ms 3660 KB Output is correct
22 Correct 156 ms 3572 KB Output is correct
23 Correct 113 ms 3652 KB Output is correct
24 Correct 109 ms 3660 KB Output is correct
25 Correct 93 ms 3660 KB Output is correct
26 Correct 117 ms 3584 KB Output is correct
27 Correct 105 ms 3656 KB Output is correct
28 Correct 90 ms 3632 KB Output is correct
29 Correct 99 ms 3644 KB Output is correct
30 Correct 100 ms 3692 KB Output is correct
31 Correct 105 ms 3804 KB Output is correct
32 Correct 94 ms 3588 KB Output is correct
33 Correct 103 ms 3768 KB Output is correct
34 Correct 109 ms 3628 KB Output is correct
35 Correct 94 ms 3600 KB Output is correct
36 Correct 91 ms 3660 KB Output is correct
37 Correct 96 ms 3668 KB Output is correct
38 Correct 102 ms 3736 KB Output is correct
39 Correct 121 ms 3640 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 5 ms 468 KB Output is correct
42 Correct 3 ms 468 KB Output is correct
43 Correct 9 ms 468 KB Output is correct
44 Correct 6 ms 560 KB Output is correct
45 Correct 23 ms 472 KB Output is correct
46 Correct 90 ms 6604 KB Output is correct
47 Correct 98 ms 6612 KB Output is correct
48 Correct 92 ms 6604 KB Output is correct
49 Correct 117 ms 6620 KB Output is correct
50 Correct 86 ms 6688 KB Output is correct
51 Correct 93 ms 6696 KB Output is correct
52 Correct 86 ms 6620 KB Output is correct
53 Correct 115 ms 6604 KB Output is correct
54 Correct 90 ms 6732 KB Output is correct
55 Correct 87 ms 6736 KB Output is correct
56 Correct 129 ms 6732 KB Output is correct
57 Correct 135 ms 6732 KB Output is correct
58 Correct 92 ms 6752 KB Output is correct
59 Correct 99 ms 6740 KB Output is correct
60 Correct 119 ms 6752 KB Output is correct
61 Correct 124 ms 6820 KB Output is correct
62 Correct 91 ms 6476 KB Output is correct
63 Correct 97 ms 6492 KB Output is correct
64 Correct 125 ms 6476 KB Output is correct
65 Correct 117 ms 6464 KB Output is correct