oj.uz

Submission #139268

# Submission time Handle Problem Language Result Execution time Memory
139268 2019-07-31T13:51:52 Z win11905 Travelling Merchant (APIO17_merchant) C++11
100 / 100
 114 ms 4272 KB 
#include <bits/stdc++.h>
#define long long long 
using namespace std;

const int N = 105;
const int K = 1005;
const long INF = 1e9+1;

int n, m, k;
long b[N][K], s[N][K];
long d1[N][N], d2[N][N], cost[N][N];

void apsp(long d[N][N]) {
  for(int k = 1; k <= n; ++k) 
    for(int i = 1; i <= n; ++i)
      for(int j = 1; j <= n; ++j)
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}

int main() {
  fill_n(d1[0], N*N, INF);
  scanf("%d %d %d", &n, &m, &k);
  for(int i = 1; i <= n; ++i) 
    for(int j = 1; j <= k; ++j) 
      scanf("%lld %lld", &b[i][j], &s[i][j]);
  for(int i = 1; i <= n; ++i) for(int j = 1; j <= n; ++j)
    for(int l = 1; l <= k; ++l) if(s[j][l] != -1 && b[i][l] != -1)
      cost[i][j] = max(cost[i][j], s[j][l] - b[i][l]);
  for(int i = 0, u, v, w; i < m; ++i) {
    scanf("%d %d %d", &u, &v, &w);
    d1[u][v] = w;
  }
  apsp(d1);
  long l = 0, r = 1e9+1;
  while(l < r) {
    long m = (l + r + 1) / 2;
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= n; ++j)
      d2[i][j] = m * d1[i][j] - cost[i][j];
    apsp(d2);
    bool st = false;
    for(int i = 1; i <= n; ++i) st |= d2[i][i] <= 0;
    if(st) l = m;
    else r = m-1;
  }
  printf("%lld\n", l);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &n, &m, &k);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:25:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%lld %lld", &b[i][j], &s[i][j]);
       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &u, &v, &w);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 2040 KB Output is correct
2 Correct 40 ms 1400 KB Output is correct
3 Correct 42 ms 1400 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 8 ms 892 KB Output is correct
6 Correct 8 ms 888 KB Output is correct
7 Correct 10 ms 888 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 9 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 8 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 1016 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 9 ms 1020 KB Output is correct
11 Correct 9 ms 1016 KB Output is correct
12 Correct 9 ms 1016 KB Output is correct
13 Correct 9 ms 888 KB Output is correct
14 Correct 9 ms 1016 KB Output is correct
15 Correct 10 ms 1016 KB Output is correct
16 Correct 8 ms 888 KB Output is correct
17 Correct 9 ms 1016 KB Output is correct
18 Correct 2 ms 508 KB Output is correct
19 Correct 9 ms 1016 KB Output is correct
20 Correct 11 ms 1016 KB Output is correct
21 Correct 10 ms 888 KB Output is correct
22 Correct 9 ms 888 KB Output is correct
23 Correct 8 ms 820 KB Output is correct
24 Correct 8 ms 888 KB Output is correct
25 Correct 10 ms 888 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 8 ms 888 KB Output is correct
28 Correct 8 ms 888 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 9 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1588 KB Output is correct
2 Correct 100 ms 2300 KB Output is correct
3 Correct 44 ms 1520 KB Output is correct
4 Correct 47 ms 1528 KB Output is correct
5 Correct 47 ms 1528 KB Output is correct
6 Correct 43 ms 1400 KB Output is correct
7 Correct 9 ms 1016 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 9 ms 1016 KB Output is correct
10 Correct 11 ms 1016 KB Output is correct
11 Correct 10 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 8 ms 820 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 8 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 1016 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 9 ms 1020 KB Output is correct
11 Correct 9 ms 1016 KB Output is correct
12 Correct 9 ms 1016 KB Output is correct
13 Correct 9 ms 888 KB Output is correct
14 Correct 9 ms 1016 KB Output is correct
15 Correct 10 ms 1016 KB Output is correct
16 Correct 8 ms 888 KB Output is correct
17 Correct 47 ms 1588 KB Output is correct
18 Correct 100 ms 2300 KB Output is correct
19 Correct 44 ms 1520 KB Output is correct
20 Correct 47 ms 1528 KB Output is correct
21 Correct 47 ms 1528 KB Output is correct
22 Correct 43 ms 1400 KB Output is correct
23 Correct 9 ms 1016 KB Output is correct
24 Correct 2 ms 508 KB Output is correct
25 Correct 9 ms 1016 KB Output is correct
26 Correct 11 ms 1016 KB Output is correct
27 Correct 10 ms 888 KB Output is correct
28 Correct 9 ms 888 KB Output is correct
29 Correct 8 ms 820 KB Output is correct
30 Correct 42 ms 1500 KB Output is correct
31 Correct 45 ms 1700 KB Output is correct
32 Correct 63 ms 2680 KB Output is correct
33 Correct 44 ms 1656 KB Output is correct
34 Correct 45 ms 1656 KB Output is correct
35 Correct 44 ms 1656 KB Output is correct
36 Correct 107 ms 4032 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 42 ms 1400 KB Output is correct
40 Correct 44 ms 1528 KB Output is correct
41 Correct 42 ms 1528 KB Output is correct
42 Correct 42 ms 1400 KB Output is correct
43 Correct 41 ms 1528 KB Output is correct
44 Correct 2 ms 504 KB Output is correct
45 Correct 10 ms 1016 KB Output is correct
46 Correct 11 ms 1144 KB Output is correct
47 Correct 10 ms 1016 KB Output is correct
48 Correct 114 ms 4272 KB Output is correct
49 Correct 112 ms 4232 KB Output is correct
50 Correct 2 ms 380 KB Output is correct
51 Correct 78 ms 2040 KB Output is correct
52 Correct 40 ms 1400 KB Output is correct
53 Correct 42 ms 1400 KB Output is correct
54 Correct 8 ms 888 KB Output is correct
55 Correct 8 ms 892 KB Output is correct
56 Correct 8 ms 888 KB Output is correct
57 Correct 10 ms 888 KB Output is correct
58 Correct 2 ms 504 KB Output is correct
59 Correct 8 ms 888 KB Output is correct
60 Correct 8 ms 888 KB Output is correct
61 Correct 8 ms 888 KB Output is correct
62 Correct 2 ms 504 KB Output is correct
63 Correct 9 ms 888 KB Output is correct