제출 #100438

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
100438		square1001	여행하는 상인 (APIO17_merchant)	C++14	0 / 100	1068 ms	2936 KiB

merchant

#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
int main() {
	int N, M, K;
	cin >> N >> M >> K;
	vector<vector<int> > B(N, vector<int>(K)), S(N, vector<int>(K));
	for(int i = 0; i < N; ++i) {
		for(int j = 0; j < K; ++j) {
			cin >> B[i][j] >> S[i][j];
		}
	}
	vector<vector<int> > D(N, vector<int>(N, inf));
	for(int i = 0; i < N; ++i) D[i][i] = 0;
	for(int i = 0; i < M; ++i) {
		int V, W, T;
		cin >> V >> W >> T; --V, --W;
		D[V][W] = T;
	}
	for(int i = 0; i < N; ++i) {
		for(int j = 0; j < N; ++j) {
			for(int k = 0; k < N; ++k) {
				D[j][k] = min(D[j][k], D[j][i] + D[i][k]);
			}
		}
	}
	double L = 0, R = inf;
	for(int rep = 0; rep < 60; ++rep) {
		double M = (L + R) * 0.5;
		vector<vector<double> > C(N, vector<double>(N, 1.0e+99));
		for(int i = 0; i < N; ++i) {
			C[i][i] = 0;
			for(int j = 0; j < N; ++j) {
				for(int k = 0; k < K; ++k) {
					if(S[j][k] != -1 && B[i][k] != -1) {
						C[i][j] = min(C[i][j], (long long)(D[i][j]) * M - (S[j][k] - B[i][k]));
					}
				}
			}
		}
		for(int i = 0; i < N; ++i) {
			for(int j = 0; j < N; ++j) {
				for(int k = 0; k < N; ++k) {
					C[j][k] = min(C[j][k], C[j][i] + C[i][k]);
				}
			}
		}
		bool ok = true;
		for(int i = 0; i < N; ++i) {
			if(C[i][i] < 0) ok = false;
		}
		if(ok) R = M;
		else L = M;
	}
	cout << int(L) << endl;
	return 0;
}

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