Submission #556672

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
556672	2022-05-03T14:22:29 Z	hollwo_pelw	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	96 ms	3340 KB

merchant

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;

void Hollwo_Pelw();

signed main(){
#ifndef hollwo_pelw_local
	if (fopen("hollwo_pelw.inp", "r"))
		assert(freopen("hollwo_pelw.inp", "r", stdin)), assert(freopen("hollwo_pelw.out", "w", stdout));
#else
	using namespace chrono;
	auto start = steady_clock::now();
#endif
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
	int testcases = 1;
	// cin >> testcases;
	for (int test = 1; test <= testcases; test++){
		// cout << "Case #" << test << ": ";
		Hollwo_Pelw();
	}
#ifdef hollwo_pelw_local
	auto end = steady_clock::now();
	cout << "\nExcution time : " << duration_cast<milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}

const int N = 105, K = 1005, inf = 1e9 + 7;
const long long linf = 4e18;

int n, m, k, b[N][K], s[N][K], d[N][N], c[N][N];
long long f[N][N];

void Hollwo_Pelw(){
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= k; j++)
			cin >> b[i][j] >> s[i][j];

	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++)
		for (int _ = 1; _ <= k; _++) if (s[j][_] >= 0 && b[i][_] >= 0)
			c[i][j] = max(c[i][j], s[j][_] - b[i][_]);

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			d[i][j] = i == j ? 0 : inf;

	for (int u, v, w; m --; )
		cin >> u >> v >> w, d[u][v] = w;

	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);

	int l = 0, r = 1e9 + 7;

	while (l < r) {
		int m = (l + r + 1) >> 1, ok = 0;
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++) {
				f[i][j] = d[i][j] == inf || i == j ? linf : 1ll * d[i][j] * m - c[i][j];
			}
		for (int k = 1; k <= n; k++)
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= n; j++)
					f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
		for (int i = 1; i <= n && !ok; i++)
			if (f[i][i] <= 0) ok = 1;

		(ok ? l = m : r = m - 1);
	}

	cout << l << '\n';
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	53 ms	1248 KB	Output is correct
2	Correct	31 ms	1236 KB	Output is correct
3	Correct	32 ms	1236 KB	Output is correct
4	Correct	7 ms	724 KB	Output is correct
5	Correct	5 ms	716 KB	Output is correct
6	Correct	5 ms	724 KB	Output is correct
7	Correct	6 ms	728 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	5 ms	724 KB	Output is correct
10	Correct	5 ms	724 KB	Output is correct
11	Correct	5 ms	724 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	5 ms	716 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	724 KB	Output is correct
2	Correct	6 ms	728 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	5 ms	724 KB	Output is correct
5	Correct	5 ms	724 KB	Output is correct
6	Correct	5 ms	724 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	5 ms	716 KB	Output is correct
9	Correct	6 ms	820 KB	Output is correct
10	Correct	5 ms	724 KB	Output is correct
11	Correct	6 ms	824 KB	Output is correct
12	Correct	5 ms	724 KB	Output is correct
13	Correct	7 ms	852 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	5 ms	724 KB	Output is correct
16	Correct	7 ms	724 KB	Output is correct
17	Correct	6 ms	724 KB	Output is correct
18	Correct	6 ms	724 KB	Output is correct
19	Correct	7 ms	852 KB	Output is correct
20	Correct	9 ms	852 KB	Output is correct
21	Correct	5 ms	724 KB	Output is correct
22	Correct	6 ms	736 KB	Output is correct
23	Correct	7 ms	852 KB	Output is correct
24	Correct	6 ms	724 KB	Output is correct
25	Correct	9 ms	852 KB	Output is correct
26	Correct	1 ms	324 KB	Output is correct
27	Correct	6 ms	852 KB	Output is correct
28	Correct	8 ms	800 KB	Output is correct
29	Correct	6 ms	776 KB	Output is correct
30	Correct	6 ms	724 KB	Output is correct
31	Correct	5 ms	716 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	852 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	6 ms	852 KB	Output is correct
4	Correct	8 ms	800 KB	Output is correct
5	Correct	6 ms	776 KB	Output is correct
6	Correct	6 ms	724 KB	Output is correct
7	Correct	5 ms	716 KB	Output is correct
8	Correct	38 ms	1384 KB	Output is correct
9	Correct	87 ms	1372 KB	Output is correct
10	Correct	33 ms	1364 KB	Output is correct
11	Correct	37 ms	1388 KB	Output is correct
12	Correct	43 ms	1388 KB	Output is correct
13	Correct	39 ms	1364 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	820 KB	Output is correct
2	Correct	5 ms	724 KB	Output is correct
3	Correct	6 ms	824 KB	Output is correct
4	Correct	5 ms	724 KB	Output is correct
5	Correct	7 ms	852 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	5 ms	724 KB	Output is correct
8	Correct	7 ms	724 KB	Output is correct
9	Correct	6 ms	724 KB	Output is correct
10	Correct	6 ms	724 KB	Output is correct
11	Correct	7 ms	852 KB	Output is correct
12	Correct	9 ms	852 KB	Output is correct
13	Correct	5 ms	724 KB	Output is correct
14	Correct	6 ms	736 KB	Output is correct
15	Correct	7 ms	852 KB	Output is correct
16	Correct	6 ms	724 KB	Output is correct
17	Correct	38 ms	1384 KB	Output is correct
18	Correct	87 ms	1372 KB	Output is correct
19	Correct	33 ms	1364 KB	Output is correct
20	Correct	37 ms	1388 KB	Output is correct
21	Correct	43 ms	1388 KB	Output is correct
22	Correct	39 ms	1364 KB	Output is correct
23	Correct	9 ms	852 KB	Output is correct
24	Correct	1 ms	324 KB	Output is correct
25	Correct	6 ms	852 KB	Output is correct
26	Correct	8 ms	800 KB	Output is correct
27	Correct	6 ms	776 KB	Output is correct
28	Correct	6 ms	724 KB	Output is correct
29	Correct	5 ms	716 KB	Output is correct
30	Correct	53 ms	1248 KB	Output is correct
31	Correct	31 ms	1236 KB	Output is correct
32	Correct	32 ms	1236 KB	Output is correct
33	Correct	7 ms	724 KB	Output is correct
34	Correct	5 ms	716 KB	Output is correct
35	Correct	5 ms	724 KB	Output is correct
36	Correct	6 ms	728 KB	Output is correct
37	Correct	1 ms	328 KB	Output is correct
38	Correct	5 ms	724 KB	Output is correct
39	Correct	5 ms	724 KB	Output is correct
40	Correct	5 ms	724 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	5 ms	716 KB	Output is correct
43	Correct	35 ms	1236 KB	Output is correct
44	Correct	37 ms	1340 KB	Output is correct
45	Correct	47 ms	1748 KB	Output is correct
46	Correct	37 ms	1236 KB	Output is correct
47	Correct	36 ms	1240 KB	Output is correct
48	Correct	34 ms	1352 KB	Output is correct
49	Correct	87 ms	3216 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	328 KB	Output is correct
52	Correct	34 ms	1284 KB	Output is correct
53	Correct	37 ms	1364 KB	Output is correct
54	Correct	35 ms	1236 KB	Output is correct
55	Correct	42 ms	1284 KB	Output is correct
56	Correct	35 ms	1252 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	8 ms	848 KB	Output is correct
59	Correct	10 ms	848 KB	Output is correct
60	Correct	8 ms	852 KB	Output is correct
61	Correct	96 ms	3340 KB	Output is correct
62	Correct	93 ms	3272 KB	Output is correct
63	Correct	1 ms	324 KB	Output is correct

Submission #556672

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0