oj.uz

답안 #656907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
656907 2022-11-08T13:28:09 Z Melika0gh 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 140 ms 4052 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;

const ll inf = 1121272678990188431;
const int maxn = 1e2+10, maxk = 1e3+10;
ll b[maxn][maxk], s[maxn][maxk], dis[maxn][maxn], new_w[maxn][maxn], max_ben[maxn][maxn];
int n, m, k;

void FloydWarshall(ll d[maxn][maxn])
{
	for(int w = 0; w < n; w++)
		for(int v = 0; v < n; v++)
			for(int u = 0; u < n; u++)
				d[v][u] = min(d[v][u], d[v][w] + d[w][u]);
	
	return;
}

void CalcBen()
{
	for(int v = 0; v < n; v++)
		for(int u = 0; u < n; u++)
			for(int l = 0; l < k; l++)
				if(b[v][l] != -1 && s[u][l] != -1)
					max_ben[v][u] = max(max_ben[v][u], s[u][l] - b[v][l]);
	
	return;
}

bool Valid(ll x)
{
	for(int v = 0; v < n; v++)
	{
		for(int u = 0; u < n; u++)
		{
			if(dis[v][u] == inf)
				new_w[v][u] = inf;
			else
				new_w[v][u] = x * dis[v][u] - max_ben[v][u];
		}
	}
	
	FloydWarshall(new_w);
	for(int v = 0; v < n; v++)
		if(new_w[v][v] <= 0)
			return true;
	
	return false;
}

ll Bs(ll l, ll r)
{
	if((r - l) <= 1)
		return l;
	
	ll mid = (l + r) / 2;
	if(Valid(mid))
		return Bs(mid, r);
	else
		return Bs(l, mid);
}

int main()
{
	cin >> n >> m >> k;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < k; j++)
			cin >> b[i][j] >> s[i][j];
	
	for(int i = 0; i < n; i++)
		fill(dis[i], dis[i] + n, inf);
	
	for(int i = 0; i < m; i++)
	{
		int v, u;
		ll w;
		cin >> v >> u >> w;
		v--, u--;
		dis[v][u] = w;
	}
	
	FloydWarshall(dis);
	CalcBen();
	
	ll ans = Bs(0, 1e9+10);
	cout << ans << '\n';
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 1960 KB Output is correct
2 Correct 29 ms 1208 KB Output is correct
3 Correct 31 ms 1268 KB Output is correct
4 Correct 5 ms 692 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 7 ms 692 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 6 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 7 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 7 ms 692 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 848 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 836 KB Output is correct
13 Correct 10 ms 936 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 5 ms 828 KB Output is correct
16 Correct 8 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 7 ms 852 KB Output is correct
20 Correct 7 ms 852 KB Output is correct
21 Correct 8 ms 852 KB Output is correct
22 Correct 7 ms 880 KB Output is correct
23 Correct 8 ms 852 KB Output is correct
24 Correct 5 ms 840 KB Output is correct
25 Correct 6 ms 832 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 8 ms 828 KB Output is correct
28 Correct 7 ms 852 KB Output is correct
29 Correct 7 ms 832 KB Output is correct
30 Correct 8 ms 836 KB Output is correct
31 Correct 6 ms 724 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 832 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 8 ms 828 KB Output is correct
4 Correct 7 ms 852 KB Output is correct
5 Correct 7 ms 832 KB Output is correct
6 Correct 8 ms 836 KB Output is correct
7 Correct 6 ms 724 KB Output is correct
8 Correct 40 ms 1516 KB Output is correct
9 Correct 124 ms 3820 KB Output is correct
10 Correct 36 ms 1500 KB Output is correct
11 Correct 41 ms 1748 KB Output is correct
12 Correct 53 ms 1748 KB Output is correct
13 Correct 35 ms 1504 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 848 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 836 KB Output is correct
5 Correct 10 ms 936 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 5 ms 828 KB Output is correct
8 Correct 8 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 7 ms 852 KB Output is correct
12 Correct 7 ms 852 KB Output is correct
13 Correct 8 ms 852 KB Output is correct
14 Correct 7 ms 880 KB Output is correct
15 Correct 8 ms 852 KB Output is correct
16 Correct 5 ms 840 KB Output is correct
17 Correct 40 ms 1516 KB Output is correct
18 Correct 124 ms 3820 KB Output is correct
19 Correct 36 ms 1500 KB Output is correct
20 Correct 41 ms 1748 KB Output is correct
21 Correct 53 ms 1748 KB Output is correct
22 Correct 35 ms 1504 KB Output is correct
23 Correct 6 ms 832 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 8 ms 828 KB Output is correct
26 Correct 7 ms 852 KB Output is correct
27 Correct 7 ms 832 KB Output is correct
28 Correct 8 ms 836 KB Output is correct
29 Correct 6 ms 724 KB Output is correct
30 Correct 88 ms 1960 KB Output is correct
31 Correct 29 ms 1208 KB Output is correct
32 Correct 31 ms 1268 KB Output is correct
33 Correct 5 ms 692 KB Output is correct
34 Correct 6 ms 724 KB Output is correct
35 Correct 4 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 308 KB Output is correct
38 Correct 7 ms 692 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 6 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 7 ms 852 KB Output is correct
43 Correct 34 ms 1388 KB Output is correct
44 Correct 35 ms 1588 KB Output is correct
45 Correct 62 ms 2508 KB Output is correct
46 Correct 40 ms 1580 KB Output is correct
47 Correct 34 ms 1492 KB Output is correct
48 Correct 34 ms 1604 KB Output is correct
49 Correct 133 ms 4052 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 32 ms 1348 KB Output is correct
53 Correct 37 ms 1468 KB Output is correct
54 Correct 31 ms 1340 KB Output is correct
55 Correct 31 ms 1364 KB Output is correct
56 Correct 32 ms 1328 KB Output is correct
57 Correct 1 ms 308 KB Output is correct
58 Correct 9 ms 1012 KB Output is correct
59 Correct 9 ms 964 KB Output is correct
60 Correct 10 ms 980 KB Output is correct
61 Correct 140 ms 4008 KB Output is correct
62 Correct 138 ms 4052 KB Output is correct
63 Correct 1 ms 340 KB Output is correct