oj.uz

Submission #107396

# Submission time Handle Problem Language Result Execution time Memory
107396 2019-04-23T21:00:27 Z Noam527 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 119 ms 4308 KB 
#include <bits/stdc++.h>
#define CHECK cout << "ok" << endl
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 1e18;
const int OO = 0;
const int OOO = 1;
using namespace std;

int n, m, k;
ll B[101][1001], S[101][1001];
ll D[101][101] = {}, W[101][101];
ll d[101][101];
ll dist[101], cnt[101];

bool check(ll x) {
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++)
		d[i][j] = W[i][j] - x * D[i][j];
	if (OO) {
		cout << "d\n";
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) cout << d[i][j] << " "; cout << '\n';
		}
		cout << '\n';
	}

	for (int i = 0; i < n; i++) dist[i] = cnt[i] = 0;
	for (int iter = 0; iter <= n; iter++) {
		if (OO) {
			cout << "starting iteration " << iter << '\n';
			cout << "d: ";
			for (int i = 0; i < n; i++) cout << dist[i] << " "; cout << '\n';
			cout << "c: ";
			for (int i = 0; i < n; i++) cout << cnt[i] << " "; cout << '\n';
		}
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++) {
				if (i != j) {
					if (make_pair(dist[j], cnt[j]) < make_pair(dist[i] + d[i][j], cnt[i] + 1)) {
						if (iter == n) return true;
						dist[j] = dist[i] + d[i][j];
						cnt[j] = cnt[i] + 1;
					}
				}
			}
	}
	return false;
}

void preprocess() {
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			if (i != j) {
				for (int x = 0; x < k; x++)
					if (B[i][x] != -1 && S[j][x] != -1)
						W[i][j] = max(W[i][j], S[j][x] - B[i][x]);
			}
	for (int u = 0; u < n; u++)
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				D[i][j] = min(D[i][j], D[i][u] + D[u][j]);

	if (OO) {
		cout << "W\n";
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) cout << W[i][j] << " "; cout << '\n';
		}
		cout << '\n';
		cout << "D\n";
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) cout << D[i][j] << " "; cout << '\n';
		}
		cout << '\n';
	}
}

int main() {
	ios::sync_with_stdio(0), cin.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++) for (int j = 0; j < n; j++) {
		W[i][j] = 0;
		if (i != j) D[i][j] = inf;
	}
	for (int i = 0, u, v, w; i < m; i++) {
		cin >> u >> v >> w;
		--u, --v;
		D[u][v] = w;
	}
	preprocess();
	if (OO) {
		check(2);
		return 0;
	}
	ll lo = 0, hi = 1e9 + 3, mid;
	while (lo < hi) {
		mid = (lo + hi + 1) / 2;
		if (check(mid)) lo = mid;
		else hi = mid - 1;
	}
	finish(lo);
}

Compilation message

merchant.cpp: In function 'bool check(ll)':
merchant.cpp:24:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for (int j = 0; j < n; j++) cout << d[i][j] << " "; cout << '\n';
    ^~~
merchant.cpp:24:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for (int j = 0; j < n; j++) cout << d[i][j] << " "; cout << '\n';
                                                        ^~~~
merchant.cpp:34:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for (int i = 0; i < n; i++) cout << dist[i] << " "; cout << '\n';
    ^~~
merchant.cpp:34:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for (int i = 0; i < n; i++) cout << dist[i] << " "; cout << '\n';
                                                        ^~~~
merchant.cpp:36:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for (int i = 0; i < n; i++) cout << cnt[i] << " "; cout << '\n';
    ^~~
merchant.cpp:36:55: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for (int i = 0; i < n; i++) cout << cnt[i] << " "; cout << '\n';
                                                       ^~~~
merchant.cpp: In function 'void preprocess()':
merchant.cpp:68:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for (int j = 0; j < n; j++) cout << W[i][j] << " "; cout << '\n';
    ^~~
merchant.cpp:68:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for (int j = 0; j < n; j++) cout << W[i][j] << " "; cout << '\n';
                                                        ^~~~
merchant.cpp:73:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for (int j = 0; j < n; j++) cout << D[i][j] << " "; cout << '\n';
    ^~~
merchant.cpp:73:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for (int j = 0; j < n; j++) cout << D[i][j] << " "; cout << '\n';
                                                        ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 3448 KB Output is correct
2 Correct 61 ms 1528 KB Output is correct
3 Correct 84 ms 1408 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 11 ms 868 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 11 ms 912 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 2 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 10 ms 896 KB Output is correct
2 Correct 13 ms 896 KB Output is correct
3 Correct 11 ms 896 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 15 ms 996 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 12 ms 984 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 19 ms 1024 KB Output is correct
16 Correct 10 ms 896 KB Output is correct
17 Correct 17 ms 896 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 12 ms 1024 KB Output is correct
20 Correct 11 ms 1024 KB Output is correct
21 Correct 10 ms 896 KB Output is correct
22 Correct 11 ms 896 KB Output is correct
23 Correct 10 ms 896 KB Output is correct
24 Correct 10 ms 896 KB Output is correct
25 Correct 11 ms 868 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 11 ms 912 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 2 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 61 ms 1664 KB Output is correct
2 Correct 111 ms 3936 KB Output is correct
3 Correct 52 ms 1536 KB Output is correct
4 Correct 62 ms 1912 KB Output is correct
5 Correct 60 ms 1792 KB Output is correct
6 Correct 68 ms 1620 KB Output is correct
7 Correct 17 ms 896 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 12 ms 1024 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 10 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 896 KB Output is correct
2 Correct 13 ms 896 KB Output is correct
3 Correct 11 ms 896 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 15 ms 996 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 12 ms 984 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 19 ms 1024 KB Output is correct
16 Correct 10 ms 896 KB Output is correct
17 Correct 61 ms 1664 KB Output is correct
18 Correct 111 ms 3936 KB Output is correct
19 Correct 52 ms 1536 KB Output is correct
20 Correct 62 ms 1912 KB Output is correct
21 Correct 60 ms 1792 KB Output is correct
22 Correct 68 ms 1620 KB Output is correct
23 Correct 17 ms 896 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 12 ms 1024 KB Output is correct
26 Correct 11 ms 1024 KB Output is correct
27 Correct 10 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 10 ms 896 KB Output is correct
30 Correct 62 ms 1452 KB Output is correct
31 Correct 72 ms 1636 KB Output is correct
32 Correct 104 ms 2760 KB Output is correct
33 Correct 61 ms 1536 KB Output is correct
34 Correct 65 ms 1664 KB Output is correct
35 Correct 71 ms 1664 KB Output is correct
36 Correct 114 ms 4088 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 51 ms 1408 KB Output is correct
40 Correct 64 ms 1536 KB Output is correct
41 Correct 63 ms 1408 KB Output is correct
42 Correct 56 ms 1408 KB Output is correct
43 Correct 56 ms 1408 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 16 ms 1024 KB Output is correct
46 Correct 12 ms 1024 KB Output is correct
47 Correct 12 ms 1024 KB Output is correct
48 Correct 119 ms 4216 KB Output is correct
49 Correct 117 ms 4308 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 81 ms 3448 KB Output is correct
52 Correct 61 ms 1528 KB Output is correct
53 Correct 84 ms 1408 KB Output is correct
54 Correct 10 ms 896 KB Output is correct
55 Correct 12 ms 896 KB Output is correct
56 Correct 10 ms 896 KB Output is correct
57 Correct 11 ms 868 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 11 ms 912 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 11 ms 896 KB Output is correct
62 Correct 2 ms 512 KB Output is correct
63 Correct 10 ms 896 KB Output is correct