답안 #230049

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
230049	2020-05-07T21:17:05 Z	MetB	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	255 ms	3380 KB

merchant

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
#define N 2000003
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;

ll un_dist[200][200], deal[200][200];
ll sell[200][2000], buy[200][2000], n, m, k;
ll d[200][200];

bool check (ll x) {

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++) {
			if (un_dist[i][j] == INF) d[i][j] = -INF;
			else {
				d[i][j] = deal[i][j] - x * un_dist[i][j];
			}
			d[i][j] = max (d[i][j], -INF);
		}


	for (int k = 0; k < n; k++)
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				if (d[i][j] < d[i][k] + d[k][j]) d[i][j] = d[i][k] + d[k][j];

	for (int i = 0; i < n; i++)
		if (d[i][i] >= 0) return true;
	if (!x) return true;

	return false;
}
 
int main () {
	cin >> n >> m >> k;

	for (int i = 0; i < n; i++)
		for (int j = 0; j < k; j++) {
			cin >> buy[i][j] >> sell[i][j];
		}

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			for (int it = 0; it < k; it++) {
				if (sell[j][it] == -1 || buy[i][it] == -1) continue;
				deal[i][j] = max (deal[i][j], sell[j][it] - buy[i][it]);
			}

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			un_dist[i][j] = INF;

	for (int i = 0; i < m; i++) {
		ll u, v, l;
		cin >> u >> v >> l;
		u--, v--;
		un_dist[u][v] = l;
	}

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

	ll l = 0, r = 1e9 + 10;

	while (l < r) {
		ll mid = (l + r + 1) / 2;
		if (check (mid)) l = mid;
		else r = mid - 1;
	}

	cout << l << endl;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	130 ms	3064 KB	Output is correct
2	Correct	34 ms	1408 KB	Output is correct
3	Correct	38 ms	1408 KB	Output is correct
4	Correct	10 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	12 ms	896 KB	Output is correct
8	Correct	5 ms	512 KB	Output is correct
9	Correct	9 ms	896 KB	Output is correct
10	Correct	10 ms	896 KB	Output is correct
11	Correct	10 ms	896 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	12 ms	1024 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	116 ms	1912 KB	Output is correct
2	Correct	255 ms	3196 KB	Output is correct
3	Correct	91 ms	1664 KB	Output is correct
4	Correct	130 ms	1984 KB	Output is correct
5	Correct	126 ms	1920 KB	Output is correct
6	Correct	57 ms	1664 KB	Output is correct
7	Correct	21 ms	1024 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	22 ms	1152 KB	Output is correct
10	Correct	16 ms	1024 KB	Output is correct
11	Correct	15 ms	1024 KB	Output is correct
12	Correct	11 ms	1024 KB	Output is correct
13	Correct	11 ms	1152 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	1024 KB	Output is correct
2	Correct	10 ms	896 KB	Output is correct
3	Correct	11 ms	1024 KB	Output is correct
4	Correct	10 ms	1024 KB	Output is correct
5	Correct	19 ms	1024 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	10 ms	896 KB	Output is correct
8	Correct	11 ms	1024 KB	Output is correct
9	Correct	12 ms	896 KB	Output is correct
10	Correct	11 ms	1024 KB	Output is correct
11	Correct	14 ms	1024 KB	Output is correct
12	Correct	14 ms	1024 KB	Output is correct
13	Correct	12 ms	1152 KB	Output is correct
14	Correct	13 ms	1024 KB	Output is correct
15	Correct	16 ms	1024 KB	Output is correct
16	Correct	10 ms	896 KB	Output is correct
17	Correct	116 ms	1912 KB	Output is correct
18	Correct	255 ms	3196 KB	Output is correct
19	Correct	91 ms	1664 KB	Output is correct
20	Correct	130 ms	1984 KB	Output is correct
21	Correct	126 ms	1920 KB	Output is correct
22	Correct	57 ms	1664 KB	Output is correct
23	Correct	21 ms	1024 KB	Output is correct
24	Correct	4 ms	384 KB	Output is correct
25	Correct	22 ms	1152 KB	Output is correct
26	Correct	16 ms	1024 KB	Output is correct
27	Correct	15 ms	1024 KB	Output is correct
28	Correct	11 ms	1024 KB	Output is correct
29	Correct	11 ms	1152 KB	Output is correct
30	Correct	45 ms	1536 KB	Output is correct
31	Correct	49 ms	1792 KB	Output is correct
32	Correct	93 ms	3192 KB	Output is correct
33	Correct	42 ms	1920 KB	Output is correct
34	Correct	43 ms	1792 KB	Output is correct
35	Correct	44 ms	1792 KB	Output is correct
36	Correct	230 ms	3380 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Correct	5 ms	384 KB	Output is correct
39	Correct	42 ms	1536 KB	Output is correct
40	Correct	46 ms	1664 KB	Output is correct
41	Correct	41 ms	1664 KB	Output is correct
42	Correct	41 ms	1536 KB	Output is correct
43	Correct	37 ms	1536 KB	Output is correct
44	Correct	5 ms	384 KB	Output is correct
45	Correct	18 ms	1152 KB	Output is correct
46	Correct	18 ms	1152 KB	Output is correct
47	Correct	17 ms	1152 KB	Output is correct
48	Correct	210 ms	3320 KB	Output is correct
49	Correct	209 ms	3320 KB	Output is correct
50	Correct	5 ms	384 KB	Output is correct
51	Correct	130 ms	3064 KB	Output is correct
52	Correct	34 ms	1408 KB	Output is correct
53	Correct	38 ms	1408 KB	Output is correct
54	Correct	10 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	12 ms	896 KB	Output is correct
58	Correct	5 ms	512 KB	Output is correct
59	Correct	9 ms	896 KB	Output is correct
60	Correct	10 ms	896 KB	Output is correct
61	Correct	10 ms	896 KB	Output is correct
62	Correct	5 ms	384 KB	Output is correct
63	Correct	12 ms	1024 KB	Output is correct

답안 #230049

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