답안 #407363

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407363	2021-05-18T19:21:13 Z	MohamedAhmed04	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	146 ms	2152 KB

merchant

#include <bits/stdc++.h>

using namespace std ;

const long long inf = 1e18 ;
const int MAXN = 100 + 10 ;
const int MAXK = 1000 + 10 ;

bool Overflow_Mul(long double x , long double y)
{
	return (x * y > inf) ;
}

long long s[MAXN][MAXK] , b[MAXN][MAXK] ;
long long dist[MAXN][MAXN] , best[MAXN][MAXN] ;
long long ans[MAXN][MAXN] ;

int n , m , k ;

void preprocess()
{
	for(int x = 1 ; x <= n ; ++x)
	{
		for(int y = 1 ; y <= n ; ++y)
		{
			best[x][y] = 0 ;
			for(int z = 1 ; z <= k ; ++z)
			{
				if(b[x][z] != -1 && s[y][z] != -1)
					best[x][y] = max(best[x][y] , s[y][z] - b[x][z]) ;
			}
		}
	}
	for(int z = 1 ; z <= n ; ++z)
	{
		for(int x = 1 ; x <= n ; ++x)
		{
			for(int y = 1 ; y <= n ; ++y)
				dist[x][y] = min(dist[x][y] , dist[x][z] + dist[z][y]) ;
		}
	}
}

bool check(long long mid)
{
	for(int x = 1 ; x <= n ; ++x)
	{
		for(int y = 1 ; y <= n ; ++y)
		{
			ans[x][y] = -1ll * inf ;
			if(best[x][y] == inf || dist[x][y] == inf || x == y)
				continue ;
			if(!Overflow_Mul(mid , dist[x][y]))
				ans[x][y] = max(-1ll * inf , best[x][y] - mid * dist[x][y]) ;
		}
	}
	for(int z = 1 ; z <= n ; ++z)
	{
		for(int x = 1 ; x <= n ; ++x)
		{
			for(int y = 1 ; y <= n ; ++y)
				ans[x][y] = max(ans[x][y] , min(inf , ans[x][z] + ans[z][y])) ;
		}
	}
	for(int i = 1 ; i <= n ; ++i)
	{
		if(ans[i][i] >= 0)
			return true ;
	}
	return false ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m>>k ;
	for(int i = 1 ; i <= n ; ++i)
	{
		for(int j = 1 ; j <= k ; ++j)
			cin>>b[i][j]>>s[i][j] ;
	}
	for(int i = 1 ; i <= n ; ++i)
	{
		for(int j = 1 ; j <= n ; ++j)
			dist[i][j] = inf ;
	}
	for(int i = 0 ; i < m ; ++i)
	{
		int x , y , z ;
		cin>>x>>y>>z ;
		dist[x][y] = z ;
	}
	preprocess() ;
	long long ans = 0 ;
	long long l = 1 , r = 1e15 ;
	while(l <= r)
	{
		long long mid = (l + r) >> 1 ;
		if(check(mid))
			ans = mid , l = mid+1ll ;
		else
			r = mid-1ll ;
	}
	return cout<<ans<<"\n" , 0 ;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	113 ms	2152 KB	Output is correct
2	Correct	81 ms	1372 KB	Output is correct
3	Correct	85 ms	1368 KB	Output is correct
4	Correct	12 ms	844 KB	Output is correct
5	Correct	12 ms	856 KB	Output is correct
6	Correct	12 ms	856 KB	Output is correct
7	Correct	13 ms	908 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	12 ms	852 KB	Output is correct
10	Correct	12 ms	844 KB	Output is correct
11	Correct	12 ms	860 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	13 ms	916 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	856 KB	Output is correct
2	Correct	13 ms	908 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	12 ms	852 KB	Output is correct
5	Correct	12 ms	844 KB	Output is correct
6	Correct	12 ms	860 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	13 ms	916 KB	Output is correct
9	Correct	12 ms	876 KB	Output is correct
10	Correct	12 ms	844 KB	Output is correct
11	Correct	13 ms	916 KB	Output is correct
12	Correct	11 ms	844 KB	Output is correct
13	Correct	13 ms	916 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	12 ms	844 KB	Output is correct
16	Correct	13 ms	844 KB	Output is correct
17	Correct	12 ms	872 KB	Output is correct
18	Correct	12 ms	896 KB	Output is correct
19	Correct	13 ms	908 KB	Output is correct
20	Correct	13 ms	916 KB	Output is correct
21	Correct	13 ms	856 KB	Output is correct
22	Correct	12 ms	844 KB	Output is correct
23	Correct	14 ms	908 KB	Output is correct
24	Correct	12 ms	876 KB	Output is correct
25	Correct	13 ms	844 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	13 ms	912 KB	Output is correct
28	Correct	13 ms	844 KB	Output is correct
29	Correct	13 ms	912 KB	Output is correct
30	Correct	15 ms	940 KB	Output is correct
31	Correct	12 ms	844 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	844 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	13 ms	912 KB	Output is correct
4	Correct	13 ms	844 KB	Output is correct
5	Correct	13 ms	912 KB	Output is correct
6	Correct	15 ms	940 KB	Output is correct
7	Correct	12 ms	844 KB	Output is correct
8	Correct	88 ms	1544 KB	Output is correct
9	Correct	140 ms	2152 KB	Output is correct
10	Correct	84 ms	1356 KB	Output is correct
11	Correct	91 ms	1536 KB	Output is correct
12	Correct	92 ms	1484 KB	Output is correct
13	Correct	85 ms	1440 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	876 KB	Output is correct
2	Correct	12 ms	844 KB	Output is correct
3	Correct	13 ms	916 KB	Output is correct
4	Correct	11 ms	844 KB	Output is correct
5	Correct	13 ms	916 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	12 ms	844 KB	Output is correct
8	Correct	13 ms	844 KB	Output is correct
9	Correct	12 ms	872 KB	Output is correct
10	Correct	12 ms	896 KB	Output is correct
11	Correct	13 ms	908 KB	Output is correct
12	Correct	13 ms	916 KB	Output is correct
13	Correct	13 ms	856 KB	Output is correct
14	Correct	12 ms	844 KB	Output is correct
15	Correct	14 ms	908 KB	Output is correct
16	Correct	12 ms	876 KB	Output is correct
17	Correct	88 ms	1544 KB	Output is correct
18	Correct	140 ms	2152 KB	Output is correct
19	Correct	84 ms	1356 KB	Output is correct
20	Correct	91 ms	1536 KB	Output is correct
21	Correct	92 ms	1484 KB	Output is correct
22	Correct	85 ms	1440 KB	Output is correct
23	Correct	13 ms	844 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	13 ms	912 KB	Output is correct
26	Correct	13 ms	844 KB	Output is correct
27	Correct	13 ms	912 KB	Output is correct
28	Correct	15 ms	940 KB	Output is correct
29	Correct	12 ms	844 KB	Output is correct
30	Correct	113 ms	2152 KB	Output is correct
31	Correct	81 ms	1372 KB	Output is correct
32	Correct	85 ms	1368 KB	Output is correct
33	Correct	12 ms	844 KB	Output is correct
34	Correct	12 ms	856 KB	Output is correct
35	Correct	12 ms	856 KB	Output is correct
36	Correct	13 ms	908 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	12 ms	852 KB	Output is correct
39	Correct	12 ms	844 KB	Output is correct
40	Correct	12 ms	860 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	13 ms	916 KB	Output is correct
43	Correct	88 ms	1400 KB	Output is correct
44	Correct	85 ms	1536 KB	Output is correct
45	Correct	109 ms	2152 KB	Output is correct
46	Correct	99 ms	1536 KB	Output is correct
47	Correct	87 ms	1540 KB	Output is correct
48	Correct	87 ms	1548 KB	Output is correct
49	Correct	141 ms	2124 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	83 ms	1388 KB	Output is correct
53	Correct	84 ms	1356 KB	Output is correct
54	Correct	83 ms	1356 KB	Output is correct
55	Correct	88 ms	1356 KB	Output is correct
56	Correct	90 ms	1388 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	14 ms	844 KB	Output is correct
59	Correct	14 ms	944 KB	Output is correct
60	Correct	14 ms	844 KB	Output is correct
61	Correct	146 ms	2128 KB	Output is correct
62	Correct	145 ms	2112 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct

답안 #407363

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