oj.uz

Submission #80297

# Submission time Handle Problem Language Result Execution time Memory
80297 2018-10-19T21:36:03 Z Plurm Travelling Merchant (APIO17_merchant) C++11
0 / 100
 151 ms 1900 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 = 5e12;
	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)1e6,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 Incorrect 94 ms 1528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

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

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1804 KB Output is correct
2 Correct 151 ms 1900 KB Output is correct
3 Correct 64 ms 1900 KB Output is correct
4 Incorrect 66 ms 1900 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1528 KB Output is correct
2 Correct 11 ms 1528 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 12 ms 1528 KB Output is correct
6 Correct 2 ms 1528 KB Output is correct
7 Correct 11 ms 1528 KB Output is correct
8 Correct 12 ms 1528 KB Output is correct
9 Correct 11 ms 1528 KB Output is correct
10 Correct 11 ms 1528 KB Output is correct
11 Correct 12 ms 1528 KB Output is correct
12 Correct 12 ms 1528 KB Output is correct
13 Correct 11 ms 1528 KB Output is correct
14 Correct 11 ms 1528 KB Output is correct
15 Correct 14 ms 1528 KB Output is correct
16 Correct 11 ms 1528 KB Output is correct
17 Correct 66 ms 1804 KB Output is correct
18 Correct 151 ms 1900 KB Output is correct
19 Correct 64 ms 1900 KB Output is correct
20 Incorrect 66 ms 1900 KB Output isn't correct
21 Halted 0 ms 0 KB -