Submission #392242

#	Time	Username	Problem	Language	Result	Execution time	Memory
392242		MarcoMeijer	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	104 ms	5368 KiB

merchant

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1010;
const int N = (1<<20);

int n, m, k;
ll B[MX][MX], S[MX][MX];
ll dist[MX][MX];
ll profit[MX][MX];
ll dist2[MX][MX];

bool possible(ll w) {
    RE(u,n) RE(v,n) dist2[u][v] = max<ll>(-1e18, profit[u][v] - dist[u][v]*w);
    RE(u,n) dist2[u][u] = -1e18;
    RE(i,n) RE(u,n) RE(v,n) dist2[u][v] = max(dist2[u][v], dist2[u][i] + dist2[i][v]);
    RE(u,n) if(dist2[u][u] >= 0) return true;
    return false;
}

void program() {
    IN(n,m,k);

    // fill profit
    RE(i,n) RE(j,k) IN(B[i][j], S[i][j]);
    RE(u,n) RE(v,n) profit[u][v] = 0;
    RE(u,n) RE(v,n) RE(i,k) if(S[v][i] != -1 && B[u][i] != -1) profit[u][v] = max(profit[u][v], S[v][i] - B[u][i]);
    
    // fill dist
    RE(i,n) RE(j,n) dist[i][j] = INF;
    RE(i,n) dist[i][i] = 0;
    RE(i,m) {
        ll u, v, w; IN(u,v,w); u--; v--;
        dist[u][v] = w;
    }
    RE(i,n) RE(u,n) RE(v,n) dist[u][v] = min(dist[u][v], dist[u][i] + dist[i][v]);

    // binary search
    ll lb=0, ub=0;
    RE(u,n) RE(v,n) ub = max(ub, profit[u][v]);
    while(lb != ub) {
        ll mid=(lb+ub+1)/2;
        if(possible(mid)) lb=mid;
        else ub=mid-1;
    }
    OUTL(lb);
}

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