oj.uz

Submission #114859

# Submission time Handle Problem Language Result Execution time Memory
114859 2019-06-03T15:26:58 Z maruii Travelling Merchant (APIO17_merchant) C++14
100 / 100
 92 ms 3416 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int N, M, K;
int B[101][1000], S[101][1000], E[101][101], W[101][101];

bool f(ll m) {
	ll X[101][101] = {0};
	for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j) X[i][j] = W[i][j] - m * E[i][j];
	for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j) for (int k = 1; k <= N; ++k) {
		if (j != k) X[j][k] = max(X[j][k], X[j][i] + X[i][k]);
	}
	for (int i = 1; i < N; ++i) for (int j = i + 1; j <= N; ++j) if (X[i][j] + X[j][i] >= 0) return 1;
	return 0;
}

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> N >> M >> K;
	for (int i = 1; i <= N; ++i) for (int j = 0; j < K; ++j) cin >> B[i][j] >> S[i][j];
	for (int i = 1; i <= N; ++i) fill(E[i] + 1, E[i] + N + 1, 1e9);
	for (int i = 0; i < M; ++i) {
		int a, b, c; cin >> a >> b >> c;
		E[a][b] = c;
	}
	
	for (int x = 1; x <= N; ++x) for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j)
		E[i][j] = min(E[i][j], E[i][x] + E[x][j]);
	for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j) for (int k = 0; k < K; ++k)
		if(S[j][k] > 0 && B[i][k] > 0) W[i][j] = max(W[i][j], S[j][k] - B[i][k]);

	int l = 0, r = 1e9;
	while (l < r) {
		int m = l + r + 1 >> 1;
		if (f(m)) l = m;
		else r = m - 1;
	}
	cout << r;
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:35:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = l + r + 1 >> 1;
           ~~~~~~^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 1280 KB Output is correct
2 Correct 41 ms 1280 KB Output is correct
3 Correct 47 ms 1280 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 9 ms 768 KB Output is correct
6 Correct 9 ms 896 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 8 ms 768 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 10 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 896 KB Output is correct
2 Correct 8 ms 896 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 7 ms 640 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 10 ms 968 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 9 ms 928 KB Output is correct
14 Correct 9 ms 896 KB Output is correct
15 Correct 10 ms 896 KB Output is correct
16 Correct 8 ms 896 KB Output is correct
17 Correct 9 ms 896 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 10 ms 956 KB Output is correct
20 Correct 9 ms 896 KB Output is correct
21 Correct 10 ms 896 KB Output is correct
22 Correct 9 ms 896 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 9 ms 896 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 9 ms 896 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 8 ms 768 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 10 ms 896 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1320 KB Output is correct
2 Correct 84 ms 1272 KB Output is correct
3 Correct 44 ms 1356 KB Output is correct
4 Correct 48 ms 1280 KB Output is correct
5 Correct 47 ms 1656 KB Output is correct
6 Correct 45 ms 1528 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 10 ms 956 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 9 ms 896 KB Output is correct
13 Correct 9 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 896 KB Output is correct
2 Correct 8 ms 896 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 7 ms 640 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 10 ms 968 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 9 ms 928 KB Output is correct
14 Correct 9 ms 896 KB Output is correct
15 Correct 10 ms 896 KB Output is correct
16 Correct 8 ms 896 KB Output is correct
17 Correct 47 ms 1320 KB Output is correct
18 Correct 84 ms 1272 KB Output is correct
19 Correct 44 ms 1356 KB Output is correct
20 Correct 48 ms 1280 KB Output is correct
21 Correct 47 ms 1656 KB Output is correct
22 Correct 45 ms 1528 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 10 ms 956 KB Output is correct
26 Correct 9 ms 896 KB Output is correct
27 Correct 10 ms 896 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 9 ms 896 KB Output is correct
30 Correct 44 ms 1280 KB Output is correct
31 Correct 45 ms 1408 KB Output is correct
32 Correct 59 ms 1836 KB Output is correct
33 Correct 45 ms 1280 KB Output is correct
34 Correct 45 ms 1336 KB Output is correct
35 Correct 47 ms 1280 KB Output is correct
36 Correct 90 ms 3292 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 44 ms 1400 KB Output is correct
40 Correct 45 ms 1348 KB Output is correct
41 Correct 44 ms 1356 KB Output is correct
42 Correct 45 ms 1252 KB Output is correct
43 Correct 43 ms 1336 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 11 ms 984 KB Output is correct
46 Correct 10 ms 896 KB Output is correct
47 Correct 10 ms 896 KB Output is correct
48 Correct 92 ms 3416 KB Output is correct
49 Correct 92 ms 3320 KB Output is correct
50 Correct 2 ms 512 KB Output is correct
51 Correct 67 ms 1280 KB Output is correct
52 Correct 41 ms 1280 KB Output is correct
53 Correct 47 ms 1280 KB Output is correct
54 Correct 8 ms 896 KB Output is correct
55 Correct 9 ms 768 KB Output is correct
56 Correct 9 ms 896 KB Output is correct
57 Correct 9 ms 896 KB Output is correct
58 Correct 2 ms 512 KB Output is correct
59 Correct 9 ms 896 KB Output is correct
60 Correct 9 ms 896 KB Output is correct
61 Correct 8 ms 768 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 10 ms 896 KB Output is correct