oj.uz

Submission #702553

# Submission time Handle Problem Language Result Execution time Memory
702553 2023-02-24T11:49:48 Z Abrar_Al_Samit Travelling Merchant (APIO17_merchant) C++17
100 / 100
 96 ms 4148 KB 
#include<bits/stdc++.h>
using namespace std;

const int nax = 101;
const long long INF = 1e18;

int n, m, k;
long long b[nax][nax*10], s[nax][nax*10];
long long graph[nax][nax], graph2[nax][nax];
long long profit[nax][nax];

void floyd_warshall(long long g[nax][nax]) {
  for(int y=1; y<=n; ++y) {
    for(int x=1; x<=n; ++x) {
      for(int z=1; z<=n; ++z) {
        g[x][z] = min(g[x][z], g[x][y]+g[y][z]);
      }
    }
  }
}
void PlayGround() {
  cin>>n>>m>>k;
  for(int i=1; i<=n; ++i) {
    for(int j=1; j<=k; ++j) {
      cin>>b[i][j]>>s[i][j];
    }
  }
  for(int i=1; i<=n; ++i) {
    for(int j=1; j<=n; ++j) {
      graph[i][j] = INF;
    }
  }
  for(int i=0; i<m; ++i) {
    int u, v, w;
    cin>>u>>v>>w;
    graph[u][v] = w;
  }

  floyd_warshall(graph);

  for(int x=1; x<=k; ++x) {
    for(int i=1; i<=n; ++i) {
      if(b[i][x]==-1) continue;
      for(int j=1; j<=n; ++j) {
        if(s[j][x]==-1) continue;

        profit[i][j] = max(profit[i][j], s[j][x] - b[i][x]);
      }
    }
  }

  long long lo = 0, hi = INF;
  while(lo<hi) {
    long long mid = (1+lo+hi) / 2;

    for(int i=1; i<=n; ++i) {
      for(int j=1; j<=n; ++j) {
        graph2[i][j] = mid * min(graph[i][j], INF/mid) - profit[i][j];
      }
    }
    floyd_warshall(graph2);

    bool ok = false;
    for(int i=1; i<=n; ++i) if(graph2[i][i]<=0) {
      ok = true;
    }
    if(ok) lo = mid;
    else hi = mid-1;
  }

  cout<<lo<<'\n';
  //cerr<<"Time elapsed: "<<1.0*clock()/CLOCKS_PER_SEC<<" s.\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 3188 KB Output is correct
2 Correct 69 ms 1272 KB Output is correct
3 Correct 62 ms 1288 KB Output is correct
4 Correct 8 ms 724 KB Output is correct
5 Correct 9 ms 712 KB Output is correct
6 Correct 10 ms 816 KB Output is correct
7 Correct 10 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 9 ms 724 KB Output is correct
10 Correct 9 ms 716 KB Output is correct
11 Correct 9 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 9 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 816 KB Output is correct
2 Correct 10 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 9 ms 724 KB Output is correct
5 Correct 9 ms 716 KB Output is correct
6 Correct 9 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 9 ms 852 KB Output is correct
9 Correct 9 ms 884 KB Output is correct
10 Correct 10 ms 852 KB Output is correct
11 Correct 9 ms 852 KB Output is correct
12 Correct 8 ms 852 KB Output is correct
13 Correct 9 ms 848 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 8 ms 844 KB Output is correct
16 Correct 9 ms 880 KB Output is correct
17 Correct 10 ms 868 KB Output is correct
18 Correct 9 ms 912 KB Output is correct
19 Correct 10 ms 852 KB Output is correct
20 Correct 11 ms 852 KB Output is correct
21 Correct 10 ms 980 KB Output is correct
22 Correct 10 ms 892 KB Output is correct
23 Correct 10 ms 964 KB Output is correct
24 Correct 9 ms 844 KB Output is correct
25 Correct 9 ms 852 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 10 ms 852 KB Output is correct
28 Correct 9 ms 852 KB Output is correct
29 Correct 12 ms 956 KB Output is correct
30 Correct 9 ms 852 KB Output is correct
31 Correct 9 ms 864 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 852 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 10 ms 852 KB Output is correct
4 Correct 9 ms 852 KB Output is correct
5 Correct 12 ms 956 KB Output is correct
6 Correct 9 ms 852 KB Output is correct
7 Correct 9 ms 864 KB Output is correct
8 Correct 62 ms 1620 KB Output is correct
9 Correct 83 ms 3904 KB Output is correct
10 Correct 64 ms 1504 KB Output is correct
11 Correct 71 ms 1748 KB Output is correct
12 Correct 62 ms 1752 KB Output is correct
13 Correct 60 ms 1512 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 884 KB Output is correct
2 Correct 10 ms 852 KB Output is correct
3 Correct 9 ms 852 KB Output is correct
4 Correct 8 ms 852 KB Output is correct
5 Correct 9 ms 848 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 8 ms 844 KB Output is correct
8 Correct 9 ms 880 KB Output is correct
9 Correct 10 ms 868 KB Output is correct
10 Correct 9 ms 912 KB Output is correct
11 Correct 10 ms 852 KB Output is correct
12 Correct 11 ms 852 KB Output is correct
13 Correct 10 ms 980 KB Output is correct
14 Correct 10 ms 892 KB Output is correct
15 Correct 10 ms 964 KB Output is correct
16 Correct 9 ms 844 KB Output is correct
17 Correct 62 ms 1620 KB Output is correct
18 Correct 83 ms 3904 KB Output is correct
19 Correct 64 ms 1504 KB Output is correct
20 Correct 71 ms 1748 KB Output is correct
21 Correct 62 ms 1752 KB Output is correct
22 Correct 60 ms 1512 KB Output is correct
23 Correct 9 ms 852 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 10 ms 852 KB Output is correct
26 Correct 9 ms 852 KB Output is correct
27 Correct 12 ms 956 KB Output is correct
28 Correct 9 ms 852 KB Output is correct
29 Correct 9 ms 864 KB Output is correct
30 Correct 70 ms 3188 KB Output is correct
31 Correct 69 ms 1272 KB Output is correct
32 Correct 62 ms 1288 KB Output is correct
33 Correct 8 ms 724 KB Output is correct
34 Correct 9 ms 712 KB Output is correct
35 Correct 10 ms 816 KB Output is correct
36 Correct 10 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 9 ms 724 KB Output is correct
39 Correct 9 ms 716 KB Output is correct
40 Correct 9 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 9 ms 852 KB Output is correct
43 Correct 59 ms 1388 KB Output is correct
44 Correct 77 ms 1620 KB Output is correct
45 Correct 65 ms 2612 KB Output is correct
46 Correct 59 ms 1492 KB Output is correct
47 Correct 58 ms 1600 KB Output is correct
48 Correct 58 ms 1492 KB Output is correct
49 Correct 88 ms 4016 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 61 ms 1364 KB Output is correct
53 Correct 63 ms 1476 KB Output is correct
54 Correct 58 ms 1364 KB Output is correct
55 Correct 58 ms 1364 KB Output is correct
56 Correct 58 ms 1344 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 10 ms 980 KB Output is correct
59 Correct 9 ms 1044 KB Output is correct
60 Correct 10 ms 980 KB Output is correct
61 Correct 96 ms 4148 KB Output is correct
62 Correct 87 ms 4140 KB Output is correct
63 Correct 0 ms 340 KB Output is correct