Submission #1171268

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1171268	2025-03-20 17:08:47	Muhammet	Travelling Merchant (APIO17_merchant)	C++17	0 / 100	295 ms	2192 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 N = 1e2 + 5;
vector <pair <int, int>> v[N];
ll n, m, k, ans = 1e9 + 1;
vector <vector <ll>> dis, e, b, s;
bool check(ll x) {
  e.assign(n+1, vector <ll> (n+1, 0));
  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= n; j++) {
      for(int x = 1; x <= k; x++) {
        if(b[i][x] == -1 or s[j][x] == -1) continue;
        e[i][j] = max(e[i][j], (s[j][x] - b[i][x]));
      }
      e[i][j] -= (x * dis[i][j]);
      e[i][j] *= (-1);
    }
  }
  for(int x = 1; x <= n; x++) {
    for(int i = 1; i <= n; i++) {
      for(int j = 1; j <= n; j++) {
        e[i][j] = min(e[i][j], e[i][x] + e[x][j]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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