답안 #531467

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531467	2022-02-28T18:33:13 Z	Alex_tz307	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	127 ms	1300 KB

merchant

#include <bits/stdc++.h>

using namespace std;

const int64_t INF = 1e18L;

void maxSelf(int &x, int y) {
  if (x < y) {
    x = y;
  }
}

void minSelf(int64_t &x, int64_t y) {
  if (y < x) {
    x = y;
  }
}

void FloydWarshall(vector<vector<int64_t>> &d) {
  int n = d.size() - 1;
  for (int k = 1; k <= n; ++k) {
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        minSelf(d[i][j], d[i][k] + d[k][j]);
      }
    }
  }
}

void testCase() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<int>> b(n + 1, vector<int>(k + 1)), s(n + 1, vector<int>(k + 1));
  vector<vector<int64_t>> d(n + 1, vector<int64_t>(n + 1, INF));
  for (int u = 1; u <= n; ++u) {
    for (int i = 1; i <= k; ++i) {
      cin >> b[u][i] >> s[u][i];
    }
  }
  for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    d[u][v] = w;
  }
  FloydWarshall(d);
  vector<vector<int>> profit(n + 1, vector<int>(n + 1));
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      for (int p = 1; p <= k; ++p) {
        if (b[i][p] != -1 && s[j][p] != -1) {
          maxSelf(profit[i][j], s[j][p] - b[i][p]);
        }
      }
    }
  }
  int l = 1, r = 1e9;
  while (l <= r) {
    int mid = (l + r) / 2;
    vector<vector<int64_t>> dp(n + 1, vector<int64_t>(n + 1));
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        dp[i][j] = (int64_t)mid * min(d[i][j], INF / mid) - profit[i][j];
      }
    }
    FloydWarshall(dp);
    bool ok = false;
    for (int v = 1; v <= n; ++v) {
      if (dp[v][v] <= 0) {
        ok = true;
      }
    }
    if (ok) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  cout << r << '\n';
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	50 ms	1228 KB	Output is correct
2	Correct	27 ms	460 KB	Output is correct
3	Correct	30 ms	512 KB	Output is correct
4	Correct	5 ms	332 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	6 ms	332 KB	Output is correct
7	Correct	9 ms	388 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	5 ms	332 KB	Output is correct
10	Correct	6 ms	460 KB	Output is correct
11	Correct	6 ms	380 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	6 ms	388 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	332 KB	Output is correct
2	Correct	9 ms	388 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	5 ms	332 KB	Output is correct
5	Correct	6 ms	460 KB	Output is correct
6	Correct	6 ms	380 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	6 ms	388 KB	Output is correct
9	Correct	6 ms	332 KB	Output is correct
10	Correct	5 ms	332 KB	Output is correct
11	Correct	5 ms	392 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	11 ms	332 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	5 ms	332 KB	Output is correct
16	Correct	8 ms	332 KB	Output is correct
17	Correct	6 ms	332 KB	Output is correct
18	Correct	6 ms	388 KB	Output is correct
19	Correct	8 ms	392 KB	Output is correct
20	Correct	7 ms	392 KB	Output is correct
21	Correct	5 ms	332 KB	Output is correct
22	Correct	7 ms	332 KB	Output is correct
23	Correct	7 ms	332 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	14 ms	392 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	13 ms	332 KB	Output is correct
28	Correct	8 ms	392 KB	Output is correct
29	Correct	7 ms	332 KB	Output is correct
30	Correct	6 ms	332 KB	Output is correct
31	Correct	6 ms	332 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	392 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	13 ms	332 KB	Output is correct
4	Correct	8 ms	392 KB	Output is correct
5	Correct	7 ms	332 KB	Output is correct
6	Correct	6 ms	332 KB	Output is correct
7	Correct	6 ms	332 KB	Output is correct
8	Correct	102 ms	588 KB	Output is correct
9	Correct	127 ms	1120 KB	Output is correct
10	Correct	74 ms	460 KB	Output is correct
11	Correct	104 ms	584 KB	Output is correct
12	Correct	105 ms	532 KB	Output is correct
13	Correct	43 ms	460 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	332 KB	Output is correct
2	Correct	5 ms	332 KB	Output is correct
3	Correct	5 ms	392 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	11 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	5 ms	332 KB	Output is correct
8	Correct	8 ms	332 KB	Output is correct
9	Correct	6 ms	332 KB	Output is correct
10	Correct	6 ms	388 KB	Output is correct
11	Correct	8 ms	392 KB	Output is correct
12	Correct	7 ms	392 KB	Output is correct
13	Correct	5 ms	332 KB	Output is correct
14	Correct	7 ms	332 KB	Output is correct
15	Correct	7 ms	332 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	102 ms	588 KB	Output is correct
18	Correct	127 ms	1120 KB	Output is correct
19	Correct	74 ms	460 KB	Output is correct
20	Correct	104 ms	584 KB	Output is correct
21	Correct	105 ms	532 KB	Output is correct
22	Correct	43 ms	460 KB	Output is correct
23	Correct	14 ms	392 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	13 ms	332 KB	Output is correct
26	Correct	8 ms	392 KB	Output is correct
27	Correct	7 ms	332 KB	Output is correct
28	Correct	6 ms	332 KB	Output is correct
29	Correct	6 ms	332 KB	Output is correct
30	Correct	50 ms	1228 KB	Output is correct
31	Correct	27 ms	460 KB	Output is correct
32	Correct	30 ms	512 KB	Output is correct
33	Correct	5 ms	332 KB	Output is correct
34	Correct	5 ms	376 KB	Output is correct
35	Correct	6 ms	332 KB	Output is correct
36	Correct	9 ms	388 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	5 ms	332 KB	Output is correct
39	Correct	6 ms	460 KB	Output is correct
40	Correct	6 ms	380 KB	Output is correct
41	Correct	0 ms	204 KB	Output is correct
42	Correct	6 ms	388 KB	Output is correct
43	Correct	34 ms	580 KB	Output is correct
44	Correct	35 ms	588 KB	Output is correct
45	Correct	54 ms	1220 KB	Output is correct
46	Correct	33 ms	588 KB	Output is correct
47	Correct	32 ms	588 KB	Output is correct
48	Correct	31 ms	588 KB	Output is correct
49	Correct	94 ms	1220 KB	Output is correct
50	Correct	0 ms	204 KB	Output is correct
51	Correct	0 ms	204 KB	Output is correct
52	Correct	38 ms	524 KB	Output is correct
53	Correct	41 ms	516 KB	Output is correct
54	Correct	31 ms	460 KB	Output is correct
55	Correct	31 ms	536 KB	Output is correct
56	Correct	28 ms	460 KB	Output is correct
57	Correct	0 ms	204 KB	Output is correct
58	Correct	7 ms	332 KB	Output is correct
59	Correct	8 ms	416 KB	Output is correct
60	Correct	11 ms	332 KB	Output is correct
61	Correct	75 ms	1300 KB	Output is correct
62	Correct	75 ms	1192 KB	Output is correct
63	Correct	1 ms	204 KB	Output is correct

답안 #531467

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0