Submission #409111

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
409111	2021-05-20T08:14:38 Z	cheissmart	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	103 ms	3332 KB

merchant

#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 0x3f3f3f3f, N = 105, K = 1005;
const ll oo = 1e18;
const double eps = 1e-9;

int cost[N][K][2];
int a[N][N], b[N][N];
ll c[N][N];

signed main()
{
	IO_OP;

	memset(a, 0x3f, sizeof a);

	int n, m, k;
	cin >> n >> m >> k;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < k; j++) {
			cin >> cost[i][j][0] >> cost[i][j][1];
		}
	for(int i = 0; i < n; i++)
		a[i][i] = 0;
	for(int i = 0; i < m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		u--, v--;
		a[u][v] = min(a[u][v], w);
	}
	for(int k = 0; k < n; k++)
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				a[i][j] = min(a[i][j], a[i][k] + a[k][j]);

	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			for(int l = 0; l < k; l++) {
				if(cost[j][l][1] != -1 && cost[i][l][0] != -1)
					b[i][j] = max(b[i][j], cost[j][l][1] - cost[i][l][0]);
			}

	auto ok = [&] (ll eff) {
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++) {
				if(i == j) c[i][j] = INF;
				else if(a[i][j] < INF)
					c[i][j] = a[i][j] * eff - b[i][j];
				else 
					c[i][j] = oo;
			}
		for(int k = 0; k < n; k++)
			for(int i = 0; i < n; i++) {
				for(int j = 0; j < n; j++)
					c[i][j] = min(c[i][j], c[i][k] + c[k][j]);
			}
		for(int i = 0; i < n; i++)
			if(c[i][i] <= 0)
				return true;
		return false;
	};

	int lb = 0, rb = INF;
	while(lb <= rb) {
		int mb = (lb + rb) / 2;
		if(ok(mb)) lb = mb + 1;
		else rb = mb - 1;
	}
	cout << rb << '\n';

}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	68 ms	1160 KB	Output is correct
2	Correct	39 ms	844 KB	Output is correct
3	Correct	39 ms	844 KB	Output is correct
4	Correct	6 ms	588 KB	Output is correct
5	Correct	6 ms	588 KB	Output is correct
6	Correct	6 ms	616 KB	Output is correct
7	Correct	7 ms	588 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	6 ms	604 KB	Output is correct
10	Correct	6 ms	616 KB	Output is correct
11	Correct	6 ms	588 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	7 ms	624 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	616 KB	Output is correct
2	Correct	7 ms	588 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	6 ms	604 KB	Output is correct
5	Correct	6 ms	616 KB	Output is correct
6	Correct	6 ms	588 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	7 ms	624 KB	Output is correct
9	Correct	6 ms	588 KB	Output is correct
10	Correct	6 ms	624 KB	Output is correct
11	Correct	7 ms	588 KB	Output is correct
12	Correct	6 ms	644 KB	Output is correct
13	Correct	7 ms	648 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	8 ms	632 KB	Output is correct
16	Correct	7 ms	588 KB	Output is correct
17	Correct	7 ms	636 KB	Output is correct
18	Correct	7 ms	588 KB	Output is correct
19	Correct	7 ms	588 KB	Output is correct
20	Correct	8 ms	588 KB	Output is correct
21	Correct	7 ms	588 KB	Output is correct
22	Correct	7 ms	640 KB	Output is correct
23	Correct	8 ms	644 KB	Output is correct
24	Correct	6 ms	588 KB	Output is correct
25	Correct	7 ms	588 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	7 ms	648 KB	Output is correct
28	Correct	7 ms	588 KB	Output is correct
29	Correct	7 ms	588 KB	Output is correct
30	Correct	7 ms	628 KB	Output is correct
31	Correct	6 ms	588 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	588 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	7 ms	648 KB	Output is correct
4	Correct	7 ms	588 KB	Output is correct
5	Correct	7 ms	588 KB	Output is correct
6	Correct	7 ms	628 KB	Output is correct
7	Correct	6 ms	588 KB	Output is correct
8	Correct	46 ms	972 KB	Output is correct
9	Correct	94 ms	1256 KB	Output is correct
10	Correct	41 ms	844 KB	Output is correct
11	Correct	45 ms	972 KB	Output is correct
12	Correct	45 ms	964 KB	Output is correct
13	Correct	41 ms	804 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	588 KB	Output is correct
2	Correct	6 ms	624 KB	Output is correct
3	Correct	7 ms	588 KB	Output is correct
4	Correct	6 ms	644 KB	Output is correct
5	Correct	7 ms	648 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	8 ms	632 KB	Output is correct
8	Correct	7 ms	588 KB	Output is correct
9	Correct	7 ms	636 KB	Output is correct
10	Correct	7 ms	588 KB	Output is correct
11	Correct	7 ms	588 KB	Output is correct
12	Correct	8 ms	588 KB	Output is correct
13	Correct	7 ms	588 KB	Output is correct
14	Correct	7 ms	640 KB	Output is correct
15	Correct	8 ms	644 KB	Output is correct
16	Correct	6 ms	588 KB	Output is correct
17	Correct	46 ms	972 KB	Output is correct
18	Correct	94 ms	1256 KB	Output is correct
19	Correct	41 ms	844 KB	Output is correct
20	Correct	45 ms	972 KB	Output is correct
21	Correct	45 ms	964 KB	Output is correct
22	Correct	41 ms	804 KB	Output is correct
23	Correct	7 ms	588 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	7 ms	648 KB	Output is correct
26	Correct	7 ms	588 KB	Output is correct
27	Correct	7 ms	588 KB	Output is correct
28	Correct	7 ms	628 KB	Output is correct
29	Correct	6 ms	588 KB	Output is correct
30	Correct	68 ms	1160 KB	Output is correct
31	Correct	39 ms	844 KB	Output is correct
32	Correct	39 ms	844 KB	Output is correct
33	Correct	6 ms	588 KB	Output is correct
34	Correct	6 ms	588 KB	Output is correct
35	Correct	6 ms	616 KB	Output is correct
36	Correct	7 ms	588 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	6 ms	604 KB	Output is correct
39	Correct	6 ms	616 KB	Output is correct
40	Correct	6 ms	588 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	7 ms	624 KB	Output is correct
43	Correct	39 ms	900 KB	Output is correct
44	Correct	48 ms	972 KB	Output is correct
45	Correct	60 ms	1716 KB	Output is correct
46	Correct	41 ms	972 KB	Output is correct
47	Correct	42 ms	1020 KB	Output is correct
48	Correct	46 ms	972 KB	Output is correct
49	Correct	101 ms	3124 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	44 ms	896 KB	Output is correct
53	Correct	41 ms	972 KB	Output is correct
54	Correct	40 ms	844 KB	Output is correct
55	Correct	39 ms	844 KB	Output is correct
56	Correct	39 ms	888 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	8 ms	716 KB	Output is correct
59	Correct	9 ms	768 KB	Output is correct
60	Correct	8 ms	780 KB	Output is correct
61	Correct	103 ms	3308 KB	Output is correct
62	Correct	103 ms	3332 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct

Submission #409111

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