oj.uz

Submission #80301

# Submission time Handle Problem Language Result Execution time Memory
80301 2018-10-19T21:38:42 Z Plurm Travelling Merchant (APIO17_merchant) C++11
100 / 100
 130 ms 1792 KB 
#include <bits/stdc++.h>
using namespace std;
int b[128][1024];
int s[128][1024];
int profit[128][128];
long long d1[128][128];
long long d2[128][128];
int main(){
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= k; j++){
			scanf("%d%d",&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){
					profit[i][j] = max(profit[i][j],s[j][l] - b[i][l]);
				}
			}
			d1[i][j] = 1e18;
		}
	}
	for(int i = 1; i <= m; i++){
		int v,w,t;
		scanf("%d%d%d",&v,&w,&t);
		d1[v][w] = t;
	}
	for(int l = 1; l <= n; l++){
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				d1[i][j] = min(d1[i][j],d1[i][l] + d1[l][j]);
			}
		}
	}
	long long lo = 0ll;
	long long hi = 1e12;
	long long mid;
	while(lo < hi){
		mid = (lo + hi + 1ll)/2ll;
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				d2[i][j] = profit[i][j] - mid*min((long long)1e18/mid,d1[i][j]);
			}
		}
		for(int l = 1; l <= n; l++){
			for(int i = 1; i <= n; i++){
				for(int j = 1; j <= n; j++){
					d2[i][j] = max(d2[i][j],d2[i][l] + d2[l][j]);
				}
			}
		}
		bool ok = false;
		for(int i = 1; i <= n; i++){
			if(d2[i][i] >= 0){
				ok = true;
			}
		}
		if(ok){
			lo = mid;
		}else{
			hi = mid-1ll;
		}
	}
	printf("%lld\n",lo);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&m,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:13:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d",&b[i][j],&s[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&v,&w,&t);
   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 1276 KB Output is correct
2 Correct 57 ms 1396 KB Output is correct
3 Correct 58 ms 1472 KB Output is correct
4 Correct 12 ms 1472 KB Output is correct
5 Correct 10 ms 1472 KB Output is correct
6 Correct 10 ms 1472 KB Output is correct
7 Correct 11 ms 1472 KB Output is correct
8 Correct 2 ms 1472 KB Output is correct
9 Correct 10 ms 1472 KB Output is correct
10 Correct 10 ms 1472 KB Output is correct
11 Correct 10 ms 1472 KB Output is correct
12 Correct 2 ms 1472 KB Output is correct
13 Correct 11 ms 1472 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 1660 KB Output is correct
2 Correct 117 ms 1748 KB Output is correct
3 Correct 60 ms 1792 KB Output is correct
4 Correct 63 ms 1792 KB Output is correct
5 Correct 64 ms 1792 KB Output is correct
6 Correct 63 ms 1792 KB Output is correct
7 Correct 11 ms 1472 KB Output is correct
8 Correct 2 ms 1472 KB Output is correct
9 Correct 11 ms 1472 KB Output is correct
10 Correct 11 ms 1472 KB Output is correct
11 Correct 11 ms 1472 KB Output is correct
12 Correct 10 ms 1472 KB Output is correct
13 Correct 10 ms 1472 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1472 KB Output is correct
2 Correct 10 ms 1472 KB Output is correct
3 Correct 10 ms 1472 KB Output is correct
4 Correct 10 ms 1472 KB Output is correct
5 Correct 11 ms 1472 KB Output is correct
6 Correct 2 ms 1472 KB Output is correct
7 Correct 11 ms 1472 KB Output is correct
8 Correct 11 ms 1472 KB Output is correct
9 Correct 11 ms 1472 KB Output is correct
10 Correct 10 ms 1472 KB Output is correct
11 Correct 12 ms 1472 KB Output is correct
12 Correct 11 ms 1472 KB Output is correct
13 Correct 10 ms 1472 KB Output is correct
14 Correct 10 ms 1472 KB Output is correct
15 Correct 12 ms 1472 KB Output is correct
16 Correct 10 ms 1472 KB Output is correct
17 Correct 65 ms 1660 KB Output is correct
18 Correct 117 ms 1748 KB Output is correct
19 Correct 60 ms 1792 KB Output is correct
20 Correct 63 ms 1792 KB Output is correct
21 Correct 64 ms 1792 KB Output is correct
22 Correct 63 ms 1792 KB Output is correct
23 Correct 11 ms 1472 KB Output is correct
24 Correct 2 ms 1472 KB Output is correct
25 Correct 11 ms 1472 KB Output is correct
26 Correct 11 ms 1472 KB Output is correct
27 Correct 11 ms 1472 KB Output is correct
28 Correct 10 ms 1472 KB Output is correct
29 Correct 10 ms 1472 KB Output is correct
30 Correct 58 ms 1792 KB Output is correct
31 Correct 61 ms 1792 KB Output is correct
32 Correct 79 ms 1792 KB Output is correct
33 Correct 59 ms 1792 KB Output is correct
34 Correct 63 ms 1792 KB Output is correct
35 Correct 64 ms 1792 KB Output is correct
36 Correct 127 ms 1792 KB Output is correct
37 Correct 2 ms 1792 KB Output is correct
38 Correct 2 ms 1792 KB Output is correct
39 Correct 56 ms 1792 KB Output is correct
40 Correct 61 ms 1792 KB Output is correct
41 Correct 59 ms 1792 KB Output is correct
42 Correct 57 ms 1792 KB Output is correct
43 Correct 58 ms 1792 KB Output is correct
44 Correct 2 ms 1792 KB Output is correct
45 Correct 14 ms 1792 KB Output is correct
46 Correct 13 ms 1792 KB Output is correct
47 Correct 13 ms 1792 KB Output is correct
48 Correct 126 ms 1792 KB Output is correct
49 Correct 130 ms 1792 KB Output is correct
50 Correct 2 ms 1792 KB Output is correct
51 Correct 92 ms 1276 KB Output is correct
52 Correct 57 ms 1396 KB Output is correct
53 Correct 58 ms 1472 KB Output is correct
54 Correct 12 ms 1472 KB Output is correct
55 Correct 10 ms 1472 KB Output is correct
56 Correct 10 ms 1472 KB Output is correct
57 Correct 11 ms 1472 KB Output is correct
58 Correct 2 ms 1472 KB Output is correct
59 Correct 10 ms 1472 KB Output is correct
60 Correct 10 ms 1472 KB Output is correct
61 Correct 10 ms 1472 KB Output is correct
62 Correct 2 ms 1472 KB Output is correct
63 Correct 11 ms 1472 KB Output is correct