oj.uz

Submission #97215

# Submission time Handle Problem Language Result Execution time Memory
97215 2019-02-14T12:13:53 Z E869120 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 806 ms 2552 KB 
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

long long N, M, K, B[109][1009], S[109][1009];
long long dist[109][109], V[109][109], D[109][109], col[109]; long double dp[109], e[109][109];
vector<int>G[109], I;

void dfs(int pos) {
	if (col[pos] == 1) return;
	col[pos] = 1;
	for (int i = 0; i < G[pos].size(); i++) dfs(G[pos][i]);
}

bool solve(long double c) {
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (dist[i][j] == (1LL << 60) || V[i][j] == -(1LL << 60)) { e[i][j] = 1e18; continue; }
			e[i][j] = 1.0L * c * dist[i][j] - 1.0L * V[i][j];
		}
	}
	for (int i = 1; i <= N; i++) dp[i] = (1LL << 60);
	for (int i = 0; i < I.size(); i++) dp[I[i]] = 0;

	for (int i = 1; i <= 2 * N; i++) {
		for (int j = 1; j <= N; j++) {
			for (int k = 1; k <= N; k++) {
				dp[k] = min(dp[k], dp[j] + e[j][k]);
			}
		}
	}
	vector<long double>E1; for (int i = 1; i <= N; i++) E1.push_back(dp[i]);

	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			for (int k = 1; k <= N; k++) {
				dp[k] = min(dp[k], dp[j] + e[j][k]);
			}
		}
	}
	vector<long double>E2; for (int i = 1; i <= N; i++) E2.push_back(dp[i]);

	if (E1 == E2) return false;
	return true;
}

int main() {
	cin >> N >> M >> K;
	for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { dist[i][j] = (1LL << 60); D[i][i] = 1; } }
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= K; j++) cin >> B[i][j] >> S[i][j];
	}
	for (int i = 1; i <= M; i++) {
		long long a1, a2, a3; cin >> a1 >> a2 >> a3;
		dist[a1][a2] = a3;
	}
	for (int k = 1; k <= N; k++) {
		for (int i = 1; i <= N; i++) {
			for (int j = 1; j <= N; j++) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
		}
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			long long Benq = 0;
			for (int k = 1; k <= K; k++) {
				if (S[j][k] == -1 || B[i][k] == -1) continue;
				Benq = max(Benq, S[j][k] - B[i][k]);
			}
			if (dist[i][j] != (1LL << 60)) { V[i][j] = Benq; D[i][j] = 1; }
			else V[i][j] = -(1LL << 60);
		}
	}
	for (int k = 1; k <= N; k++) {
		for (int i = 1; i <= N; i++) {
			for (int j = 1; j <= N; j++) {
				if (D[i][k] == 1 && D[k][j] == 1) D[i][j] = 1;
			}
		}
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) { if (D[i][j] == 1 && D[j][i] == 1) G[i].push_back(j); }
	}
	for (int i = 1; i <= N; i++) {
		if (col[i] == 1) continue;
		I.push_back(i); dfs(i);
	}

	long long L = 1, R = (1LL << 30), MM, maxn = 0;
	for (int i = 0; i < 35; i++) {
		MM = (L + R) / 2;
		bool t = solve(1.0L * MM - 1e-10);
		if (t == true) { L = MM; maxn = max(maxn, MM); }
		else { R = MM; }
	}
	cout << maxn << endl;
	return 0;
}

Compilation message

merchant.cpp: In function 'void dfs(int)':
merchant.cpp:13:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < G[pos].size(); i++) dfs(G[pos][i]);
                  ~~^~~~~~~~~~~~~~~
merchant.cpp: In function 'bool solve(long double)':
merchant.cpp:24:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < I.size(); i++) dp[I[i]] = 0;
                  ~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 752 ms 2552 KB Output is correct
