oj.uz

Submission #1004811

# Submission time Handle Problem Language Result Execution time Memory
1004811 2024-06-21T16:47:59 Z Whisper Autobus (COCI22_autobus) C++17
70 / 70
 101 ms 9568 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = 👎 - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX_NODE        71
#define MAX_EDGE        1000005

int numNode, numEdge, numQuery, maxUse;

int dp[MAX_NODE][MAX_NODE][MAX_NODE];
int cost[MAX_NODE][MAX_NODE];


void process(void){
    cin >> numNode >> numEdge;

    memset(cost, 0x3f, sizeof(cost));

    for (int i = 1; i <= numEdge; ++i){
        int u, v, w; cin >> u >> v >> w;
        minimize(cost[u][v], w);
    }
    cin >> maxUse >> numQuery;
    memset(dp, 0x3f, sizeof dp);
    for (int i = 1; i <= numNode; ++i){
        dp[0][i][i] = 0;
    }
    for (int d = 0; d < numNode; ++d){
        FOR(u, 1, numNode) FOR(v, 1, numNode) if(dp[d][u][v] < LINF){
            FOR(x, 1, numNode) minimize(dp[d + 1][u][x], dp[d][u][v] + cost[v][x]);
        }
    }
    maxUse = min(maxUse, numNode);
    for (int i = 1; i <= numQuery; ++i){
        int u, v; cin >> u >> v;
        int ans = LINF;
        for (int d = 0; d <= maxUse; ++d) minimize(ans, dp[d][u][v]);
        cout << (ans >= INF ? -1 : ans) << '\n';
    }
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);

    process();
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3284 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 3160 KB Output is correct
2 Correct 28 ms 3312 KB Output is correct
3 Correct 28 ms 3160 KB Output is correct
4 Correct 30 ms 3164 KB Output is correct
5 Correct 29 ms 3164 KB Output is correct
6 Correct 29 ms 3368 KB Output is correct
7 Correct 30 ms 3160 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3284 KB Output is correct
7 Correct 29 ms 3164 KB Output is correct
8 Correct 29 ms 3160 KB Output is correct
9 Correct 29 ms 3164 KB Output is correct
10 Correct 29 ms 3340 KB Output is correct
11 Correct 29 ms 3160 KB Output is correct
12 Correct 32 ms 3384 KB Output is correct
13 Correct 89 ms 9312 KB Output is correct
14 Correct 87 ms 9296 KB Output is correct
15 Correct 101 ms 9300 KB Output is correct
16 Correct 88 ms 9196 KB Output is correct
17 Correct 92 ms 9296 KB Output is correct
18 Correct 90 ms 9300 KB Output is correct
19 Correct 86 ms 9300 KB Output is correct
20 Correct 86 ms 9300 KB Output is correct
21 Correct 88 ms 9556 KB Output is correct
22 Correct 99 ms 9448 KB Output is correct
23 Correct 88 ms 9552 KB Output is correct
24 Correct 88 ms 9552 KB Output is correct
25 Correct 89 ms 9568 KB Output is correct
26 Correct 90 ms 9552 KB Output is correct
27 Correct 99 ms 9556 KB Output is correct
28 Correct 90 ms 9452 KB Output is correct
29 Correct 89 ms 9192 KB Output is correct
30 Correct 89 ms 9296 KB Output is correct
31 Correct 93 ms 9192 KB Output is correct
32 Correct 90 ms 9184 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3284 KB Output is correct
7 Correct 29 ms 3160 KB Output is correct
8 Correct 28 ms 3312 KB Output is correct
9 Correct 28 ms 3160 KB Output is correct
10 Correct 30 ms 3164 KB Output is correct
11 Correct 29 ms 3164 KB Output is correct
12 Correct 29 ms 3368 KB Output is correct
13 Correct 30 ms 3160 KB Output is correct
14 Correct 29 ms 3164 KB Output is correct
15 Correct 29 ms 3160 KB Output is correct
16 Correct 29 ms 3164 KB Output is correct
17 Correct 29 ms 3340 KB Output is correct
18 Correct 29 ms 3160 KB Output is correct
19 Correct 32 ms 3384 KB Output is correct
20 Correct 89 ms 9312 KB Output is correct
21 Correct 87 ms 9296 KB Output is correct
22 Correct 101 ms 9300 KB Output is correct
23 Correct 88 ms 9196 KB Output is correct
24 Correct 92 ms 9296 KB Output is correct
25 Correct 90 ms 9300 KB Output is correct
26 Correct 86 ms 9300 KB Output is correct
27 Correct 86 ms 9300 KB Output is correct
28 Correct 88 ms 9556 KB Output is correct
29 Correct 99 ms 9448 KB Output is correct
30 Correct 88 ms 9552 KB Output is correct
31 Correct 88 ms 9552 KB Output is correct
32 Correct 89 ms 9568 KB Output is correct
33 Correct 90 ms 9552 KB Output is correct
34 Correct 99 ms 9556 KB Output is correct
35 Correct 90 ms 9452 KB Output is correct
36 Correct 89 ms 9192 KB Output is correct
37 Correct 89 ms 9296 KB Output is correct
38 Correct 93 ms 9192 KB Output is correct
39 Correct 90 ms 9184 KB Output is correct
40 Correct 28 ms 3164 KB Output is correct
41 Correct 30 ms 3164 KB Output is correct
42 Correct 28 ms 3164 KB Output is correct
43 Correct 29 ms 3164 KB Output is correct
44 Correct 29 ms 3160 KB Output is correct
45 Correct 30 ms 3160 KB Output is correct
46 Correct 88 ms 9300 KB Output is correct
47 Correct 98 ms 9300 KB Output is correct
48 Correct 87 ms 9296 KB Output is correct
49 Correct 89 ms 9296 KB Output is correct
50 Correct 90 ms 9300 KB Output is correct
51 Correct 87 ms 9300 KB Output is correct
52 Correct 87 ms 9296 KB Output is correct
53 Correct 88 ms 9308 KB Output is correct
54 Correct 100 ms 9552 KB Output is correct
55 Correct 86 ms 9552 KB Output is correct
56 Correct 90 ms 9552 KB Output is correct
57 Correct 90 ms 9564 KB Output is correct
58 Correct 89 ms 9552 KB Output is correct
59 Correct 90 ms 9564 KB Output is correct
60 Correct 91 ms 9552 KB Output is correct
61 Correct 90 ms 9556 KB Output is correct
62 Correct 90 ms 9296 KB Output is correct
63 Correct 92 ms 9300 KB Output is correct
64 Correct 86 ms 9300 KB Output is correct
65 Correct 95 ms 9300 KB Output is correct