oj.uz

답안 #1004812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004812 2024-06-21T16:48:17 Z vjudge1 Autobus (COCI22_autobus) C++17
70 / 70
 107 ms 3412 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 = (n) - 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3160 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 3164 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 3164 KB Output is correct
2 Correct 30 ms 3160 KB Output is correct
3 Correct 28 ms 3160 KB Output is correct
4 Correct 29 ms 3164 KB Output is correct
5 Correct 30 ms 3164 KB Output is correct
6 Correct 29 ms 3164 KB Output is correct
7 Correct 29 ms 3160 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3160 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 3164 KB Output is correct
7 Correct 29 ms 3160 KB Output is correct
8 Correct 29 ms 3284 KB Output is correct
9 Correct 28 ms 3160 KB Output is correct
10 Correct 29 ms 3160 KB Output is correct
11 Correct 29 ms 3292 KB Output is correct
12 Correct 29 ms 3160 KB Output is correct
13 Correct 83 ms 3284 KB Output is correct
14 Correct 85 ms 3156 KB Output is correct
15 Correct 85 ms 3152 KB Output is correct
16 Correct 91 ms 3412 KB Output is correct
17 Correct 79 ms 3160 KB Output is correct
18 Correct 83 ms 3152 KB Output is correct
19 Correct 98 ms 3044 KB Output is correct
20 Correct 90 ms 3156 KB Output is correct
21 Correct 88 ms 3152 KB Output is correct
22 Correct 85 ms 3280 KB Output is correct
23 Correct 80 ms 3152 KB Output is correct
24 Correct 86 ms 3156 KB Output is correct
25 Correct 86 ms 3156 KB Output is correct
26 Correct 92 ms 3156 KB Output is correct
27 Correct 86 ms 3152 KB Output is correct
28 Correct 89 ms 3152 KB Output is correct
29 Correct 88 ms 3060 KB Output is correct
30 Correct 107 ms 3152 KB Output is correct
31 Correct 87 ms 3300 KB Output is correct
32 Correct 88 ms 3156 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3160 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 3164 KB Output is correct
7 Correct 30 ms 3164 KB Output is correct
8 Correct 30 ms 3160 KB Output is correct
9 Correct 28 ms 3160 KB Output is correct
10 Correct 29 ms 3164 KB Output is correct
11 Correct 30 ms 3164 KB Output is correct
12 Correct 29 ms 3164 KB Output is correct
13 Correct 29 ms 3160 KB Output is correct
14 Correct 29 ms 3160 KB Output is correct
15 Correct 29 ms 3284 KB Output is correct
16 Correct 28 ms 3160 KB Output is correct
17 Correct 29 ms 3160 KB Output is correct
18 Correct 29 ms 3292 KB Output is correct
19 Correct 29 ms 3160 KB Output is correct
20 Correct 83 ms 3284 KB Output is correct
21 Correct 85 ms 3156 KB Output is correct
22 Correct 85 ms 3152 KB Output is correct
23 Correct 91 ms 3412 KB Output is correct
24 Correct 79 ms 3160 KB Output is correct
25 Correct 83 ms 3152 KB Output is correct
26 Correct 98 ms 3044 KB Output is correct
27 Correct 90 ms 3156 KB Output is correct
28 Correct 88 ms 3152 KB Output is correct
29 Correct 85 ms 3280 KB Output is correct
30 Correct 80 ms 3152 KB Output is correct
31 Correct 86 ms 3156 KB Output is correct
32 Correct 86 ms 3156 KB Output is correct
33 Correct 92 ms 3156 KB Output is correct
34 Correct 86 ms 3152 KB Output is correct
35 Correct 89 ms 3152 KB Output is correct
36 Correct 88 ms 3060 KB Output is correct
37 Correct 107 ms 3152 KB Output is correct
38 Correct 87 ms 3300 KB Output is correct
39 Correct 88 ms 3156 KB Output is correct
40 Correct 29 ms 3164 KB Output is correct
41 Correct 29 ms 3280 KB Output is correct
42 Correct 28 ms 3160 KB Output is correct
43 Correct 29 ms 3300 KB Output is correct
44 Correct 29 ms 3160 KB Output is correct
45 Correct 28 ms 3160 KB Output is correct
46 Correct 85 ms 3156 KB Output is correct
47 Correct 85 ms 3048 KB Output is correct
48 Correct 84 ms 3160 KB Output is correct
49 Correct 86 ms 3044 KB Output is correct
50 Correct 87 ms 3064 KB Output is correct
51 Correct 80 ms 3152 KB Output is correct
52 Correct 84 ms 3156 KB Output is correct
53 Correct 86 ms 3056 KB Output is correct
54 Correct 87 ms 3156 KB Output is correct
55 Correct 86 ms 3300 KB Output is correct
56 Correct 88 ms 3156 KB Output is correct
57 Correct 87 ms 3296 KB Output is correct
58 Correct 87 ms 3156 KB Output is correct
59 Correct 92 ms 3156 KB Output is correct
60 Correct 87 ms 3156 KB Output is correct
61 Correct 88 ms 3152 KB Output is correct
62 Correct 88 ms 3156 KB Output is correct
63 Correct 100 ms 3296 KB Output is correct
64 Correct 100 ms 3156 KB Output is correct
65 Correct 88 ms 3060 KB Output is correct