oj.uz

Submission #853949

# Submission time Handle Problem Language Result Execution time Memory
853949 2023-09-25T16:31:28 Z parsadox2 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 61 ms 4556 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define debug(x) cout << #x << " = " << x << " ";
#define fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define S second
#define F first
#define int long long
using namespace std;
 
const int maxn = 1e2 + 10 , maxk = 1e3 + 10 , ili = 1e9 + 10;
const int inf = 1e18 + 10;
int n , m , k , s[maxn][maxk] , b[maxn][maxk] , c[maxn][maxn];
ll dis[maxn][maxn] , ans[maxn][maxn];
vector <pair<ll, int>> g[maxn];
 
void allinf(ll tmp[][maxn])
{
	for(int i = 0 ; i < maxn ; i++)
		for(int j = 0 ; j < maxn ; j++)
			tmp[i][j] = inf;
}
 
void floyd(ll dist[][maxn])
{
	for(int i = 0 ; i < n ; i++)
		for(auto u : g[i])
			dist[i][u.S] = min(dist[i][u.S] , u.F);
	for(int kk = 0 ; kk < n ; kk++)
		for(int i = 0 ; i < n ; i++)
			for(int j = 0 ; j < n ; j++)
				dist[i][j] = min(dist[i][j] , dist[i][kk] + dist[kk][j]);
}
 
int C(int v , int u)
{
	int res = 0;
	for(int i = 0 ; i < k ; i++)
		if(b[v][i] != -1 && s[u][i] != -1)
			res = max(res , s[u][i] - b[v][i]);
	return res;
}
 
int32_t main()
{
	fast;
	
	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 < m ; i++)
	{
		int v , u , w;
		cin >> v >> u >> w;
		v--; u--;
		g[v].pb({w , u});
	}
	allinf(dis);
	floyd(dis);
	ll low = 0 , high = ili;
	for(int i = 0 ; i < n ; i++)
		for(int j = 0 ; j < n ; j++)
			if(i != j)
				c[i][j] = C(i , j);
	while(high - low > 1)
	{
		ll mid = (high + low) / 2;
		for(int i = 0 ; i < n ; i++)	g[i].clear();
		for(int i = 0 ; i < n ; i++)
			for(int j = 0 ; j < n ; j++)
				if(i != j)
					g[i].pb({(inf / dis[i][j] < mid ? inf : 1LL * mid * dis[i][j] - c[i][j]) , j});
		allinf(ans);
		floyd(ans);
		ll mn = 667;
		for(int i = 0 ; i < n ; i++) mn = min(mn , ans[i][i]);
		if(mn < 1)
			low = mid;
		else
			high = mid;
	}
	cout << low << endl;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 3660 KB Output is correct
