oj.uz

Submission #119006

# Submission time Handle Problem Language Result Execution time Memory
119006 2019-06-20T07:23:16 Z MAMBA Travelling Merchant (APIO17_merchant) C++17
100 / 100
 154 ms 2784 KB 
#include <bits/stdc++.h>

using namespace std;

inline void fileIO(string s) {
	freopen((s + ".in").c_str(), "r", stdin);
	freopen((s + ".out").c_str(), "w", stdout);
}

inline void read() {}
template <class S>
inline void read(S &arg) {
	cin >> arg;
}
template <class S>
inline void readA(S Lptr, S Rptr) {
	while (Lptr != Rptr) {
		read(*Lptr);
		Lptr++;
	}
}
template <class S, class... T>
inline void read(S &arg, T &... rest) {
	read(arg);
	read(rest...);
}

inline void write() {}
template <class S>
inline void write(S arg) {
	cout << arg;
}
template <class S>
inline void writeA(S Lptr, S Rptr, char del = ' ') {
	if (Lptr != Rptr) {
		write(*Lptr);
		Lptr++;
	}
	while (Lptr != Rptr) {
		write(del);
		write(*Lptr);
		Lptr++;
	}
}
template <class S, class... T>
inline void write(S arg, T... rest) {
	write(arg);
	write(' ');
	write(rest...);
}

#define rep(i, j, k) for (int i = j; i < (int)k; i++)
#define pb push_back
#define mt make_tuple
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

template <class T, class S>
inline bool smin(T &a, S b) {
	return (T)b < a ? a = b, 1 : 0;
}
template <class T, class S>
inline bool smax(T &a, S b) {
	return a < (T)b ? a = b, 1 : 0;
}

constexpr int MOD = 1e9 + 7;
constexpr int N = 110;
constexpr int K = 1010;

template <typename T>
inline T mod(T &v) {
	return v = (v % MOD + MOD) % MOD;
}
template <typename S, typename T>
inline S add(S &l, T r) {
	return mod(l += r);
}

ll po(ll v, ll u) {
	return u ? po(v * v % MOD, u >> 1) * (u & 1 ? v : 1) % MOD : 1;
}

int n , m , k;
ll B[N][K];
ll S[N][K];
ll mat[N][N];
ll dist[N][N];
ll d[N][N];


int32_t main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	memset(dist, 63 , sizeof(dist));
	read(n , m, k);

	rep(i , 0 , n) {
		dist[i][i] = 0;
		rep(j , 0 , k)
			read(B[i][j] , S[i][j]);
	}

	rep(i , 0 , m) {
		int u , v , w;
		read(u , v , w);
		u--, v--;
		smin(dist[u][v] , w);
	}

	rep(z , 0 , n) 
		rep(i , 0 , n)
		rep(j , 0 , n)
		smin(dist[i][j] , dist[i][z] + dist[z][j]);

	rep(i , 0 , n) {
		rep(j , 0 , n)
			rep(z , 0 , k)
			if (~B[i][z] && ~S[j][z])
				smax(mat[i][j] , S[j][z] - B[i][z]);
	}


	auto f = [](int limit) -> bool {

		memset(d , 63 , sizeof(d));

		rep(i , 0 , n)
			rep(j , 0 , n)
			if (dist[i][j] != dist[N - 1][N - 1]) 
				d[i][j] = dist[i][j] * limit - mat[i][j];


		rep(z , 0 , n)
			rep(i , 0 , n)
			rep(j , 0 , n)
				if (d[i][z] != d[N- 1][N - 1] &&
					d[z][j] != d[N - 1][N - 1] && i != j)
				smin(d[i][j] , d[i][z] + d[z][j]);

		rep(i , 0 , n)
			rep(j , 0 , n)
			if (i != j && max(d[i][j] , d[j][i]) < d[N - 1][N - 1] && d[i][j] + d[j][i] <= 0)
				return true;
		return false;

	};


	int lo = 0, hi = 2e9 + 10;
	while (lo != hi - 1) {
		int mid = lo + hi >> 1;
		if (f(mid))
			lo = mid;
		else
			hi = mid;
	}
	write(lo);

	return 0;
}

