oj.uz

Submission #538549

# Submission time Handle Problem Language Result Execution time Memory
538549 2022-03-17T04:40:14 Z pavement Travelling Merchant (APIO17_merchant) C++17
100 / 100
 106 ms 4188 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, M, K, adj[105][105], B[105][1005], S[105][1005], m[105][105], adj2[105][105];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	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 <= N; i++)
		for (int j = 1; j <= N; j++) adj[i][j] = 1e16;
	for (int i = 1, V, W, T; i <= M; i++) {
		cin >> V >> W >> T;
		adj[V][W] = min(adj[V][W], T);
	}
	for (int k = 1; k <= N; k++)
		for (int i = 1; i <= N; i++)
			for (int j = 1; j <= N; j++)
				adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= N; j++)
			for (int k = 1; k <= K; k++)
				if (S[j][k] != -1 && B[i][k] != -1) m[i][j] = max(m[i][j], S[j][k] - B[i][k]);
	int lo = 1, hi = 1e9, ans = 0;
	while (lo <= hi) {
		int mid = (lo + hi) / 2;
		bool can = 0;
		for (int i = 1; i <= N; i++)
			for (int j = 1; j <= N; j++)
				adj2[i][j] = mid * min((int)1e16 / mid, adj[i][j]) - m[i][j];
		for (int k = 1; k <= N; k++)
			for (int i = 1; i <= N; i++)
				for (int j = 1; j <= N; j++)
					adj2[i][j] = min({(int)1e16, adj2[i][j], adj2[i][k] + adj2[k][j]});
		for (int i = 1; i <= N; i++)
			if (adj2[i][i] <= 0) can = 1;
		if (can) ans = mid, lo = mid + 1;
		else hi = mid - 1;
	}
	cout << ans << '\n';
}

Compilation message

merchant.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 2068 KB Output is correct
2 Correct 47 ms 1288 KB Output is correct
3 Correct 46 ms 1288 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 6 ms 824 KB Output is correct
6 Correct 7 ms 828 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 6 ms 724 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 6 ms 724 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 7 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 828 KB Output is correct
2 Correct 7 ms 896 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 7 ms 880 KB Output is correct
10 Correct 10 ms 852 KB Output is correct
11 Correct 8 ms 852 KB Output is correct
12 Correct 6 ms 904 KB Output is correct
13 Correct 7 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 6 ms 936 KB Output is correct
17 Correct 7 ms 872 KB Output is correct
18 Correct 7 ms 852 KB Output is correct
19 Correct 7 ms 852 KB Output is correct
20 Correct 9 ms 840 KB Output is correct
21 Correct 7 ms 852 KB Output is correct
22 Correct 9 ms 908 KB Output is correct
23 Correct 9 ms 852 KB Output is correct
24 Correct 7 ms 852 KB Output is correct
25 Correct 9 ms 856 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 7 ms 852 KB Output is correct
28 Correct 7 ms 856 KB Output is correct
29 Correct 7 ms 964 KB Output is correct
30 Correct 6 ms 884 KB Output is correct
31 Correct 6 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 856 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 7 ms 852 KB Output is correct
4 Correct 7 ms 856 KB Output is correct
5 Correct 7 ms 964 KB Output is correct
6 Correct 6 ms 884 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 47 ms 1492 KB Output is correct
9 Correct 106 ms 2112 KB Output is correct
10 Correct 59 ms 1500 KB Output is correct
11 Correct 53 ms 1868 KB Output is correct
12 Correct 47 ms 1764 KB Output is correct
13 Correct 44 ms 1520 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 880 KB Output is correct
2 Correct 10 ms 852 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 6 ms 904 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 6 ms 936 KB Output is correct
9 Correct 7 ms 872 KB Output is correct
10 Correct 7 ms 852 KB Output is correct
11 Correct 7 ms 852 KB Output is correct
12 Correct 9 ms 840 KB Output is correct
13 Correct 7 ms 852 KB Output is correct
14 Correct 9 ms 908 KB Output is correct
15 Correct 9 ms 852 KB Output is correct
16 Correct 7 ms 852 KB Output is correct
17 Correct 47 ms 1492 KB Output is correct
18 Correct 106 ms 2112 KB Output is correct
19 Correct 59 ms 1500 KB Output is correct
20 Correct 53 ms 1868 KB Output is correct
21 Correct 47 ms 1764 KB Output is correct
22 Correct 44 ms 1520 KB Output is correct
23 Correct 9 ms 856 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 7 ms 852 KB Output is correct
26 Correct 7 ms 856 KB Output is correct
27 Correct 7 ms 964 KB Output is correct
28 Correct 6 ms 884 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 81 ms 2068 KB Output is correct
31 Correct 47 ms 1288 KB Output is correct
32 Correct 46 ms 1288 KB Output is correct
33 Correct 6 ms 724 KB Output is correct
34 Correct 6 ms 824 KB Output is correct
35 Correct 7 ms 828 KB Output is correct
36 Correct 7 ms 896 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 6 ms 724 KB Output is correct
39 Correct 6 ms 724 KB Output is correct
40 Correct 6 ms 724 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 7 ms 852 KB Output is correct
43 Correct 45 ms 1412 KB Output is correct
44 Correct 50 ms 1616 KB Output is correct
45 Correct 68 ms 2520 KB Output is correct
46 Correct 46 ms 1608 KB Output is correct
47 Correct 45 ms 1632 KB Output is correct
48 Correct 49 ms 1740 KB Output is correct
49 Correct 105 ms 4088 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 42 ms 1396 KB Output is correct
53 Correct 45 ms 1508 KB Output is correct
54 Correct 44 ms 1364 KB Output is correct
55 Correct 43 ms 1364 KB Output is correct
56 Correct 45 ms 1364 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 11 ms 980 KB Output is correct
59 Correct 9 ms 980 KB Output is correct
60 Correct 8 ms 980 KB Output is correct
61 Correct 98 ms 4188 KB Output is correct
62 Correct 94 ms 4172 KB Output is correct
63 Correct 1 ms 340 KB Output is correct