oj.uz

Submission #533502

# Submission time Handle Problem Language Result Execution time Memory
533502 2022-03-06T08:17:35 Z Slavita Autobus (COCI22_autobus) C++14
55 / 70
 1000 ms 13684 KB 
#include <bits/stdc++.h>
#pragma optimize("O3")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 1e2 + 228;
const int big = 1e9 + 228;
const ll llbig = 1e18 + 228;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
ll n, m, ans, k, q, dp[N][N][N], mem[N][N];

void upd(ll &a, ll b){
    if (b < a) a = b;
}

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> m;
    for (int i = 1; i <= m; i++){
        ll a, b, t;
        cin >> a >> b >> t;
        if (mem[a][b] == 0) mem[a][b] = t;
        else mem[a][b] = min(mem[a][b], t);
    }
    cin >> k >> q;

    for (int start = 1; start <= n; start++){
        for (int i = 1; i <= n; i++)
            for (int j = 0; j <= n; j++) dp[start][i][j] = llbig;
        dp[start][start][0] = 0;

        for (int kol = 0; kol < k; kol++){
            for (int v = 1; v <= n; v++){
                if (dp[start][v][kol] == llbig) continue;
                for (int u = 1; u <= n; u++){
                    ll c = mem[v][u];
                    if (u == v) continue;
                    if (!c) continue;
                    upd(dp[start][u][kol + 1], dp[start][v][kol] + c);
                }
            }
        }
    }


    while(q--){
        ll start, finish;
        cin >> start >> finish;

        ll mn = llbig;
        for (int kol = 0; kol <= k; kol++){
            mn = min(mn, dp[start][finish][kol]);
        }

        if (mn == llbig) cout << -1 << en;
        else cout << mn << en;
    }
    return 0;
}

Compilation message

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("O3")
      |

Subtask #1
15.0 / 15.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 13236 KB Output is correct
2 Correct 10 ms 13260 KB Output is correct
3 Correct 8 ms 13260 KB Output is correct
4 Correct 8 ms 13292 KB Output is correct
5 Correct 8 ms 13304 KB Output is correct
6 Correct 9 ms 13320 KB Output is correct
7 Correct 11 ms 13316 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 20 ms 13300 KB Output is correct
8 Correct 40 ms 13316 KB Output is correct
9 Correct 11 ms 13260 KB Output is correct
10 Correct 31 ms 13300 KB Output is correct
11 Correct 16 ms 13268 KB Output is correct
12 Correct 44 ms 13280 KB Output is correct
13 Correct 95 ms 13684 KB Output is correct
14 Correct 96 ms 13544 KB Output is correct
15 Correct 115 ms 13520 KB Output is correct
16 Correct 97 ms 13440 KB Output is correct
17 Correct 92 ms 13636 KB Output is correct
18 Correct 93 ms 13508 KB Output is correct
19 Correct 118 ms 13500 KB Output is correct
20 Correct 108 ms 13560 KB Output is correct
21 Correct 97 ms 13592 KB Output is correct
22 Correct 101 ms 13560 KB Output is correct
23 Correct 98 ms 13560 KB Output is correct
24 Correct 112 ms 13592 KB Output is correct
25 Correct 95 ms 13532 KB Output is correct
26 Correct 98 ms 13596 KB Output is correct
27 Correct 99 ms 13288 KB Output is correct
28 Correct 105 ms 13228 KB Output is correct
29 Correct 90 ms 13244 KB Output is correct
30 Correct 96 ms 13600 KB Output is correct
31 Correct 105 ms 13552 KB Output is correct
32 Correct 120 ms 13636 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 7 ms 13236 KB Output is correct
8 Correct 10 ms 13260 KB Output is correct
9 Correct 8 ms 13260 KB Output is correct
10 Correct 8 ms 13292 KB Output is correct
11 Correct 8 ms 13304 KB Output is correct
12 Correct 9 ms 13320 KB Output is correct
13 Correct 11 ms 13316 KB Output is correct
14 Correct 20 ms 13300 KB Output is correct
15 Correct 40 ms 13316 KB Output is correct
16 Correct 11 ms 13260 KB Output is correct
17 Correct 31 ms 13300 KB Output is correct
18 Correct 16 ms 13268 KB Output is correct
19 Correct 44 ms 13280 KB Output is correct
20 Correct 95 ms 13684 KB Output is correct
21 Correct 96 ms 13544 KB Output is correct
22 Correct 115 ms 13520 KB Output is correct
23 Correct 97 ms 13440 KB Output is correct
24 Correct 92 ms 13636 KB Output is correct
25 Correct 93 ms 13508 KB Output is correct
26 Correct 118 ms 13500 KB Output is correct
27 Correct 108 ms 13560 KB Output is correct
28 Correct 97 ms 13592 KB Output is correct
29 Correct 101 ms 13560 KB Output is correct
30 Correct 98 ms 13560 KB Output is correct
31 Correct 112 ms 13592 KB Output is correct
32 Correct 95 ms 13532 KB Output is correct
33 Correct 98 ms 13596 KB Output is correct
34 Correct 99 ms 13288 KB Output is correct
35 Correct 105 ms 13228 KB Output is correct
36 Correct 90 ms 13244 KB Output is correct
37 Correct 96 ms 13600 KB Output is correct
38 Correct 105 ms 13552 KB Output is correct
39 Correct 120 ms 13636 KB Output is correct
40 Correct 15 ms 13248 KB Output is correct
41 Execution timed out 1085 ms 708 KB Time limit exceeded
42 Halted 0 ms 0 KB -