oj.uz

Submission #466218

# Submission time Handle Problem Language Result Execution time Memory
466218 2021-08-18T11:19:00 Z Namnamseo Travelling Merchant (APIO17_merchant) C++17
100 / 100
 96 ms 3324 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#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 94 ms 2448 KB Output is correct
2 Correct 42 ms 1228 KB Output is correct
3 Correct 47 ms 1276 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 7 ms 844 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 1 ms 388 KB Output is correct
9 Correct 7 ms 868 KB Output is correct
10 Correct 6 ms 844 KB Output is correct
11 Correct 9 ms 844 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 7 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 7 ms 844 KB Output is correct
3 Correct 1 ms 388 KB Output is correct
4 Correct 7 ms 868 KB Output is correct
5 Correct 6 ms 844 KB Output is correct
6 Correct 9 ms 844 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 7 ms 832 KB Output is correct
10 Correct 6 ms 844 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 6 ms 844 KB Output is correct
13 Correct 7 ms 844 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 7 ms 844 KB Output is correct
16 Correct 7 ms 844 KB Output is correct
17 Correct 6 ms 844 KB Output is correct
18 Correct 7 ms 844 KB Output is correct
19 Correct 8 ms 844 KB Output is correct
20 Correct 8 ms 840 KB Output is correct
21 Correct 7 ms 844 KB Output is correct
22 Correct 7 ms 844 KB Output is correct
23 Correct 8 ms 844 KB Output is correct
24 Correct 7 ms 844 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 8 ms 944 KB Output is correct
28 Correct 10 ms 936 KB Output is correct
29 Correct 10 ms 844 KB Output is correct
30 Correct 7 ms 908 KB Output is correct
31 Correct 6 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 8 ms 944 KB Output is correct
4 Correct 10 ms 936 KB Output is correct
5 Correct 10 ms 844 KB Output is correct
6 Correct 7 ms 908 KB Output is correct
7 Correct 6 ms 888 KB Output is correct
8 Correct 50 ms 1356 KB Output is correct
9 Correct 87 ms 3096 KB Output is correct
10 Correct 48 ms 1356 KB Output is correct
11 Correct 47 ms 1536 KB Output is correct
12 Correct 47 ms 1632 KB Output is correct
13 Correct 43 ms 1432 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 832 KB Output is correct
2 Correct 6 ms 844 KB Output is correct
3 Correct 9 ms 896 KB Output is correct
4 Correct 6 ms 844 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 7 ms 844 KB Output is correct
11 Correct 8 ms 844 KB Output is correct
12 Correct 8 ms 840 KB Output is correct
13 Correct 7 ms 844 KB Output is correct
14 Correct 7 ms 844 KB Output is correct
15 Correct 8 ms 844 KB Output is correct
16 Correct 7 ms 844 KB Output is correct
17 Correct 50 ms 1356 KB Output is correct
18 Correct 87 ms 3096 KB Output is correct
19 Correct 48 ms 1356 KB Output is correct
20 Correct 47 ms 1536 KB Output is correct
21 Correct 47 ms 1632 KB Output is correct
22 Correct 43 ms 1432 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 8 ms 944 KB Output is correct
26 Correct 10 ms 936 KB Output is correct
27 Correct 10 ms 844 KB Output is correct
28 Correct 7 ms 908 KB Output is correct
29 Correct 6 ms 888 KB Output is correct
30 Correct 94 ms 2448 KB Output is correct
31 Correct 42 ms 1228 KB Output is correct
32 Correct 47 ms 1276 KB Output is correct
33 Correct 7 ms 844 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 7 ms 844 KB Output is correct
36 Correct 7 ms 844 KB Output is correct
37 Correct 1 ms 388 KB Output is correct
38 Correct 7 ms 868 KB Output is correct
39 Correct 6 ms 844 KB Output is correct
40 Correct 9 ms 844 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 7 ms 844 KB Output is correct
43 Correct 42 ms 1356 KB Output is correct
44 Correct 43 ms 1400 KB Output is correct
45 Correct 64 ms 1820 KB Output is correct
46 Correct 43 ms 1388 KB Output is correct
47 Correct 54 ms 1356 KB Output is correct
48 Correct 47 ms 1356 KB Output is correct
49 Correct 90 ms 3196 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 42 ms 1332 KB Output is correct
53 Correct 43 ms 1356 KB Output is correct
54 Correct 42 ms 1360 KB Output is correct
55 Correct 41 ms 1332 KB Output is correct
56 Correct 44 ms 1228 KB Output is correct
57 Correct 1 ms 460 KB Output is correct
58 Correct 8 ms 972 KB Output is correct
59 Correct 8 ms 972 KB Output is correct
60 Correct 10 ms 972 KB Output is correct
61 Correct 96 ms 3324 KB Output is correct
62 Correct 91 ms 3320 KB Output is correct
63 Correct 1 ms 460 KB Output is correct