oj.uz

Submission #950180

# Submission time Handle Problem Language Result Execution time Memory
950180 2024-03-20T06:31:03 Z abczz Travelling Merchant (APIO17_merchant) C++14
0 / 100
 113 ms 3832 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <deque>
#include <queue>
#define ll long long

using namespace std;

ll dist[100][100], C[100][100], X[100][100], l, r, mid;
ll n, m, k, a, b, c, cur, A[100][1000], B[100][1000];
int main() {
  cin >> n >> m >> k;
  for (int i=0; i<n; ++i) {
    for (int j=0; j<n; ++j) {
      dist[i][j] = 1e18;
    }
  }
  for (int i=0; i<n; ++i) {
    dist[i][i] = 0;
    for (int j=0; j<k; ++j) {
      cin >> A[i][j] >> B[i][j];
    }
  }
  for (int i=0; i<m; ++i) {
    cin >> a >> b >> c;
    --a, --b;
    dist[a][b] = min(dist[a][b], c);
  }
  for (int x=0; x<n; ++x) {
    for (int i=0; i<n; ++i) {
      for (int j=0; j<n; ++j) {
        dist[i][j] = min(dist[i][x] + dist[x][j], dist[i][j]);
      }
    }
  }
  for (int i=0; i<n; ++i) {
    for (int j=0; j<n; ++j) {
      if (i != j) {
        for (int x=0; x<k; ++x) {
          if (min(A[i][x], B[j][x]) != -1) C[i][j] = max(C[i][j], B[j][x]-A[i][x]);
        }
      }
    }
  }
  l = 0, r = 1e9;
  while (l < r) {
    mid = (l+r+1)/2;
    for (int i=0; i<n; ++i) {
      for (int j=0; j<n; ++j) {
        X[i][j] = C[i][j] - mid * dist[i][j];
      }
    }
    for (int x=0; x<n; ++x) {
      for (int i=0; i<n; ++i) {
        for (int j=0; j<n; ++j) {
          X[i][j] = max(X[i][j], min((ll)1e18, X[i][x] + X[x][j]));
        }
      }
    }
    cur = -1e18;
    for (int i=0; i<n; ++i) {
      for (int j=0; j<n; ++j) {
        if (i != j) {
          cur = max(cur, X[i][j]+X[j][i]);
        }
      }
    }
    if (cur >= 0) l = mid;
    else r = mid-1;
  }
  cout << l << '\n';
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 2132 KB Output is correct
2 Correct 36 ms 1372 KB Output is correct
3 Correct 38 ms 1372 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 5 ms 860 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 6 ms 856 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 6 ms 988 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 6 ms 856 KB Output is correct
6 Correct 5 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 6 ms 988 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1372 KB Output is correct
2 Correct 113 ms 3832 KB Output is correct
3 Correct 43 ms 1392 KB Output is correct
4 Correct 46 ms 1804 KB Output is correct
5 Correct 45 ms 1628 KB Output is correct
6 Correct 41 ms 1372 KB Output is correct
7 Correct 7 ms 856 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 7 ms 860 KB Output is correct
10 Correct 7 ms 860 KB Output is correct
11 Incorrect 7 ms 860 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1372 KB Output is correct
2 Correct 113 ms 3832 KB Output is correct
3 Correct 43 ms 1392 KB Output is correct
4 Correct 46 ms 1804 KB Output is correct
5 Correct 45 ms 1628 KB Output is correct
6 Correct 41 ms 1372 KB Output is correct
7 Correct 7 ms 856 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 7 ms 860 KB Output is correct
10 Correct 7 ms 860 KB Output is correct
11 Incorrect 7 ms 860 KB Output isn't correct
12 Halted 0 ms 0 KB -