Submission #374242

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
374242	2021-03-07 00:23:41	ivan_tudor	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	154 ms	4332 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;
const long long N = 105;
long long mind[N][N];
long long maxp[N][N];
long long newc[N][N];
long long b[N][1005];
long long s[N][1005];
long long n;
bool check(long long R){
  for(long long i =1 ; i<=n;i++)
    for(long long j =1 ; j<=n;j++){
      newc[i][j] =  maxp[i][j] -  R * mind[i][j];
    }
  for(long long k = 1; k <=n;k++){
    for(long long i = 1; i<=n;i++)
      for(long long j =1 ; j<=n;j++){
        if(newc[i][k] + newc[k][j] > newc[i][j])
          newc[i][j] = newc[i][k] + newc[k][j];
      }
  }
  for(long long i =1 ; i<=n;i++){
    if(newc[i][i] >=0)
      return true;
  }
  return false;
}
int main()
{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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