oj.uz

Submission #99898

# Submission time Handle Problem Language Result Execution time Memory
99898 2019-03-08T14:18:05 Z TadijaSebez Travelling Merchant (APIO17_merchant) C++11
100 / 100
 104 ms 1528 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf=1e18;
const int N=105;
const int K=1050;
int b[N][K],s[N][K],p[N][N];
ll dist[N][N],work[N][N];
int main()
{
	int n,m,k,u,v;
	scanf("%i %i %i",&n,&m,&k);
	for(int i=1;i<=n;i++) for(int j=1;j<=k;j++) scanf("%i %i",&b[i][j],&s[i][j]);
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) for(int l=1;l<=k;l++) if(b[i][l]!=-1 && s[j][l]!=-1) p[i][j]=max(p[i][j],s[j][l]-b[i][l]);
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) dist[i][j]=inf;
	for(int i=1;i<=m;i++) scanf("%i %i",&u,&v),scanf("%lld",&dist[u][v]);
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) for(int l=1;l<=n;l++) dist[j][l]=min(dist[j][l],dist[j][i]+dist[i][l]);
	int top=1e9,bot=1,mid,ans=0;
	while(top>=bot)
	{
		mid=top+bot>>1;
		for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) work[i][j]=(ll)mid*min(dist[i][j],inf/mid)-p[i][j];
		for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) for(int l=1;l<=n;l++) work[j][l]=min(work[j][l],work[j][i]+work[i][l]);
		bool ok=0;for(int i=1;i<=n;i++) ok|=work[i][i]<=0;
		if(ok) ans=mid,bot=mid+1;
		else top=mid-1;
	}
	printf("%i\n",ans);
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:21:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   mid=top+bot>>1;
       ~~~^~~~
merchant.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i %i",&n,&m,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
merchant.cpp:13:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) for(int j=1;j<=k;j++) scanf("%i %i",&b[i][j],&s[i][j]);
                                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:16:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=m;i++) scanf("%i %i",&u,&v),scanf("%lld",&dist[u][v]);
                        ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:16:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 1400 KB Output is correct
2 Correct 37 ms 1280 KB Output is correct
3 Correct 51 ms 1280 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 8 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 1396 KB Output is correct
2 Correct 91 ms 1400 KB Output is correct
3 Correct 38 ms 1372 KB Output is correct
4 Correct 46 ms 1280 KB Output is correct
5 Correct 46 ms 1528 KB Output is correct
6 Correct 51 ms 1408 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 10 ms 768 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 768 KB Output is correct
2 Correct 7 ms 768 KB Output is correct
3 Correct 7 ms 768 KB Output is correct
4 Correct 8 ms 768 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 9 ms 768 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 9 ms 896 KB Output is correct
13 Correct 9 ms 768 KB Output is correct
14 Correct 8 ms 768 KB Output is correct
15 Correct 8 ms 896 KB Output is correct
16 Correct 8 ms 896 KB Output is correct
17 Correct 56 ms 1396 KB Output is correct
18 Correct 91 ms 1400 KB Output is correct
19 Correct 38 ms 1372 KB Output is correct
20 Correct 46 ms 1280 KB Output is correct
21 Correct 46 ms 1528 KB Output is correct
22 Correct 51 ms 1408 KB Output is correct
23 Correct 9 ms 768 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 8 ms 896 KB Output is correct
27 Correct 8 ms 896 KB Output is correct
28 Correct 8 ms 896 KB Output is correct
29 Correct 10 ms 768 KB Output is correct
30 Correct 40 ms 1280 KB Output is correct
31 Correct 48 ms 1400 KB Output is correct
32 Correct 63 ms 1400 KB Output is correct
33 Correct 43 ms 1280 KB Output is correct
34 Correct 41 ms 1380 KB Output is correct
35 Correct 58 ms 1396 KB Output is correct
36 Correct 97 ms 1400 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 39 ms 1408 KB Output is correct
40 Correct 43 ms 1408 KB Output is correct
41 Correct 61 ms 1528 KB Output is correct
42 Correct 38 ms 1408 KB Output is correct
43 Correct 39 ms 1280 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 14 ms 1024 KB Output is correct
46 Correct 11 ms 896 KB Output is correct
47 Correct 11 ms 768 KB Output is correct
48 Correct 102 ms 1488 KB Output is correct
49 Correct 104 ms 1400 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 77 ms 1400 KB Output is correct
52 Correct 37 ms 1280 KB Output is correct
53 Correct 51 ms 1280 KB Output is correct
54 Correct 7 ms 896 KB Output is correct
55 Correct 9 ms 896 KB Output is correct
56 Correct 7 ms 896 KB Output is correct
57 Correct 8 ms 896 KB Output is correct
58 Correct 3 ms 384 KB Output is correct
59 Correct 9 ms 896 KB Output is correct
60 Correct 7 ms 896 KB Output is correct
61 Correct 8 ms 896 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 8 ms 896 KB Output is correct