제출 #869807

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
869807		gutzzy	여행하는 상인 (APIO17_merchant)	C++14	0 / 100	41 ms	1116 KiB

merchant

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

vector<vector<pair<int,int>>> items;
vector<vector<pair<int,int>>> lst;
vector<int> visited;
vector<pair<vector<int>,int>> ans;
vector<vector<int>> dist;
int n;

void dfs(int nodo, vector<int> cur, int d){
    visited[nodo] += 1;
    for(auto vecino:lst[nodo]){
        if(vecino.first==0){
            d += vecino.second;
            ans.push_back({cur,d});
            //for(auto a:cur) cout << a << " ";
            //cout << endl;
            //cout << "d: " << d << endl;
            return;
        }
        if(visited[vecino.first]>n-1) continue;
        cur.push_back(vecino.first);
        dfs(vecino.first, cur, d+vecino.second);
        cur.pop_back();
    }
    
}

void fw(){
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<n;k++){
                if(dist[i][j] > dist[i][k]+dist[k][j] and dist[i][k]!=1e9 and dist[k][j]!=1e9){
                    dist[i][j] = dist[i][k]+dist[k][j];
                }
            }
        }
    }
}

int main(){
    int m,k,v,w,t;
    cin >> n >> m >> k;
    // items --> vector[market][item][0-->buy / 1-->sell]
    items = vector<vector<pair<int,int>>>(n,vector<pair<int,int>>(k));
    lst = vector<vector<pair<int,int>>>(m,vector<pair<int,int>>());
    dist = vector<vector<int>>(n,vector<int>(n,1e9));
    
    for(int i=0;i<n;i++) dist[i][i]=0;
    
    for(int i=0;i<n;i++){
        for(int j=0;j<k;j++){
            cin >> items[i][j].first >> items[i][j].second;
        }
    }
    for(int i=0;i<m;i++){
        cin >> v >> w >> t;
        lst[v-1].push_back({w-1,t});
        dist[v-1][w-1]=t;
    }
    
    // busco cíclos

    fw();
    
    int res = 0;
    
    for(int i=1;i<n;i++){
        for(int j=0;j<k;j++){
            if(items[0][j].first==-1) continue;
            if(items[i][j].second==-1) continue;
            res = max(res, (items[i][j].second-items[0][j].first)/(dist[0][i]+dist[i][0]));
        }
    }
    cout << res << endl;
}

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