Submission #407362

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
407362	2021-05-18T19:20:46 Z	MohamedAhmed04	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	148 ms	4688 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][MAXK] ;
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

#	Verdict	Execution time	Memory	Grader output
1	Correct	140 ms	3816 KB	Output is correct
2	Correct	85 ms	1768 KB	Output is correct
3	Correct	83 ms	1740 KB	Output is correct
4	Correct	12 ms	972 KB	Output is correct
5	Correct	12 ms	1048 KB	Output is correct
6	Correct	12 ms	1044 KB	Output is correct
7	Correct	13 ms	1100 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	12 ms	1036 KB	Output is correct
10	Correct	14 ms	1056 KB	Output is correct
11	Correct	12 ms	1048 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Correct	13 ms	1100 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	1044 KB	Output is correct
2	Correct	13 ms	1100 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	12 ms	1036 KB	Output is correct
5	Correct	14 ms	1056 KB	Output is correct
6	Correct	12 ms	1048 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	13 ms	1100 KB	Output is correct
9	Correct	15 ms	1068 KB	Output is correct
10	Correct	12 ms	960 KB	Output is correct
11	Correct	13 ms	1084 KB	Output is correct
12	Correct	12 ms	972 KB	Output is correct
13	Correct	13 ms	1096 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	12 ms	972 KB	Output is correct
16	Correct	13 ms	1092 KB	Output is correct
17	Correct	12 ms	1060 KB	Output is correct
18	Correct	13 ms	972 KB	Output is correct
19	Correct	14 ms	1124 KB	Output is correct
20	Correct	13 ms	1124 KB	Output is correct
21	Correct	13 ms	1056 KB	Output is correct
22	Correct	13 ms	1080 KB	Output is correct
23	Correct	17 ms	1100 KB	Output is correct
24	Correct	12 ms	972 KB	Output is correct
25	Correct	13 ms	1104 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	13 ms	1124 KB	Output is correct
28	Correct	13 ms	1100 KB	Output is correct
29	Correct	13 ms	1124 KB	Output is correct
30	Correct	13 ms	972 KB	Output is correct
31	Correct	12 ms	972 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	1104 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	13 ms	1124 KB	Output is correct
4	Correct	13 ms	1100 KB	Output is correct
5	Correct	13 ms	1124 KB	Output is correct
6	Correct	13 ms	972 KB	Output is correct
7	Correct	12 ms	972 KB	Output is correct
8	Correct	91 ms	1972 KB	Output is correct
9	Correct	140 ms	4312 KB	Output is correct
10	Correct	85 ms	1924 KB	Output is correct
11	Correct	89 ms	2136 KB	Output is correct
12	Correct	89 ms	2112 KB	Output is correct
13	Correct	86 ms	1976 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	1068 KB	Output is correct
2	Correct	12 ms	960 KB	Output is correct
3	Correct	13 ms	1084 KB	Output is correct
4	Correct	12 ms	972 KB	Output is correct
5	Correct	13 ms	1096 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	12 ms	972 KB	Output is correct
8	Correct	13 ms	1092 KB	Output is correct
9	Correct	12 ms	1060 KB	Output is correct
10	Correct	13 ms	972 KB	Output is correct
11	Correct	14 ms	1124 KB	Output is correct
12	Correct	13 ms	1124 KB	Output is correct
13	Correct	13 ms	1056 KB	Output is correct
14	Correct	13 ms	1080 KB	Output is correct
15	Correct	17 ms	1100 KB	Output is correct
16	Correct	12 ms	972 KB	Output is correct
17	Correct	91 ms	1972 KB	Output is correct
18	Correct	140 ms	4312 KB	Output is correct
19	Correct	85 ms	1924 KB	Output is correct
20	Correct	89 ms	2136 KB	Output is correct
21	Correct	89 ms	2112 KB	Output is correct
22	Correct	86 ms	1976 KB	Output is correct
23	Correct	13 ms	1104 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	13 ms	1124 KB	Output is correct
26	Correct	13 ms	1100 KB	Output is correct
27	Correct	13 ms	1124 KB	Output is correct
28	Correct	13 ms	972 KB	Output is correct
29	Correct	12 ms	972 KB	Output is correct
30	Correct	140 ms	3816 KB	Output is correct
31	Correct	85 ms	1768 KB	Output is correct
32	Correct	83 ms	1740 KB	Output is correct
33	Correct	12 ms	972 KB	Output is correct
34	Correct	12 ms	1048 KB	Output is correct
35	Correct	12 ms	1044 KB	Output is correct
36	Correct	13 ms	1100 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	12 ms	1036 KB	Output is correct
39	Correct	14 ms	1056 KB	Output is correct
40	Correct	12 ms	1048 KB	Output is correct
41	Correct	1 ms	460 KB	Output is correct
42	Correct	13 ms	1100 KB	Output is correct
43	Correct	83 ms	1740 KB	Output is correct
44	Correct	85 ms	2000 KB	Output is correct
45	Correct	105 ms	3032 KB	Output is correct
46	Correct	86 ms	1996 KB	Output is correct
47	Correct	86 ms	1996 KB	Output is correct
48	Correct	86 ms	2116 KB	Output is correct
49	Correct	143 ms	4404 KB	Output is correct
50	Correct	1 ms	320 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	84 ms	1740 KB	Output is correct
53	Correct	88 ms	1904 KB	Output is correct
54	Correct	84 ms	1872 KB	Output is correct
55	Correct	86 ms	1836 KB	Output is correct
56	Correct	83 ms	1740 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	14 ms	1200 KB	Output is correct
59	Correct	15 ms	1196 KB	Output is correct
60	Correct	14 ms	1200 KB	Output is correct
61	Correct	147 ms	4548 KB	Output is correct
62	Correct	148 ms	4688 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct

Submission #407362

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