제출 #957986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957986		steveonalex	여행하는 상인 (APIO17_merchant)	C++17	0 / 100	105 ms	3228 KiB

merchant

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

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
// mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 101, K = 1001;
const ll INF = 1e18 + 69;

int n, m, k;
pair<int, int> store[N][K];
ll graph[N][N], profit[N][N], ohio_dis[N][N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m >> k;
    for(int i= 1; i<=n; ++i){
        for(int j = 0; j<k; ++j) cin >> store[i][j].first >> store[i][j].second;
    }

    for(int i = 1; i<=n; ++i)
    for(int j = i + 1; j<=n; ++j) graph[i][j] = graph[j][i] = INF;

    for(int i = 0; i<m; ++i){
        int u, v, w; cin >> u >> v >> w;
        minimize(graph[u][v], w);
    }

    for(int k = 1; k<=n; ++k) for(int i = 1; i<=n; ++i) for(int j = 1; j<=n; ++j) minimize(graph[i][j], graph[i][k] + graph[k][j]);

    for(int i = 1; i<=n; ++i)
    for(int j = 1; j<=n; ++j) if (i != j){
        for(int t = 0; t < k; ++t) if (store[i][t].first != -1 && store[j][t].second != -1){
            maximize(profit[i][j], store[j][t].second - store[i][t].first);
        }
    }

    int l = 0, r = 1e9;
    while(l < r){
        int mid = (l + r + 1) >> 1;
        for(int i = 1; i<=n; ++i) for(int j = 1; j<=n; ++j) ohio_dis[i][j] = INF;

        for(int i = 1; i<=n; ++i)
        for(int j = 1; j<=n; ++j) if (i != j) minimize(ohio_dis[i][j], graph[i][j] * mid - profit[i][j]);

        for(int k = 1; k<=n; ++k) for(int i = 1; i<=n; ++i) for(int j = 1; j<=n; ++j) 
            minimize(ohio_dis[i][j], ohio_dis[i][k] + ohio_dis[k][j]);

        bool check = false;
        for(int i = 1; i<=n; ++i) if (ohio_dis[i][i] <= 0) check = true;
        if (check) l = mid;
        else r = mid - 1;
    }
    cout << l << "\n";

    return 0;
}

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