oj.uz

Submission #123686

# Submission time Handle Problem Language Result Execution time Memory
123686 2019-07-02T04:04:18 Z nvmdava Travelling Merchant (APIO17_merchant) C++17
21 / 100
 98 ms 2936 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll d[105][105], p[105][105], t[105][105];
ll s[105][2005], b[105][2005];
int n, m, k;

inline void fw(ll re[105][105]){
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			for(int l = 1; l <= n; l++)
				re[j][l] = min(re[j][l], re[j][i] + re[i][l]);
}

bool check(ll val){
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			t[i][j] = d[i][j] == 1000000001 ? 0x3f3f3f3f3f3f3f3f : - p[i][j] + d[i][j] * val;
	
	fw(t);
	for(int i = 1; i <= n; i++){
		if(t[i][i] <= 0) return 1;
	}
	return 0;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m>>k;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			d[i][j] = 1000000001;
	
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= k; j++){
			cin>>b[i][j]>>s[i][j];
		}
	}
	
	while(m--){
		int v, u, t;
		cin>>v>>u>>t;
		d[v][u] = t;
	}
	fw(d);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			if(d[i][j] == 1000000001)
				continue;
			for(int l = 1; l <= k; l++){
				if(b[i][l] == -1 || s[j][l] == -1) continue;
				p[i][j] = max(p[i][j], s[j][l] - b[i][l]);
			}
		}
	}
	
	long long l = 0, r = 10000000001;
	while(l != r){
		ll m = (l + r + 1) >> 1;
		if(check(m)) l = m;
		else r = m - 1;
	}
	cout<<l;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 2936 KB Output is correct
2 Incorrect 45 ms 1272 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 888 KB Output is correct
2 Correct 9 ms 888 KB Output is correct
3 Correct 9 ms 972 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 9 ms 888 KB Output is correct
14 Correct 9 ms 888 KB Output is correct
15 Correct 10 ms 888 KB Output is correct
16 Correct 9 ms 892 KB Output is correct
17 Correct 9 ms 888 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 9 ms 888 KB Output is correct
20 Correct 10 ms 888 KB Output is correct
21 Correct 10 ms 888 KB Output is correct
22 Correct 9 ms 888 KB Output is correct
23 Correct 8 ms 888 KB Output is correct
24 Correct 9 ms 888 KB Output is correct
25 Correct 10 ms 888 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 888 KB Output is correct
28 Correct 8 ms 888 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 9 ms 888 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 1528 KB Output is correct
2 Correct 98 ms 2856 KB Output is correct
3 Correct 46 ms 1400 KB Output is correct
4 Incorrect 52 ms 1528 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 9 ms 888 KB Output is correct
3 Correct 9 ms 972 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 9 ms 888 KB Output is correct
14 Correct 9 ms 888 KB Output is correct
15 Correct 10 ms 888 KB Output is correct
16 Correct 9 ms 892 KB Output is correct
17 Correct 49 ms 1528 KB Output is correct
18 Correct 98 ms 2856 KB Output is correct
19 Correct 46 ms 1400 KB Output is correct
20 Incorrect 52 ms 1528 KB Output isn't correct
21 Halted 0 ms 0 KB -