답안 #107397

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107397	2019-04-23T21:01:13 Z	Noam527	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	129 ms	2228 KB

merchant

#include <bits/stdc++.h>
#define CHECK cout << "ok" << endl
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 1e18;
const int OO = 1;
const int OOO = 1;
using namespace std;

int n, m, k;
ll B[101][1001], S[101][1001];
ll D[101][101] = {}, W[101][101];
ll d[101][101];
ll dist[101], cnt[101];

bool check(ll x) {
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++)
		d[i][j] = W[i][j] - x * D[i][j];

	for (int i = 0; i < n; i++) dist[i] = cnt[i] = 0;
	for (int iter = 0; iter <= n; iter++) {
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++) {
				if (i != j) {
					if (make_pair(dist[j], cnt[j]) < make_pair(dist[i] + d[i][j], cnt[i] + 1)) {
						if (iter == n) return true;
						dist[j] = dist[i] + d[i][j];
						cnt[j] = cnt[i] + 1;
					}
				}
			}
	}
	return false;
}

void preprocess() {
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			if (i != j) {
				for (int x = 0; x < k; x++)
					if (B[i][x] != -1 && S[j][x] != -1)
						W[i][j] = max(W[i][j], S[j][x] - B[i][x]);
			}
	for (int u = 0; u < n; u++)
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				D[i][j] = min(D[i][j], D[i][u] + D[u][j]);
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m >> k;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++)
			cin >> B[i][j] >> S[i][j];
	}
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {
		W[i][j] = 0;
		if (i != j) D[i][j] = inf;
	}
	for (int i = 0, u, v, w; i < m; i++) {
		cin >> u >> v >> w;
		--u, --v;
		D[u][v] = w;
	}
	preprocess();

	ll lo = 0, hi = 1e9 + 3, mid;
	while (lo < hi) {
		mid = (lo + hi + 1) / 2;
		if (check(mid)) lo = mid;
		else hi = mid - 1;
	}
	finish(lo);
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	2196 KB	Output is correct
2	Correct	52 ms	1324 KB	Output is correct
3	Correct	81 ms	1408 KB	Output is correct
4	Correct	15 ms	896 KB	Output is correct
5	Correct	10 ms	896 KB	Output is correct
6	Correct	10 ms	896 KB	Output is correct
7	Correct	15 ms	896 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	9 ms	896 KB	Output is correct
10	Correct	10 ms	896 KB	Output is correct
11	Correct	9 ms	896 KB	Output is correct
12	Correct	3 ms	512 KB	Output is correct
13	Correct	16 ms	896 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	896 KB	Output is correct
2	Correct	9 ms	896 KB	Output is correct
3	Correct	9 ms	972 KB	Output is correct
4	Correct	12 ms	896 KB	Output is correct
5	Correct	15 ms	896 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	9 ms	896 KB	Output is correct
8	Correct	10 ms	896 KB	Output is correct
9	Correct	10 ms	896 KB	Output is correct
10	Correct	16 ms	896 KB	Output is correct
11	Correct	15 ms	896 KB	Output is correct
12	Correct	12 ms	896 KB	Output is correct
13	Correct	10 ms	896 KB	Output is correct
14	Correct	11 ms	896 KB	Output is correct
15	Correct	11 ms	940 KB	Output is correct
16	Correct	10 ms	896 KB	Output is correct
17	Correct	13 ms	896 KB	Output is correct
18	Correct	3 ms	384 KB	Output is correct
19	Correct	12 ms	896 KB	Output is correct
20	Correct	11 ms	896 KB	Output is correct
21	Correct	10 ms	896 KB	Output is correct
22	Correct	11 ms	896 KB	Output is correct
23	Correct	10 ms	896 KB	Output is correct
24	Correct	10 ms	896 KB	Output is correct
25	Correct	15 ms	896 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	9 ms	896 KB	Output is correct
28	Correct	10 ms	896 KB	Output is correct
29	Correct	9 ms	896 KB	Output is correct
30	Correct	3 ms	512 KB	Output is correct
31	Correct	16 ms	896 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	59 ms	1656 KB	Output is correct
2	Correct	99 ms	2168 KB	Output is correct
3	Correct	55 ms	1408 KB	Output is correct
4	Correct	55 ms	1536 KB	Output is correct
5	Correct	62 ms	1620 KB	Output is correct
6	Correct	52 ms	1408 KB	Output is correct
7	Correct	13 ms	896 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	12 ms	896 KB	Output is correct
10	Correct	11 ms	896 KB	Output is correct
11	Correct	10 ms	896 KB	Output is correct
12	Correct	11 ms	896 KB	Output is correct
13	Correct	10 ms	896 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	896 KB	Output is correct
2	Correct	9 ms	896 KB	Output is correct
3	Correct	9 ms	972 KB	Output is correct
4	Correct	12 ms	896 KB	Output is correct
5	Correct	15 ms	896 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	9 ms	896 KB	Output is correct
8	Correct	10 ms	896 KB	Output is correct
9	Correct	10 ms	896 KB	Output is correct
10	Correct	16 ms	896 KB	Output is correct
11	Correct	15 ms	896 KB	Output is correct
12	Correct	12 ms	896 KB	Output is correct
13	Correct	10 ms	896 KB	Output is correct
14	Correct	11 ms	896 KB	Output is correct
15	Correct	11 ms	940 KB	Output is correct
16	Correct	10 ms	896 KB	Output is correct
17	Correct	59 ms	1656 KB	Output is correct
18	Correct	99 ms	2168 KB	Output is correct
19	Correct	55 ms	1408 KB	Output is correct
20	Correct	55 ms	1536 KB	Output is correct
21	Correct	62 ms	1620 KB	Output is correct
22	Correct	52 ms	1408 KB	Output is correct
23	Correct	13 ms	896 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	12 ms	896 KB	Output is correct
26	Correct	11 ms	896 KB	Output is correct
27	Correct	10 ms	896 KB	Output is correct
28	Correct	11 ms	896 KB	Output is correct
29	Correct	10 ms	896 KB	Output is correct
30	Correct	61 ms	1460 KB	Output is correct
31	Correct	59 ms	1536 KB	Output is correct
32	Correct	79 ms	2168 KB	Output is correct
33	Correct	60 ms	1536 KB	Output is correct
34	Correct	60 ms	1536 KB	Output is correct
35	Correct	108 ms	1580 KB	Output is correct
36	Correct	96 ms	2168 KB	Output is correct
37	Correct	2 ms	384 KB	Output is correct
38	Correct	2 ms	512 KB	Output is correct
39	Correct	54 ms	1476 KB	Output is correct
40	Correct	56 ms	1324 KB	Output is correct
41	Correct	57 ms	1408 KB	Output is correct
42	Correct	63 ms	1528 KB	Output is correct
43	Correct	57 ms	1408 KB	Output is correct
44	Correct	2 ms	384 KB	Output is correct
45	Correct	13 ms	1024 KB	Output is correct
46	Correct	12 ms	1024 KB	Output is correct
47	Correct	36 ms	1024 KB	Output is correct
48	Correct	104 ms	2168 KB	Output is correct
49	Correct	129 ms	2228 KB	Output is correct
50	Correct	3 ms	532 KB	Output is correct
51	Correct	80 ms	2196 KB	Output is correct
52	Correct	52 ms	1324 KB	Output is correct
53	Correct	81 ms	1408 KB	Output is correct
54	Correct	15 ms	896 KB	Output is correct
55	Correct	10 ms	896 KB	Output is correct
56	Correct	10 ms	896 KB	Output is correct
57	Correct	15 ms	896 KB	Output is correct
58	Correct	2 ms	384 KB	Output is correct
59	Correct	9 ms	896 KB	Output is correct
60	Correct	10 ms	896 KB	Output is correct
61	Correct	9 ms	896 KB	Output is correct
62	Correct	3 ms	512 KB	Output is correct
63	Correct	16 ms	896 KB	Output is correct

답안 #107397

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