oj.uz

Submission #80296

# Submission time Handle Problem Language Result Execution time Memory
80296 2018-10-19T21:34:35 Z Plurm Travelling Merchant (APIO17_merchant) C++11
54 / 100
 143 ms 13536 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 = 5e10;
	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*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 86 ms 2680 KB Output is correct
2 Incorrect 75 ms 2788 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 9 ms 2788 KB Output is correct
2 Correct 9 ms 2788 KB Output is correct
3 Correct 10 ms 2788 KB Output is correct
4 Correct 9 ms 2788 KB Output is correct
5 Correct 10 ms 2788 KB Output is correct
6 Correct 2 ms 2788 KB Output is correct
7 Correct 9 ms 2788 KB Output is correct
8 Correct 9 ms 2788 KB Output is correct
9 Correct 9 ms 2788 KB Output is correct
10 Correct 9 ms 2788 KB Output is correct
11 Correct 10 ms 2788 KB Output is correct
12 Correct 10 ms 2788 KB Output is correct
13 Correct 10 ms 2788 KB Output is correct
14 Correct 9 ms 2788 KB Output is correct
15 Correct 11 ms 2788 KB Output is correct
16 Correct 11 ms 2788 KB Output is correct
17 Correct 10 ms 2788 KB Output is correct
18 Correct 2 ms 2788 KB Output is correct
19 Correct 9 ms 2828 KB Output is correct
20 Correct 12 ms 2948 KB Output is correct
21 Correct 11 ms 2948 KB Output is correct
22 Correct 10 ms 2988 KB Output is correct
23 Correct 9 ms 3012 KB Output is correct
24 Correct 9 ms 3012 KB Output is correct
25 Correct 9 ms 3024 KB Output is correct
26 Correct 2 ms 3024 KB Output is correct
27 Correct 14 ms 3024 KB Output is correct
28 Correct 9 ms 3060 KB Output is correct
29 Correct 9 ms 3060 KB Output is correct
30 Correct 2 ms 3060 KB Output is correct
31 Correct 9 ms 3076 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 3852 KB Output is correct
2 Correct 110 ms 5552 KB Output is correct
3 Correct 58 ms 5552 KB Output is correct
4 Correct 58 ms 5740 KB Output is correct
5 Correct 55 ms 5956 KB Output is correct
6 Correct 54 ms 6164 KB Output is correct
7 Correct 10 ms 2788 KB Output is correct
8 Correct 2 ms 2788 KB Output is correct
9 Correct 9 ms 2828 KB Output is correct
10 Correct 12 ms 2948 KB Output is correct
11 Correct 11 ms 2948 KB Output is correct
12 Correct 10 ms 2988 KB Output is correct
13 Correct 9 ms 3012 KB Output is correct

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2788 KB Output is correct
2 Correct 9 ms 2788 KB Output is correct
3 Correct 10 ms 2788 KB Output is correct
4 Correct 9 ms 2788 KB Output is correct
5 Correct 10 ms 2788 KB Output is correct
6 Correct 2 ms 2788 KB Output is correct
7 Correct 9 ms 2788 KB Output is correct
8 Correct 9 ms 2788 KB Output is correct
9 Correct 9 ms 2788 KB Output is correct
10 Correct 9 ms 2788 KB Output is correct
11 Correct 10 ms 2788 KB Output is correct
12 Correct 10 ms 2788 KB Output is correct
13 Correct 10 ms 2788 KB Output is correct
14 Correct 9 ms 2788 KB Output is correct
15 Correct 11 ms 2788 KB Output is correct
16 Correct 11 ms 2788 KB Output is correct
17 Correct 56 ms 3852 KB Output is correct
18 Correct 110 ms 5552 KB Output is correct
19 Correct 58 ms 5552 KB Output is correct
20 Correct 58 ms 5740 KB Output is correct
21 Correct 55 ms 5956 KB Output is correct
22 Correct 54 ms 6164 KB Output is correct
23 Correct 10 ms 2788 KB Output is correct
24 Correct 2 ms 2788 KB Output is correct
25 Correct 9 ms 2828 KB Output is correct
26 Correct 12 ms 2948 KB Output is correct
27 Correct 11 ms 2948 KB Output is correct
28 Correct 10 ms 2988 KB Output is correct
29 Correct 9 ms 3012 KB Output is correct
30 Correct 51 ms 6164 KB Output is correct
31 Correct 56 ms 6276 KB Output is correct
32 Correct 72 ms 6748 KB Output is correct
33 Correct 55 ms 6748 KB Output is correct
34 Correct 54 ms 6776 KB Output is correct
35 Correct 55 ms 6852 KB Output is correct
36 Correct 117 ms 8848 KB Output is correct
37 Correct 2 ms 8848 KB Output is correct
38 Correct 2 ms 8848 KB Output is correct
39 Correct 51 ms 8928 KB Output is correct
40 Correct 54 ms 9040 KB Output is correct
41 Correct 53 ms 9152 KB Output is correct
42 Correct 51 ms 9152 KB Output is correct
43 Correct 51 ms 9152 KB Output is correct
44 Correct 2 ms 9152 KB Output is correct
45 Correct 12 ms 9152 KB Output is correct
46 Correct 11 ms 9152 KB Output is correct
47 Correct 11 ms 9152 KB Output is correct
48 Correct 122 ms 11492 KB Output is correct
49 Correct 143 ms 13536 KB Output is correct
50 Correct 2 ms 13536 KB Output is correct
51 Correct 86 ms 2680 KB Output is correct
52 Incorrect 75 ms 2788 KB Output isn't correct
53 Halted 0 ms 0 KB -