oj.uz

Submission #872665

# Submission time Handle Problem Language Result Execution time Memory
872665 2023-11-13T13:59:39 Z HossamHero7 Autobus (COCI22_autobus) C++14
55 / 70
 1000 ms 756 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int edge[75][75];
vector<pair<int,ll>> adj[75];
ll dp[75][75][2];
void solve(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) edge[i][j] = 1e9;
    for(int i=0;i<m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        edge[a][b] = min(edge[a][b] , c);
    }
    int cnt = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++) {
            if(edge[i][j] != 1e9) adj[i].push_back({j,edge[i][j]}) , cnt++;
        }
    }
    int k,q;
    cin>>k>>q;
    k = min(k,cnt);
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) dp[i][j][0] = (i == j ? 0 : 1e18);
    for(int rem=1;rem<=k;rem++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                dp[i][j][rem&1] = dp[i][j][rem-1&1];
                for(auto [ch,c] : adj[i]) dp[i][j][rem&1] = min(dp[ch][j][rem-1&1] + c,dp[i][j][rem&1]);
            }
        }
    }
    while(q--){
        int a,b;
        cin>>a>>b;
        cout<<(dp[a][b][k&1] == 1e18 ? -1 : dp[a][b][k&1])<<endl;
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:30:47: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   30 |                 dp[i][j][rem&1] = dp[i][j][rem-1&1];
      |                                            ~~~^~
Main.cpp:31:26: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |                 for(auto [ch,c] : adj[i]) dp[i][j][rem&1] = min(dp[ch][j][rem-1&1] + c,dp[i][j][rem&1]);
      |                          ^
Main.cpp:31:78: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   31 |                 for(auto [ch,c] : adj[i]) dp[i][j][rem&1] = min(dp[ch][j][rem-1&1] + c,dp[i][j][rem&1]);
      |                                                                           ~~~^~

Subtask #1
15.0 / 15.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 756 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 5 ms 580 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 20 ms 756 KB Output is correct
13 Correct 72 ms 596 KB Output is correct
14 Correct 72 ms 472 KB Output is correct
15 Correct 98 ms 592 KB Output is correct
16 Correct 83 ms 460 KB Output is correct
17 Correct 72 ms 600 KB Output is correct
18 Correct 70 ms 460 KB Output is correct
19 Correct 106 ms 464 KB Output is correct
20 Correct 89 ms 460 KB Output is correct
21 Correct 71 ms 720 KB Output is correct
22 Correct 77 ms 716 KB Output is correct
23 Correct 76 ms 716 KB Output is correct
24 Correct 89 ms 596 KB Output is correct
25 Correct 74 ms 592 KB Output is correct
26 Correct 79 ms 592 KB Output is correct
27 Correct 88 ms 460 KB Output is correct
28 Correct 81 ms 592 KB Output is correct
29 Correct 73 ms 460 KB Output is correct
30 Correct 81 ms 460 KB Output is correct
31 Correct 92 ms 720 KB Output is correct
32 Correct 110 ms 472 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 756 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 5 ms 580 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 5 ms 604 KB Output is correct
18 Correct 5 ms 600 KB Output is correct
19 Correct 20 ms 756 KB Output is correct
20 Correct 72 ms 596 KB Output is correct
21 Correct 72 ms 472 KB Output is correct
22 Correct 98 ms 592 KB Output is correct
23 Correct 83 ms 460 KB Output is correct
24 Correct 72 ms 600 KB Output is correct
25 Correct 70 ms 460 KB Output is correct
26 Correct 106 ms 464 KB Output is correct
27 Correct 89 ms 460 KB Output is correct
28 Correct 71 ms 720 KB Output is correct
29 Correct 77 ms 716 KB Output is correct
30 Correct 76 ms 716 KB Output is correct
31 Correct 89 ms 596 KB Output is correct
32 Correct 74 ms 592 KB Output is correct
33 Correct 79 ms 592 KB Output is correct
34 Correct 88 ms 460 KB Output is correct
35 Correct 81 ms 592 KB Output is correct
36 Correct 73 ms 460 KB Output is correct
37 Correct 81 ms 460 KB Output is correct
38 Correct 92 ms 720 KB Output is correct
39 Correct 110 ms 472 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 24 ms 600 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 124 ms 564 KB Output is correct
44 Correct 5 ms 604 KB Output is correct
45 Execution timed out 1087 ms 604 KB Time limit exceeded
46 Halted 0 ms 0 KB -