제출 #320673

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
320673		CSQ31	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	171 ms	4196 KiB

merchant

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
VII dist(101,vector<ll>(101,INF));
VII profit(101,vector<ll>(101,0)),s(101,vector<ll>(1001,0)),b(101,vector<ll>(1001,0));
int n,m,x;
void ford(VII &adj){
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int k=1;k<=n;k++){
				adj[j][k] = min(adj[j][k],adj[j][i]+adj[i][k]);
			}
		}
	}
	
}
int main()
{
	owo
	cin>>n>>m>>x;
	for(int i=1;i<=n;i++){
		for(int j=0;j<x;j++){
			cin>>b[i][j]>>s[i][j];
		}
		
	}
	for(int i=0;i<m;i++){
		int v,u,t;
		cin>>v>>u>>t;
		dist[v][u] = t;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int k=1;k<=n;k++){
				dist[j][k] = min(dist[j][k],dist[j][i]+dist[i][k]);
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int k=0;k<x;k++){
				if(s[j][k] != -1 && b[i][k] != -1)
				profit[i][j] = max(profit[i][j],s[j][k]-b[i][k]);
			}	
		}
	}
	VII adj(n+1,vector<ll>(n+1,0));
	ll l=1,r=1e9;
	while(r>=l){
		ll mid = (r+l)/2;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
			   adj[i][j] = mid*min(dist[i][j],INF/mid)-profit[i][j];
			}
		}
		ford(adj);
		bool ok = 0;
		for(int i=1;i<=n;i++)if(adj[i][i] <= 0)ok = 1;
		if(ok)l = mid+1;
		else r = mid-1;
	}
	cout<<r;
}

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