# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200598 | Rakhmand | Travelling Merchant (APIO17_merchant) | C++14 | 92 ms | 4600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)
const int MXN = 1e5 + 10;
const long long MNN = 1e6 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e16;
const int OO = 1e9 + 10;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
void istxt(bool yes){
if(yes == 1){
freopen("balancing.in", "r", stdin);
freopen("balancing.out", "w", stdout);
}else{
freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/input.txt", "r", stdin);
}
}
int n, m, k;
llong b[110][1100], s[110][1100], ans[110][110], u[MXN], v[MXN], cost[MXN], dp[110][110];
llong g[110][110];
llong mx[110][110];
bool check(llong ans){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(g[i][j] == INF){
dp[i][j] = INF;
}else{
dp[i][j] = g[i][j] * ans - mx[i][j];
}
}
dp[i][i] = INF;
}
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
}
for(int i = 1; i <= n; i++){
if(dp[i][i] <= 0){
return true;
}
}
return false;
}
int main () {
ios;
//istxt(0);
cin >> n >> m >> k;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= k; j++){
cin >> b[i][j] >> s[i][j];
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
g[i][j] = INF;
}
g[i][i] = 0;
}
for(int i = 1; i <= m; i++){
cin >> u[i] >> v[i] >> cost[i];
g[u[i]][v[i]] = cost[i];
}
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= k; j++){
if(b[i][j] != -1){
for(int nx = 1; nx <= n; nx++){
if(s[nx][j] != -1){
mx[i][nx] = max(mx[i][nx], s[nx][j] - b[i][j]);
}
}
}
}
}
llong l = 0, r = 1e9;
while(r - l > 1){
llong m = (r + l) / 2;
if(check(m)){
l = m;
}else{
r = m;
}
}
cout << (check(r) ? r : l);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |