Submission #750328

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
750328	2023-05-29 11:45:34	boris_7	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	170 ms	2432 KiB

merchant

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
    int n,m,k;
    cin>>n>>m>>k;
    vector<vector<ll>>b(n,vector<ll>(k)),s(n,vector<ll>(k));
    for(int i = 0;i<n;i++){
        for(int j = 0;j<k;j++){
            cin>>b[i][j]>>s[i][j];
        }
    }
    vector<vector<pair<ll,ll>>>gp(n);
    vector<vector<ll>>d(n,vector<ll>(n,1e18));
    for(int i = 0;i<m;i++){
        int u,v,w;
        cin>>u>>v>>w;
        gp[--u].push_back({--v,w});
        d[u][v]=w;
    }
    for(int p = 0;p<n;p++){
        for(int i = 0;i<n;i++){
            for(int j = 0;j<n;j++){
                d[i][j] = min(d[i][j],d[i][p]+d[p][j]);
            }
        }
    }
    vector<vector<ll>>max_delta(n,vector<ll>(n));
    for(int p = 0;p<k;p++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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