2 Correct 30 ms 1628 KB Output is correct
3 Correct 31 ms 1628 KB Output is correct
4 Correct 5 ms 1116 KB Output is correct
5 Correct 5 ms 1116 KB Output is correct
6 Correct 6 ms 984 KB Output is correct
7 Correct 6 ms 1116 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 5 ms 1148 KB Output is correct
10 Correct 6 ms 1116 KB Output is correct
11 Correct 6 ms 1116 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 5 ms 980 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 984 KB Output is correct
2 Correct 6 ms 1116 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 5 ms 1148 KB Output is correct
5 Correct 6 ms 1116 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 5 ms 980 KB Output is correct
9 Correct 6 ms 1116 KB Output is correct
10 Correct 6 ms 1116 KB Output is correct
11 Correct 6 ms 1116 KB Output is correct
12 Correct 5 ms 1180 KB Output is correct
13 Correct 6 ms 1116 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 5 ms 1116 KB Output is correct
16 Correct 5 ms 1204 KB Output is correct
17 Correct 5 ms 1112 KB Output is correct
18 Correct 6 ms 1116 KB Output is correct
19 Correct 6 ms 992 KB Output is correct
20 Correct 6 ms 1116 KB Output is correct
21 Correct 6 ms 1200 KB Output is correct
22 Correct 6 ms 1116 KB Output is correct
23 Correct 6 ms 1112 KB Output is correct
24 Correct 5 ms 1112 KB Output is correct
25 Correct 6 ms 1116 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 6 ms 1116 KB Output is correct
28 Correct 6 ms 1116 KB Output is correct
29 Correct 6 ms 1244 KB Output is correct
30 Correct 6 ms 992 KB Output is correct
31 Correct 5 ms 1116 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1116 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 6 ms 1116 KB Output is correct
4 Correct 6 ms 1116 KB Output is correct
5 Correct 6 ms 1244 KB Output is correct
6 Correct 6 ms 992 KB Output is correct
7 Correct 5 ms 1116 KB Output is correct
8 Correct 33 ms 1856 KB Output is correct
9 Correct 53 ms 4236 KB Output is correct
10 Correct 31 ms 1880 KB Output is correct
11 Correct 32 ms 1884 KB Output is correct
12 Correct 33 ms 1884 KB Output is correct
13 Correct 32 ms 1884 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1116 KB Output is correct
2 Correct 6 ms 1116 KB Output is correct
3 Correct 6 ms 1116 KB Output is correct
4 Correct 5 ms 1180 KB Output is correct
5 Correct 6 ms 1116 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 5 ms 1116 KB Output is correct
8 Correct 5 ms 1204 KB Output is correct
9 Correct 5 ms 1112 KB Output is correct
10 Correct 6 ms 1116 KB Output is correct
11 Correct 6 ms 992 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 6 ms 1200 KB Output is correct
14 Correct 6 ms 1116 KB Output is correct
15 Correct 6 ms 1112 KB Output is correct
16 Correct 5 ms 1112 KB Output is correct
17 Correct 33 ms 1856 KB Output is correct
18 Correct 53 ms 4236 KB Output is correct
19 Correct 31 ms 1880 KB Output is correct
20 Correct 32 ms 1884 KB Output is correct
21 Correct 33 ms 1884 KB Output is correct
22 Correct 32 ms 1884 KB Output is correct
23 Correct 6 ms 1116 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 6 ms 1116 KB Output is correct
26 Correct 6 ms 1116 KB Output is correct
27 Correct 6 ms 1244 KB Output is correct
28 Correct 6 ms 992 KB Output is correct
29 Correct 5 ms 1116 KB Output is correct
30 Correct 47 ms 3660 KB Output is correct
31 Correct 30 ms 1628 KB Output is correct
32 Correct 31 ms 1628 KB Output is correct
33 Correct 5 ms 1116 KB Output is correct
34 Correct 5 ms 1116 KB Output is correct
35 Correct 6 ms 984 KB Output is correct
36 Correct 6 ms 1116 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 5 ms 1148 KB Output is correct
39 Correct 6 ms 1116 KB Output is correct
40 Correct 6 ms 1116 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 5 ms 980 KB Output is correct
43 Correct 31 ms 1764 KB Output is correct
44 Correct 32 ms 1948 KB Output is correct
45 Correct 51 ms 3360 KB Output is correct
46 Correct 35 ms 1884 KB Output is correct
47 Correct 32 ms 1884 KB Output is correct
48 Correct 32 ms 1884 KB Output is correct
49 Correct 54 ms 4408 KB Output is correct
50 Correct 1 ms 856 KB Output is correct
51 Correct 2 ms 600 KB Output is correct
52 Correct 31 ms 1628 KB Output is correct
53 Correct 32 ms 1884 KB Output is correct
54 Correct 31 ms 1628 KB Output is correct
55 Correct 31 ms 1628 KB Output is correct
56 Correct 31 ms 1628 KB Output is correct
57 Correct 1 ms 600 KB Output is correct
58 Correct 6 ms 1116 KB Output is correct
59 Correct 7 ms 1344 KB Output is correct
60 Correct 6 ms 1116 KB Output is correct
61 Correct 61 ms 4556 KB Output is correct
62 Correct 56 ms 4432 KB Output is correct
63 Correct 1 ms 604 KB Output is correct