oj.uz

Submission #656508

# Submission time Handle Problem Language Result Execution time Memory
656508 2022-11-07T17:27:04 Z Iliya Travelling Merchant (APIO17_merchant) C++17
100 / 100
 83 ms 2176 KB 
// Freedom will be ours
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const ll INF = 1121272678990188431;
const int N = 1e2 + 10, M = 9999, K = 1e3 + 10;

int n, m, k;
ll t[N][N], tmp[N][N], p[N][N], b[N][K], s[N][K];

void floyd(ll g[N][N]){
	for(int k = 0; k < n; k++) 
		for(int i = 0; i < n; i++) 
			for(int j = 0; j < n; j++) 
				g[i][j] = min(g[i][j], g[i][k] + g[k][j]);

}

bool check(ll mid){
	floyd(tmp);
	for(int i = 0; i < n; i++)
		if(tmp[i][i] <= 0)
			return true;
	return false;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

	cin >> n >> m >> k;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < k; j++)
			cin >> b[i][j] >> s[i][j];
	
	for(int i = 0; i < n; i++)
		fill(t[i], t[i] + N, INF);

	for(int i = 0; i < m; i++){
		int v, w, timee;
		cin >> v >> w >> timee; v--, w--;
		t[v][w] = timee;
	}
	
	floyd(t);

	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			for(int l = 0; l < k; l++)
				if(s[j][k] != -1 and b[i][l] != -1)
					p[i][j] = max(p[i][j], s[j][l] - b[i][l]);

	ll l = 0, r = 1e9 + 10;
	while(r - l > 1){
		ll mid = l + (r - l) / 2;
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				if(t[i][j] == INF)
					tmp[i][j] = INF;
				else tmp[i][j] = mid * t[i][j] - p[i][j];
			}
		}
		if(check(mid)) l = mid;
		else r = mid;
	}

	cout << l << '\n';
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 2076 KB Output is correct
2 Correct 30 ms 1308 KB Output is correct
3 Correct 29 ms 1236 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 7 ms 724 KB Output is correct
10 Correct 6 ms 824 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 724 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 6 ms 888 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 35 ms 1492 KB Output is correct
9 Correct 81 ms 2156 KB Output is correct
10 Correct 34 ms 1456 KB Output is correct
11 Correct 41 ms 1544 KB Output is correct
12 Correct 39 ms 1536 KB Output is correct
13 Correct 32 ms 1436 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 6 ms 864 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 7 ms 896 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 35 ms 1492 KB Output is correct
18 Correct 81 ms 2156 KB Output is correct
19 Correct 34 ms 1456 KB Output is correct
20 Correct 41 ms 1544 KB Output is correct
21 Correct 39 ms 1536 KB Output is correct
22 Correct 32 ms 1436 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 6 ms 888 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 52 ms 2076 KB Output is correct
31 Correct 30 ms 1308 KB Output is correct
32 Correct 29 ms 1236 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 4 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 7 ms 724 KB Output is correct
39 Correct 6 ms 824 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 5 ms 724 KB Output is correct
43 Correct 34 ms 1400 KB Output is correct
44 Correct 32 ms 1492 KB Output is correct
45 Correct 48 ms 2148 KB Output is correct
46 Correct 42 ms 1612 KB Output is correct
47 Correct 33 ms 1492 KB Output is correct
48 Correct 41 ms 1548 KB Output is correct
49 Correct 83 ms 2176 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 31 ms 1364 KB Output is correct
53 Correct 43 ms 1364 KB Output is correct
54 Correct 44 ms 1364 KB Output is correct
55 Correct 37 ms 1408 KB Output is correct
56 Correct 31 ms 1236 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 6 ms 852 KB Output is correct
59 Correct 7 ms 920 KB Output is correct
60 Correct 6 ms 852 KB Output is correct
61 Correct 82 ms 2132 KB Output is correct
62 Correct 82 ms 2144 KB Output is correct
63 Correct 0 ms 340 KB Output is correct