oj.uz

Submission #545625

# Submission time Handle Problem Language Result Execution time Memory
545625 2022-04-05T01:52:58 Z cig32 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 87 ms 5676 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 2e5 + 10;
const int MOD = 998244353;
#define int long long
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { // read int128
  int x; cin >> x; return (ll)x;
}
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD);
}
void solve(int tc) {
  int n, m, k;
  cin >> n >> m >> k;
  int b[n+1][k+1], s[n+1][k+1];
  for(int i=1; i<=n; i++) {
    for(int j=1; j<=k; j++) {
      cin >> b[i][j] >> s[i][j];
    }
  } 
  int dist[n+1][n+1];
  int p[n+1][n+1];
  for(int i=1; i<=n; i++) {
    for(int j=1; j<=n; j++) {
      dist[i][j] = 1e18;
      p[i][j] = 0;
      if(i == j) dist[i][j] = 0;
    }
  }
  for(int i=0; i<m; i++) {
    int v, w, t;
    cin >> v >> w >> t;
    dist[v][w] = min(dist[v][w], t);
  }
  for(int qwq=1; qwq<=n; qwq++) {
    for(int i=1; i<=n; i++) {
      for(int j=1; j<=n; j++) {
        dist[i][j] = min(dist[i][j], dist[i][qwq] + dist[qwq][j]);
      }
    }
  }
  for(int i=1; i<=n; i++) {
    for(int j=1; j<=n; j++) {
      for(int l=1; l<=k; l++) {
        if(b[i][l] != -1 && s[j][l] != -1) p[i][j] = max(p[i][j], s[j][l] - b[i][l]);
      }
    }
  }
  int lb = 0, rb = 1e9;
  while(lb < rb) {
    int mid = (lb + rb + 1) >> 1;
    double newd[n+1][n+1];
    for(int i=1; i<=n; i++) {
      for(int j=1; j<=n; j++) {
        newd[i][j] = p[i][j] * 1.0 / mid - dist[i][j];
      }
    }
    for(int qwq=1; qwq<=n; qwq++) {
      for(int i=1; i<=n; i++) {
        for(int j=1; j<=n; j++) {
          newd[i][j] = max(newd[i][j], newd[i][qwq] + newd[qwq][j]);
        }
      }
    }
    bool ok = 0;
    for(int i=1; i<=n; i++) {
      for(int j=1; j<=n; j++) {
        if(i == j) continue;
        if(p[i][j] * 1.0 / mid - dist[i][j] + newd[j][i] >= 0) {
          ok = 1;
        }
      }
    }
    if(ok) lb = mid;
    else rb = mid - 1;
  }
  cout << lb << '\n';
}
int32_t main(){
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
} 
/*
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 4940 KB Output is correct
2 Correct 33 ms 2004 KB Output is correct
3 Correct 32 ms 2004 KB Output is correct
4 Correct 7 ms 1876 KB Output is correct
5 Correct 8 ms 1884 KB Output is correct
6 Correct 7 ms 1876 KB Output is correct
7 Correct 7 ms 2004 KB Output is correct
8 Correct 2 ms 1876 KB Output is correct
9 Correct 7 ms 1884 KB Output is correct
10 Correct 7 ms 1876 KB Output is correct
11 Correct 7 ms 1884 KB Output is correct
12 Correct 3 ms 1876 KB Output is correct
13 Correct 7 ms 2004 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1876 KB Output is correct
2 Correct 7 ms 2004 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct
4 Correct 7 ms 1884 KB Output is correct
5 Correct 7 ms 1876 KB Output is correct
6 Correct 7 ms 1884 KB Output is correct
7 Correct 3 ms 1876 KB Output is correct
8 Correct 7 ms 2004 KB Output is correct
9 Correct 10 ms 1876 KB Output is correct
10 Correct 9 ms 1960 KB Output is correct
11 Correct 8 ms 1876 KB Output is correct
12 Correct 7 ms 1876 KB Output is correct
13 Correct 8 ms 2140 KB Output is correct
14 Correct 3 ms 1892 KB Output is correct
15 Correct 7 ms 1876 KB Output is correct
16 Correct 8 ms 2004 KB Output is correct
17 Correct 7 ms 1968 KB Output is correct
18 Correct 8 ms 1876 KB Output is correct
19 Correct 8 ms 2004 KB Output is correct
20 Correct 8 ms 2040 KB Output is correct
21 Correct 7 ms 1876 KB Output is correct
22 Correct 7 ms 1876 KB Output is correct
23 Correct 8 ms 2004 KB Output is correct
24 Correct 7 ms 1876 KB Output is correct
25 Correct 8 ms 1900 KB Output is correct
26 Correct 3 ms 1876 KB Output is correct
27 Correct 8 ms 2004 KB Output is correct
28 Correct 11 ms 2004 KB Output is correct
29 Correct 8 ms 2028 KB Output is correct
30 Correct 7 ms 1900 KB Output is correct
31 Correct 7 ms 1876 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1900 KB Output is correct
2 Correct 3 ms 1876 KB Output is correct
3 Correct 8 ms 2004 KB Output is correct
4 Correct 11 ms 2004 KB Output is correct
5 Correct 8 ms 2028 KB Output is correct
6 Correct 7 ms 1900 KB Output is correct
7 Correct 7 ms 1876 KB Output is correct
8 Correct 39 ms 2388 KB Output is correct
9 Correct 80 ms 5212 KB Output is correct
10 Correct 34 ms 2260 KB Output is correct
11 Correct 39 ms 2516 KB Output is correct
12 Correct 37 ms 2388 KB Output is correct
13 Correct 34 ms 2260 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1876 KB Output is correct
2 Correct 9 ms 1960 KB Output is correct
3 Correct 8 ms 1876 KB Output is correct
4 Correct 7 ms 1876 KB Output is correct
5 Correct 8 ms 2140 KB Output is correct
6 Correct 3 ms 1892 KB Output is correct
7 Correct 7 ms 1876 KB Output is correct
8 Correct 8 ms 2004 KB Output is correct
9 Correct 7 ms 1968 KB Output is correct
10 Correct 8 ms 1876 KB Output is correct
11 Correct 8 ms 2004 KB Output is correct
12 Correct 8 ms 2040 KB Output is correct
13 Correct 7 ms 1876 KB Output is correct
14 Correct 7 ms 1876 KB Output is correct
15 Correct 8 ms 2004 KB Output is correct
16 Correct 7 ms 1876 KB Output is correct
17 Correct 39 ms 2388 KB Output is correct
18 Correct 80 ms 5212 KB Output is correct
19 Correct 34 ms 2260 KB Output is correct
20 Correct 39 ms 2516 KB Output is correct
21 Correct 37 ms 2388 KB Output is correct
22 Correct 34 ms 2260 KB Output is correct
23 Correct 8 ms 1900 KB Output is correct
24 Correct 3 ms 1876 KB Output is correct
25 Correct 8 ms 2004 KB Output is correct
26 Correct 11 ms 2004 KB Output is correct
27 Correct 8 ms 2028 KB Output is correct
28 Correct 7 ms 1900 KB Output is correct
29 Correct 7 ms 1876 KB Output is correct
30 Correct 57 ms 4940 KB Output is correct
31 Correct 33 ms 2004 KB Output is correct
32 Correct 32 ms 2004 KB Output is correct
33 Correct 7 ms 1876 KB Output is correct
34 Correct 8 ms 1884 KB Output is correct
35 Correct 7 ms 1876 KB Output is correct
36 Correct 7 ms 2004 KB Output is correct
37 Correct 2 ms 1876 KB Output is correct
38 Correct 7 ms 1884 KB Output is correct
39 Correct 7 ms 1876 KB Output is correct
40 Correct 7 ms 1884 KB Output is correct
41 Correct 3 ms 1876 KB Output is correct
42 Correct 7 ms 2004 KB Output is correct
43 Correct 34 ms 2164 KB Output is correct
44 Correct 35 ms 2360 KB Output is correct
45 Correct 49 ms 3872 KB Output is correct
46 Correct 34 ms 2284 KB Output is correct
47 Correct 32 ms 2304 KB Output is correct
48 Correct 38 ms 2260 KB Output is correct
49 Correct 87 ms 5544 KB Output is correct
50 Correct 3 ms 1876 KB Output is correct
51 Correct 2 ms 1876 KB Output is correct
52 Correct 36 ms 2148 KB Output is correct
53 Correct 34 ms 2260 KB Output is correct
54 Correct 32 ms 2204 KB Output is correct
55 Correct 37 ms 2176 KB Output is correct
56 Correct 40 ms 2136 KB Output is correct
57 Correct 3 ms 1876 KB Output is correct
58 Correct 9 ms 2020 KB Output is correct
59 Correct 9 ms 2128 KB Output is correct
60 Correct 8 ms 2004 KB Output is correct
61 Correct 85 ms 5676 KB Output is correct
62 Correct 84 ms 5616 KB Output is correct
63 Correct 3 ms 1876 KB Output is correct