제출 #413989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
413989		Return_0	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	97 ms	4164 KiB

merchant

#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 / 12
• Subtask 2: 21 / 21
• Subtask 3: 33 / 33
• Subtask 4: 34 / 34