oj.uz

Submission #533509

# Submission time Handle Problem Language Result Execution time Memory
533509 2022-03-06T08:20:27 Z Slavita Autobus (COCI22_autobus) C++14
70 / 70
 175 ms 13992 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;
    k = min(k, n);

    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 512 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 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 13276 KB Output is correct
2 Correct 7 ms 13260 KB Output is correct
3 Correct 7 ms 13260 KB Output is correct
4 Correct 10 ms 13260 KB Output is correct
5 Correct 9 ms 13288 KB Output is correct
6 Correct 10 ms 13260 KB Output is correct
7 Correct 11 ms 13244 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 19 ms 13260 KB Output is correct
8 Correct 42 ms 13212 KB Output is correct
9 Correct 9 ms 13260 KB Output is correct
10 Correct 32 ms 13164 KB Output is correct
11 Correct 16 ms 13264 KB Output is correct
12 Correct 50 ms 13220 KB Output is correct
13 Correct 115 ms 13160 KB Output is correct
14 Correct 101 ms 13280 KB Output is correct
15 Correct 120 ms 13168 KB Output is correct
16 Correct 105 ms 13160 KB Output is correct
17 Correct 126 ms 13252 KB Output is correct
18 Correct 91 ms 13172 KB Output is correct
19 Correct 124 ms 13276 KB Output is correct
20 Correct 111 ms 13276 KB Output is correct
21 Correct 113 ms 13212 KB Output is correct
22 Correct 114 ms 13276 KB Output is correct
23 Correct 96 ms 13288 KB Output is correct
24 Correct 111 ms 13184 KB Output is correct
25 Correct 95 ms 13196 KB Output is correct
26 Correct 109 ms 13252 KB Output is correct
27 Correct 130 ms 13160 KB Output is correct
28 Correct 108 ms 13280 KB Output is correct
29 Correct 92 ms 13280 KB Output is correct
30 Correct 107 ms 13276 KB Output is correct
31 Correct 107 ms 13280 KB Output is correct
32 Correct 126 ms 13280 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 7 ms 13276 KB Output is correct
8 Correct 7 ms 13260 KB Output is correct
9 Correct 7 ms 13260 KB Output is correct
10 Correct 10 ms 13260 KB Output is correct
11 Correct 9 ms 13288 KB Output is correct
12 Correct 10 ms 13260 KB Output is correct
13 Correct 11 ms 13244 KB Output is correct
14 Correct 19 ms 13260 KB Output is correct
15 Correct 42 ms 13212 KB Output is correct
16 Correct 9 ms 13260 KB Output is correct
17 Correct 32 ms 13164 KB Output is correct
18 Correct 16 ms 13264 KB Output is correct
19 Correct 50 ms 13220 KB Output is correct
20 Correct 115 ms 13160 KB Output is correct
21 Correct 101 ms 13280 KB Output is correct
22 Correct 120 ms 13168 KB Output is correct
23 Correct 105 ms 13160 KB Output is correct
24 Correct 126 ms 13252 KB Output is correct
25 Correct 91 ms 13172 KB Output is correct
26 Correct 124 ms 13276 KB Output is correct
27 Correct 111 ms 13276 KB Output is correct
28 Correct 113 ms 13212 KB Output is correct
29 Correct 114 ms 13276 KB Output is correct
30 Correct 96 ms 13288 KB Output is correct
31 Correct 111 ms 13184 KB Output is correct
32 Correct 95 ms 13196 KB Output is correct
33 Correct 109 ms 13252 KB Output is correct
34 Correct 130 ms 13160 KB Output is correct
35 Correct 108 ms 13280 KB Output is correct
36 Correct 92 ms 13280 KB Output is correct
37 Correct 107 ms 13276 KB Output is correct
38 Correct 107 ms 13280 KB Output is correct
39 Correct 126 ms 13280 KB Output is correct
40 Correct 15 ms 13276 KB Output is correct
41 Correct 49 ms 13308 KB Output is correct
42 Correct 13 ms 13244 KB Output is correct
43 Correct 52 ms 13236 KB Output is correct
44 Correct 17 ms 13308 KB Output is correct
45 Correct 66 ms 13204 KB Output is correct
46 Correct 118 ms 13548 KB Output is correct
47 Correct 108 ms 13964 KB Output is correct
48 Correct 108 ms 13980 KB Output is correct
49 Correct 119 ms 13940 KB Output is correct
50 Correct 110 ms 13600 KB Output is correct
51 Correct 102 ms 13908 KB Output is correct
52 Correct 103 ms 13992 KB Output is correct
53 Correct 141 ms 13932 KB Output is correct
54 Correct 93 ms 13972 KB Output is correct
55 Correct 102 ms 13928 KB Output is correct
56 Correct 175 ms 13904 KB Output is correct
57 Correct 120 ms 13960 KB Output is correct
58 Correct 100 ms 13864 KB Output is correct
59 Correct 121 ms 13896 KB Output is correct
60 Correct 120 ms 13844 KB Output is correct
61 Correct 130 ms 13892 KB Output is correct
62 Correct 115 ms 13896 KB Output is correct
63 Correct 101 ms 13916 KB Output is correct
64 Correct 102 ms 13976 KB Output is correct
65 Correct 149 ms 13892 KB Output is correct