oj.uz

답안 #97214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
97214 2019-02-14T12:13:23 Z E869120 여행하는 상인 (APIO17_merchant) C++14
54 / 100
 747 ms 2464 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-9);
		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
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 710 ms 2344 KB Output is correct
2 Incorrect 616 ms 1880 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 1024 KB Output is correct
2 Correct 91 ms 1024 KB Output is correct
3 Correct 79 ms 1024 KB Output is correct
4 Correct 72 ms 1076 KB Output is correct
5 Correct 74 ms 1024 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 79 ms 1024 KB Output is correct
8 Correct 80 ms 1024 KB Output is correct
9 Correct 87 ms 1012 KB Output is correct
10 Correct 80 ms 1024 KB Output is correct
11 Correct 79 ms 1064 KB Output is correct
12 Correct 108 ms 1024 KB Output is correct
13 Correct 82 ms 1012 KB Output is correct
14 Correct 75 ms 1064 KB Output is correct
15 Correct 88 ms 1100 KB Output is correct
16 Correct 79 ms 1024 KB Output is correct
17 Correct 81 ms 1116 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 79 ms 1024 KB Output is correct
20 Correct 80 ms 1024 KB Output is correct
21 Correct 83 ms 1056 KB Output is correct
22 Correct 89 ms 1012 KB Output is correct
23 Correct 97 ms 1024 KB Output is correct
24 Correct 105 ms 1052 KB Output is correct
25 Correct 95 ms 1144 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 78 ms 1144 KB Output is correct
28 Correct 72 ms 1024 KB Output is correct
29 Correct 101 ms 1052 KB Output is correct
30 Correct 4 ms 512 KB Output is correct
31 Correct 86 ms 1024 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 659 ms 1832 KB Output is correct
2 Correct 716 ms 2456 KB Output is correct
3 Correct 648 ms 1736 KB Output is correct
4 Correct 624 ms 1912 KB Output is correct
5 Correct 677 ms 1784 KB Output is correct
6 Correct 591 ms 1740 KB Output is correct
7 Correct 81 ms 1116 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 79 ms 1024 KB Output is correct
10 Correct 80 ms 1024 KB Output is correct
11 Correct 83 ms 1056 KB Output is correct
12 Correct 89 ms 1012 KB Output is correct
13 Correct 97 ms 1024 KB Output is correct

Subtask #4
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 1024 KB Output is correct
2 Correct 91 ms 1024 KB Output is correct
3 Correct 79 ms 1024 KB Output is correct
4 Correct 72 ms 1076 KB Output is correct
5 Correct 74 ms 1024 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 79 ms 1024 KB Output is correct
8 Correct 80 ms 1024 KB Output is correct
9 Correct 87 ms 1012 KB Output is correct
10 Correct 80 ms 1024 KB Output is correct
11 Correct 79 ms 1064 KB Output is correct
12 Correct 108 ms 1024 KB Output is correct
13 Correct 82 ms 1012 KB Output is correct
14 Correct 75 ms 1064 KB Output is correct
15 Correct 88 ms 1100 KB Output is correct
16 Correct 79 ms 1024 KB Output is correct
17 Correct 659 ms 1832 KB Output is correct
18 Correct 716 ms 2456 KB Output is correct
19 Correct 648 ms 1736 KB Output is correct
20 Correct 624 ms 1912 KB Output is correct
21 Correct 677 ms 1784 KB Output is correct
22 Correct 591 ms 1740 KB Output is correct
23 Correct 81 ms 1116 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 79 ms 1024 KB Output is correct
26 Correct 80 ms 1024 KB Output is correct
27 Correct 83 ms 1056 KB Output is correct
28 Correct 89 ms 1012 KB Output is correct
29 Correct 97 ms 1024 KB Output is correct
30 Correct 732 ms 1704 KB Output is correct
31 Correct 619 ms 1888 KB Output is correct
32 Correct 673 ms 2448 KB Output is correct
33 Correct 729 ms 1884 KB Output is correct
34 Correct 570 ms 1864 KB Output is correct
35 Correct 640 ms 1924 KB Output is correct
36 Correct 700 ms 2424 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 571 ms 1692 KB Output is correct
40 Correct 603 ms 1756 KB Output is correct
41 Correct 666 ms 1704 KB Output is correct
42 Correct 693 ms 1664 KB Output is correct
43 Correct 619 ms 1904 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 81 ms 1152 KB Output is correct
46 Correct 107 ms 1024 KB Output is correct
47 Correct 88 ms 1116 KB Output is correct
48 Correct 708 ms 2464 KB Output is correct
49 Correct 747 ms 2424 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 710 ms 2344 KB Output is correct
52 Incorrect 616 ms 1880 KB Output isn't correct
53 Halted 0 ms 0 KB -