oj.uz

답안 #639321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639321 2022-09-09T12:07:44 Z shmad 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 89 ms 6084 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vvt = vt< vt<ll> >;

const int N = 1e3 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const double eps = 1e-6;

int n;
ll b[105][N], s[105][N], p[105][N];

void floyd (vvt &d) {
	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] != inf && d[k][j] != inf) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
		}
	}
}

int m, k;
vvt d(105, vt<ll>(N, inf)), g(105, vt<ll>(N, inf));

bool check (ll x) {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) g[i][j] = (d[i][j] == inf ? inf : (x * d[i][j]) - p[i][j]);
		g[i][i] = inf;
	}
	floyd(g);
	for (int i = 1; i <= n; i++) if (g[i][i] <= 0) return true;
	return false;
}

void solve () {
	cin >> n >> m >> k;
	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++) {
		ll x, y, w;
		cin >> x >> y >> w;
		d[x][y] = w;
	}
	floyd(d);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int x = 1; x <= k; x++) {
				if (b[i][x] != -1 && s[j][x] != -1) p[i][j] = max(p[i][j], (s[j][x] - b[i][x]));
			}
		}
	}
	ll l = 1, r = 1e9, ans = 0;
	while (l <= r) {
		ll mid = l + r >> 1;
		if (check(mid)) ans = mid, l = mid + 1;
		else r = mid - 1;
	}
	cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Compilation message

merchant.cpp: In function 'void solve()':
merchant.cpp:70:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |   ll mid = l + r >> 1;
      |            ~~^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 3564 KB Output is correct
