oj.uz

Submission #558349

# Submission time Handle Problem Language Result Execution time Memory
558349 2022-05-07T06:51:22 Z loctildore Travelling Merchant (APIO17_merchant) C++14
100 / 100
 100 ms 4260 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x), end(x)
ll n,m,c;
ll v,w,t;
ll arr[105][105];
ll pro[105][105];
ll buy[105][1069];
ll sell[105][1069];
ll grph[105][105];
bool works(ll x) {
  for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < n; j++) {
      grph[i][j]=pro[i][j]-x*arr[i][j];
    }
    grph[i][i]=LLONG_MIN/2;
  }
  for (ll k = 0; k < n; k++) {
    for (ll i = 0; i < n; i++) {
      for (ll j = 0; j < n; j++) {
        grph[i][j]=max(grph[i][j],grph[i][k]+grph[k][j]);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (grph[i][i]>=0) {
      return true;
    }
  }
  return false;
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  for (ll i = 0; i < 105; i++) {
    for (ll j = 0; j < 105; j++) {
      arr[i][j]=INT_MAX/2;
    }
    arr[i][i]=0;
  }
  cin>>n>>m>>c;
  for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < c; j++) {
      cin>>buy[i][j]>>sell[i][j];
    }
  }
  for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < n; j++) {
      for (ll k = 0; k < c; k++) {
        if (buy[i][k]!=-1&&sell[j][k]!=-1) {
          pro[i][j]=max(pro[i][j],sell[j][k]-buy[i][k]);
        }
      }
    }
  }
  for (ll i = 0; i < m; i++) {
    cin>>v>>w>>t;
    v--;w--;
    arr[v][w]=t;
  }
  for (ll k = 0; k < n; k++) {
    for (ll i = 0; i < n; i++) {
      for (ll j = 0; j < n; j++) {
        arr[i][j]=min(arr[i][j],arr[i][k]+arr[k][j]);
      }
    }
  }
  ll s=0, e=1000000069;
  while (s+1!=e) {
    (works((s+e)/2)?s:e)=(s+e)/2;
  }
  cout<<s<<endl;
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 3400 KB Output is correct
2 Correct 34 ms 1284 KB Output is correct
3 Correct 33 ms 1184 KB Output is correct
4 Correct 6 ms 804 KB Output is correct
5 Correct 6 ms 864 KB Output is correct
6 Correct 6 ms 796 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 412 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 7 ms 876 KB Output is correct
11 Correct 6 ms 800 KB Output is correct
12 Correct 1 ms 416 KB Output is correct
13 Correct 5 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 796 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 412 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 7 ms 876 KB Output is correct
6 Correct 6 ms 800 KB Output is correct
7 Correct 1 ms 416 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 5 ms 808 KB Output is correct
13 Correct 7 ms 940 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 6 ms 952 KB Output is correct
17 Correct 6 ms 852 KB Output is correct
18 Correct 6 ms 936 KB Output is correct
19 Correct 7 ms 980 KB Output is correct
20 Correct 9 ms 980 KB Output is correct
21 Correct 6 ms 816 KB Output is correct
22 Correct 6 ms 924 KB Output is correct
23 Correct 8 ms 980 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 6 ms 940 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 7 ms 996 KB Output is correct
28 Correct 6 ms 924 KB Output is correct
29 Correct 7 ms 980 KB Output is correct
30 Correct 6 ms 808 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 940 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 7 ms 996 KB Output is correct
4 Correct 6 ms 924 KB Output is correct
5 Correct 7 ms 980 KB Output is correct
6 Correct 6 ms 808 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 46 ms 1644 KB Output is correct
9 Correct 89 ms 3984 KB Output is correct
10 Correct 36 ms 1492 KB Output is correct
11 Correct 40 ms 1724 KB Output is correct
12 Correct 40 ms 1732 KB Output is correct
13 Correct 36 ms 1524 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 5 ms 808 KB Output is correct
5 Correct 7 ms 940 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 6 ms 952 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 6 ms 936 KB Output is correct
11 Correct 7 ms 980 KB Output is correct
12 Correct 9 ms 980 KB Output is correct
13 Correct 6 ms 816 KB Output is correct
14 Correct 6 ms 924 KB Output is correct
15 Correct 8 ms 980 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 46 ms 1644 KB Output is correct
18 Correct 89 ms 3984 KB Output is correct
19 Correct 36 ms 1492 KB Output is correct
20 Correct 40 ms 1724 KB Output is correct
21 Correct 40 ms 1732 KB Output is correct
22 Correct 36 ms 1524 KB Output is correct
23 Correct 6 ms 940 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 7 ms 996 KB Output is correct
26 Correct 6 ms 924 KB Output is correct
27 Correct 7 ms 980 KB Output is correct
28 Correct 6 ms 808 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 55 ms 3400 KB Output is correct
31 Correct 34 ms 1284 KB Output is correct
32 Correct 33 ms 1184 KB Output is correct
33 Correct 6 ms 804 KB Output is correct
34 Correct 6 ms 864 KB Output is correct
35 Correct 6 ms 796 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 412 KB Output is correct
38 Correct 5 ms 852 KB Output is correct
39 Correct 7 ms 876 KB Output is correct
40 Correct 6 ms 800 KB Output is correct
41 Correct 1 ms 416 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 35 ms 1400 KB Output is correct
44 Correct 37 ms 1492 KB Output is correct
45 Correct 59 ms 2724 KB Output is correct
46 Correct 48 ms 1492 KB Output is correct
47 Correct 39 ms 1592 KB Output is correct
48 Correct 37 ms 1588 KB Output is correct
49 Correct 88 ms 4172 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 34 ms 1324 KB Output is correct
53 Correct 37 ms 1364 KB Output is correct
54 Correct 35 ms 1364 KB Output is correct
55 Correct 34 ms 1400 KB Output is correct
56 Correct 37 ms 1344 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 8 ms 1068 KB Output is correct
60 Correct 9 ms 1108 KB Output is correct
61 Correct 100 ms 4228 KB Output is correct
62 Correct 91 ms 4260 KB Output is correct
63 Correct 1 ms 340 KB Output is correct