oj.uz

Submission #80299

# Submission time Handle Problem Language Result Execution time Memory
80299 2018-10-19T21:37:12 Z Plurm Travelling Merchant (APIO17_merchant) C++11
54 / 100
 154 ms 1804 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] = 1e8;
		}
	}
	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 = 1e18;
	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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 1316 KB Output is correct
2 Incorrect 83 ms 1412 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 1660 KB Output is correct
2 Correct 139 ms 1788 KB Output is correct
3 Correct 85 ms 1788 KB Output is correct
4 Correct 90 ms 1788 KB Output is correct
5 Correct 87 ms 1788 KB Output is correct
6 Correct 84 ms 1788 KB Output is correct
7 Correct 14 ms 1412 KB Output is correct
8 Correct 2 ms 1412 KB Output is correct
9 Correct 14 ms 1412 KB Output is correct
10 Correct 15 ms 1412 KB Output is correct
11 Correct 15 ms 1412 KB Output is correct
12 Correct 14 ms 1412 KB Output is correct
13 Correct 13 ms 1412 KB Output is correct

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1412 KB Output is correct
2 Correct 13 ms 1412 KB Output is correct
3 Correct 13 ms 1412 KB Output is correct
4 Correct 13 ms 1412 KB Output is correct
5 Correct 14 ms 1412 KB Output is correct
6 Correct 2 ms 1412 KB Output is correct
7 Correct 13 ms 1412 KB Output is correct
8 Correct 13 ms 1412 KB Output is correct
9 Correct 13 ms 1412 KB Output is correct
10 Correct 13 ms 1412 KB Output is correct
11 Correct 14 ms 1412 KB Output is correct
12 Correct 15 ms 1412 KB Output is correct
13 Correct 14 ms 1412 KB Output is correct
14 Correct 13 ms 1412 KB Output is correct
15 Correct 15 ms 1412 KB Output is correct
16 Correct 14 ms 1412 KB Output is correct
17 Correct 88 ms 1660 KB Output is correct
18 Correct 139 ms 1788 KB Output is correct
19 Correct 85 ms 1788 KB Output is correct
20 Correct 90 ms 1788 KB Output is correct
21 Correct 87 ms 1788 KB Output is correct
22 Correct 84 ms 1788 KB Output is correct
23 Correct 14 ms 1412 KB Output is correct
24 Correct 2 ms 1412 KB Output is correct
25 Correct 14 ms 1412 KB Output is correct
26 Correct 15 ms 1412 KB Output is correct
27 Correct 15 ms 1412 KB Output is correct
28 Correct 14 ms 1412 KB Output is correct
29 Correct 13 ms 1412 KB Output is correct
30 Correct 82 ms 1788 KB Output is correct
31 Correct 84 ms 1788 KB Output is correct
32 Correct 104 ms 1788 KB Output is correct
33 Correct 85 ms 1788 KB Output is correct
34 Correct 86 ms 1788 KB Output is correct
35 Correct 86 ms 1788 KB Output is correct
36 Correct 147 ms 1804 KB Output is correct
37 Correct 2 ms 1804 KB Output is correct
38 Correct 2 ms 1804 KB Output is correct
39 Correct 84 ms 1804 KB Output is correct
40 Correct 84 ms 1804 KB Output is correct
41 Correct 82 ms 1804 KB Output is correct
42 Correct 84 ms 1804 KB Output is correct
43 Correct 81 ms 1804 KB Output is correct
44 Correct 2 ms 1804 KB Output is correct
45 Correct 15 ms 1804 KB Output is correct
46 Correct 15 ms 1804 KB Output is correct
47 Correct 15 ms 1804 KB Output is correct
48 Correct 154 ms 1804 KB Output is correct
49 Correct 149 ms 1804 KB Output is correct
50 Correct 2 ms 1804 KB Output is correct
51 Correct 114 ms 1316 KB Output is correct
52 Incorrect 83 ms 1412 KB Output isn't correct
53 Halted 0 ms 0 KB -