oj.uz

Submission #104620

# Submission time Handle Problem Language Result Execution time Memory
104620 2019-04-08T12:16:14 Z lyc Travelling Merchant (APIO17_merchant) C++14
21 / 100
 104 ms 3052 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];
    }

    ll 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], (ll)s[j][k]-b[i][k]);
    }

    ll lo = 0, hi = 1e12;
    while (lo < hi) {
        ll mid = (lo+hi)/2;

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

        FOR(k, 0, n-1) FOR(i, 0, n-1) if (am3[i][k] != -1) FOR(j, 0, n-1) if (am3[k][j] != -1) {
            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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 92 ms 2552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

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

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 768 KB Output is correct
2 Correct 104 ms 3052 KB Output is correct
3 Correct 60 ms 640 KB Output is correct
4 Incorrect 67 ms 852 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 12 ms 384 KB Output is correct
3 Correct 12 ms 384 KB Output is correct
4 Correct 14 ms 384 KB Output is correct
5 Correct 16 ms 492 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 12 ms 384 KB Output is correct
8 Correct 10 ms 384 KB Output is correct
9 Correct 14 ms 384 KB Output is correct
10 Correct 11 ms 384 KB Output is correct
11 Correct 13 ms 512 KB Output is correct
12 Correct 12 ms 512 KB Output is correct
13 Correct 13 ms 384 KB Output is correct
14 Correct 13 ms 384 KB Output is correct
15 Correct 13 ms 604 KB Output is correct
16 Correct 10 ms 384 KB Output is correct
17 Correct 56 ms 768 KB Output is correct
18 Correct 104 ms 3052 KB Output is correct
19 Correct 60 ms 640 KB Output is correct
20 Incorrect 67 ms 852 KB Output isn't correct
21 Halted 0 ms 0 KB -