oj.uz

Submission #336082

# Submission time Handle Problem Language Result Execution time Memory
336082 2020-12-14T17:12:13 Z CaroLinda Travelling Merchant (APIO17_merchant) C++14
100 / 100
 111 ms 4588 KB 
#include <bits/stdc++.h>

#define eps 0.000000001
#define debug printf
#define ll long long
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x.size())

const int MAXN = 110 ;
const int MAXK = 1010 ;
const ll inf = 1e15+10LL ;

using namespace std ;

int N , M , K ;
ll buying[MAXN][MAXK] , selling[MAXN][MAXK] ;
ll dist[MAXN][MAXN ] , cost[MAXN][MAXN] ;
ll dCheap[MAXN][MAXN] ;

bool test(ll val)
{
	for(int i = 1 ; i <= N ; i++ )
		for(int j = 1 ; j <= N ; j++ )
		{
			dCheap[i][j] = inf ;

			if( dist[i][j] <= (inf/val) )
				dCheap[i][j] = dist[i][j] * val - cost[i][j] ;
		}
	
	for(int i = 1 ; i <= N ; i++ )
		for(int j = 1 ; j <= N ; j++ )
			for(int g = 1 ; g <= N ; g++ ) 
				dCheap[i][j] = min( dCheap[i][j] , dCheap[i][g] + dCheap[g][j] ) ;

	for(int i = 1 ; i <= N ; i++ )
		for(int j= i+1 ; j<= N ; j++ )
			if( dCheap[i][j] + dCheap[j][i] <= 0 ) return true ; 
	
	return false ;

}

