oj.uz

Submission #583202

# Submission time Handle Problem Language Result Execution time Memory
583202 2022-06-25T04:55:49 Z Jomnoi Travelling Merchant (APIO17_merchant) C++17
100 / 100
 93 ms 4176 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 105;
const int MAX_K = 1005;
const long long llINF = 1e18 + 7;

long long B[MAX_N][MAX_K], S[MAX_N][MAX_K];
long long dist[MAX_N][MAX_N], dist2[MAX_N][MAX_N];
long long profit[MAX_N][MAX_N];

int main() {
   cin.tie(nullptr)->sync_with_stdio(false);

   int N, M, K;
   cin >> N >> M >> K;

   for(int i = 1; i <= N; i++) {
      for(int j = 1; j <= N; j++) {
         dist[i][j] = llINF;
      }
   }

   for(int i = 1; i <= N; i++) {
      for(int k = 1; k <= K; k++) {
         cin >> B[i][k] >> S[i][k];
      }
   }
   while(M--) {
      int v, w, t;
      cin >> v >> w >> t;
      
      dist[v][w] = t;
   }

   for(int k = 1; k <= N; k++) {
      for(int i = 1; i <= N; i++) {
         for(int j = 1; j <= N; j++) {
            dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
         }
      }
   }

   for(int i = 1; i <= N; i++) {
      for(int j = 1; j <= N; j++) {
         for(int k = 1; k <= K; k++) {
            if(B[i][k] != -1 and S[j][k] != -1) {
               profit[i][j] = max(profit[i][j], S[j][k] - B[i][k]);
            }
         }
      }
   }

   int l = 1, r = 1e9, ans = 0;
   while(l <= r) {
      int mid = (l + r) / 2;

      for(int i = 1; i <= N; i++) {
         for(int j = 1; j <= N; j++) {
            dist2[i][j] = llINF;

            if(dist[i][j] != llINF) {
               dist2[i][j] = dist[i][j] * mid - profit[i][j];
            }
         }
      }

      for(int k = 1; k <= N; k++) {
         for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= N; j++) {
               dist2[i][j] = min(dist2[i][j], dist2[i][k] + dist2[k][j]);
            }
         }
      }

      bool hasNegCycle = false;
      for(int i = 1; i <= N; i++) {
         if(dist2[i][i] <= 0) {
            hasNegCycle = true;
         }
      }

      if(hasNegCycle == true) {
         l = mid + 1;
         ans = mid;
      }
      else {
         r = mid - 1;
      }
   }
   cout << ans;
   return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 3324 KB Output is correct
2 Correct 33 ms 1236 KB Output is correct
3 Correct 34 ms 1224 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 7 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 880 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 6 ms 708 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 848 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 6 ms 880 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 6 ms 708 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 6 ms 848 KB Output is correct
10 Correct 7 ms 840 KB Output is correct
11 Correct 5 ms 908 KB Output is correct
12 Correct 6 ms 856 KB Output is correct
13 Correct 7 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 6 ms 724 KB Output is correct
16 Correct 6 ms 860 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 6 ms 900 KB Output is correct
20 Correct 8 ms 944 KB Output is correct
21 Correct 6 ms 876 KB Output is correct
22 Correct 6 ms 892 KB Output is correct
23 Correct 7 ms 852 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 6 ms 944 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 7 ms 940 KB Output is correct
30 Correct 6 ms 876 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 852 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 6 ms 944 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 7 ms 940 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 39 ms 1620 KB Output is correct
9 Correct 87 ms 4020 KB Output is correct
10 Correct 40 ms 1492 KB Output is correct
11 Correct 39 ms 1740 KB Output is correct
12 Correct 42 ms 1736 KB Output is correct
13 Correct 36 ms 1492 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 848 KB Output is correct
2 Correct 7 ms 840 KB Output is correct
3 Correct 5 ms 908 KB Output is correct
4 Correct 6 ms 856 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 724 KB Output is correct
8 Correct 6 ms 860 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 900 KB Output is correct
12 Correct 8 ms 944 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
14 Correct 6 ms 892 KB Output is correct
15 Correct 7 ms 852 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 39 ms 1620 KB Output is correct
18 Correct 87 ms 4020 KB Output is correct
19 Correct 40 ms 1492 KB Output is correct
20 Correct 39 ms 1740 KB Output is correct
21 Correct 42 ms 1736 KB Output is correct
22 Correct 36 ms 1492 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 6 ms 944 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 7 ms 940 KB Output is correct
28 Correct 6 ms 876 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 57 ms 3324 KB Output is correct
31 Correct 33 ms 1236 KB Output is correct
32 Correct 34 ms 1224 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 7 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 880 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 6 ms 708 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 5 ms 848 KB Output is correct
43 Correct 35 ms 1396 KB Output is correct
44 Correct 39 ms 1492 KB Output is correct
45 Correct 50 ms 2508 KB Output is correct
46 Correct 38 ms 1492 KB Output is correct
47 Correct 37 ms 1492 KB Output is correct
48 Correct 38 ms 1536 KB Output is correct
49 Correct 91 ms 4080 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 37 ms 1236 KB Output is correct
53 Correct 37 ms 1456 KB Output is correct
54 Correct 37 ms 1492 KB Output is correct
55 Correct 37 ms 1364 KB Output is correct
56 Correct 35 ms 1236 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 7 ms 980 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 92 ms 4176 KB Output is correct
62 Correct 93 ms 4172 KB Output is correct
63 Correct 1 ms 324 KB Output is correct