답안 #231936

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
231936	2020-05-15T11:25:47 Z	ruler	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	113 ms	3320 KB

merchant

// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 2e9;
const ll MOD = 1e9 + 7;
 
////////////////////////////////////////////////////////////////////

const int N = 1e2 + 5, K = 1e3 + 5;

int n, m, t, B[N][K], S[N][K], D[N][N], V[N][N];
ll C[N][N];

bool OK(int q) {
	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) C[i][j] = 1LL * q * D[i][j] - V[i][j];
	for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i ^ j) C[i][j] = min(C[i][j], C[i][k] + C[k][j]);
	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i != j && C[i][j] + C[j][i] <= 0) return true;
	return false;
}

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	mt19937 Rnd(time(0));

	memset(D, 63, sizeof D);

	cin >> n >> m >> t;
	for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) cin >> B[i][j] >> S[i][j];
	for (int i = 1; i <= m; i++) {
		int v, u, w; cin >> v >> u >> w;
		D[v][u] = min(D[v][u], w);
	}
	for (int i = 1; i <= n; i++) D[i][i] = 0;
	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]);
	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) for (int k = 1; k <= t; k++) if (B[i][k] != -1 && S[j][k] != -1) V[i][j] = max(V[i][j], S[j][k] - B[i][k]);

	int dw = 0, up = INF;
	while (up - dw > 1) {
		int md = (dw + up) >> 1;
		if (OK(md)) dw = md;
		else up = md;
	}
	cout << dw << endl;

	return 0;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	76 ms	1272 KB	Output is correct
2	Correct	43 ms	1280 KB	Output is correct
3	Correct	48 ms	1280 KB	Output is correct
4	Correct	10 ms	768 KB	Output is correct
5	Correct	11 ms	896 KB	Output is correct
6	Correct	10 ms	768 KB	Output is correct
7	Correct	11 ms	896 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	10 ms	768 KB	Output is correct
10	Correct	11 ms	768 KB	Output is correct
11	Correct	11 ms	768 KB	Output is correct
12	Correct	4 ms	512 KB	Output is correct
13	Correct	11 ms	768 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	896 KB	Output is correct
2	Correct	10 ms	896 KB	Output is correct
3	Correct	11 ms	896 KB	Output is correct
4	Correct	11 ms	768 KB	Output is correct
5	Correct	12 ms	896 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	11 ms	896 KB	Output is correct
8	Correct	11 ms	896 KB	Output is correct
9	Correct	11 ms	896 KB	Output is correct
10	Correct	11 ms	896 KB	Output is correct
11	Correct	12 ms	896 KB	Output is correct
12	Correct	13 ms	896 KB	Output is correct
13	Correct	11 ms	896 KB	Output is correct
14	Correct	11 ms	896 KB	Output is correct
15	Correct	13 ms	896 KB	Output is correct
16	Correct	10 ms	896 KB	Output is correct
17	Correct	12 ms	896 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	12 ms	896 KB	Output is correct
20	Correct	12 ms	896 KB	Output is correct
21	Correct	12 ms	896 KB	Output is correct
22	Correct	11 ms	896 KB	Output is correct
23	Correct	10 ms	896 KB	Output is correct
24	Correct	10 ms	768 KB	Output is correct
25	Correct	11 ms	896 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	10 ms	768 KB	Output is correct
28	Correct	11 ms	768 KB	Output is correct
29	Correct	11 ms	768 KB	Output is correct
30	Correct	4 ms	512 KB	Output is correct
31	Correct	11 ms	768 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	51 ms	1384 KB	Output is correct
2	Correct	103 ms	1272 KB	Output is correct
3	Correct	48 ms	1280 KB	Output is correct
4	Correct	52 ms	1280 KB	Output is correct
5	Correct	51 ms	1280 KB	Output is correct
6	Correct	48 ms	1280 KB	Output is correct
7	Correct	12 ms	896 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	12 ms	896 KB	Output is correct
10	Correct	12 ms	896 KB	Output is correct
11	Correct	12 ms	896 KB	Output is correct
12	Correct	11 ms	896 KB	Output is correct
13	Correct	10 ms	896 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	896 KB	Output is correct
2	Correct	10 ms	896 KB	Output is correct
3	Correct	11 ms	896 KB	Output is correct
4	Correct	11 ms	768 KB	Output is correct
5	Correct	12 ms	896 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	11 ms	896 KB	Output is correct
8	Correct	11 ms	896 KB	Output is correct
9	Correct	11 ms	896 KB	Output is correct
10	Correct	11 ms	896 KB	Output is correct
11	Correct	12 ms	896 KB	Output is correct
12	Correct	13 ms	896 KB	Output is correct
13	Correct	11 ms	896 KB	Output is correct
14	Correct	11 ms	896 KB	Output is correct
15	Correct	13 ms	896 KB	Output is correct
16	Correct	10 ms	896 KB	Output is correct
17	Correct	51 ms	1384 KB	Output is correct
18	Correct	103 ms	1272 KB	Output is correct
19	Correct	48 ms	1280 KB	Output is correct
20	Correct	52 ms	1280 KB	Output is correct
21	Correct	51 ms	1280 KB	Output is correct
22	Correct	48 ms	1280 KB	Output is correct
23	Correct	12 ms	896 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	12 ms	896 KB	Output is correct
26	Correct	12 ms	896 KB	Output is correct
27	Correct	12 ms	896 KB	Output is correct
28	Correct	11 ms	896 KB	Output is correct
29	Correct	10 ms	896 KB	Output is correct
30	Correct	45 ms	1280 KB	Output is correct
31	Correct	49 ms	1408 KB	Output is correct
32	Correct	66 ms	1792 KB	Output is correct
33	Correct	48 ms	1528 KB	Output is correct
34	Correct	48 ms	1408 KB	Output is correct
35	Correct	51 ms	1408 KB	Output is correct
36	Correct	111 ms	3192 KB	Output is correct
37	Correct	5 ms	512 KB	Output is correct
38	Correct	5 ms	512 KB	Output is correct
39	Correct	46 ms	1280 KB	Output is correct
40	Correct	51 ms	1536 KB	Output is correct
41	Correct	46 ms	1280 KB	Output is correct
42	Correct	45 ms	1280 KB	Output is correct
43	Correct	46 ms	1280 KB	Output is correct
44	Correct	5 ms	384 KB	Output is correct
45	Correct	13 ms	896 KB	Output is correct
46	Correct	13 ms	896 KB	Output is correct
47	Correct	13 ms	1024 KB	Output is correct
48	Correct	113 ms	3320 KB	Output is correct
49	Correct	110 ms	3320 KB	Output is correct
50	Correct	5 ms	384 KB	Output is correct
51	Correct	76 ms	1272 KB	Output is correct
52	Correct	43 ms	1280 KB	Output is correct
53	Correct	48 ms	1280 KB	Output is correct
54	Correct	10 ms	768 KB	Output is correct
55	Correct	11 ms	896 KB	Output is correct
56	Correct	10 ms	768 KB	Output is correct
57	Correct	11 ms	896 KB	Output is correct
58	Correct	4 ms	384 KB	Output is correct
59	Correct	10 ms	768 KB	Output is correct
60	Correct	11 ms	768 KB	Output is correct
61	Correct	11 ms	768 KB	Output is correct
62	Correct	4 ms	512 KB	Output is correct
63	Correct	11 ms	768 KB	Output is correct

답안 #231936

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