Compilation message

merchant.cpp: In function 'int32_t main()':
merchant.cpp:157:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = lo + hi >> 1;
             ~~~^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 2168 KB Output is correct
2 Correct 43 ms 1280 KB Output is correct
3 Correct 47 ms 1408 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 9 ms 1024 KB Output is correct
7 Correct 11 ms 1024 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 9 ms 1024 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 8 ms 1024 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 1572 KB Output is correct
2 Correct 154 ms 2544 KB Output is correct
3 Correct 90 ms 1536 KB Output is correct
4 Correct 119 ms 1792 KB Output is correct
5 Correct 106 ms 1792 KB Output is correct
6 Correct 58 ms 1536 KB Output is correct
7 Correct 18 ms 1028 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 18 ms 1024 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 10 ms 1024 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1024 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 10 ms 1024 KB Output is correct
4 Correct 8 ms 1024 KB Output is correct
5 Correct 27 ms 1024 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 10 ms 1024 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 8 ms 1024 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 9 ms 1024 KB Output is correct
14 Correct 11 ms 1024 KB Output is correct
15 Correct 12 ms 1024 KB Output is correct
16 Correct 9 ms 1024 KB Output is correct
17 Correct 108 ms 1572 KB Output is correct
18 Correct 154 ms 2544 KB Output is correct
19 Correct 90 ms 1536 KB Output is correct
20 Correct 119 ms 1792 KB Output is correct
21 Correct 106 ms 1792 KB Output is correct
22 Correct 58 ms 1536 KB Output is correct
23 Correct 18 ms 1028 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 18 ms 1024 KB Output is correct
26 Correct 13 ms 1024 KB Output is correct
27 Correct 11 ms 1024 KB Output is correct
28 Correct 10 ms 1024 KB Output is correct
29 Correct 10 ms 1024 KB Output is correct
30 Correct 52 ms 1528 KB Output is correct
31 Correct 52 ms 1536 KB Output is correct
32 Correct 64 ms 2680 KB Output is correct
33 Correct 48 ms 1664 KB Output is correct
34 Correct 48 ms 1536 KB Output is correct
35 Correct 48 ms 1740 KB Output is correct
36 Correct 108 ms 2784 KB Output is correct
37 Correct 2 ms 640 KB Output is correct
38 Correct 2 ms 640 KB Output is correct
39 Correct 47 ms 1436 KB Output is correct
40 Correct 46 ms 1536 KB Output is correct
41 Correct 44 ms 1528 KB Output is correct
42 Correct 47 ms 1408 KB Output is correct
43 Correct 46 ms 1408 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 11 ms 1152 KB Output is correct
46 Correct 11 ms 1188 KB Output is correct
47 Correct 11 ms 1152 KB Output is correct
48 Correct 87 ms 2684 KB Output is correct
49 Correct 87 ms 2680 KB Output is correct
50 Correct 2 ms 512 KB Output is correct
51 Correct 68 ms 2168 KB Output is correct
52 Correct 43 ms 1280 KB Output is correct
53 Correct 47 ms 1408 KB Output is correct
54 Correct 9 ms 896 KB Output is correct
55 Correct 9 ms 896 KB Output is correct
56 Correct 9 ms 1024 KB Output is correct
57 Correct 11 ms 1024 KB Output is correct
58 Correct 2 ms 512 KB Output is correct
59 Correct 9 ms 1024 KB Output is correct
60 Correct 9 ms 896 KB Output is correct
61 Correct 9 ms 896 KB Output is correct
62 Correct 2 ms 640 KB Output is correct
63 Correct 8 ms 1024 KB Output is correct