# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
639717 | 2022-09-11T08:44:53 Z | ghostwriter | Travelling Merchant (APIO17_merchant) | C++14 | 84 ms | 3388 KB |
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include <debug.h> #endif #define st first #define nd second #define pb push_back #define pf push_front #define _pb pop_back #define _pf pop_front #define lb lower_bound #define ub upper_bound #define mtp make_tuple #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair<int, int> pi; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; typedef string str; template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); } template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; } #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i)) #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i)) #define EACH(i, x) for (auto &(i) : (x)) #define WHILE while #define file "TEST" mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); } /* Tran The Bao CTL - Da Lat Cay ngay cay dem nhung deo duoc cong nhan */ const ll oo = 1e18; const int N = 105; const int K = 1005; int n, m, k, b[N][K], s[N][K], c[N][N]; ll d[N][N], g[N][N]; bool check(int x) { FOR(i, 1, n) FOR(j, 1, n) { if (i == j) { g[i][j] = -oo; continue; } if (d[i][j] == oo) { g[i][j] = -oo; continue; } g[i][j] = -x * d[i][j] + c[i][j]; } FOR(z, 1, n) FOR(i, 1, n) FOR(j, 1, n) g[i][j] = max(g[i][j], g[i][z] + g[z][j]); FOR(i, 1, n) if (g[i][i] >= 0) return 1; return 0; } signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); // freopen(file".inp", "r", stdin); // freopen(file".out", "w", stdout); cin >> n >> m >> k; FOR(i, 1, n) FOR(j, 1, k) cin >> b[i][j] >> s[i][j]; FOR(i, 1, n) FOR(j, 1, n) d[i][j] = (i == j? 0 : oo); FOR(i, 1, m) { int v, w, t; cin >> v >> w >> t; d[v][w] = t; } FOR(z, 1, n) FOR(i, 1, n) FOR(j, 1, n) d[i][j] = min(d[i][j], d[i][z] + d[z][j]); FOR(i, 1, n) FOR(j, 1, n) FOR(z, 1, k) if (b[i][z] != -1 && s[j][z] != -1) c[i][j] = max(c[i][j], -b[i][z] + s[j][z]); int l = 1, r = 1e9, ans = 0; WHILE(l <= r) { int mid = l + (r - l) / 2; if (check(mid)) { ans = mid; l = mid + 1; } else r = mid - 1; } cout << ans; return 0; } /* 4 5 2 10 9 5 2 6 4 20 15 9 7 10 9 -1 -1 16 11 1 2 3 2 3 3 1 4 1 4 3 1 3 1 1 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 52 ms | 2496 KB | Output is correct |
2 | Correct | 30 ms | 1236 KB | Output is correct |
3 | Correct | 30 ms | 1236 KB | Output is correct |
4 | Correct | 4 ms | 724 KB | Output is correct |
5 | Correct | 5 ms | 724 KB | Output is correct |
6 | Correct | 5 ms | 724 KB | Output is correct |
7 | Correct | 8 ms | 724 KB | Output is correct |
8 | Correct | 0 ms | 340 KB | Output is correct |
9 | Correct | 5 ms | 724 KB | Output is correct |
10 | Correct | 5 ms | 820 KB | Output is correct |
11 | Correct | 4 ms | 724 KB | Output is correct |
12 | Correct | 0 ms | 340 KB | Output is correct |
13 | Correct | 5 ms | 788 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 724 KB | Output is correct |
2 | Correct | 8 ms | 724 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Correct | 5 ms | 724 KB | Output is correct |
5 | Correct | 5 ms | 820 KB | Output is correct |
6 | Correct | 4 ms | 724 KB | Output is correct |
7 | Correct | 0 ms | 340 KB | Output is correct |
8 | Correct | 5 ms | 788 KB | Output is correct |
9 | Correct | 5 ms | 724 KB | Output is correct |
10 | Correct | 5 ms | 836 KB | Output is correct |
11 | Correct | 5 ms | 724 KB | Output is correct |
12 | Correct | 5 ms | 724 KB | Output is correct |
13 | Correct | 5 ms | 852 KB | Output is correct |
14 | Correct | 1 ms | 332 KB | Output is correct |
15 | Correct | 5 ms | 724 KB | Output is correct |
16 | Correct | 6 ms | 852 KB | Output is correct |
17 | Correct | 5 ms | 724 KB | Output is correct |
18 | Correct | 5 ms | 728 KB | Output is correct |
19 | Correct | 6 ms | 852 KB | Output is correct |
20 | Correct | 5 ms | 852 KB | Output is correct |
21 | Correct | 5 ms | 724 KB | Output is correct |
22 | Correct | 5 ms | 852 KB | Output is correct |
23 | Correct | 6 ms | 860 KB | Output is correct |
24 | Correct | 5 ms | 724 KB | Output is correct |
25 | Correct | 6 ms | 852 KB | Output is correct |
26 | Correct | 1 ms | 340 KB | Output is correct |
27 | Correct | 5 ms | 836 KB | Output is correct |
28 | Correct | 6 ms | 852 KB | Output is correct |
29 | Correct | 6 ms | 852 KB | Output is correct |
30 | Correct | 5 ms | 860 KB | Output is correct |
31 | Correct | 5 ms | 724 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 852 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 5 ms | 836 KB | Output is correct |
4 | Correct | 6 ms | 852 KB | Output is correct |
5 | Correct | 6 ms | 852 KB | Output is correct |
6 | Correct | 5 ms | 860 KB | Output is correct |
7 | Correct | 5 ms | 724 KB | Output is correct |
8 | Correct | 35 ms | 1364 KB | Output is correct |
9 | Correct | 80 ms | 2984 KB | Output is correct |
10 | Correct | 32 ms | 1392 KB | Output is correct |
11 | Correct | 36 ms | 1492 KB | Output is correct |
12 | Correct | 36 ms | 1500 KB | Output is correct |
13 | Correct | 33 ms | 1364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 724 KB | Output is correct |
2 | Correct | 5 ms | 836 KB | Output is correct |
3 | Correct | 5 ms | 724 KB | Output is correct |
4 | Correct | 5 ms | 724 KB | Output is correct |
5 | Correct | 5 ms | 852 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
7 | Correct | 5 ms | 724 KB | Output is correct |
8 | Correct | 6 ms | 852 KB | Output is correct |
9 | Correct | 5 ms | 724 KB | Output is correct |
10 | Correct | 5 ms | 728 KB | Output is correct |
11 | Correct | 6 ms | 852 KB | Output is correct |
12 | Correct | 5 ms | 852 KB | Output is correct |
13 | Correct | 5 ms | 724 KB | Output is correct |
14 | Correct | 5 ms | 852 KB | Output is correct |
15 | Correct | 6 ms | 860 KB | Output is correct |
16 | Correct | 5 ms | 724 KB | Output is correct |
17 | Correct | 35 ms | 1364 KB | Output is correct |
18 | Correct | 80 ms | 2984 KB | Output is correct |
19 | Correct | 32 ms | 1392 KB | Output is correct |
20 | Correct | 36 ms | 1492 KB | Output is correct |
21 | Correct | 36 ms | 1500 KB | Output is correct |
22 | Correct | 33 ms | 1364 KB | Output is correct |
23 | Correct | 6 ms | 852 KB | Output is correct |
24 | Correct | 1 ms | 340 KB | Output is correct |
25 | Correct | 5 ms | 836 KB | Output is correct |
26 | Correct | 6 ms | 852 KB | Output is correct |
27 | Correct | 6 ms | 852 KB | Output is correct |
28 | Correct | 5 ms | 860 KB | Output is correct |
29 | Correct | 5 ms | 724 KB | Output is correct |
30 | Correct | 52 ms | 2496 KB | Output is correct |
31 | Correct | 30 ms | 1236 KB | Output is correct |
32 | Correct | 30 ms | 1236 KB | Output is correct |
33 | Correct | 4 ms | 724 KB | Output is correct |
34 | Correct | 5 ms | 724 KB | Output is correct |
35 | Correct | 5 ms | 724 KB | Output is correct |
36 | Correct | 8 ms | 724 KB | Output is correct |
37 | Correct | 0 ms | 340 KB | Output is correct |
38 | Correct | 5 ms | 724 KB | Output is correct |
39 | Correct | 5 ms | 820 KB | Output is correct |
40 | Correct | 4 ms | 724 KB | Output is correct |
41 | Correct | 0 ms | 340 KB | Output is correct |
42 | Correct | 5 ms | 788 KB | Output is correct |
43 | Correct | 31 ms | 1236 KB | Output is correct |
44 | Correct | 36 ms | 1364 KB | Output is correct |
45 | Correct | 47 ms | 1800 KB | Output is correct |
46 | Correct | 33 ms | 1364 KB | Output is correct |
47 | Correct | 33 ms | 1320 KB | Output is correct |
48 | Correct | 34 ms | 1364 KB | Output is correct |
49 | Correct | 82 ms | 3148 KB | Output is correct |
50 | Correct | 0 ms | 324 KB | Output is correct |
51 | Correct | 1 ms | 328 KB | Output is correct |
52 | Correct | 31 ms | 1236 KB | Output is correct |
53 | Correct | 33 ms | 1368 KB | Output is correct |
54 | Correct | 34 ms | 1340 KB | Output is correct |
55 | Correct | 31 ms | 1236 KB | Output is correct |
56 | Correct | 31 ms | 1332 KB | Output is correct |
57 | Correct | 1 ms | 324 KB | Output is correct |
58 | Correct | 7 ms | 852 KB | Output is correct |
59 | Correct | 7 ms | 852 KB | Output is correct |
60 | Correct | 6 ms | 852 KB | Output is correct |
61 | Correct | 84 ms | 3388 KB | Output is correct |
62 | Correct | 83 ms | 3240 KB | Output is correct |
63 | Correct | 1 ms | 340 KB | Output is correct |