Submission #307360

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
307360	2020-09-28T00:46:28 Z	syy	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	76 ms	4216 KB

merchant

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (ll) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss

ll n, m, K, buy[105][1005], sell[105][1005], dist[105][105], earn[105][105];

bool check(ll x) {
	ll diff[105][105]; FOR(i, 1, n) FOR(j, 1, n) diff[i][j] = LLINF;
	FOR(i, 1, n) FOR(j, 1, n) if (dist[i][j] != LLINF) diff[i][j] = min(diff[i][j], dist[i][j] * x - earn[i][j]);
	// how much you must earn to profit - how much you can earn
	FOR(k, 1, n) FOR(i, 1, n) FOR(j, 1, n) diff[i][j] = min(diff[i][j], diff[i][k] + diff[k][j]);
	FOR(i, 1, n) if (diff[i][i] <= 0) return 1;
	return 0;
}

int main() {
	fastio; cin >> n >> m >> K;
	FOR(i, 1, n) FOR(k, 1, K) {
		cin >> buy[i][k] >> sell[i][k];
		if (buy[i][k] == -1) buy[i][k] = LLINF;
		if (sell[i][k] == -1) sell[i][k] = -LLINF;
	}
	FOR(i, 1, n) FOR(j, 1, n) dist[i][j] = LLINF;
	FOR(i, 1, m) {
		ll a, b, c; cin >> a >> b >> c;
		dist[a][b] = c;
	}
	FOR(k, 1, n) FOR(i, 1, n) FOR(j, 1, n) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
	FOR(i, 1, n) FOR(j, 1, n) FOR(k, 1, K) earn[i][j] = max(earn[i][j], sell[j][k] - buy[i][k]);
	ll lower = 0, upper = 1000000001;
	while (upper - lower > 1) {
		ll mid = (upper + lower)/2;
		if (check(mid)) lower = mid;
		else upper = mid;
	}
	cout << lower;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	69 ms	2176 KB	Output is correct
2	Correct	40 ms	1408 KB	Output is correct
3	Correct	39 ms	1408 KB	Output is correct
4	Correct	6 ms	896 KB	Output is correct
5	Correct	6 ms	896 KB	Output is correct
6	Correct	6 ms	896 KB	Output is correct
7	Correct	7 ms	896 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	6 ms	896 KB	Output is correct
10	Correct	6 ms	896 KB	Output is correct
11	Correct	6 ms	896 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	6 ms	896 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	896 KB	Output is correct
2	Correct	6 ms	896 KB	Output is correct
3	Correct	7 ms	896 KB	Output is correct
4	Correct	6 ms	896 KB	Output is correct
5	Correct	7 ms	896 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	6 ms	896 KB	Output is correct
8	Correct	6 ms	896 KB	Output is correct
9	Correct	6 ms	896 KB	Output is correct
10	Correct	6 ms	896 KB	Output is correct
11	Correct	7 ms	896 KB	Output is correct
12	Correct	7 ms	896 KB	Output is correct
13	Correct	7 ms	896 KB	Output is correct
14	Correct	7 ms	896 KB	Output is correct
15	Correct	7 ms	1024 KB	Output is correct
16	Correct	6 ms	896 KB	Output is correct
17	Correct	7 ms	896 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	7 ms	896 KB	Output is correct
20	Correct	7 ms	896 KB	Output is correct
21	Correct	7 ms	896 KB	Output is correct
22	Correct	8 ms	896 KB	Output is correct
23	Correct	6 ms	1024 KB	Output is correct
24	Correct	6 ms	896 KB	Output is correct
25	Correct	7 ms	896 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	6 ms	896 KB	Output is correct
28	Correct	6 ms	896 KB	Output is correct
29	Correct	6 ms	896 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	6 ms	896 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	1536 KB	Output is correct
2	Correct	74 ms	2168 KB	Output is correct
3	Correct	40 ms	1408 KB	Output is correct
4	Correct	43 ms	1536 KB	Output is correct
5	Correct	43 ms	1536 KB	Output is correct
6	Correct	41 ms	1408 KB	Output is correct
7	Correct	7 ms	896 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	7 ms	896 KB	Output is correct
10	Correct	7 ms	896 KB	Output is correct
11	Correct	7 ms	896 KB	Output is correct
12	Correct	8 ms	896 KB	Output is correct
13	Correct	6 ms	1024 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	896 KB	Output is correct
2	Correct	6 ms	896 KB	Output is correct
3	Correct	7 ms	896 KB	Output is correct
4	Correct	6 ms	896 KB	Output is correct
5	Correct	7 ms	896 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	6 ms	896 KB	Output is correct
8	Correct	6 ms	896 KB	Output is correct
9	Correct	6 ms	896 KB	Output is correct
10	Correct	6 ms	896 KB	Output is correct
11	Correct	7 ms	896 KB	Output is correct
12	Correct	7 ms	896 KB	Output is correct
13	Correct	7 ms	896 KB	Output is correct
14	Correct	7 ms	896 KB	Output is correct
15	Correct	7 ms	1024 KB	Output is correct
16	Correct	6 ms	896 KB	Output is correct
17	Correct	45 ms	1536 KB	Output is correct
18	Correct	74 ms	2168 KB	Output is correct
19	Correct	40 ms	1408 KB	Output is correct
20	Correct	43 ms	1536 KB	Output is correct
21	Correct	43 ms	1536 KB	Output is correct
22	Correct	41 ms	1408 KB	Output is correct
23	Correct	7 ms	896 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	7 ms	896 KB	Output is correct
26	Correct	7 ms	896 KB	Output is correct
27	Correct	7 ms	896 KB	Output is correct
28	Correct	8 ms	896 KB	Output is correct
29	Correct	6 ms	1024 KB	Output is correct
30	Correct	40 ms	1408 KB	Output is correct
31	Correct	44 ms	1664 KB	Output is correct
32	Correct	59 ms	2680 KB	Output is correct
33	Correct	44 ms	1656 KB	Output is correct
34	Correct	42 ms	1664 KB	Output is correct
35	Correct	42 ms	1664 KB	Output is correct
36	Correct	75 ms	4088 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	40 ms	1408 KB	Output is correct
40	Correct	41 ms	1536 KB	Output is correct
41	Correct	40 ms	1532 KB	Output is correct
42	Correct	41 ms	1408 KB	Output is correct
43	Correct	39 ms	1408 KB	Output is correct
44	Correct	1 ms	384 KB	Output is correct
45	Correct	8 ms	1024 KB	Output is correct
46	Correct	8 ms	1024 KB	Output is correct
47	Correct	8 ms	1024 KB	Output is correct
48	Correct	75 ms	4216 KB	Output is correct
49	Correct	76 ms	4216 KB	Output is correct
50	Correct	1 ms	384 KB	Output is correct
51	Correct	69 ms	2176 KB	Output is correct
52	Correct	40 ms	1408 KB	Output is correct
53	Correct	39 ms	1408 KB	Output is correct
54	Correct	6 ms	896 KB	Output is correct
55	Correct	6 ms	896 KB	Output is correct
56	Correct	6 ms	896 KB	Output is correct
57	Correct	7 ms	896 KB	Output is correct
58	Correct	1 ms	384 KB	Output is correct
59	Correct	6 ms	896 KB	Output is correct
60	Correct	6 ms	896 KB	Output is correct
61	Correct	6 ms	896 KB	Output is correct
62	Correct	1 ms	384 KB	Output is correct
63	Correct	6 ms	896 KB	Output is correct

Submission #307360

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0