oj.uz

Submission #727181

# Submission time Handle Problem Language Result Execution time Memory
727181 2023-04-20T07:26:05 Z josanneo22 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 69 ms 3404 KB 
#include <cstring>
#include <iostream>
using namespace std;
using ll=long long;
 
const int maxn = int(1e2) + 10;
const int maxk = int(1e3) + 10;
const ll inf = 0x3f3f3f3f * ((1ll<<32)+1);
 
int n, m, knd;
int buy[maxn][maxk], sell[maxn][maxk];
ll de[maxn][maxn];
int mxsell[maxn][maxn];
 
#define Floyd(d) { \
	for (int j=1; j<=n; ++j) { \
		for (int i=1; i<=n; ++i) for (int k=1; k<=n; ++k) \
			d[i][k] = min(d[i][k], d[i][j] + d[j][k]); \
	} \
}
 
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m >> knd;
	n &= 127;
	for (int i=1; i<=n; ++i) for (int j=1; j<=knd; ++j) {
		cin >> buy[i][j] >> sell[i][j];
	}
	memset(de, 0x3f, sizeof(de));
	for (int i=1; i<=m; ++i) {
		int f, t, v; cin >> f >> t >> v;
		de[f][t] = min(de[f][t], ll(v));
	}
	Floyd(de);
 
	for (int t=1; t<=knd; ++t) {
		for (int i=1; i<=n; ++i) if (buy[i][t] != -1)
		for (int j=1; j<=n; ++j) if (sell[j][t] != -1) {
			mxsell[i][j] = max(mxsell[i][j], sell[j][t]-buy[i][t]);
		}
	}
 
	int ql=-1, qr=int(1e9)+10;
	while (ql+1 < qr) {
		int c = (ql+qr)/2;
		static ll dc[maxn][maxn];
		for (int i=1; i<=n; ++i) for (int j=1; j<=n; ++j) {
			if (de[i][j] == inf) dc[i][j] = inf;
			else dc[i][j] = c*1ll*de[i][j]-mxsell[i][j];
		}
		Floyd(dc);
		bool loop = false;
		for (int i=1; i<=n; ++i) if (dc[i][i] <= 0) { loop = true; break; }
		(loop ? ql : qr) = c;
	}
 
	cout << ql << '\n';
 
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 2548 KB Output is correct
2 Correct 39 ms 1288 KB Output is correct
3 Correct 32 ms 1236 KB Output is correct
4 Correct 5 ms 864 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 5 ms 836 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 7 ms 868 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 6 ms 856 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 5 ms 836 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 7 ms 868 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 852 KB Output is correct
21 Correct 6 ms 848 KB Output is correct
22 Correct 6 ms 852 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 7 ms 840 KB Output is correct
28 Correct 8 ms 852 KB Output is correct
29 Correct 7 ms 944 KB Output is correct
30 Correct 6 ms 848 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 7 ms 840 KB Output is correct
4 Correct 8 ms 852 KB Output is correct
5 Correct 7 ms 944 KB Output is correct
6 Correct 6 ms 848 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 33 ms 1364 KB Output is correct
9 Correct 56 ms 3012 KB Output is correct
10 Correct 37 ms 1420 KB Output is correct
11 Correct 34 ms 1564 KB Output is correct
12 Correct 34 ms 1548 KB Output is correct
13 Correct 38 ms 1420 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 6 ms 848 KB Output is correct
14 Correct 6 ms 852 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 33 ms 1364 KB Output is correct
18 Correct 56 ms 3012 KB Output is correct
19 Correct 37 ms 1420 KB Output is correct
20 Correct 34 ms 1564 KB Output is correct
21 Correct 34 ms 1548 KB Output is correct
22 Correct 38 ms 1420 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 7 ms 840 KB Output is correct
26 Correct 8 ms 852 KB Output is correct
27 Correct 7 ms 944 KB Output is correct
28 Correct 6 ms 848 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 65 ms 2548 KB Output is correct
31 Correct 39 ms 1288 KB Output is correct
32 Correct 32 ms 1236 KB Output is correct
33 Correct 5 ms 864 KB Output is correct
34 Correct 5 ms 852 KB Output is correct
35 Correct 5 ms 852 KB Output is correct
36 Correct 6 ms 860 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 5 ms 836 KB Output is correct
39 Correct 5 ms 852 KB Output is correct
40 Correct 7 ms 868 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 6 ms 856 KB Output is correct
43 Correct 40 ms 1340 KB Output is correct
44 Correct 40 ms 1408 KB Output is correct
45 Correct 39 ms 1820 KB Output is correct
46 Correct 32 ms 1400 KB Output is correct
47 Correct 32 ms 1364 KB Output is correct
48 Correct 34 ms 1364 KB Output is correct
49 Correct 67 ms 3280 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 456 KB Output is correct
52 Correct 34 ms 1336 KB Output is correct
53 Correct 33 ms 1364 KB Output is correct
54 Correct 32 ms 1364 KB Output is correct
55 Correct 33 ms 1340 KB Output is correct
56 Correct 31 ms 1236 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 8 ms 980 KB Output is correct
59 Correct 7 ms 988 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 69 ms 3404 KB Output is correct
62 Correct 67 ms 3384 KB Output is correct
63 Correct 1 ms 340 KB Output is correct