답안 #934278

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
934278	2024-02-27T04:56:13 Z	oblantis	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	75 ms	4428 KB

merchant

#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll inf = 4e9;
const ll INF = LONG_LONG_MAX / 2;
const int mod = 1e9+7;
const int maxn = 100 + 1;
ll c[maxn][maxn];
ll dp[maxn][maxn];
void solve() {
	int n, m, k;
	cin >> n >> m >> k;
	ll b[n][k], s[n][k];
	ll a[n][n];
	vt<pii> g[n];
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++)a[i][j] = INF;
		for(int j = 0; j < k; j++){
			cin >> b[i][j] >> s[i][j];
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			for(int o = 0; o < k; o++){
				if(b[i][o] != -1)c[i][j] = max(c[i][j], s[j][o] - b[i][o]);
			}
		}
	}
	for(int i = 0, u, v, d; i < m; i++){
		cin >> u >> v >> d;
		--u, --v;
		g[u].pb({v, d});
	}
	for(int i = 0; i < n; i++){
		priority_queue<pii, vt<pii>, greater<pii>> pq;
		pq.push({0, i});
		a[i][i] = 0;
		while(!pq.empty()){
			pii nw = pq.top();
			pq.pop();
			if(a[i][nw.ss] != nw.ff)continue;
			for(auto j : g[nw.ss]){
				if(a[i][j.ff] > nw.ff + j.ss){
					a[i][j.ff] = nw.ff + j.ss;
					pq.push({a[i][j.ff], j.ff});
				}
			}
		}
	}
	ll l = 0, r = 1000000001;
	while(l + 1 < r){
		ll mid = l + (r - l) / 2;
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				if(i != j)dp[i][j] = c[i][j] - min(a[i][j], INF / mid) * mid;
				else dp[i][i] = -INF;
			}
		}
		bool ok = 0;
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				for(int o = 0; o < n; o++){
					if(dp[j][o] <= dp[j][i] + dp[i][o])dp[j][o] = dp[j][i] + dp[i][o];
				}
			}
		}
		for(int i = 0; i < n; i++){
			if(dp[i][i] >= 0)ok = 1;
		}
		if(ok)l = mid;
		else r = mid;
	}
	cout << l;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int times = 1;
	//cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	47 ms	2140 KB	Output is correct
2	Correct	43 ms	604 KB	Output is correct
3	Correct	38 ms	604 KB	Output is correct
4	Correct	6 ms	604 KB	Output is correct
5	Correct	5 ms	348 KB	Output is correct
6	Correct	8 ms	348 KB	Output is correct
7	Correct	6 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	6 ms	348 KB	Output is correct
10	Correct	5 ms	348 KB	Output is correct
11	Correct	5 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	6 ms	568 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	348 KB	Output is correct
2	Correct	6 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	6 ms	348 KB	Output is correct
5	Correct	5 ms	348 KB	Output is correct
6	Correct	5 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	6 ms	568 KB	Output is correct
9	Correct	6 ms	348 KB	Output is correct
10	Correct	8 ms	348 KB	Output is correct
11	Correct	8 ms	348 KB	Output is correct
12	Correct	7 ms	588 KB	Output is correct
13	Correct	7 ms	600 KB	Output is correct
14	Correct	1 ms	596 KB	Output is correct
15	Correct	4 ms	348 KB	Output is correct
16	Correct	4 ms	604 KB	Output is correct
17	Correct	4 ms	348 KB	Output is correct
18	Correct	4 ms	600 KB	Output is correct
19	Correct	6 ms	600 KB	Output is correct
20	Correct	5 ms	604 KB	Output is correct
21	Correct	4 ms	604 KB	Output is correct
22	Correct	5 ms	604 KB	Output is correct
23	Correct	5 ms	604 KB	Output is correct
24	Correct	4 ms	344 KB	Output is correct
25	Correct	9 ms	604 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	8 ms	604 KB	Output is correct
28	Correct	6 ms	604 KB	Output is correct
29	Correct	5 ms	604 KB	Output is correct
30	Correct	4 ms	452 KB	Output is correct
31	Correct	4 ms	348 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	604 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	8 ms	604 KB	Output is correct
4	Correct	6 ms	604 KB	Output is correct
5	Correct	5 ms	604 KB	Output is correct
6	Correct	4 ms	452 KB	Output is correct
7	Correct	4 ms	348 KB	Output is correct
8	Correct	48 ms	604 KB	Output is correct
9	Correct	75 ms	2096 KB	Output is correct
10	Correct	39 ms	600 KB	Output is correct
11	Correct	56 ms	836 KB	Output is correct
12	Correct	52 ms	860 KB	Output is correct
13	Correct	32 ms	604 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	348 KB	Output is correct
2	Correct	8 ms	348 KB	Output is correct
3	Correct	8 ms	348 KB	Output is correct
4	Correct	7 ms	588 KB	Output is correct
5	Correct	7 ms	600 KB	Output is correct
6	Correct	1 ms	596 KB	Output is correct
7	Correct	4 ms	348 KB	Output is correct
8	Correct	4 ms	604 KB	Output is correct
9	Correct	4 ms	348 KB	Output is correct
10	Correct	4 ms	600 KB	Output is correct
11	Correct	6 ms	600 KB	Output is correct
12	Correct	5 ms	604 KB	Output is correct
13	Correct	4 ms	604 KB	Output is correct
14	Correct	5 ms	604 KB	Output is correct
15	Correct	5 ms	604 KB	Output is correct
16	Correct	4 ms	344 KB	Output is correct
17	Correct	48 ms	604 KB	Output is correct
18	Correct	75 ms	2096 KB	Output is correct
19	Correct	39 ms	600 KB	Output is correct
20	Correct	56 ms	836 KB	Output is correct
21	Correct	52 ms	860 KB	Output is correct
22	Correct	32 ms	604 KB	Output is correct
23	Correct	9 ms	604 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	8 ms	604 KB	Output is correct
26	Correct	6 ms	604 KB	Output is correct
27	Correct	5 ms	604 KB	Output is correct
28	Correct	4 ms	452 KB	Output is correct
29	Correct	4 ms	348 KB	Output is correct
30	Correct	47 ms	2140 KB	Output is correct
31	Correct	43 ms	604 KB	Output is correct
32	Correct	38 ms	604 KB	Output is correct
33	Correct	6 ms	604 KB	Output is correct
34	Correct	5 ms	348 KB	Output is correct
35	Correct	8 ms	348 KB	Output is correct
36	Correct	6 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	6 ms	348 KB	Output is correct
39	Correct	5 ms	348 KB	Output is correct
40	Correct	5 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	6 ms	568 KB	Output is correct
43	Correct	37 ms	744 KB	Output is correct
44	Correct	32 ms	860 KB	Output is correct
45	Correct	57 ms	2412 KB	Output is correct
46	Correct	49 ms	856 KB	Output is correct
47	Correct	49 ms	860 KB	Output is correct
48	Correct	35 ms	856 KB	Output is correct
49	Correct	63 ms	4048 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	29 ms	600 KB	Output is correct
53	Correct	27 ms	856 KB	Output is correct
54	Correct	28 ms	600 KB	Output is correct
55	Correct	30 ms	1012 KB	Output is correct
56	Correct	28 ms	632 KB	Output is correct
57	Correct	0 ms	596 KB	Output is correct
58	Correct	6 ms	748 KB	Output is correct
59	Correct	6 ms	604 KB	Output is correct
60	Correct	6 ms	604 KB	Output is correct
61	Correct	61 ms	4428 KB	Output is correct
62	Correct	63 ms	4188 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct

답안 #934278

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