oj.uz

답안 #263435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
263435 2020-08-13T17:00:05 Z shayan_p 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 158 ms 4004 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 105;
const int maxk = 1005;
const int maxm = 10005;
const ld eps = 0.0000001;
const ll inf = (ll)4e18;
ll b[maxn][maxk],s[maxn][maxk];
int n,m;
pair<pair<int,int>,ll> e[maxm], E[maxn*maxn];
ll dp[maxn][maxn];
ll c[maxn][maxn];
ld sp[maxn][maxn];
 
bool check(ll x){
	memset(dp, 63, sizeof dp);
	for (int i = 1; i <= n; i++)
		dp[i][i] = 0;
	for (int i = 1; i <= m; i++){
		int v = e[i].first.first, u = e[i].first.second;
		ll w = e[i].second;
		dp[v][u] = x*w;
	}
	for (int k = 1; k <= n; k++)
		for (int v = 1; v <= n; v++)
			for (int u = 1; u <= n; u++)
				dp[v][u] = min(dp[v][u], dp[v][k] + dp[k][u]);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (i != j)
			    dp[i][j]-= c[i][j], sp[i][j] = dp[i][j] - eps;
	for(int i = 1; i <= n; i++)
	    dp[i][i] = inf;
	for(int k = 1; k <= n; k++)
	    for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
		    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
	for (int i = 1; i <= n; i++)
		if (dp[i][i] <= 0)
		    return true;
	return false;		
}
 
int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int k;
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= k; j++)
			cin >> b[i][j] >> s[i][j];
	for (int i = 1; i <= m; i++){
		int v, u, w;
		cin >> v >> u >> w;
		e[i] = {{v, u}, w};
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			for (int x = 1; x <= k; x++)
				if (b[i][x] != -1 and s[j][x] != -1)
					c[i][j] = max(c[i][j], s[j][x] - b[i][x]);
	ll lo = 0, hi = 1000 * 1000 * 1000 + 1;
	while (hi - lo > 1){
		ll mid = (lo + hi) >> 1;
		if (check(mid))
			lo = mid;
		else
			hi = mid;
	}
	cout << lo << endl;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 3448 KB Output is correct
2 Correct 83 ms 1408 KB Output is correct
3 Correct 74 ms 1408 KB Output is correct
4 Correct 11 ms 896 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 11 ms 896 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 15 ms 896 KB Output is correct
11 Correct 15 ms 896 KB Output is correct
12 Correct 1 ms 488 KB Output is correct
13 Correct 12 ms 1024 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 1912 KB Output is correct
2 Correct 130 ms 4004 KB Output is correct
3 Correct 97 ms 1696 KB Output is correct
4 Correct 86 ms 1920 KB Output is correct
5 Correct 97 ms 1912 KB Output is correct
6 Correct 99 ms 1664 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 12 ms 1024 KB Output is correct
10 Correct 17 ms 1024 KB Output is correct
11 Correct 12 ms 1024 KB Output is correct
12 Correct 13 ms 1024 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 1024 KB Output is correct
2 Correct 15 ms 1024 KB Output is correct
3 Correct 12 ms 1024 KB Output is correct
4 Correct 14 ms 1024 KB Output is correct
5 Correct 12 ms 1024 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 13 ms 896 KB Output is correct
8 Correct 11 ms 1024 KB Output is correct
9 Correct 12 ms 1024 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 12 ms 1024 KB Output is correct
12 Correct 12 ms 1024 KB Output is correct
13 Correct 12 ms 1024 KB Output is correct
14 Correct 13 ms 1024 KB Output is correct
15 Correct 13 ms 1152 KB Output is correct
16 Correct 11 ms 896 KB Output is correct
17 Correct 89 ms 1912 KB Output is correct
18 Correct 130 ms 4004 KB Output is correct
19 Correct 97 ms 1696 KB Output is correct
20 Correct 86 ms 1920 KB Output is correct
21 Correct 97 ms 1912 KB Output is correct
22 Correct 99 ms 1664 KB Output is correct
23 Correct 12 ms 1024 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 12 ms 1024 KB Output is correct
26 Correct 17 ms 1024 KB Output is correct
27 Correct 12 ms 1024 KB Output is correct
28 Correct 13 ms 1024 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 74 ms 1536 KB Output is correct
31 Correct 97 ms 1664 KB Output is correct
32 Correct 103 ms 2796 KB Output is correct
33 Correct 78 ms 1664 KB Output is correct
34 Correct 111 ms 1792 KB Output is correct
35 Correct 87 ms 1784 KB Output is correct
36 Correct 139 ms 3704 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 85 ms 1512 KB Output is correct
40 Correct 85 ms 1780 KB Output is correct
41 Correct 75 ms 1536 KB Output is correct
42 Correct 88 ms 1656 KB Output is correct
43 Correct 74 ms 1408 KB Output is correct
44 Correct 1 ms 512 KB Output is correct
45 Correct 13 ms 1152 KB Output is correct
46 Correct 13 ms 1152 KB Output is correct
47 Correct 18 ms 1152 KB Output is correct
48 Correct 158 ms 3960 KB Output is correct
49 Correct 145 ms 3952 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 107 ms 3448 KB Output is correct
52 Correct 83 ms 1408 KB Output is correct
53 Correct 74 ms 1408 KB Output is correct
54 Correct 11 ms 896 KB Output is correct
55 Correct 11 ms 896 KB Output is correct
56 Correct 11 ms 896 KB Output is correct
57 Correct 12 ms 1024 KB Output is correct
58 Correct 1 ms 512 KB Output is correct
59 Correct 11 ms 896 KB Output is correct
60 Correct 15 ms 896 KB Output is correct
61 Correct 15 ms 896 KB Output is correct
62 Correct 1 ms 488 KB Output is correct
63 Correct 12 ms 1024 KB Output is correct