제출 #1260099

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1260099		kamrad	여행하는 상인 (APIO17_merchant)	C++20	0 / 100	57 ms	2112 KiB

merchant

#include <bits/stdc++.h>
using namespace std;

//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")

using ll  = long long;
using ld  = long double;
using pii = pair<ll, ll>;
using pll = pair<ll, ll>;
using pi3 = pair<pii, ll>;

#define IOS               ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define F                 first
#define S                 second
#define sz(x)             x.size()
#define all(x)            x.begin(), x.end()
#define pb                push_back
#define minr(a, b)        a = min(a, b);
#define maxr(a, b)        a = max(a, b);
#define shit              cout << "shit\n" << flush;
#define tl                while(1&1) continue;
#define rand(l, r)        uniform_ll_distribution<ll64_t>(l,r)(rng)
random_device device;     default_random_engine rng(device());

const ll Mod    = 1e9 + 7; //998244353;
const ll LG     = 64;
const ll SQ     = 500;
const ll  Inf    = 2e15 + 10;
const ll maxN   = 1e2 + 10;
const ll maxK   = 1e3 + 10;

ll n, m, k;

ll b[maxN][maxK];
ll s[maxN][maxK];
ll p[maxN][maxN];
ll e[maxN][maxN];
ll dist[maxN][maxN];

bool check(ll x) {
	for(ll i = 1; i <= n; i++)
		for(ll j = 1; j <= n; j++)
			e[i][j] = Inf;
	for(ll i = 1; i <= n; i++)
		for(ll j = 1; j <= n; j++)
			if(i != j)
				minr(e[i][j], x*dist[i][j]-p[i][j]);

	for(ll k = 1; k <= n; k++)
		for(ll i = 1; i <= n; i++)
			for(ll j = 1; j <= n; j++)
				minr(e[i][j], e[i][k]+e[k][j]);
	for(ll i = 1; i <= n; i++)
		if(e[i][i] <= 0)
			return true;
	return false;
}

int main() {
	IOS;
	
	cin >> n >> m >> k;

	for(ll i = 1; i <= n; i++)
		for(ll j = 1; j <= k; j++)
			cin >> b[i][j] >> s[i][j];

	for(ll i = 0; i < maxN; i++)
		for(ll j = 0; j < maxN; j++)
			if(i != j)
				dist[i][j] = Inf;
	for(ll i = 1; i <= m; i++) {
		ll u, v, t;
		cin >> u >> v >> t;
		dist[u][v] = t;
	}

	for(ll k = 1; k <= n; k++)
		for(ll i = 1; i <= n; i++)
			for(ll j = 1; j <= n; j++)
				minr(dist[i][j], dist[i][k]+dist[k][j]);

	for(ll i = 1; i <= n; i++)
		for(ll j = 1; j <= n; j++)
			for(ll x = 1; x <= k; x++)
				if(b[i][x] != -1 and s[j][x] != -1)
					maxr(p[i][j], s[j][x]-b[i][x]);
	
	ll l = 0;
	ll r = 1e18;
	while(l+1 < r) {
		ll mid = (l+r)>>1;
		if(check(mid))
			l = mid;
		else
			r = mid;
	}
	cout << l;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 21
• Subtask 3: 0 / 33
• Subtask 4: 0 / 34