oj.uz

Submission #200293

# Submission time Handle Problem Language Result Execution time Memory
200293 2020-02-06T08:54:50 Z dimash241 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 124 ms 4600 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")

# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 1e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;
#define int long long
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int b[152][1052];
int s[152][1052];
int dist[152][152];
int cost[152][152];
int nw[152];
vector < int > g[145];
int dp[152][152];

 main () {
   	SpeedForce;
	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 ++)
			dist[i][j] = inf;
	for (int i = 1; i <= m; i ++) {
		int x, y, z;
		cin >> x >> y >> z;
		dist[x][y] = z;
	}

	for (int k = 1; k <= n; k ++) {
		for (int i = 1; i <= n; i ++) {
			for (int j = 1; j <= n; j ++)
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
		}
	}

	for (int i = 1; i <= n; i ++) {
		for (int j = 1; j <= n; j ++) {
			for (int it = 1; it <= k; ++it) {
				if (s[j][it] != -1 && b[i][it] != -1)
					cost[i][j] = max(cost[i][j], s[j][it] - b[i][it]);
			}
		}
	}
	int l = 0, r = 1e9 + 1;
	while (l + 1 < r) {
		int md = (l + r) >> 1;

		for (int i = 1; i <= n; i ++) {
			for (int j = 1; j <= n; j ++) {
				dp[i][j] = cost[i][j] - dist[i][j] * (ll)md;
			}
		}

		for (int k = 1; k <= n; k++)
			for (int i = 1; i <= n; i ++) {
				for (int j = 1; j <= n; j ++) {
					dp[i][j] = max(dp[i][j], dp[i][k] + dp[k][j]);
				}
			}

		bool good = 0;
		for (int i = 1; i <= n; i ++)
			if(dp[i][i] >= 0) good = 1;
		if(good) l = md;
		else r = md;
	}

   	cout << l << '\n';

   	return Accepted;
}

// B...a

Compilation message

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

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 2304 KB Output is correct
2 Correct 46 ms 1528 KB Output is correct
3 Correct 45 ms 1400 KB Output is correct
4 Correct 10 ms 888 KB Output is correct
5 Correct 10 ms 888 KB Output is correct
6 Correct 10 ms 888 KB Output is correct
7 Correct 12 ms 888 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 10 ms 888 KB Output is correct
10 Correct 11 ms 888 KB Output is correct
11 Correct 11 ms 888 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 11 ms 1016 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1580 KB Output is correct
2 Correct 106 ms 4092 KB Output is correct
3 Correct 47 ms 1660 KB Output is correct
4 Correct 51 ms 1912 KB Output is correct
5 Correct 51 ms 1912 KB Output is correct
6 Correct 46 ms 1656 KB Output is correct
7 Correct 12 ms 1020 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 12 ms 1012 KB Output is correct
10 Correct 12 ms 1016 KB Output is correct
11 Correct 15 ms 1016 KB Output is correct
12 Correct 11 ms 1016 KB Output is correct
13 Correct 10 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 888 KB Output is correct
2 Correct 11 ms 888 KB Output is correct
3 Correct 11 ms 1016 KB Output is correct
4 Correct 10 ms 1016 KB Output is correct
5 Correct 11 ms 1020 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 11 ms 888 KB Output is correct
8 Correct 11 ms 1016 KB Output is correct
9 Correct 11 ms 888 KB Output is correct
10 Correct 11 ms 1016 KB Output is correct
11 Correct 11 ms 1016 KB Output is correct
12 Correct 12 ms 1016 KB Output is correct
13 Correct 12 ms 1016 KB Output is correct
14 Correct 11 ms 1016 KB Output is correct
15 Correct 13 ms 1016 KB Output is correct
16 Correct 10 ms 888 KB Output is correct
17 Correct 50 ms 1580 KB Output is correct
18 Correct 106 ms 4092 KB Output is correct
19 Correct 47 ms 1660 KB Output is correct
20 Correct 51 ms 1912 KB Output is correct
21 Correct 51 ms 1912 KB Output is correct
22 Correct 46 ms 1656 KB Output is correct
23 Correct 12 ms 1020 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 12 ms 1012 KB Output is correct
26 Correct 12 ms 1016 KB Output is correct
27 Correct 15 ms 1016 KB Output is correct
28 Correct 11 ms 1016 KB Output is correct
29 Correct 10 ms 888 KB Output is correct
30 Correct 46 ms 1528 KB Output is correct
31 Correct 48 ms 1784 KB Output is correct
32 Correct 65 ms 2808 KB Output is correct
33 Correct 48 ms 1788 KB Output is correct
34 Correct 47 ms 1784 KB Output is correct
35 Correct 49 ms 1784 KB Output is correct
36 Correct 124 ms 4344 KB Output is correct
37 Correct 5 ms 504 KB Output is correct
38 Correct 5 ms 504 KB Output is correct
39 Correct 46 ms 1532 KB Output is correct
40 Correct 47 ms 1528 KB Output is correct
41 Correct 45 ms 1656 KB Output is correct
42 Correct 47 ms 1532 KB Output is correct
43 Correct 47 ms 1528 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 13 ms 1144 KB Output is correct
46 Correct 13 ms 1144 KB Output is correct
47 Correct 13 ms 1144 KB Output is correct
48 Correct 115 ms 4600 KB Output is correct
49 Correct 112 ms 4472 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 71 ms 2304 KB Output is correct
52 Correct 46 ms 1528 KB Output is correct
53 Correct 45 ms 1400 KB Output is correct
54 Correct 10 ms 888 KB Output is correct
55 Correct 10 ms 888 KB Output is correct
56 Correct 10 ms 888 KB Output is correct
57 Correct 12 ms 888 KB Output is correct
58 Correct 5 ms 380 KB Output is correct
59 Correct 10 ms 888 KB Output is correct
60 Correct 11 ms 888 KB Output is correct
61 Correct 11 ms 888 KB Output is correct
62 Correct 5 ms 504 KB Output is correct
63 Correct 11 ms 1016 KB Output is correct