oj.uz

답안 #364893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364893 2021-02-10T11:32:33 Z kostia244 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 575 ms 3564 KB 
#pragma GCC optimize("trapv,Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;

template<typename F>
void multitest(F func) {
	int t;
	cin >> t;
	while(t--) func();
}
void report(int ok) {
	cout << (ok?"YES":"NO") << '\n';
}
const int maxn = 101, maxk = 1010;
int n, m, k, b[maxn][maxk], s[maxn][maxk], deal[maxn][maxn];
ll dist[maxn][maxn];
vector<array<int, 3>> edges;
int main() {
	cin.tie(0)->sync_with_stdio(0);
	//multitest([&](){});
	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];
	edges.resize(m);
	for(auto &[x, y, z] : edges) cin >> x >> y >> z, x--, y--;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++) {
			for(int x = 0; x < k; x++) if(s[j][x] != -1 && b[i][x] != -1) deal[i][j] = max(deal[i][j], s[j][x]-b[i][x]);
		}
	auto apsp = [&]() {
		for(int k = 0; k < n; k++)
			for(int i = 0; i < n; i++)
				for(int j = 0; j < n; j++)
					dist[i][j] = min(1ll<<61, max(dist[i][j], dist[i][k]+dist[k][j]));//, cout << i << " " << j << " " << k << " " << dist[i][k] << " " << dist[k][j] << endl;
	};
	auto neg = [&]() {
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				if(i != j && i != k && dist[i][j]+dist[j][i] >= 0) return 1;
		return 0;
	};
	auto print = [&]() {
		for(int i = 0; i < n; i++, cout << endl)
			for(int j = 0; j < n; j++)
				cout << max(-1000ll, dist[i][j]) << " ";
		cout << "------\n";
	};
	auto check = [&](ll f) {
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				dist[i][j] = -(1ll<<59);
		for(int i = 0; i < n; i++) dist[i][i] = 0;
		for(auto [x, y, z] : edges) dist[x][y] = max(dist[x][y], -z*f);
		apsp();
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				dist[i][j] += deal[i][j];
		apsp();
		return neg();
	};
	ll ans = 0;
	for(ll z = 1ll<<36; z>>=1;) ans += z*check(ans+z);
	cout << ans << '\n';
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:46:7: warning: variable 'print' set but not used [-Wunused-but-set-variable]
   46 |  auto print = [&]() {
      |       ^~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 532 ms 1260 KB Output is correct
2 Correct 511 ms 1396 KB Output is correct
3 Correct 505 ms 1260 KB Output is correct
4 Correct 67 ms 748 KB Output is correct
5 Correct 66 ms 748 KB Output is correct
6 Correct 66 ms 748 KB Output is correct
7 Correct 68 ms 748 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 66 ms 748 KB Output is correct
10 Correct 68 ms 748 KB Output is correct
11 Correct 68 ms 748 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 66 ms 876 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 748 KB Output is correct
2 Correct 68 ms 748 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 66 ms 748 KB Output is correct
5 Correct 68 ms 748 KB Output is correct
6 Correct 68 ms 748 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 66 ms 876 KB Output is correct
9 Correct 67 ms 860 KB Output is correct
10 Correct 70 ms 864 KB Output is correct
11 Correct 66 ms 876 KB Output is correct
12 Correct 61 ms 748 KB Output is correct
13 Correct 67 ms 876 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 66 ms 748 KB Output is correct
16 Correct 67 ms 876 KB Output is correct
17 Correct 67 ms 748 KB Output is correct
18 Correct 68 ms 876 KB Output is correct
19 Correct 67 ms 876 KB Output is correct
20 Correct 67 ms 876 KB Output is correct
21 Correct 68 ms 876 KB Output is correct
22 Correct 77 ms 876 KB Output is correct
23 Correct 74 ms 980 KB Output is correct
24 Correct 67 ms 748 KB Output is correct
25 Correct 67 ms 748 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 67 ms 748 KB Output is correct
28 Correct 67 ms 876 KB Output is correct
29 Correct 81 ms 748 KB Output is correct
30 Correct 75 ms 876 KB Output is correct
31 Correct 67 ms 748 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 748 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 67 ms 748 KB Output is correct
4 Correct 67 ms 876 KB Output is correct
5 Correct 81 ms 748 KB Output is correct
6 Correct 75 ms 876 KB Output is correct
7 Correct 67 ms 748 KB Output is correct
8 Correct 506 ms 1308 KB Output is correct
9 Correct 558 ms 1260 KB Output is correct
10 Correct 512 ms 1260 KB Output is correct
11 Correct 510 ms 1260 KB Output is correct
12 Correct 518 ms 1388 KB Output is correct
13 Correct 509 ms 1388 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 860 KB Output is correct
2 Correct 70 ms 864 KB Output is correct
3 Correct 66 ms 876 KB Output is correct
4 Correct 61 ms 748 KB Output is correct
5 Correct 67 ms 876 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 66 ms 748 KB Output is correct
8 Correct 67 ms 876 KB Output is correct
9 Correct 67 ms 748 KB Output is correct
10 Correct 68 ms 876 KB Output is correct
11 Correct 67 ms 876 KB Output is correct
12 Correct 67 ms 876 KB Output is correct
13 Correct 68 ms 876 KB Output is correct
14 Correct 77 ms 876 KB Output is correct
15 Correct 74 ms 980 KB Output is correct
16 Correct 67 ms 748 KB Output is correct
17 Correct 506 ms 1308 KB Output is correct
18 Correct 558 ms 1260 KB Output is correct
19 Correct 512 ms 1260 KB Output is correct
20 Correct 510 ms 1260 KB Output is correct
21 Correct 518 ms 1388 KB Output is correct
22 Correct 509 ms 1388 KB Output is correct
23 Correct 67 ms 748 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 67 ms 748 KB Output is correct
26 Correct 67 ms 876 KB Output is correct
27 Correct 81 ms 748 KB Output is correct
28 Correct 75 ms 876 KB Output is correct
29 Correct 67 ms 748 KB Output is correct
30 Correct 532 ms 1260 KB Output is correct
31 Correct 511 ms 1396 KB Output is correct
32 Correct 505 ms 1260 KB Output is correct
33 Correct 67 ms 748 KB Output is correct
34 Correct 66 ms 748 KB Output is correct
35 Correct 66 ms 748 KB Output is correct
36 Correct 68 ms 748 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 66 ms 748 KB Output is correct
39 Correct 68 ms 748 KB Output is correct
40 Correct 68 ms 748 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 66 ms 876 KB Output is correct
43 Correct 505 ms 1320 KB Output is correct
44 Correct 519 ms 1388 KB Output is correct
45 Correct 525 ms 1800 KB Output is correct
46 Correct 545 ms 1372 KB Output is correct
47 Correct 509 ms 1388 KB Output is correct
48 Correct 511 ms 1396 KB Output is correct
49 Correct 563 ms 3180 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 501 ms 1388 KB Output is correct
53 Correct 520 ms 1536 KB Output is correct
54 Correct 504 ms 1388 KB Output is correct
55 Correct 509 ms 1260 KB Output is correct
56 Correct 504 ms 1388 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 70 ms 876 KB Output is correct
59 Correct 69 ms 876 KB Output is correct
60 Correct 68 ms 876 KB Output is correct
61 Correct 575 ms 3436 KB Output is correct
62 Correct 572 ms 3564 KB Output is correct
63 Correct 1 ms 492 KB Output is correct