int main()
{
	scanf("%d %d %d", &N, &M, &K) ;
	for(int i = 1 ; i <= N ; i++ )
		for(int j = 1 ; j <= K ; j++ ) scanf("%lld %lld", &buying[i][j], &selling[i][j] ) ;
	
	for(int i = 1 ; i <= N ; i++ )
		for(int j = i+1 ; j <= N ; j++ ) dist[i][j] = dist[j][i] = inf ;

	for(int i = 1 ,u,v,t ; i <= M ; i++ )
	{
		scanf("%d %d %d", &u, &v, &t ) ;
		dist[u][v] = (ll)t ;
	}

	for(int i = 1 ; i <= N ; i++ )
		for(int j= 1 ; j <= N ; j++ )
			for(int g = 1 ; g <= N ; g++ )
				dist[j][g] = min(dist[j][g], dist[j][i] + dist[i][g] ) ;

	for(int i = 1 ; i<= N ; i++ )
		for(int j = 1 ; j <= N ; j++ )
		{
			ll best = 0;

			for(int k = 1 ; k <= K ; k++ )
				if( buying[i][k] != -1 && selling[j][k] != -1 )
					best = max(best, -buying[i][k] + selling[j][k] ) ;

			cost[i][j] = best ;
		}

	ll l = 1 , r = 1000000000000000LL , mid , best = 0LL ;

	while( l <= r )
	{
		mid = (l+r) >> 1 ;

		if( test(mid) )
		{
			best = mid ;
			l = mid+1 ;
		}
		else r = mid-1 ;

	} 	                           

	printf("%lld\n", best ) ; 

}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |  scanf("%d %d %d", &N, &M, &K) ;
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:48:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   for(int j = 1 ; j <= K ; j++ ) scanf("%lld %lld", &buying[i][j], &selling[i][j] ) ;
      |                                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:55:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |   scanf("%d %d %d", &u, &v, &t ) ;
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 2156 KB Output is correct
2 Correct 67 ms 1388 KB Output is correct
3 Correct 68 ms 1388 KB Output is correct
4 Correct 11 ms 876 KB Output is correct
5 Correct 10 ms 876 KB Output is correct
6 Correct 10 ms 876 KB Output is correct
7 Correct 11 ms 876 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 12 ms 876 KB Output is correct
10 Correct 10 ms 876 KB Output is correct
11 Correct 10 ms 876 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 10 ms 1004 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 876 KB Output is correct
2 Correct 10 ms 876 KB Output is correct
3 Correct 11 ms 876 KB Output is correct
4 Correct 9 ms 876 KB Output is correct
5 Correct 11 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 11 ms 876 KB Output is correct
9 Correct 10 ms 876 KB Output is correct
10 Correct 10 ms 876 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 11 ms 1004 KB Output is correct
13 Correct 11 ms 876 KB Output is correct
14 Correct 10 ms 876 KB Output is correct
15 Correct 11 ms 1004 KB Output is correct
16 Correct 10 ms 876 KB Output is correct
17 Correct 10 ms 876 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 11 ms 876 KB Output is correct
20 Correct 11 ms 876 KB Output is correct
21 Correct 11 ms 1024 KB Output is correct
22 Correct 10 ms 876 KB Output is correct
23 Correct 10 ms 876 KB Output is correct
24 Correct 10 ms 876 KB Output is correct
25 Correct 11 ms 876 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 12 ms 876 KB Output is correct
28 Correct 10 ms 876 KB Output is correct
29 Correct 10 ms 876 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 10 ms 1004 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1516 KB Output is correct
2 Correct 111 ms 2156 KB Output is correct
3 Correct 71 ms 1516 KB Output is correct
4 Correct 72 ms 1516 KB Output is correct
5 Correct 71 ms 1644 KB Output is correct
6 Correct 70 ms 1516 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 11 ms 876 KB Output is correct
10 Correct 11 ms 876 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 10 ms 876 KB Output is correct
13 Correct 10 ms 876 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 876 KB Output is correct
2 Correct 10 ms 876 KB Output is correct
3 Correct 11 ms 876 KB Output is correct
4 Correct 9 ms 876 KB Output is correct
5 Correct 11 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 11 ms 876 KB Output is correct
9 Correct 10 ms 876 KB Output is correct
10 Correct 10 ms 876 KB Output is correct
11 Correct 13 ms 1004 KB Output is correct
12 Correct 11 ms 1004 KB Output is correct
13 Correct 11 ms 876 KB Output is correct
14 Correct 10 ms 876 KB Output is correct
15 Correct 11 ms 1004 KB Output is correct
16 Correct 10 ms 876 KB Output is correct
17 Correct 74 ms 1516 KB Output is correct
18 Correct 111 ms 2156 KB Output is correct
19 Correct 71 ms 1516 KB Output is correct
20 Correct 72 ms 1516 KB Output is correct
21 Correct 71 ms 1644 KB Output is correct
22 Correct 70 ms 1516 KB Output is correct
23 Correct 10 ms 876 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 11 ms 876 KB Output is correct
26 Correct 11 ms 876 KB Output is correct
27 Correct 11 ms 1024 KB Output is correct
28 Correct 10 ms 876 KB Output is correct
29 Correct 10 ms 876 KB Output is correct
30 Correct 70 ms 1408 KB Output is correct
31 Correct 70 ms 1716 KB Output is correct
32 Correct 97 ms 2668 KB Output is correct
33 Correct 74 ms 1772 KB Output is correct
34 Correct 74 ms 1644 KB Output is correct
35 Correct 75 ms 1772 KB Output is correct
36 Correct 108 ms 4076 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 68 ms 1516 KB Output is correct
40 Correct 70 ms 1516 KB Output is correct
41 Correct 69 ms 1516 KB Output is correct
42 Correct 69 ms 1516 KB Output is correct
43 Correct 69 ms 1388 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 15 ms 1004 KB Output is correct
46 Correct 12 ms 1004 KB Output is correct
47 Correct 11 ms 1004 KB Output is correct
48 Correct 108 ms 4204 KB Output is correct
49 Correct 111 ms 4588 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 106 ms 2156 KB Output is correct
52 Correct 67 ms 1388 KB Output is correct
53 Correct 68 ms 1388 KB Output is correct
54 Correct 11 ms 876 KB Output is correct
55 Correct 10 ms 876 KB Output is correct
56 Correct 10 ms 876 KB Output is correct
57 Correct 11 ms 876 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 12 ms 876 KB Output is correct
60 Correct 10 ms 876 KB Output is correct
61 Correct 10 ms 876 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 10 ms 1004 KB Output is correct