oj.uz

Submission #413989

# Submission time Handle Problem Language Result Execution time Memory
413989 2021-05-29T18:27:03 Z Return_0 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 97 ms 4164 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#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;

typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 103, K = 1e3 + 3;

ll itm [N][K][2], tim [N][N], dist [N][N], pf [N][N], n, m, k;

void shrtstpth (ll dis [][N]) {
	for (ll p = 1; p <= n; p++) for (ll v = 1; v <= n; v++) for (ll u = 1; u <= n; u++)
		dis[v][u] = min(dis[v][u], dis[v][p] + dis[p][u]);
}

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

	memset(tim, 63, sizeof tim);

	cin>> n >> m >> k;
	for (ll i = 1; i <= n; i++) for (ll j = 1; j <= k; j++) cin>> itm[i][j][0] >> itm[i][j][1];

	for (ll v = 1; v <= n; v++) for (ll u = 1; u <= n; u++) for (ll i = 1; i <= k; i++) if (itm[v][i][0] != -1 && itm[u][i][1] != -1)
		pf[v][u] = max(pf[v][u], itm[u][i][1] - itm[v][i][0]);
	
	for (ll i = 0, v, u, w; i < m; i++) {
		cin>> v >> u >> w;
		tim[v][u] = w;
	}

	shrtstpth(tim);

	ll l = 0, r = mod;
	while (r - l > 1) {
		ll md = mid;
		for (ll v = 1; v <= n; v++) for (ll u = 1; u <= n; u++) {
			if (tim[v][u] > inf / md) dist[v][u] = inf;
			else dist[v][u] = tim[v][u] * md - pf[v][u];
		}
		shrtstpth(dist);
		bool fnd = false;
		for (ll v = 1; v <= n; v++) if (dist[v][v] <= 0) { fnd = true; break; }
		if (fnd) l = md;
		else r = md;
	}

	cout<< l << endl;

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1

*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3220 KB Output is correct
2 Correct 30 ms 844 KB Output is correct
3 Correct 31 ms 892 KB Output is correct
4 Correct 5 ms 588 KB Output is correct
5 Correct 5 ms 684 KB Output is correct
6 Correct 5 ms 664 KB Output is correct
7 Correct 6 ms 716 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 588 KB Output is correct
10 Correct 5 ms 588 KB Output is correct
11 Correct 5 ms 588 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 6 ms 716 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 664 KB Output is correct
2 Correct 6 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 588 KB Output is correct
5 Correct 5 ms 588 KB Output is correct
6 Correct 5 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 6 ms 716 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 6 ms 588 KB Output is correct
11 Correct 6 ms 716 KB Output is correct
12 Correct 5 ms 792 KB Output is correct
13 Correct 6 ms 716 KB Output is correct
14 Correct 1 ms 408 KB Output is correct
15 Correct 7 ms 716 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 5 ms 588 KB Output is correct
18 Correct 5 ms 716 KB Output is correct
19 Correct 6 ms 676 KB Output is correct
20 Correct 6 ms 716 KB Output is correct
21 Correct 6 ms 716 KB Output is correct
22 Correct 6 ms 716 KB Output is correct
23 Correct 7 ms 800 KB Output is correct
24 Correct 5 ms 588 KB Output is correct
25 Correct 6 ms 716 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 6 ms 716 KB Output is correct
28 Correct 6 ms 668 KB Output is correct
29 Correct 6 ms 716 KB Output is correct
30 Correct 6 ms 716 KB Output is correct
31 Correct 5 ms 588 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 716 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 6 ms 716 KB Output is correct
4 Correct 6 ms 668 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 5 ms 588 KB Output is correct
8 Correct 39 ms 1228 KB Output is correct
9 Correct 88 ms 3816 KB Output is correct
10 Correct 35 ms 1100 KB Output is correct
11 Correct 38 ms 1260 KB Output is correct
12 Correct 38 ms 1256 KB Output is correct
13 Correct 37 ms 1112 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 716 KB Output is correct
2 Correct 6 ms 588 KB Output is correct
3 Correct 6 ms 716 KB Output is correct
4 Correct 5 ms 792 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 1 ms 408 KB Output is correct
7 Correct 7 ms 716 KB Output is correct
8 Correct 6 ms 716 KB Output is correct
9 Correct 5 ms 588 KB Output is correct
10 Correct 5 ms 716 KB Output is correct
11 Correct 6 ms 676 KB Output is correct
12 Correct 6 ms 716 KB Output is correct
13 Correct 6 ms 716 KB Output is correct
14 Correct 6 ms 716 KB Output is correct
15 Correct 7 ms 800 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 39 ms 1228 KB Output is correct
18 Correct 88 ms 3816 KB Output is correct
19 Correct 35 ms 1100 KB Output is correct
20 Correct 38 ms 1260 KB Output is correct
21 Correct 38 ms 1256 KB Output is correct
22 Correct 37 ms 1112 KB Output is correct
23 Correct 6 ms 716 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 6 ms 716 KB Output is correct
26 Correct 6 ms 668 KB Output is correct
27 Correct 6 ms 716 KB Output is correct
28 Correct 6 ms 716 KB Output is correct
29 Correct 5 ms 588 KB Output is correct
30 Correct 59 ms 3220 KB Output is correct
31 Correct 30 ms 844 KB Output is correct
32 Correct 31 ms 892 KB Output is correct
33 Correct 5 ms 588 KB Output is correct
34 Correct 5 ms 684 KB Output is correct
35 Correct 5 ms 664 KB Output is correct
36 Correct 6 ms 716 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 6 ms 588 KB Output is correct
39 Correct 5 ms 588 KB Output is correct
40 Correct 5 ms 588 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 33 ms 1096 KB Output is correct
44 Correct 39 ms 1100 KB Output is correct
45 Correct 65 ms 2584 KB Output is correct
46 Correct 35 ms 1060 KB Output is correct
47 Correct 34 ms 1100 KB Output is correct
48 Correct 34 ms 1100 KB Output is correct
49 Correct 93 ms 4036 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 412 KB Output is correct
52 Correct 32 ms 844 KB Output is correct
53 Correct 34 ms 1088 KB Output is correct
54 Correct 33 ms 1092 KB Output is correct
55 Correct 32 ms 972 KB Output is correct
56 Correct 33 ms 844 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 7 ms 844 KB Output is correct
59 Correct 7 ms 844 KB Output is correct
60 Correct 7 ms 844 KB Output is correct
61 Correct 97 ms 4164 KB Output is correct
62 Correct 95 ms 4164 KB Output is correct
63 Correct 1 ms 412 KB Output is correct