oj.uz

Submission #406390

# Submission time Handle Problem Language Result Execution time Memory
406390 2021-05-17T14:12:09 Z wind_reaper Travelling Merchant (APIO17_merchant) C++17
100 / 100
 100 ms 2540 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;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

//***************** CONSTANTS *****************

const int64_t INF = 10'000'000'000'000'000;
const int DINF = 1'000'000'000;
const int MXN = 100;
const int MXK = 1000;

//***************** GLOBAL VARIABLES *****************

int N, M, K;

int64_t buy[MXN][MXK], sell[MXN][MXK], profit[MXN][MXN], dist[MXN][MXN];

//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

bool check(int x){
	int64_t adj[MXN][MXN];

	for(int u = 0; u < N; u++)
		for(int v = 0; v < N; v++)
			adj[u][v] = max(-INF, profit[u][v] - dist[u][v] * x);

	for(int k = 0; k < N; k++)
		for(int i = 0; i < N; i++)
			for(int j = 0; j < N; j++)
				adj[i][j] = max(adj[i][j], adj[i][k] + adj[k][j]);

	for(int i = 0; i < N; i++)
		if(adj[i][i] >= 0)
			return true;

	return false;
}

void solve(){
	cin >> N >> M >> K;

	for(int i = 0; i < N; i++)
		for(int j = 0; j < K; j++){
			cin >> buy[i][j] >> sell[i][j];
			if(buy[i][j] == -1) buy[i][j] = INF;
			if(sell[i][j] == -1) sell[i][j] = -INF;
		}

	for(int i = 0; i < N; i++)
		for(int j = 0; j < N; j++){
			profit[i][j] = 0;
			dist[i][j] = DINF;
		}

	for(int i = 0; i < M; i++){
		int u, v;
		cin >> u >> v;
		--u, --v;
		cin >> dist[u][v];
	}

	for(int k = 0; k < N; k++)
		for(int i = 0; i < N; i++)
			for(int j = 0; j < N; j++)
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);

	for(int i = 0; i < K; i++)
		for(int u = 0; u < N; u++)
			for(int v = 0; v < N; v++)
				profit[u][v] = max(profit[u][v], sell[v][i] - buy[u][i]);

	int l = 1, r = 1'000'000'000, ans = 0;

	while(l <= r){
		int mid = (l + r) >> 1;
		if(check(mid)){
			l = mid + 1;
			ans = mid;
		}
		else r = mid - 1;
	}

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve();

	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
    #endif

	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 2092 KB Output is correct
2 Correct 38 ms 1320 KB Output is correct
3 Correct 43 ms 1228 KB Output is correct
4 Correct 8 ms 844 KB Output is correct
5 Correct 6 ms 844 KB Output is correct
6 Correct 6 ms 844 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 8 ms 884 KB Output is correct
11 Correct 6 ms 844 KB Output is correct
12 Correct 1 ms 472 KB Output is correct
13 Correct 7 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 844 KB Output is correct
2 Correct 7 ms 844 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 844 KB Output is correct
5 Correct 8 ms 884 KB Output is correct
6 Correct 6 ms 844 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 7 ms 844 KB Output is correct
11 Correct 7 ms 852 KB Output is correct
12 Correct 8 ms 844 KB Output is correct
13 Correct 10 ms 844 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 7 ms 844 KB Output is correct
16 Correct 8 ms 844 KB Output is correct
17 Correct 7 ms 844 KB Output is correct
18 Correct 7 ms 844 KB Output is correct
19 Correct 8 ms 840 KB Output is correct
20 Correct 7 ms 844 KB Output is correct
21 Correct 7 ms 840 KB Output is correct
22 Correct 7 ms 844 KB Output is correct
23 Correct 8 ms 972 KB Output is correct
24 Correct 7 ms 844 KB Output is correct
25 Correct 7 ms 912 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 8 ms 844 KB Output is correct
28 Correct 9 ms 844 KB Output is correct
29 Correct 7 ms 916 KB Output is correct
30 Correct 9 ms 824 KB Output is correct
31 Correct 7 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 912 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 8 ms 844 KB Output is correct
4 Correct 9 ms 844 KB Output is correct
5 Correct 7 ms 916 KB Output is correct
6 Correct 9 ms 824 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 42 ms 1484 KB Output is correct
9 Correct 74 ms 2032 KB Output is correct
10 Correct 41 ms 1356 KB Output is correct
11 Correct 49 ms 1484 KB Output is correct
12 Correct 52 ms 1448 KB Output is correct
13 Correct 41 ms 1356 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 896 KB Output is correct
2 Correct 7 ms 844 KB Output is correct
3 Correct 7 ms 852 KB Output is correct
4 Correct 8 ms 844 KB Output is correct
5 Correct 10 ms 844 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 8 ms 844 KB Output is correct
9 Correct 7 ms 844 KB Output is correct
10 Correct 7 ms 844 KB Output is correct
11 Correct 8 ms 840 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 7 ms 840 KB Output is correct
14 Correct 7 ms 844 KB Output is correct
15 Correct 8 ms 972 KB Output is correct
16 Correct 7 ms 844 KB Output is correct
17 Correct 42 ms 1484 KB Output is correct
18 Correct 74 ms 2032 KB Output is correct
19 Correct 41 ms 1356 KB Output is correct
20 Correct 49 ms 1484 KB Output is correct
21 Correct 52 ms 1448 KB Output is correct
22 Correct 41 ms 1356 KB Output is correct
23 Correct 7 ms 912 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 8 ms 844 KB Output is correct
26 Correct 9 ms 844 KB Output is correct
27 Correct 7 ms 916 KB Output is correct
28 Correct 9 ms 824 KB Output is correct
29 Correct 7 ms 844 KB Output is correct
30 Correct 73 ms 2092 KB Output is correct
31 Correct 38 ms 1320 KB Output is correct
32 Correct 43 ms 1228 KB Output is correct
33 Correct 8 ms 844 KB Output is correct
34 Correct 6 ms 844 KB Output is correct
35 Correct 6 ms 844 KB Output is correct
36 Correct 7 ms 844 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 6 ms 844 KB Output is correct
39 Correct 8 ms 884 KB Output is correct
40 Correct 6 ms 844 KB Output is correct
41 Correct 1 ms 472 KB Output is correct
42 Correct 7 ms 844 KB Output is correct
43 Correct 39 ms 1356 KB Output is correct
44 Correct 42 ms 1484 KB Output is correct
45 Correct 75 ms 2528 KB Output is correct
46 Correct 46 ms 1532 KB Output is correct
47 Correct 42 ms 1484 KB Output is correct
48 Correct 43 ms 1500 KB Output is correct
49 Correct 77 ms 2540 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 39 ms 1356 KB Output is correct
53 Correct 46 ms 1456 KB Output is correct
54 Correct 40 ms 1356 KB Output is correct
55 Correct 50 ms 1356 KB Output is correct
56 Correct 40 ms 1356 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 8 ms 972 KB Output is correct
59 Correct 8 ms 972 KB Output is correct
60 Correct 8 ms 972 KB Output is correct
61 Correct 88 ms 2372 KB Output is correct
62 Correct 100 ms 2400 KB Output is correct
63 Correct 1 ms 332 KB Output is correct