oj.uz

Submission #123691

# Submission time Handle Problem Language Result Execution time Memory
123691 2019-07-02T04:13:19 Z nvmdava Travelling Merchant (APIO17_merchant) C++17
100 / 100
 109 ms 5112 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;
#define crypt 0x3f2e32d7a2f6e5c3
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] == crypt ? LLONG_MAX / 2 : - p[i][j] + min(d[i][j], LLONG_MAX / 2 / val) * 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] = crypt;
	
	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
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 3036 KB Output is correct
2 Correct 45 ms 1272 KB Output is correct
3 Correct 47 ms 1324 KB Output is correct
4 Correct 9 ms 888 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 8 ms 888 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 9 ms 760 KB Output is correct
10 Correct 8 ms 920 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 9 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 9 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 10 ms 1012 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 10 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 8 ms 888 KB Output is correct
17 Correct 9 ms 888 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 10 ms 888 KB Output is correct
20 Correct 10 ms 888 KB Output is correct
21 Correct 9 ms 888 KB Output is correct
22 Correct 9 ms 892 KB Output is correct
23 Correct 8 ms 888 KB Output is correct
24 Correct 8 ms 888 KB Output is correct
25 Correct 9 ms 888 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 9 ms 760 KB Output is correct
28 Correct 8 ms 920 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 9 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 1604 KB Output is correct
2 Correct 100 ms 2868 KB Output is correct
3 Correct 48 ms 1516 KB Output is correct
4 Correct 55 ms 1532 KB Output is correct
5 Correct 53 ms 1784 KB Output is correct
6 Correct 49 ms 1528 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 10 ms 888 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 9 ms 892 KB Output is correct
13 Correct 8 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 9 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 10 ms 1012 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 10 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 8 ms 888 KB Output is correct
17 Correct 51 ms 1604 KB Output is correct
18 Correct 100 ms 2868 KB Output is correct
19 Correct 48 ms 1516 KB Output is correct
20 Correct 55 ms 1532 KB Output is correct
21 Correct 53 ms 1784 KB Output is correct
22 Correct 49 ms 1528 KB Output is correct
23 Correct 9 ms 888 KB Output is correct
24 Correct 2 ms 380 KB Output is correct
25 Correct 10 ms 888 KB Output is correct
26 Correct 10 ms 888 KB Output is correct
27 Correct 9 ms 888 KB Output is correct
28 Correct 9 ms 892 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 48 ms 1400 KB Output is correct
31 Correct 49 ms 1656 KB Output is correct
32 Correct 70 ms 3192 KB Output is correct
33 Correct 48 ms 1656 KB Output is correct
34 Correct 50 ms 1656 KB Output is correct
35 Correct 49 ms 1784 KB Output is correct
36 Correct 105 ms 4856 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 50 ms 1400 KB Output is correct
40 Correct 51 ms 1656 KB Output is correct
41 Correct 47 ms 1528 KB Output is correct
42 Correct 46 ms 1400 KB Output is correct
43 Correct 47 ms 1404 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 11 ms 1016 KB Output is correct
46 Correct 11 ms 1144 KB Output is correct
47 Correct 10 ms 1144 KB Output is correct
48 Correct 108 ms 5112 KB Output is correct
49 Correct 109 ms 4984 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 76 ms 3036 KB Output is correct
52 Correct 45 ms 1272 KB Output is correct
53 Correct 47 ms 1324 KB Output is correct
54 Correct 9 ms 888 KB Output is correct
55 Correct 8 ms 888 KB Output is correct
56 Correct 8 ms 888 KB Output is correct
57 Correct 9 ms 888 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 9 ms 760 KB Output is correct
60 Correct 8 ms 920 KB Output is correct
61 Correct 8 ms 888 KB Output is correct
62 Correct 2 ms 380 KB Output is correct
63 Correct 9 ms 888 KB Output is correct