Submission #775632

#	Time	Username	Problem	Language	Result	Execution time	Memory
775632		gagik_2007	Travelling Merchant (APIO17_merchant)	C++17	0 / 100	13 ms	596 KiB

merchant

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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define ff first
#define ss second

ll ttt;
const ll INF=1e18;
const ll MOD=1e9+7;
const ll N=107;
const ll K=1007;
ll n,m,k;
vector<int>g[N];
ll b[K][N],s[K][N];
ll maxval[N];
ll dist[N][N];

void floyd_warshall(){
    for(int p=1;p<=n;p++){
        for(int v=1;v<=n;v++){
            for(int u=1;u<=n;u++){
                dist[v][u]=min(dist[v][u],dist[v][p]+dist[p][u]);
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // freopen("output.txt","w",stdout);
    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 v=1;v<=n;v++){
        for(int u=1;u<=n;u++){
            dist[v][u]=MOD;
            if(v==u)dist[v][u]=0;
        }
    }
    for(int i=0;i<m;i++){
        int x,y,t;
        cin>>x>>y>>t;
        g[x].push_back(y);
        dist[x][y]=min(dist[x][y],(ll)t);
    }
    floyd_warshall();
    // for(int v=1;v<=n;v++){
    //     for(int u=1;u<=n;u++){
    //         cout<<v<<", "<<u<<": "<<dist[v][u]<<endl;
    //     }
    // }
    ll ans=0;
    for(int i=1;i<=k;i++){
        for(int v=2;v<=n;v++){
            maxval[i]=max(maxval[i],(s[v][i]-b[1][i])/(dist[1][v]+dist[v][1]));
        }
        ans=max(ans,maxval[i]);
    }
    cout<<ans<<endl;
}

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