oj.uz

Submission #820841

# Submission time Handle Problem Language Result Execution time Memory
820841 2023-08-11T06:12:19 Z Alihan_8 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 100 ms 4188 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define pb push_back
#define ln '\n'
#define int long long

template <class _T>
bool chmin(_T &x, const _T &y){
    bool flag = false;
    if ( x > y ){
        x = y; flag |= true;
    }
    return flag;
}

template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag = false;
    if ( x < y ){
        x = y; flag |= true;
    }
    return flag;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m, k; cin >> n >> m >> k;
    vector <vector<int>> B(n, vector <int> (k)), S(n, vector <int> (k));
    for ( int i = 0; i < n; i++ ){
        for ( int j = 0; j < k; j++ ){
            cin >> B[i][j] >> S[i][j];
        }
    }
    const int inf = 1e9 + 501;
    vector <vector<int>> dis(n, vector <int> (n, inf));
    for ( int i = 0; i < m; i++ ){
        int u, v, t; cin >> u >> v >> t;
        dis[--u][--v] = t;
    }
    auto RunFloyd = [&](auto &d){
        for ( int i = 0; i < n; i++ ){
            for ( int j = 0; j < n; j++ ){
                for ( int k = 0; k < n; k++ ){
                    chmin(d[j][k], d[j][i] + d[i][k]);
                }
            }
        }
    };
    RunFloyd(dis);
    vector <vector<int>> P(n, vector <int> (n));
    for ( int i = 0; i < n; i++ ){
        for ( int j = 0; j < n; j++ ){
            for ( int _k = 0; _k < k; _k++ ){
                if ( B[i][_k] == -1 or S[j][_k] == -1 ){
                    continue;
                }
                chmax(P[i][j], -B[i][_k] + S[j][_k]);
            }
        }
    }
    auto ok = [&](int M){
        auto a = P;
        for ( int i = 0; i < n; i++ ){
            for ( int j = 0; j < n; j++ ){
                a[i][j] = M * dis[i][j] - P[i][j];
            }
        }
        RunFloyd(a);
        bool flag = false;
        for ( int i = 0; i < n; i++ ){
            flag |= (a[i][i] <= 0);
        }
        return flag;
    };
    int l = 0, r = 1e9 + 1;
    while ( l + 1 < r ){
        int md = (l + r) >> 1;
        if ( ok(md) ) l = md;
        else r = md;
    }
    cout << l;

    cout << '\n';
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 3372 KB Output is correct
2 Correct 23 ms 468 KB Output is correct
3 Correct 30 ms 468 KB Output is correct
4 Correct 5 ms 324 KB Output is correct
5 Correct 4 ms 392 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 456 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 316 KB Output is correct
11 Correct 4 ms 320 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 4 ms 460 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 456 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 316 KB Output is correct
6 Correct 4 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 6 ms 444 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 9 ms 480 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 328 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 6 ms 460 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 6 ms 496 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 11 ms 456 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 12 ms 468 KB Output is correct
28 Correct 7 ms 460 KB Output is correct
29 Correct 9 ms 468 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 5 ms 392 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 456 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 12 ms 468 KB Output is correct
4 Correct 7 ms 460 KB Output is correct
5 Correct 9 ms 468 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 5 ms 392 KB Output is correct
8 Correct 76 ms 800 KB Output is correct
9 Correct 100 ms 3728 KB Output is correct
10 Correct 60 ms 712 KB Output is correct
11 Correct 78 ms 924 KB Output is correct
12 Correct 74 ms 928 KB Output is correct
13 Correct 41 ms 720 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 6 ms 444 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 9 ms 480 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 328 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 6 ms 460 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 5 ms 332 KB Output is correct
15 Correct 6 ms 496 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 76 ms 800 KB Output is correct
18 Correct 100 ms 3728 KB Output is correct
19 Correct 60 ms 712 KB Output is correct
20 Correct 78 ms 924 KB Output is correct
21 Correct 74 ms 928 KB Output is correct
22 Correct 41 ms 720 KB Output is correct
23 Correct 11 ms 456 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 12 ms 468 KB Output is correct
26 Correct 7 ms 460 KB Output is correct
27 Correct 9 ms 468 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 5 ms 392 KB Output is correct
30 Correct 44 ms 3372 KB Output is correct
31 Correct 23 ms 468 KB Output is correct
32 Correct 30 ms 468 KB Output is correct
33 Correct 5 ms 324 KB Output is correct
34 Correct 4 ms 392 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 4 ms 456 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 4 ms 340 KB Output is correct
39 Correct 4 ms 316 KB Output is correct
40 Correct 4 ms 320 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 26 ms 596 KB Output is correct
44 Correct 28 ms 844 KB Output is correct
45 Correct 50 ms 2288 KB Output is correct
46 Correct 35 ms 792 KB Output is correct
47 Correct 25 ms 708 KB Output is correct
48 Correct 27 ms 792 KB Output is correct
49 Correct 78 ms 4032 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 24 ms 596 KB Output is correct
53 Correct 30 ms 596 KB Output is correct
54 Correct 24 ms 596 KB Output is correct
55 Correct 24 ms 596 KB Output is correct
56 Correct 29 ms 596 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 6 ms 464 KB Output is correct
59 Correct 6 ms 468 KB Output is correct
60 Correct 6 ms 468 KB Output is correct
61 Correct 58 ms 4188 KB Output is correct
62 Correct 60 ms 4160 KB Output is correct
63 Correct 1 ms 212 KB Output is correct