oj.uz

Submission #952085

# Submission time Handle Problem Language Result Execution time Memory
952085 2024-03-23T05:17:28 Z Matjaz Travelling Merchant (APIO17_merchant) C++14
0 / 100
 41 ms 1116 KB 
//
//  APIO17_MERCHANT.cpp
//  
//
//  Created by Matjaz Leonardis on 22/03/2024.
//

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int N,M,K;
int INF = (1<<29);

int main(){
    cin >> N >> M >> K;
    
    vector<vector<int> > B(N, vector<int> (K));
    vector<vector<int> > S(N, vector<int> (K));
    
    for (int i=0;i<N;i++){
        for (int j=0;j<K;j++) cin >> B[i][j] >> S[i][j];
    }
    
    vector<vector<long long> > dist(N, vector<long long>(N, INF));
    
    for (int i=0;i<M;i++){
        int V,W,T;
        cin >> V >> W >> T;
        dist[V - 1][W - 1] = T;
    }
    
    for (int k=0;k<N;k++){
        for (int i=0;i<N;i++){
            for (int j=0;j<N;j++) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
        }
    }
    
    long long best = 0;
    
    for (int i=1;i<N;i++){
        int max_profit = 0;
        for (int j=0;j<K;j++) if (B[0][j] < 0) continue; else max_profit = max(max_profit, S[i][j] - B[0][j]);
        
        best = max(best, max_profit / (dist[0][i] + dist[i][0]));
    }
    
    cout << best << endl;
    
    return 0;
}

/*vector<vector<pair<int,int> > > s(N, vector<pair<int,int> > ());

for (int i=0;i<M;i++){
    int V,W,T;
    cin >> V >> W >> T;
    s[V - 1].push_back(make_pair(W - 1, T));
} */

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1116 KB Output is correct
2 Incorrect 2 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -