Submission #75808

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
75808	2018-09-11 07:33:17	tmwilliamlin168	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	125 ms	9500 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;
#define ll long long
const int mxN=100, mxK=1000;
int n, m, k, b[mxN][mxK], s[mxN][mxK], a[mxN][mxN];
ll d1[mxN][mxN], d2[mxN][mxN];
void fw(ll d[mxN][mxN]) {
  for(int k=0; k<n; ++k)
    for(int i=0; i<n; ++i)
      for(int j=0; j<n; ++j)
        d[i][j]=min(d[i][k]+d[k][j], d[i][j]);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  cin >> n >> m >> k;
  for(int i=0; i<n; ++i)
    for(int j=0; j<k; ++j)
      cin >> b[i][j] >> s[i][j];
  for(int i=0; i<n; ++i)
    for(int j=0; j<n; ++j)
      for(int l=0; l<k; ++l)
        if(b[i][l]!=-1&&s[j][l]!=-1)
          a[i][j]=max(s[j][l]-b[i][l], a[i][j]);
//  for(int i=0; i<n; ++i) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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