oj.uz

Submission #69978

# Submission time Handle Problem Language Result Execution time Memory
69978 2018-08-22T07:36:43 Z funcsr Travelling Merchant (APIO17_merchant) C++17
100 / 100
 96 ms 14460 KB 
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF (1LL<<60)
#define MOD 1000000007

int N, M, K;
void warshall_floyd(long long D[100][100]) {
  rep(k, N) rep(i, N) rep(j, N) D[i][j] = min(D[i][j], D[i][k]+D[k][j]);
}

long long B[100][1000], S[100][1000];
long long D[100][100];
long long profit[100][100];
long long cost[100][100];

bool f(int X) {
  rep(i, N) rep(j, N) cost[i][j] = INF;
  rep(a, N) rep(b, N) if (a != b && D[a][b] != INF) {
    cost[a][b] = -(profit[a][b]-1LL*X*D[a][b]);
  }
  warshall_floyd(cost);
  //cout<<"f("<<X<<"): ";rep(i, N) cout<<cost[i][i]<<",";cout<<"\n";
  rep(i, N) if (cost[i][i] <= 0) return true;
  return false;
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> M >> K;
  rep(i, N) rep(j, K) cin >> B[i][j] >> S[i][j];
  rep(i, N) rep(j, N) D[i][j] = INF;
  rep(i, N) D[i][i] = 0;
  rep(i, M) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    D[u][v] = w;
  }
  rep(a, N) rep(b, N) if (a != b) {
    long long m = 0;
    rep(k, K) {
      if (B[a][k] == -1 || S[b][k] == -1) continue;
      m = max(m, S[b][k]-B[a][k]);
    }
    profit[a][b] = m;
  }
  warshall_floyd(D);

  int lo = 0, hi = 2e9;
  while (hi-lo>1) {
    int mid=(0LL+lo+hi)/2;
    if (f(mid)) lo = mid;
    else hi = mid;
  }
  cout << lo << "\n";
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 3448 KB Output is correct
2 Correct 51 ms 3448 KB Output is correct
3 Correct 52 ms 3448 KB Output is correct
4 Correct 10 ms 3448 KB Output is correct
5 Correct 9 ms 3448 KB Output is correct
6 Correct 11 ms 3448 KB Output is correct
7 Correct 12 ms 3448 KB Output is correct
8 Correct 3 ms 3448 KB Output is correct
9 Correct 11 ms 3448 KB Output is correct
10 Correct 10 ms 3448 KB Output is correct
11 Correct 11 ms 3448 KB Output is correct
12 Correct 3 ms 3448 KB Output is correct
13 Correct 9 ms 3448 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 4140 KB Output is correct
2 Correct 77 ms 6456 KB Output is correct
3 Correct 48 ms 6456 KB Output is correct
4 Correct 52 ms 6456 KB Output is correct
5 Correct 52 ms 6456 KB Output is correct
6 Correct 47 ms 6556 KB Output is correct
7 Correct 13 ms 3448 KB Output is correct
8 Correct 2 ms 3448 KB Output is correct
9 Correct 11 ms 3448 KB Output is correct
10 Correct 13 ms 3448 KB Output is correct
11 Correct 14 ms 3448 KB Output is correct
12 Correct 10 ms 3448 KB Output is correct
13 Correct 8 ms 3448 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3448 KB Output is correct
2 Correct 12 ms 3448 KB Output is correct
3 Correct 10 ms 3448 KB Output is correct
4 Correct 9 ms 3448 KB Output is correct
5 Correct 10 ms 3448 KB Output is correct
6 Correct 2 ms 3448 KB Output is correct
7 Correct 10 ms 3448 KB Output is correct
8 Correct 10 ms 3448 KB Output is correct
9 Correct 11 ms 3448 KB Output is correct
10 Correct 9 ms 3448 KB Output is correct
11 Correct 11 ms 3448 KB Output is correct
12 Correct 10 ms 3448 KB Output is correct
13 Correct 9 ms 3448 KB Output is correct
14 Correct 8 ms 3448 KB Output is correct
15 Correct 10 ms 3448 KB Output is correct
16 Correct 9 ms 3448 KB Output is correct
17 Correct 52 ms 4140 KB Output is correct
18 Correct 77 ms 6456 KB Output is correct
19 Correct 48 ms 6456 KB Output is correct
20 Correct 52 ms 6456 KB Output is correct
21 Correct 52 ms 6456 KB Output is correct
22 Correct 47 ms 6556 KB Output is correct
23 Correct 13 ms 3448 KB Output is correct
24 Correct 2 ms 3448 KB Output is correct
25 Correct 11 ms 3448 KB Output is correct
26 Correct 13 ms 3448 KB Output is correct
27 Correct 14 ms 3448 KB Output is correct
28 Correct 10 ms 3448 KB Output is correct
29 Correct 8 ms 3448 KB Output is correct
30 Correct 69 ms 6556 KB Output is correct
31 Correct 57 ms 6644 KB Output is correct
32 Correct 96 ms 7636 KB Output is correct
33 Correct 47 ms 7636 KB Output is correct
34 Correct 49 ms 7636 KB Output is correct
35 Correct 50 ms 7636 KB Output is correct
36 Correct 80 ms 9876 KB Output is correct
37 Correct 2 ms 9876 KB Output is correct
38 Correct 2 ms 9876 KB Output is correct
39 Correct 48 ms 9876 KB Output is correct
40 Correct 49 ms 9876 KB Output is correct
41 Correct 48 ms 9876 KB Output is correct
42 Correct 46 ms 9876 KB Output is correct
43 Correct 47 ms 9876 KB Output is correct
44 Correct 2 ms 9876 KB Output is correct
45 Correct 10 ms 9876 KB Output is correct
46 Correct 10 ms 9876 KB Output is correct
47 Correct 11 ms 9876 KB Output is correct
48 Correct 84 ms 12472 KB Output is correct
49 Correct 87 ms 14460 KB Output is correct
50 Correct 4 ms 14460 KB Output is correct
51 Correct 82 ms 3448 KB Output is correct
52 Correct 51 ms 3448 KB Output is correct
53 Correct 52 ms 3448 KB Output is correct
54 Correct 10 ms 3448 KB Output is correct
55 Correct 9 ms 3448 KB Output is correct
56 Correct 11 ms 3448 KB Output is correct
57 Correct 12 ms 3448 KB Output is correct
58 Correct 3 ms 3448 KB Output is correct
59 Correct 11 ms 3448 KB Output is correct
60 Correct 10 ms 3448 KB Output is correct
61 Correct 11 ms 3448 KB Output is correct
62 Correct 3 ms 3448 KB Output is correct
63 Correct 9 ms 3448 KB Output is correct