oj.uz

Submission #639324

# Submission time Handle Problem Language Result Execution time Memory
639324 2022-09-09T12:09:57 Z shmad Travelling Merchant (APIO17_merchant) C++17
100 / 100
 137 ms 4048 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++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
		}
	}
}
 
int m, k;
vvt d(105, vt<ll>(N, inf));
 
bool check (ll x) {
	vvt g(105, vt<ll>(N, inf));
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) if (d[i][j] != inf) g[i][j] = (x * d[i][j]) - p[i][j];
	}
	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;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int x = 1; x <= k; x++) {
			    if (s[j][x] != -1 && b[i][x] != -1) p[i][j] = max(p[i][j], (s[j][x] - b[i][x]));
			}
		}
	}
	floyd(d);
	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

# Verdict Execution time Memory Grader output
1 Correct 52 ms 3600 KB Output is correct
2 Correct 27 ms 2800 KB Output is correct
3 Correct 30 ms 2796 KB Output is correct
4 Correct 11 ms 2396 KB Output is correct
5 Correct 12 ms 2400 KB Output is correct
6 Correct 10 ms 2448 KB Output is correct
7 Correct 12 ms 2436 KB Output is correct
8 Correct 8 ms 2116 KB Output is correct
9 Correct 13 ms 2460 KB Output is correct
10 Correct 12 ms 2400 KB Output is correct
11 Correct 14 ms 2408 KB Output is correct
12 Correct 8 ms 2164 KB Output is correct
13 Correct 12 ms 2500 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2448 KB Output is correct
2 Correct 12 ms 2436 KB Output is correct
3 Correct 8 ms 2116 KB Output is correct
4 Correct 13 ms 2460 KB Output is correct
5 Correct 12 ms 2400 KB Output is correct
6 Correct 14 ms 2408 KB Output is correct
7 Correct 8 ms 2164 KB Output is correct
8 Correct 12 ms 2500 KB Output is correct
9 Correct 12 ms 2552 KB Output is correct
10 Correct 11 ms 2528 KB Output is correct
11 Correct 11 ms 2632 KB Output is correct
12 Correct 11 ms 2616 KB Output is correct
13 Correct 16 ms 2644 KB Output is correct
14 Correct 8 ms 2048 KB Output is correct
15 Correct 11 ms 2480 KB Output is correct
16 Correct 13 ms 2716 KB Output is correct
17 Correct 14 ms 2536 KB Output is correct
18 Correct 16 ms 2524 KB Output is correct
19 Correct 14 ms 2644 KB Output is correct
20 Correct 14 ms 2644 KB Output is correct
21 Correct 14 ms 2668 KB Output is correct
22 Correct 14 ms 2632 KB Output is correct
23 Correct 17 ms 2644 KB Output is correct
24 Correct 12 ms 2496 KB Output is correct
25 Correct 19 ms 2712 KB Output is correct
26 Correct 8 ms 2116 KB Output is correct
27 Correct 18 ms 2648 KB Output is correct
28 Correct 16 ms 2640 KB Output is correct
29 Correct 13 ms 2756 KB Output is correct
30 Correct 15 ms 2612 KB Output is correct
31 Correct 12 ms 2696 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2712 KB Output is correct
2 Correct 8 ms 2116 KB Output is correct
3 Correct 18 ms 2648 KB Output is correct
4 Correct 16 ms 2640 KB Output is correct
5 Correct 13 ms 2756 KB Output is correct
6 Correct 15 ms 2612 KB Output is correct
7 Correct 12 ms 2696 KB Output is correct
8 Correct 87 ms 3428 KB Output is correct
9 Correct 137 ms 4048 KB Output is correct
10 Correct 62 ms 3352 KB Output is correct
11 Correct 94 ms 3420 KB Output is correct
12 Correct 93 ms 3568 KB Output is correct
13 Correct 51 ms 3352 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2552 KB Output is correct
2 Correct 11 ms 2528 KB Output is correct
3 Correct 11 ms 2632 KB Output is correct
4 Correct 11 ms 2616 KB Output is correct
5 Correct 16 ms 2644 KB Output is correct
6 Correct 8 ms 2048 KB Output is correct
7 Correct 11 ms 2480 KB Output is correct
8 Correct 13 ms 2716 KB Output is correct
9 Correct 14 ms 2536 KB Output is correct
10 Correct 16 ms 2524 KB Output is correct
11 Correct 14 ms 2644 KB Output is correct
12 Correct 14 ms 2644 KB Output is correct
13 Correct 14 ms 2668 KB Output is correct
14 Correct 14 ms 2632 KB Output is correct
15 Correct 17 ms 2644 KB Output is correct
16 Correct 12 ms 2496 KB Output is correct
17 Correct 87 ms 3428 KB Output is correct
18 Correct 137 ms 4048 KB Output is correct
19 Correct 62 ms 3352 KB Output is correct
20 Correct 94 ms 3420 KB Output is correct
21 Correct 93 ms 3568 KB Output is correct
22 Correct 51 ms 3352 KB Output is correct
23 Correct 19 ms 2712 KB Output is correct
24 Correct 8 ms 2116 KB Output is correct
25 Correct 18 ms 2648 KB Output is correct
26 Correct 16 ms 2640 KB Output is correct
27 Correct 13 ms 2756 KB Output is correct
28 Correct 15 ms 2612 KB Output is correct
29 Correct 12 ms 2696 KB Output is correct
30 Correct 52 ms 3600 KB Output is correct
31 Correct 27 ms 2800 KB Output is correct
32 Correct 30 ms 2796 KB Output is correct
33 Correct 11 ms 2396 KB Output is correct
34 Correct 12 ms 2400 KB Output is correct
35 Correct 10 ms 2448 KB Output is correct
36 Correct 12 ms 2436 KB Output is correct
37 Correct 8 ms 2116 KB Output is correct
38 Correct 13 ms 2460 KB Output is correct
39 Correct 12 ms 2400 KB Output is correct
40 Correct 14 ms 2408 KB Output is correct
41 Correct 8 ms 2164 KB Output is correct
42 Correct 12 ms 2500 KB Output is correct
43 Correct 35 ms 2968 KB Output is correct
44 Correct 35 ms 3428 KB Output is correct
45 Correct 47 ms 4032 KB Output is correct
46 Correct 36 ms 3384 KB Output is correct
47 Correct 36 ms 3432 KB Output is correct
48 Correct 42 ms 3384 KB Output is correct
49 Correct 114 ms 4028 KB Output is correct
50 Correct 9 ms 2072 KB Output is correct
51 Correct 8 ms 2136 KB Output is correct
52 Correct 31 ms 2892 KB Output is correct
53 Correct 32 ms 2880 KB Output is correct
54 Correct 41 ms 3172 KB Output is correct
55 Correct 33 ms 2940 KB Output is correct
56 Correct 38 ms 2860 KB Output is correct
57 Correct 8 ms 2052 KB Output is correct
58 Correct 15 ms 2692 KB Output is correct
59 Correct 15 ms 2696 KB Output is correct
60 Correct 13 ms 2696 KB Output is correct
61 Correct 89 ms 4032 KB Output is correct
62 Correct 92 ms 4032 KB Output is correct
63 Correct 10 ms 2036 KB Output is correct