Submission #620241

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
620241	2022-08-03T04:15:00 Z	GusterGoose27	Travelling Merchant (APIO17_merchant)	C++11	100 / 100	146 ms	3484 KB

merchant

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

const int MAXN = 100;
const int MAXK = 1000;
const ll inf = 1e18;
const ld ERROR = 1e-9;
int n, m, k;
vector<pii> edges[MAXN];
ll dist[MAXN][MAXN];
ld bfdist[MAXN];
int val[MAXN][MAXN];
int buy[MAXN][MAXK];
int sell[MAXN][MAXK];

bool neg_cycle(ld ben) {
	fill(bfdist, bfdist+n, inf);
	bfdist[0] = 0;
	bool f = 1;
	for (int i = 0; i < n && f; i++) {
		f = 0;
		for (int a = 0; a < n; a++) {
			for (int b = 0; b < n; b++) {
				ld w = ben*dist[a][b]-val[a][b];
				if (bfdist[b] > bfdist[a]+w+ERROR) {
					bfdist[b] = bfdist[a]+w;
					f = 1;
				}
			}
		}
	}
	return f;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> m >> k;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++) {
			cin >> buy[i][j];
			cin >> sell[i][j];
		}
		fill(dist[i], dist[i]+n, inf);
		dist[i][i] = 0;
	}
	for (int i = 0; i < m; i++) {
		int x, y, w;
		cin >> x >> y >> w;
		x--; y--;
		edges[x].push_back(pii(y, w));
		dist[x][y] = w;
	}
	for (int i = 0; i < n; i++) {
		for (int a = 0; a < n; a++) {
			for (int b = 0; b < n; b++) dist[a][b] = min(dist[a][b], dist[a][i]+dist[i][b]);
		}
	}
	for (int a = 0; a < n; a++) {
		for (int b = 0; b < n; b++) {
			for (int i = 0; i < k; i++) {
				if (buy[a][i] != -1 && sell[b][i] != -1)
					val[a][b] = max(val[a][b], sell[b][i]-buy[a][i]);
			}
		}
	}
	int mn = 0;
	int mx = 1e9;
	while (mx > mn+1) {
		int cur = (mn+mx)/2;
		if (neg_cycle(cur-ERROR)) mn = cur;
		else mx = cur;
	}
	cout << mn << "\n";
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	2200 KB	Output is correct
2	Correct	21 ms	1108 KB	Output is correct
3	Correct	57 ms	1180 KB	Output is correct
4	Correct	3 ms	716 KB	Output is correct
5	Correct	5 ms	724 KB	Output is correct
6	Correct	1 ms	724 KB	Output is correct
7	Correct	9 ms	724 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	11 ms	760 KB	Output is correct
10	Correct	12 ms	768 KB	Output is correct
11	Correct	9 ms	764 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	2 ms	724 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	724 KB	Output is correct
2	Correct	9 ms	724 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	11 ms	760 KB	Output is correct
5	Correct	12 ms	768 KB	Output is correct
6	Correct	9 ms	764 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	2 ms	724 KB	Output is correct
9	Correct	6 ms	784 KB	Output is correct
10	Correct	6 ms	724 KB	Output is correct
11	Correct	6 ms	780 KB	Output is correct
12	Correct	6 ms	724 KB	Output is correct
13	Correct	12 ms	780 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	5 ms	724 KB	Output is correct
16	Correct	4 ms	724 KB	Output is correct
17	Correct	9 ms	724 KB	Output is correct
18	Correct	10 ms	724 KB	Output is correct
19	Correct	12 ms	724 KB	Output is correct
20	Correct	10 ms	788 KB	Output is correct
21	Correct	9 ms	820 KB	Output is correct
22	Correct	11 ms	792 KB	Output is correct
23	Correct	12 ms	824 KB	Output is correct
24	Correct	11 ms	724 KB	Output is correct
25	Correct	12 ms	724 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	17 ms	780 KB	Output is correct
28	Correct	11 ms	724 KB	Output is correct
29	Correct	9 ms	724 KB	Output is correct
30	Correct	9 ms	832 KB	Output is correct
31	Correct	9 ms	724 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	724 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	17 ms	780 KB	Output is correct
4	Correct	11 ms	724 KB	Output is correct
5	Correct	9 ms	724 KB	Output is correct
6	Correct	9 ms	832 KB	Output is correct
7	Correct	9 ms	724 KB	Output is correct
8	Correct	96 ms	1300 KB	Output is correct
9	Correct	134 ms	2980 KB	Output is correct
10	Correct	85 ms	1316 KB	Output is correct
11	Correct	92 ms	1420 KB	Output is correct
12	Correct	146 ms	1432 KB	Output is correct
13	Correct	60 ms	1236 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	784 KB	Output is correct
2	Correct	6 ms	724 KB	Output is correct
3	Correct	6 ms	780 KB	Output is correct
4	Correct	6 ms	724 KB	Output is correct
5	Correct	12 ms	780 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	5 ms	724 KB	Output is correct
8	Correct	4 ms	724 KB	Output is correct
9	Correct	9 ms	724 KB	Output is correct
10	Correct	10 ms	724 KB	Output is correct
11	Correct	12 ms	724 KB	Output is correct
12	Correct	10 ms	788 KB	Output is correct
13	Correct	9 ms	820 KB	Output is correct
14	Correct	11 ms	792 KB	Output is correct
15	Correct	12 ms	824 KB	Output is correct
16	Correct	11 ms	724 KB	Output is correct
17	Correct	96 ms	1300 KB	Output is correct
18	Correct	134 ms	2980 KB	Output is correct
19	Correct	85 ms	1316 KB	Output is correct
20	Correct	92 ms	1420 KB	Output is correct
21	Correct	146 ms	1432 KB	Output is correct
22	Correct	60 ms	1236 KB	Output is correct
23	Correct	12 ms	724 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	17 ms	780 KB	Output is correct
26	Correct	11 ms	724 KB	Output is correct
27	Correct	9 ms	724 KB	Output is correct
28	Correct	9 ms	832 KB	Output is correct
29	Correct	9 ms	724 KB	Output is correct
30	Correct	33 ms	2200 KB	Output is correct
31	Correct	21 ms	1108 KB	Output is correct
32	Correct	57 ms	1180 KB	Output is correct
33	Correct	3 ms	716 KB	Output is correct
34	Correct	5 ms	724 KB	Output is correct
35	Correct	1 ms	724 KB	Output is correct
36	Correct	9 ms	724 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	11 ms	760 KB	Output is correct
39	Correct	12 ms	768 KB	Output is correct
40	Correct	9 ms	764 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	2 ms	724 KB	Output is correct
43	Correct	36 ms	1364 KB	Output is correct
44	Correct	29 ms	1288 KB	Output is correct
45	Correct	89 ms	1704 KB	Output is correct
46	Correct	67 ms	1276 KB	Output is correct
47	Correct	51 ms	1236 KB	Output is correct
48	Correct	46 ms	1308 KB	Output is correct
49	Correct	100 ms	3144 KB	Output is correct
50	Correct	0 ms	340 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	54 ms	1248 KB	Output is correct
53	Correct	27 ms	1364 KB	Output is correct
54	Correct	21 ms	1240 KB	Output is correct
55	Correct	31 ms	1236 KB	Output is correct
56	Correct	40 ms	1236 KB	Output is correct
57	Correct	0 ms	340 KB	Output is correct
58	Correct	8 ms	884 KB	Output is correct
59	Correct	7 ms	852 KB	Output is correct
60	Correct	9 ms	852 KB	Output is correct
61	Correct	88 ms	3484 KB	Output is correct
62	Correct	120 ms	3392 KB	Output is correct
63	Correct	0 ms	340 KB	Output is correct

Submission #620241

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