Submission #250869

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
250869	2020-07-19T10:24:47 Z	atoiz	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	121 ms	1656 KB

merchant

/*input
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

const int MAXN = 105, MAXK = 1005, INF = 1001001000;
const long long INFLL = 4e18;
int N, M, K;
int rawdist[MAXN][MAXN], gain[MAXN][MAXN], buy[MAXN][MAXK], sel[MAXN][MAXK];
long long curdist[MAXN][MAXN];

#define FOR(i, a, b) for (int i = a; i <= b; ++i)

bool check(long long val)
{
	FOR(i, 1, N) FOR(j, 1, N) curdist[i][j] = rawdist[i][j] * val - gain[i][j];
	FOR(k, 1, N) FOR(i, 1, N) FOR(j, 1, N) curdist[i][j] = min(curdist[i][j], max(-INFLL, curdist[i][k] + curdist[k][j]));
	FOR(i, 1, N) FOR(j, 1, i - 1) if (curdist[i][j] + curdist[j][i] <= 0) return true;
	return false;
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> M >> K;
	FOR(i, 1, N) FOR(j, 1, K) cin >> buy[i][j] >> sel[i][j];
	FOR(i, 1, N) FOR(j, 1, N) rawdist[i][j] = INF;
	FOR(i, 1, N) rawdist[i][i] = 0;
	FOR(_, 0, M - 1) {
		int u, v, w;
		cin >> u >> v >> w;
		rawdist[u][v] = min(rawdist[u][v], w);
	}
	FOR(k, 1, N) FOR(i, 1, N) FOR(j, 1, N) rawdist[i][j] = min(rawdist[i][j], rawdist[i][k] + rawdist[k][j]);
	FOR(i, 1, N) FOR(j, 1, N) FOR(k, 1, K) if (~buy[i][k] && ~sel[j][k]) gain[i][j] = max(gain[i][j], sel[j][k] - buy[i][k]);

	int lo = 0, hi = INF;
	while (lo < hi) {
		int mid = (lo + hi + 1) >> 1;
		if (check(mid)) lo = mid;
		else hi = mid - 1;
	}
	cout << lo << endl;
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	78 ms	1272 KB	Output is correct
2	Correct	65 ms	1400 KB	Output is correct
3	Correct	49 ms	1280 KB	Output is correct
4	Correct	7 ms	768 KB	Output is correct
5	Correct	11 ms	768 KB	Output is correct
6	Correct	11 ms	768 KB	Output is correct
7	Correct	8 ms	768 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	7 ms	768 KB	Output is correct
10	Correct	7 ms	768 KB	Output is correct
11	Correct	7 ms	768 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	7 ms	768 KB	Output is correct

Subtask #2

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	768 KB	Output is correct
2	Correct	7 ms	768 KB	Output is correct
3	Correct	10 ms	768 KB	Output is correct
4	Correct	7 ms	768 KB	Output is correct
5	Correct	8 ms	896 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	7 ms	768 KB	Output is correct
8	Correct	8 ms	896 KB	Output is correct
9	Correct	7 ms	768 KB	Output is correct
10	Correct	8 ms	896 KB	Output is correct
11	Correct	8 ms	896 KB	Output is correct
12	Correct	8 ms	896 KB	Output is correct
13	Correct	8 ms	896 KB	Output is correct
14	Correct	7 ms	896 KB	Output is correct
15	Correct	9 ms	896 KB	Output is correct
16	Correct	7 ms	768 KB	Output is correct
17	Correct	8 ms	1024 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	8 ms	896 KB	Output is correct
20	Correct	8 ms	896 KB	Output is correct
21	Correct	8 ms	896 KB	Output is correct
22	Correct	11 ms	896 KB	Output is correct
23	Correct	7 ms	768 KB	Output is correct
24	Correct	11 ms	768 KB	Output is correct
25	Correct	8 ms	768 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	7 ms	768 KB	Output is correct
28	Correct	7 ms	768 KB	Output is correct
29	Correct	7 ms	768 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	7 ms	768 KB	Output is correct

Subtask #3

33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	56 ms	1400 KB	Output is correct
2	Correct	107 ms	1656 KB	Output is correct
3	Correct	52 ms	1528 KB	Output is correct
4	Correct	55 ms	1536 KB	Output is correct
5	Correct	60 ms	1536 KB	Output is correct
6	Correct	52 ms	1408 KB	Output is correct
7	Correct	8 ms	1024 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	8 ms	896 KB	Output is correct
10	Correct	8 ms	896 KB	Output is correct
11	Correct	8 ms	896 KB	Output is correct
12	Correct	11 ms	896 KB	Output is correct
13	Correct	7 ms	768 KB	Output is correct

Subtask #4

34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	768 KB	Output is correct
2	Correct	7 ms	768 KB	Output is correct
3	Correct	10 ms	768 KB	Output is correct
4	Correct	7 ms	768 KB	Output is correct
5	Correct	8 ms	896 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	7 ms	768 KB	Output is correct
8	Correct	8 ms	896 KB	Output is correct
9	Correct	7 ms	768 KB	Output is correct
10	Correct	8 ms	896 KB	Output is correct
11	Correct	8 ms	896 KB	Output is correct
12	Correct	8 ms	896 KB	Output is correct
13	Correct	8 ms	896 KB	Output is correct
14	Correct	7 ms	896 KB	Output is correct
15	Correct	9 ms	896 KB	Output is correct
16	Correct	7 ms	768 KB	Output is correct
17	Correct	56 ms	1400 KB	Output is correct
18	Correct	107 ms	1656 KB	Output is correct
19	Correct	52 ms	1528 KB	Output is correct
20	Correct	55 ms	1536 KB	Output is correct
21	Correct	60 ms	1536 KB	Output is correct
22	Correct	52 ms	1408 KB	Output is correct
23	Correct	8 ms	1024 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	8 ms	896 KB	Output is correct
26	Correct	8 ms	896 KB	Output is correct
27	Correct	8 ms	896 KB	Output is correct
28	Correct	11 ms	896 KB	Output is correct
29	Correct	7 ms	768 KB	Output is correct
30	Correct	49 ms	1360 KB	Output is correct
31	Correct	52 ms	1408 KB	Output is correct
32	Correct	68 ms	1528 KB	Output is correct
33	Correct	51 ms	1408 KB	Output is correct
34	Correct	51 ms	1408 KB	Output is correct
35	Correct	55 ms	1408 KB	Output is correct
36	Correct	115 ms	1400 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	0 ms	384 KB	Output is correct
39	Correct	50 ms	1280 KB	Output is correct
40	Correct	52 ms	1408 KB	Output is correct
41	Correct	51 ms	1280 KB	Output is correct
42	Correct	53 ms	1280 KB	Output is correct
43	Correct	49 ms	1280 KB	Output is correct
44	Correct	0 ms	384 KB	Output is correct
45	Correct	10 ms	896 KB	Output is correct
46	Correct	10 ms	896 KB	Output is correct
47	Correct	10 ms	896 KB	Output is correct
48	Correct	115 ms	1528 KB	Output is correct
49	Correct	121 ms	1528 KB	Output is correct
50	Correct	1 ms	396 KB	Output is correct
51	Correct	78 ms	1272 KB	Output is correct
52	Correct	65 ms	1400 KB	Output is correct
53	Correct	49 ms	1280 KB	Output is correct
54	Correct	7 ms	768 KB	Output is correct
55	Correct	11 ms	768 KB	Output is correct
56	Correct	11 ms	768 KB	Output is correct
57	Correct	8 ms	768 KB	Output is correct
58	Correct	0 ms	384 KB	Output is correct
59	Correct	7 ms	768 KB	Output is correct
60	Correct	7 ms	768 KB	Output is correct
61	Correct	7 ms	768 KB	Output is correct
62	Correct	0 ms	384 KB	Output is correct
63	Correct	7 ms	768 KB	Output is correct