Submission #774564

#	Time	Username	Problem	Language	Result	Execution time	Memory
774564		MarwenElarbi	여행하는 상인 (APIO17_merchant)	C++17	12 / 100	24 ms	1876 KiB

merchant

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+7;
const int nax = 2e5+5;
const int MAX_VAL = 1e6;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
long long dp[100][100];
int main(){
    optimise;
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif*/
    //setIO("redistricting");
    int n,m,q;
    cin>>n>>m>>q;
    pair<ll,ll> tab[n][q];
    bool test=true;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < q; ++j)
        { 
            cin>>tab[i][j].fi>>tab[i][j].se;
            if (i) 
                if(tab[i][j].fi!=-1) test=false;
        }
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            dp[i][j]=1e15;
        }
    }
    for (int i = 0; i < m; ++i)
    {
        int x,y,z;
        cin>>x>>y>>z;
        x--;y--;
        dp[x][y]=z;
    }
    for (int k = 0; k < n; ++k)
    {
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < n; ++j)
            {
                dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
            }
        }
    }//cout <<test<<endl;
    if (test)
    {
        long long ans=0;
        for (int i = 1; i < n; ++i)
        {
            for (int j = 0; j < q; ++j)
            {
                if (tab[i][j].se==-1||tab[0][j].fi==-1||dp[0][i]>1e10||dp[i][0]>1e10) continue;
                //cout <<ans<<endl;
                ans=max(ans,(tab[i][j].se-tab[0][j].fi)/(dp[0][i]+dp[i][0]));
            }
        }cout <<ans<<endl;
        return 0;
    }
    pair<ll,ll> cost[n][n];
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            cost[i][j].fi=0;
            cost[i][j].se=dp[i][j];
            if (dp[i][j]>1e10) continue;
            for (int k = 0;k < q; ++k)
            {
                if (tab[i][k].fi==-1||tab[j][k].se==-1) continue;
                cost[i][j].fi=max(max(1ll*0,cost[i][j].fi),tab[j][k].se-tab[i][k].fi);
            }
        }
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            cout<<cost[i][j].fi<<" ";
        }cout <<endl;
    }
    long long ans=0;
    for (int k = 0; k < n; ++k)
    {
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < n; ++j)
            {
                if (cost[i][j].fi<-1e10||cost[k][j].fi<-1e10||cost[i][k].fi<-1e10) continue;
                if (cost[i][j].fi/cost[i][j].se<(cost[i][k].fi+cost[k][j].fi)/(cost[i][k].se+cost[k][j].se)){
                    cost[i][j].fi=cost[i][k].fi+cost[k][j].fi;
                    cost[i][j].se=cost[i][k].se+cost[k][j].se;
                }
            }
        }
    }
    for (int k = 0; k < n; ++k)
    {
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < n; ++j)
            {
                if (cost[i][j].fi<-1e10||cost[j][i].fi<-1e10) continue;
                ans=max(ans,(cost[i][j].fi+cost[j][i].fi)/(cost[i][j].se+cost[j][i].se));
            }
        }
    }
    cout << ans<<endl;

    
}

Compilation message (stderr)

merchant.cpp: In function 'void setIO(std::string)':
merchant.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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