2 Correct 655 ms 1788 KB Output is correct
3 Correct 684 ms 1664 KB Output is correct
4 Correct 76 ms 896 KB Output is correct
5 Correct 77 ms 1024 KB Output is correct
6 Correct 72 ms 1012 KB Output is correct
7 Correct 74 ms 1024 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 70 ms 1024 KB Output is correct
10 Correct 76 ms 1064 KB Output is correct
11 Correct 96 ms 1012 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 73 ms 1144 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 1024 KB Output is correct
2 Correct 85 ms 904 KB Output is correct
3 Correct 79 ms 1024 KB Output is correct
4 Correct 94 ms 1024 KB Output is correct
5 Correct 87 ms 1056 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 80 ms 1012 KB Output is correct
8 Correct 78 ms 1024 KB Output is correct
9 Correct 79 ms 1052 KB Output is correct
10 Correct 109 ms 1052 KB Output is correct
11 Correct 88 ms 1024 KB Output is correct
12 Correct 72 ms 1072 KB Output is correct
13 Correct 86 ms 1024 KB Output is correct
14 Correct 107 ms 1024 KB Output is correct
15 Correct 91 ms 1024 KB Output is correct
16 Correct 77 ms 1024 KB Output is correct
17 Correct 76 ms 1060 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 83 ms 1144 KB Output is correct
20 Correct 75 ms 1024 KB Output is correct
21 Correct 90 ms 1024 KB Output is correct
22 Correct 100 ms 1024 KB Output is correct
23 Correct 75 ms 1008 KB Output is correct
24 Correct 72 ms 1012 KB Output is correct
25 Correct 74 ms 1024 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 70 ms 1024 KB Output is correct
28 Correct 76 ms 1064 KB Output is correct
29 Correct 96 ms 1012 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 73 ms 1144 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 630 ms 1792 KB Output is correct
2 Correct 710 ms 2528 KB Output is correct
3 Correct 624 ms 1784 KB Output is correct
4 Correct 661 ms 1912 KB Output is correct
5 Correct 632 ms 1792 KB Output is correct
6 Correct 587 ms 1796 KB Output is correct
7 Correct 76 ms 1060 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 83 ms 1144 KB Output is correct
10 Correct 75 ms 1024 KB Output is correct
11 Correct 90 ms 1024 KB Output is correct
12 Correct 100 ms 1024 KB Output is correct
13 Correct 75 ms 1008 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 1024 KB Output is correct
2 Correct 85 ms 904 KB Output is correct
3 Correct 79 ms 1024 KB Output is correct
4 Correct 94 ms 1024 KB Output is correct
5 Correct 87 ms 1056 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 80 ms 1012 KB Output is correct
8 Correct 78 ms 1024 KB Output is correct
9 Correct 79 ms 1052 KB Output is correct
10 Correct 109 ms 1052 KB Output is correct
11 Correct 88 ms 1024 KB Output is correct
12 Correct 72 ms 1072 KB Output is correct
13 Correct 86 ms 1024 KB Output is correct
14 Correct 107 ms 1024 KB Output is correct
15 Correct 91 ms 1024 KB Output is correct
16 Correct 77 ms 1024 KB Output is correct
17 Correct 630 ms 1792 KB Output is correct
18 Correct 710 ms 2528 KB Output is correct
19 Correct 624 ms 1784 KB Output is correct
20 Correct 661 ms 1912 KB Output is correct
21 Correct 632 ms 1792 KB Output is correct
22 Correct 587 ms 1796 KB Output is correct
23 Correct 76 ms 1060 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 83 ms 1144 KB Output is correct
26 Correct 75 ms 1024 KB Output is correct
27 Correct 90 ms 1024 KB Output is correct
28 Correct 100 ms 1024 KB Output is correct
29 Correct 75 ms 1008 KB Output is correct
30 Correct 648 ms 1740 KB Output is correct
31 Correct 709 ms 1912 KB Output is correct
32 Correct 702 ms 2484 KB Output is correct
33 Correct 655 ms 1928 KB Output is correct
34 Correct 599 ms 1912 KB Output is correct
35 Correct 640 ms 1792 KB Output is correct
36 Correct 727 ms 2532 KB Output is correct
37 Correct 3 ms 512 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 676 ms 1704 KB Output is correct
40 Correct 689 ms 1760 KB Output is correct
41 Correct 651 ms 1756 KB Output is correct
42 Correct 632 ms 1792 KB Output is correct
43 Correct 616 ms 1700 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 93 ms 1116 KB Output is correct
46 Correct 82 ms 1152 KB Output is correct
47 Correct 94 ms 1136 KB Output is correct
48 Correct 806 ms 2528 KB Output is correct
49 Correct 753 ms 2424 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 752 ms 2552 KB Output is correct
52 Correct 655 ms 1788 KB Output is correct
53 Correct 684 ms 1664 KB Output is correct
54 Correct 76 ms 896 KB Output is correct
55 Correct 77 ms 1024 KB Output is correct
56 Correct 72 ms 1012 KB Output is correct
57 Correct 74 ms 1024 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 70 ms 1024 KB Output is correct
60 Correct 76 ms 1064 KB Output is correct
61 Correct 96 ms 1012 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 73 ms 1144 KB Output is correct