답안 #372627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
372627	2021-03-01T07:24:58 Z	hivakarami	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	80 ms	4588 KB

merchant

#include<bits/stdc++.h>
 
using namespace std;
 
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
 
const int N = 100 + 100;
const int K = 1000 + 100;
const ll mod = 998244353;
const ll inf = 1e9 + 100;

int n, m, k;
ll dis[N][N], Dis[N][N], prf[N][N], s[N][K], b[N][K];



inline bool check(ll mid)
{
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
		{	
			if(dis[i][j] == inf)
				Dis[i][j] = -inf;
			else
				Dis[i][j] = prf[i][j] - dis[i][j] * mid;
		}
		Dis[i][i] = -inf;
	}
	
	/*
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
		{
			cout << i+1 << ' ' << j+1 << ' ' << Dis[i][j] << endl;
		}
	}
	*/
	
	for(int t = 0; t < n; t++)
	{
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < n; j++)
			{
				Dis[i][j] = max(Dis[i][j], Dis[i][t] + Dis[t][j]);
			}
		}
	}
	
	
	
	
	
	
	for(int i = 0; i < n; i++)
	{
		if(Dis[i][i] >= 0)
			return 1;
	}
	
	return 0;

} 


inline void floyd()
{

	for(int t = 0; t < n; t++)
	{
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < n; j++)
			{
				dis[i][j] = min(dis[i][j], dis[i][t] + dis[t][j]);
			}
		}
	}

}



inline ll max_profit(int u, int v)
{
	ll ans = 0;
	for(int i = 0; i < k; i++)	
	{	
		if(s[v][i] != -1 && b[u][i] != -1)
			ans = max(ans, s[v][i] - b[u][i]);
	}
	
	return ans;
}



int main()
{
    ios_base::sync_with_stdio(false), cin.tie(0), cout.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++)
		{
			dis[i][j] = inf;
			prf[i][j] = max_profit(i, j);
		}
		dis[i][i] = 0;	
	}
	
	
	for(int i = 0; i < m; i++)
	{
		int x, y, w;
		cin >> x >> y >> w;
		x--; y--;
		dis[x][y] = w;
	}
	
	
	floyd();
	
	
	
	/*
	cout << "//////////////////////////////////" << endl;

	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
		{
			cout << i+1 << ' ' << j+1 << ' ' << dis[i][j] << ' ' << prf[i][j] << endl;
		}
	}

	cout << "//////////////////////////////////" << endl;
	*/


	ll l = 0, r = inf;
	
	while(l + 1 < r)
	{
		ll mid = (l + r) / 2;
		
		if(check(mid))
		{
			l = mid;
		}
		else
		{
			r = mid;
		}
		
	}
	
	cout << l << endl;
	
	
		
		
	return 0;
}




/*/
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
*/

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	72 ms	3436 KB	Output is correct
2	Correct	46 ms	1644 KB	Output is correct
3	Correct	40 ms	1772 KB	Output is correct
4	Correct	6 ms	1004 KB	Output is correct
5	Correct	7 ms	1152 KB	Output is correct
6	Correct	6 ms	1004 KB	Output is correct
7	Correct	7 ms	1004 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	6 ms	1004 KB	Output is correct
10	Correct	6 ms	1004 KB	Output is correct
11	Correct	8 ms	1004 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	7 ms	1004 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	1004 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	7 ms	1132 KB	Output is correct
4	Correct	7 ms	1132 KB	Output is correct
5	Correct	7 ms	1132 KB	Output is correct
6	Correct	7 ms	1004 KB	Output is correct
7	Correct	6 ms	1004 KB	Output is correct
8	Correct	42 ms	1900 KB	Output is correct
9	Correct	75 ms	3712 KB	Output is correct
10	Correct	40 ms	1772 KB	Output is correct
11	Correct	43 ms	2028 KB	Output is correct
12	Correct	52 ms	2028 KB	Output is correct
13	Correct	44 ms	1644 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	1024 KB	Output is correct
2	Correct	6 ms	1004 KB	Output is correct
3	Correct	7 ms	1004 KB	Output is correct
4	Correct	6 ms	1004 KB	Output is correct
5	Correct	7 ms	1132 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	6 ms	1004 KB	Output is correct
8	Correct	6 ms	1004 KB	Output is correct
9	Correct	7 ms	1004 KB	Output is correct
10	Correct	7 ms	1004 KB	Output is correct
11	Correct	16 ms	1132 KB	Output is correct
12	Correct	10 ms	1132 KB	Output is correct
13	Correct	7 ms	1004 KB	Output is correct
14	Correct	7 ms	1004 KB	Output is correct
15	Correct	11 ms	1132 KB	Output is correct
16	Correct	7 ms	1004 KB	Output is correct
17	Correct	42 ms	1900 KB	Output is correct
18	Correct	75 ms	3712 KB	Output is correct
19	Correct	40 ms	1772 KB	Output is correct
20	Correct	43 ms	2028 KB	Output is correct
21	Correct	52 ms	2028 KB	Output is correct
22	Correct	44 ms	1644 KB	Output is correct
23	Correct	7 ms	1004 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	7 ms	1132 KB	Output is correct
26	Correct	7 ms	1132 KB	Output is correct
27	Correct	7 ms	1132 KB	Output is correct
28	Correct	7 ms	1004 KB	Output is correct
29	Correct	6 ms	1004 KB	Output is correct
30	Correct	72 ms	3436 KB	Output is correct
31	Correct	46 ms	1644 KB	Output is correct
32	Correct	40 ms	1772 KB	Output is correct
33	Correct	6 ms	1004 KB	Output is correct
34	Correct	7 ms	1152 KB	Output is correct
35	Correct	6 ms	1004 KB	Output is correct
36	Correct	7 ms	1004 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	6 ms	1004 KB	Output is correct
39	Correct	6 ms	1004 KB	Output is correct
40	Correct	8 ms	1004 KB	Output is correct
41	Correct	1 ms	492 KB	Output is correct
42	Correct	7 ms	1004 KB	Output is correct
43	Correct	42 ms	1644 KB	Output is correct
44	Correct	50 ms	1900 KB	Output is correct
45	Correct	62 ms	3052 KB	Output is correct
46	Correct	42 ms	1872 KB	Output is correct
47	Correct	48 ms	1900 KB	Output is correct
48	Correct	42 ms	1908 KB	Output is correct
49	Correct	79 ms	4560 KB	Output is correct
50	Correct	1 ms	492 KB	Output is correct
51	Correct	1 ms	492 KB	Output is correct
52	Correct	39 ms	1644 KB	Output is correct
53	Correct	43 ms	1772 KB	Output is correct
54	Correct	41 ms	1768 KB	Output is correct
55	Correct	42 ms	1772 KB	Output is correct
56	Correct	39 ms	1644 KB	Output is correct
57	Correct	1 ms	364 KB	Output is correct
58	Correct	11 ms	1132 KB	Output is correct
59	Correct	8 ms	1132 KB	Output is correct
60	Correct	8 ms	1132 KB	Output is correct
61	Correct	80 ms	4588 KB	Output is correct
62	Correct	78 ms	4588 KB	Output is correct
63	Correct	1 ms	364 KB	Output is correct

답안 #372627

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