oj.uz

Submission #266825

# Submission time Handle Problem Language Result Execution time Memory
266825 2020-08-15T13:13:32 Z hanagasumi Travelling Merchant (APIO17_merchant) C++17
100 / 100
 139 ms 4344 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>

#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
#define int ll
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef long double ld;

int inf = 1e18 + 100;
int infs = 1e9 + 100;

int n, m, k;
vector<vector<int>> cst;
vector<vector<int>> s;
vector<vector<int>> b;
vector<vector<int>> dst;
vector<vector<int>> dst0;
vector<vector<int>> dp;


vector<vector<pair<int, int>>> g;

bool solve(int x) {
	vector<vector<int>> dstn(n, vector<int> (n, -inf));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if(dst[i][j] == inf)
				continue;
			dstn[i][j] = max(dstn[i][j], cst[i][j] - x * dst[i][j]);
		}
	}
	for (int md = 0; md < n; md++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if(dstn[i][md] == -inf || dstn[md][j] == -inf)
					continue;
				dstn[i][j] = max(dstn[i][j], dstn[i][md] + dstn[md][j]);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		if(dstn[i][i] >= 0) 
			return 1;
	}
	return 0;
}


signed main() {
	#ifdef PC
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);


	cin >> n >> m >> k;
	cst = vector<vector<int>> (n, vector<int> (n, 0));
	dst = vector<vector<int>> (n, vector<int> (n, inf));	
	dst0 = vector<vector<int>> (n, vector<int> (n, inf));
	s = vector<vector<int>> (n, vector<int> (k, 0));
	b = vector<vector<int>> (n, vector<int> (k, 0));

	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 a, b, w;
		cin >> a >> b >> w;
		a--, b--;
		dst[a][b] = min(dst[a][b], w);
	}
	for (int md = 0; md < n; md++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if(dst[i][md] < inf && dst[md][j] < inf) 
					dst[i][j] = min(dst[i][j], dst[i][md] + dst[md][j]);
			}
		}
	}


	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			dst0[j][i] = dst[i][j];
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			for (int z = 0; z < k; z++) {
				if(b[i][z] == -1 || s[j][z] == -1) 
					continue;
				cst[i][j] = max(cst[i][j], s[j][z] - b[i][z]);
			}
		}
	}

	int l = 0, r = infs;
	while(r - l > 1) {
		int mid = (l + r) / 2;
		if(solve(mid)) 
			l = mid;
		else
			r = mid;
	}
	cout << l << endl;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 2176 KB Output is correct
2 Correct 64 ms 640 KB Output is correct
3 Correct 74 ms 640 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 9 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 10 ms 384 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 7 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 9 ms 512 KB Output is correct
4 Correct 14 ms 512 KB Output is correct
5 Correct 13 ms 512 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 10 ms 384 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 10 ms 384 KB Output is correct
14 Correct 9 ms 512 KB Output is correct
15 Correct 17 ms 512 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 14 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 15 ms 512 KB Output is correct
20 Correct 12 ms 512 KB Output is correct
21 Correct 10 ms 512 KB Output is correct
22 Correct 9 ms 384 KB Output is correct
23 Correct 10 ms 384 KB Output is correct
24 Correct 8 ms 384 KB Output is correct
25 Correct 9 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 10 ms 384 KB Output is correct
29 Correct 9 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 7 ms 512 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 880 KB Output is correct
2 Correct 136 ms 3832 KB Output is correct
3 Correct 64 ms 768 KB Output is correct
4 Correct 101 ms 1024 KB Output is correct
5 Correct 66 ms 1024 KB Output is correct
6 Correct 71 ms 888 KB Output is correct
7 Correct 14 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 15 ms 512 KB Output is correct
10 Correct 12 ms 512 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 9 ms 384 KB Output is correct
13 Correct 10 ms 384 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 9 ms 512 KB Output is correct
4 Correct 14 ms 512 KB Output is correct
5 Correct 13 ms 512 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 10 ms 384 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 10 ms 384 KB Output is correct
14 Correct 9 ms 512 KB Output is correct
15 Correct 17 ms 512 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 67 ms 880 KB Output is correct
18 Correct 136 ms 3832 KB Output is correct
19 Correct 64 ms 768 KB Output is correct
20 Correct 101 ms 1024 KB Output is correct
21 Correct 66 ms 1024 KB Output is correct
22 Correct 71 ms 888 KB Output is correct
23 Correct 14 ms 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 15 ms 512 KB Output is correct
26 Correct 12 ms 512 KB Output is correct
27 Correct 10 ms 512 KB Output is correct
28 Correct 9 ms 384 KB Output is correct
29 Correct 10 ms 384 KB Output is correct
30 Correct 73 ms 768 KB Output is correct
31 Correct 74 ms 896 KB Output is correct
32 Correct 80 ms 2424 KB Output is correct
33 Correct 60 ms 896 KB Output is correct
34 Correct 67 ms 956 KB Output is correct
35 Correct 68 ms 896 KB Output is correct
36 Correct 136 ms 4216 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 61 ms 640 KB Output is correct
40 Correct 61 ms 768 KB Output is correct
41 Correct 47 ms 768 KB Output is correct
42 Correct 65 ms 768 KB Output is correct
43 Correct 59 ms 640 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 10 ms 640 KB Output is correct
46 Correct 9 ms 640 KB Output is correct
47 Correct 10 ms 640 KB Output is correct
48 Correct 139 ms 4344 KB Output is correct
49 Correct 138 ms 4224 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 97 ms 2176 KB Output is correct
52 Correct 64 ms 640 KB Output is correct
53 Correct 74 ms 640 KB Output is correct
54 Correct 9 ms 384 KB Output is correct
55 Correct 9 ms 384 KB Output is correct
56 Correct 8 ms 384 KB Output is correct
57 Correct 9 ms 512 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 8 ms 384 KB Output is correct
60 Correct 10 ms 384 KB Output is correct
61 Correct 9 ms 384 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 7 ms 512 KB Output is correct