oj.uz

Submission #786392

# Submission time Handle Problem Language Result Execution time Memory
786392 2023-07-18T07:22:40 Z PenguinsAreCute Travelling Merchant (APIO17_merchant) C++17
100 / 100
 98 ms 4240 KB 
// editorial exists
// also i like 42
// so im adding comments to make it 42 lines
// yay 42 lines :)
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stMx(a,b) a = max(a,b)
#define stMn(a,b) a = min(a,b)
#define BIGNO (int)1210201069
#define REP(i, a, b) for(int i = a; i < b; i++)
int32_t main() {
    int n, m, K, v, w, t; cin >> n >> m >> K;
    int B[n][K], S[n][K], time[n][n], profit[n][n], relprofit[n][n];
    REP(i, 0, n) REP(j, 0, n) {
        time[i][j] = BIGNO; profit[i][j] = 0;
    }
    REP(i, 0, n) REP(j, 0, K) {
        cin >> B[i][j] >> S[i][j];
        if(B[i][j] == -1) B[i][j] = BIGNO;
    }
    REP(i, 0, m) {
        cin >> v >> w >> t; v--; w--;
        time[v][w] = t;
    }
    REP(i, 0, n) time[i][i] = 0;
    REP(k, 0, n) REP(i, 0, n) REP(j, 0, n) stMn(time[i][j], time[i][k] + time[k][j]);
    REP(i, 0, n) REP(j, 0, n) REP(k, 0, K) stMx(profit[i][j], S[j][k] - B[i][k]);
    int l = 0, h = 1000000001;
    while(h - l > 1) {
        int mid = (l + h) / 2;
        REP(i, 0, n) REP(j, 0, n) {
            relprofit[i][j] = profit[i][j] - time[i][j] * mid;
            if(i == j && profit[i][i] == 0 && relprofit[i][i] == 0) relprofit[i][i] = -1;
        }
        REP(k, 0, n) REP(i, 0, n) REP(j, 0, n) stMx(relprofit[i][j], relprofit[i][k] + relprofit[k][j]);
        bool nonnegcycle = false; REP(i, 0, n) if(relprofit[i][i] >= 0) nonnegcycle = true;
        if(nonnegcycle) l = mid;
        else h = mid;
    }
    cout << l;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 3224 KB Output is correct
2 Correct 26 ms 532 KB Output is correct
3 Correct 26 ms 468 KB Output is correct
4 Correct 4 ms 360 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 5 ms 340 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 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 5 ms 340 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 5 ms 340 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 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 4 ms 312 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 4 ms 300 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 5 ms 444 KB Output is correct
20 Correct 5 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 6 ms 340 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 5 ms 424 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 5 ms 440 KB Output is correct
29 Correct 5 ms 444 KB Output is correct
30 Correct 4 ms 308 KB Output is correct
31 Correct 4 ms 340 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 424 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 5 ms 440 KB Output is correct
5 Correct 5 ms 444 KB Output is correct
6 Correct 4 ms 308 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 34 ms 724 KB Output is correct
9 Correct 84 ms 3572 KB Output is correct
10 Correct 29 ms 660 KB Output is correct
11 Correct 33 ms 852 KB Output is correct
12 Correct 36 ms 852 KB Output is correct
13 Correct 29 ms 696 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 4 ms 312 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 4 ms 300 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 5 ms 444 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 6 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 34 ms 724 KB Output is correct
18 Correct 84 ms 3572 KB Output is correct
19 Correct 29 ms 660 KB Output is correct
20 Correct 33 ms 852 KB Output is correct
21 Correct 36 ms 852 KB Output is correct
22 Correct 29 ms 696 KB Output is correct
23 Correct 5 ms 424 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 5 ms 340 KB Output is correct
26 Correct 5 ms 440 KB Output is correct
27 Correct 5 ms 444 KB Output is correct
28 Correct 4 ms 308 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 76 ms 3224 KB Output is correct
31 Correct 26 ms 532 KB Output is correct
32 Correct 26 ms 468 KB Output is correct
33 Correct 4 ms 360 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 5 ms 340 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 340 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 5 ms 340 KB Output is correct
43 Correct 27 ms 544 KB Output is correct
44 Correct 31 ms 724 KB Output is correct
45 Correct 62 ms 2248 KB Output is correct
46 Correct 30 ms 724 KB Output is correct
47 Correct 30 ms 764 KB Output is correct
48 Correct 31 ms 724 KB Output is correct
49 Correct 94 ms 4012 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 28 ms 436 KB Output is correct
53 Correct 31 ms 596 KB Output is correct
54 Correct 32 ms 608 KB Output is correct
55 Correct 27 ms 596 KB Output is correct
56 Correct 27 ms 468 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 6 ms 524 KB Output is correct
59 Correct 7 ms 468 KB Output is correct
60 Correct 6 ms 528 KB Output is correct
61 Correct 98 ms 4240 KB Output is correct
62 Correct 93 ms 4044 KB Output is correct
63 Correct 0 ms 212 KB Output is correct