2 Correct 39 ms 2772 KB Output is correct
3 Correct 45 ms 2772 KB Output is correct
4 Correct 5 ms 2388 KB Output is correct
5 Correct 5 ms 2408 KB Output is correct
6 Correct 5 ms 2388 KB Output is correct
7 Correct 7 ms 2388 KB Output is correct
8 Correct 1 ms 2004 KB Output is correct
9 Correct 5 ms 2380 KB Output is correct
10 Correct 6 ms 2388 KB Output is correct
11 Correct 6 ms 2388 KB Output is correct
12 Correct 1 ms 2004 KB Output is correct
13 Correct 4 ms 2388 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2388 KB Output is correct
2 Correct 7 ms 2388 KB Output is correct
3 Correct 1 ms 2004 KB Output is correct
4 Correct 5 ms 2380 KB Output is correct
5 Correct 6 ms 2388 KB Output is correct
6 Correct 6 ms 2388 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 4 ms 2388 KB Output is correct
9 Correct 6 ms 2516 KB Output is correct
10 Correct 6 ms 2468 KB Output is correct
11 Correct 6 ms 2652 KB Output is correct
12 Correct 7 ms 2636 KB Output is correct
13 Correct 7 ms 2644 KB Output is correct
14 Correct 1 ms 2004 KB Output is correct
15 Correct 3 ms 2388 KB Output is correct
16 Correct 4 ms 2648 KB Output is correct
17 Correct 3 ms 2388 KB Output is correct
18 Correct 4 ms 2528 KB Output is correct
19 Correct 6 ms 2644 KB Output is correct
20 Correct 5 ms 2644 KB Output is correct
21 Correct 6 ms 2516 KB Output is correct
22 Correct 6 ms 2652 KB Output is correct
23 Correct 9 ms 2720 KB Output is correct
24 Correct 6 ms 2384 KB Output is correct
25 Correct 7 ms 2652 KB Output is correct
26 Correct 1 ms 1996 KB Output is correct
27 Correct 7 ms 2652 KB Output is correct
28 Correct 7 ms 2636 KB Output is correct
29 Correct 5 ms 2652 KB Output is correct
30 Correct 6 ms 2560 KB Output is correct
31 Correct 5 ms 2524 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2652 KB Output is correct
2 Correct 1 ms 1996 KB Output is correct
3 Correct 7 ms 2652 KB Output is correct
4 Correct 7 ms 2636 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 6 ms 2560 KB Output is correct
7 Correct 5 ms 2524 KB Output is correct
8 Correct 43 ms 3420 KB Output is correct
9 Correct 89 ms 5712 KB Output is correct
10 Correct 37 ms 3412 KB Output is correct
11 Correct 43 ms 3540 KB Output is correct
12 Correct 53 ms 3636 KB Output is correct
13 Correct 40 ms 3412 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2516 KB Output is correct
2 Correct 6 ms 2468 KB Output is correct
3 Correct 6 ms 2652 KB Output is correct
4 Correct 7 ms 2636 KB Output is correct
5 Correct 7 ms 2644 KB Output is correct
6 Correct 1 ms 2004 KB Output is correct
7 Correct 3 ms 2388 KB Output is correct
8 Correct 4 ms 2648 KB Output is correct
9 Correct 3 ms 2388 KB Output is correct
10 Correct 4 ms 2528 KB Output is correct
11 Correct 6 ms 2644 KB Output is correct
12 Correct 5 ms 2644 KB Output is correct
13 Correct 6 ms 2516 KB Output is correct
14 Correct 6 ms 2652 KB Output is correct
15 Correct 9 ms 2720 KB Output is correct
16 Correct 6 ms 2384 KB Output is correct
17 Correct 43 ms 3420 KB Output is correct
18 Correct 89 ms 5712 KB Output is correct
19 Correct 37 ms 3412 KB Output is correct
20 Correct 43 ms 3540 KB Output is correct
21 Correct 53 ms 3636 KB Output is correct
22 Correct 40 ms 3412 KB Output is correct
23 Correct 7 ms 2652 KB Output is correct
24 Correct 1 ms 1996 KB Output is correct
25 Correct 7 ms 2652 KB Output is correct
26 Correct 7 ms 2636 KB Output is correct
27 Correct 5 ms 2652 KB Output is correct
28 Correct 6 ms 2560 KB Output is correct
29 Correct 5 ms 2524 KB Output is correct
30 Correct 56 ms 3564 KB Output is correct
31 Correct 39 ms 2772 KB Output is correct
32 Correct 45 ms 2772 KB Output is correct
33 Correct 5 ms 2388 KB Output is correct
34 Correct 5 ms 2408 KB Output is correct
35 Correct 5 ms 2388 KB Output is correct
36 Correct 7 ms 2388 KB Output is correct
37 Correct 1 ms 2004 KB Output is correct
38 Correct 5 ms 2380 KB Output is correct
39 Correct 6 ms 2388 KB Output is correct
40 Correct 6 ms 2388 KB Output is correct
41 Correct 1 ms 2004 KB Output is correct
42 Correct 4 ms 2388 KB Output is correct
43 Correct 34 ms 2908 KB Output is correct
44 Correct 36 ms 3412 KB Output is correct
45 Correct 49 ms 4520 KB Output is correct
46 Correct 35 ms 3412 KB Output is correct
47 Correct 37 ms 3460 KB Output is correct
48 Correct 42 ms 3444 KB Output is correct
49 Correct 86 ms 5980 KB Output is correct
50 Correct 1 ms 2004 KB Output is correct
51 Correct 1 ms 2004 KB Output is correct
52 Correct 35 ms 2824 KB Output is correct
53 Correct 36 ms 2988 KB Output is correct
54 Correct 29 ms 3140 KB Output is correct
55 Correct 30 ms 3024 KB Output is correct
56 Correct 47 ms 2900 KB Output is correct
57 Correct 1 ms 2004 KB Output is correct
58 Correct 8 ms 2772 KB Output is correct
59 Correct 7 ms 2796 KB Output is correct
60 Correct 5 ms 2780 KB Output is correct
61 Correct 88 ms 6044 KB Output is correct
62 Correct 89 ms 6084 KB Output is correct
63 Correct 1 ms 1996 KB Output is correct