oj.uz

Submission #104621

# Submission time Handle Problem Language Result Execution time Memory
104621 2019-04-08T12:22:10 Z lyc Travelling Merchant (APIO17_merchant) C++14
100 / 100
 115 ms 3324 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x) 
#define REP(i, n) for (int i = 0; i < n; ++i) 
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)

int main() {
    //freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, x; cin >> n >> m >> x;
    int b[n][x], s[n][x];
    FOR(i, 0, n-1) {
        FOR(j, 0, x-1) {
            cin >> b[i][j] >> s[i][j];
        }
    }

    int am1[n][n];
    memset(am1, -1, sizeof am1);
    FOR(i, 0, m-1) {
        int u, v, w; cin >> u >> v >> w;
        --u, --v;
        am1[u][v] = w;
    }

    FOR(k, 0, n-1) FOR(i, 0, n-1) if (am1[i][k] != -1) FOR(j, 0, n-1) if (am1[k][j] != -1) {
        if (am1[i][j] == -1 || am1[i][k]+am1[k][j]<am1[i][j])
            am1[i][j] = am1[i][k]+am1[k][j];
    }

    int am2[n][n];
    FOR(i, 0, n-1) FOR(j, 0, n-1) {
        am2[i][j] = 0;
        FOR(k, 0, x-1) if (s[j][k] != -1 && b[i][k] != -1) am2[i][j] = max(am2[i][j], s[j][k]-b[i][k]);
    }

    int lo = 0, hi = 1e9+10;
    while (lo < hi) {
        int mid = (lo+hi)/2;

        //sum(w) / sum(dist) >= r;
        //sum(w) - r*sum(dist) >= 0;
        //sum(w - r*dist) >= 0;
        #define NINF (-1e18)
        ll am3[n][n];
        FOR(i, 0, n-1) FOR(j, 0, n-1) {
            if (am1[i][j] != -1) {
                am3[i][j] = (ll)am2[i][j] - (ll)mid*am1[i][j];
            }
            else {
                am3[i][j] = NINF;
            }
        }

        FOR(k, 0, n-1) FOR(i, 0, n-1) if (am3[i][k] != NINF) FOR(j, 0, n-1) if (am3[k][j] != NINF) {
            am3[i][j] = max(am3[i][j], am3[i][k]+am3[k][j]);
        }

        bool ok = false;
        FOR(i, 0, n-1) ok |= am3[i][i] >= 0;
        
        if (ok) lo = mid+1;
        else hi = mid;
    }
    cout << lo-1 << '\n';
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 1272 KB Output is correct
2 Correct 58 ms 512 KB Output is correct
3 Correct 60 ms 512 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 10 ms 512 KB Output is correct
6 Correct 9 ms 428 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 10 ms 384 KB Output is correct
11 Correct 10 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 7 ms 384 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 11 ms 384 KB Output is correct
3 Correct 10 ms 480 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 10 ms 440 KB Output is correct
12 Correct 8 ms 384 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 10 ms 384 KB Output is correct
15 Correct 10 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 9 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 11 ms 384 KB Output is correct
20 Correct 11 ms 384 KB Output is correct
21 Correct 12 ms 384 KB Output is correct
22 Correct 10 ms 384 KB Output is correct
23 Correct 8 ms 384 KB Output is correct
24 Correct 9 ms 428 KB Output is correct
25 Correct 9 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 9 ms 384 KB Output is correct
28 Correct 10 ms 384 KB Output is correct
29 Correct 10 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 7 ms 384 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 640 KB Output is correct
2 Correct 107 ms 1272 KB Output is correct
3 Correct 52 ms 512 KB Output is correct
4 Correct 74 ms 608 KB Output is correct
5 Correct 71 ms 768 KB Output is correct
6 Correct 51 ms 640 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 11 ms 384 KB Output is correct
10 Correct 11 ms 384 KB Output is correct
11 Correct 12 ms 384 KB Output is correct
12 Correct 10 ms 384 KB Output is correct
13 Correct 8 ms 384 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 11 ms 384 KB Output is correct
3 Correct 10 ms 480 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 10 ms 440 KB Output is correct
12 Correct 8 ms 384 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 10 ms 384 KB Output is correct
15 Correct 10 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 54 ms 640 KB Output is correct
18 Correct 107 ms 1272 KB Output is correct
19 Correct 52 ms 512 KB Output is correct
20 Correct 74 ms 608 KB Output is correct
21 Correct 71 ms 768 KB Output is correct
22 Correct 51 ms 640 KB Output is correct
23 Correct 9 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 11 ms 384 KB Output is correct
26 Correct 11 ms 384 KB Output is correct
27 Correct 12 ms 384 KB Output is correct
28 Correct 10 ms 384 KB Output is correct
29 Correct 8 ms 384 KB Output is correct
30 Correct 54 ms 564 KB Output is correct
31 Correct 58 ms 648 KB Output is correct
32 Correct 78 ms 1680 KB Output is correct
33 Correct 56 ms 888 KB Output is correct
34 Correct 89 ms 640 KB Output is correct
35 Correct 57 ms 640 KB Output is correct
36 Correct 104 ms 3256 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 50 ms 512 KB Output is correct
40 Correct 60 ms 640 KB Output is correct
41 Correct 36 ms 640 KB Output is correct
42 Correct 49 ms 512 KB Output is correct
43 Correct 56 ms 512 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 13 ms 552 KB Output is correct
46 Correct 9 ms 512 KB Output is correct
47 Correct 8 ms 556 KB Output is correct
48 Correct 115 ms 3308 KB Output is correct
49 Correct 111 ms 3324 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 93 ms 1272 KB Output is correct
52 Correct 58 ms 512 KB Output is correct
53 Correct 60 ms 512 KB Output is correct
54 Correct 9 ms 384 KB Output is correct
55 Correct 10 ms 512 KB Output is correct
56 Correct 9 ms 428 KB Output is correct
57 Correct 9 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 9 ms 384 KB Output is correct
60 Correct 10 ms 384 KB Output is correct
61 Correct 10 ms 384 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 7 ms 384 KB Output is correct