Submission #58786

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
58786	2018-07-19 11:31:10	Hoppa	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	293 ms	14584 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;
int n,m,k,u,v;
long long w,buy[105][1005],sell[105][1005],d[105][105],profit[105][105],f[105][105],ans;
int check(long long val)
{
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            f[i][j]=profit[i][j]-val*d[i][j];
    for(int kk=1;kk<=n;kk++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(i!=j && d[i][kk]<1e9 && d[kk][j]<1e9)
                    f[i][j]=max(f[i][j],f[i][kk]+f[kk][j]);
    for(int i=1;i<n;i++)
        for(int j=i+1;j<=n;j++)
            if(f[i][j]+f[j][i]>=0 && d[i][j]<1e9 && d[j][i]<1e9)
                return 1;
    return 0;
}
int main()
{
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=k;j++)
           cin>>buy[i][j]>>sell[i][j];
    for(int i=1;i<=n;i++)
      {
         for(int j=1;j<=n;j++)
          d[i][j]=1e9;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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