oj.uz

답안 #408380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
408380 2021-05-19T07:15:51 Z syl123456 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 200 ms 3316 KB 
#include <bits/stdc++.h>
#define all(i) (i).begin(), (i).end()
#define debug(x) cerr << "Line(" << __LINE__ << ") -> " << #x << " is " << x << endl
using namespace std;
template<typename T1, typename T2>
ostream& operator << (ostream &i, pair<T1, T2> j) {
    return i << j.first << ' ' << j.second;
}
template<typename T>
ostream& operator << (ostream &i, vector<T> j) {
    i << '{' << j.size() << ':';
    for (T ii : j) i << ' ' << ii;
    return i << '}';
}
typedef long long ll;
typedef pair<int, int> pi;
const int inf = 1e9 + 1;
signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> b(n, vector<int>(k)), s(n, vector<int>(k));
    for (int i = 0; i < n; ++i) for (int j = 0; j < k; ++j)
        cin >> b[i][j] >> s[i][j];
    vector<vector<int>> dis(n, vector<int>(n, inf));
    for (int i = 0; i < n; ++i) dis[i][i] = 0;
    for (int i = 0; i < m; ++i) {
        int x, y, z;
        cin >> x >> y >> z;
        dis[x - 1][y - 1] = z;
    }
    for (int ii = 0; ii < n; ++ii) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j)
        dis[i][j] = min(dis[i][j], dis[i][ii] + dis[ii][j]);
    vector<vector<int>> v(n, vector<int>(n, 0));
    for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) for (int ii = 0; ii < k; ++ii)
        if (~s[j][ii] && ~b[i][ii]) v[i][j] = max(v[i][j], s[j][ii] - b[i][ii]);
    int l = 0, r = inf;
    vector<vector<ll>> tmp(n, vector<ll>(n));
    while (l < r - 1) {
        int mid = l + r >> 1;
        for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j)
            tmp[i][j] = v[i][j] - 1ll * mid * dis[i][j];
        bool ok = false;
        for (int ii = 0; ii < n; ++ii) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) if (dis[i][ii] < inf && dis[ii][j] < inf) {
            if (i == j && i != ii && tmp[i][ii] + tmp[ii][j] >= 0) {
                ok = true;
                goto out;
            }
            tmp[i][j] = max(tmp[i][j], tmp[i][ii] + tmp[ii][j]);
        }
        out:
        if (ok) l = mid;
        else r = mid;
    }
    cout << l;
}
/*
 * 0<x<1e9, 0<=ans<=1e9
 * y/x >= k ? y-kx >= 0
 * 
 * nm all dis
 * logC
 * n^2 v[i][j] = max(s[j][ii] - b[i][ii], all ii) - ans * dis[i][j]
 * n^3 po-cycle
 *
 */

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:40:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   40 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 1256 KB Output is correct
2 Correct 132 ms 476 KB Output is correct
3 Correct 77 ms 460 KB Output is correct
4 Correct 14 ms 364 KB Output is correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 16 ms 368 KB Output is correct
7 Correct 11 ms 408 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 9 ms 372 KB Output is correct
10 Correct 10 ms 372 KB Output is correct
11 Correct 10 ms 368 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 14 ms 336 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 368 KB Output is correct
2 Correct 11 ms 408 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 9 ms 372 KB Output is correct
5 Correct 10 ms 372 KB Output is correct
6 Correct 10 ms 368 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 14 ms 336 KB Output is correct
9 Correct 12 ms 336 KB Output is correct
10 Correct 15 ms 384 KB Output is correct
11 Correct 14 ms 392 KB Output is correct
12 Correct 15 ms 388 KB Output is correct
13 Correct 16 ms 436 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 7 ms 376 KB Output is correct
16 Correct 15 ms 396 KB Output is correct
17 Correct 6 ms 332 KB Output is correct
18 Correct 12 ms 448 KB Output is correct
19 Correct 17 ms 432 KB Output is correct
20 Correct 10 ms 332 KB Output is correct
21 Correct 13 ms 364 KB Output is correct
22 Correct 14 ms 384 KB Output is correct
23 Correct 17 ms 448 KB Output is correct
24 Correct 33 ms 388 KB Output is correct
25 Correct 18 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 18 ms 384 KB Output is correct
28 Correct 14 ms 336 KB Output is correct
29 Correct 12 ms 388 KB Output is correct
30 Correct 11 ms 364 KB Output is correct
31 Correct 10 ms 332 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 18 ms 384 KB Output is correct
4 Correct 14 ms 336 KB Output is correct
5 Correct 12 ms 388 KB Output is correct
6 Correct 11 ms 364 KB Output is correct
7 Correct 10 ms 332 KB Output is correct
8 Correct 110 ms 544 KB Output is correct
9 Correct 185 ms 1156 KB Output is correct
10 Correct 136 ms 500 KB Output is correct
11 Correct 144 ms 548 KB Output is correct
12 Correct 114 ms 544 KB Output is correct
13 Correct 98 ms 496 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 336 KB Output is correct
2 Correct 15 ms 384 KB Output is correct
3 Correct 14 ms 392 KB Output is correct
4 Correct 15 ms 388 KB Output is correct
5 Correct 16 ms 436 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 15 ms 396 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 12 ms 448 KB Output is correct
11 Correct 17 ms 432 KB Output is correct
12 Correct 10 ms 332 KB Output is correct
13 Correct 13 ms 364 KB Output is correct
14 Correct 14 ms 384 KB Output is correct
15 Correct 17 ms 448 KB Output is correct
16 Correct 33 ms 388 KB Output is correct
17 Correct 110 ms 544 KB Output is correct
18 Correct 185 ms 1156 KB Output is correct
19 Correct 136 ms 500 KB Output is correct
20 Correct 144 ms 548 KB Output is correct
21 Correct 114 ms 544 KB Output is correct
22 Correct 98 ms 496 KB Output is correct
23 Correct 18 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 18 ms 384 KB Output is correct
26 Correct 14 ms 336 KB Output is correct
27 Correct 12 ms 388 KB Output is correct
28 Correct 11 ms 364 KB Output is correct
29 Correct 10 ms 332 KB Output is correct
30 Correct 175 ms 1256 KB Output is correct
31 Correct 132 ms 476 KB Output is correct
32 Correct 77 ms 460 KB Output is correct
33 Correct 14 ms 364 KB Output is correct
34 Correct 11 ms 336 KB Output is correct
35 Correct 16 ms 368 KB Output is correct
36 Correct 11 ms 408 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 9 ms 372 KB Output is correct
39 Correct 10 ms 372 KB Output is correct
40 Correct 10 ms 368 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 14 ms 336 KB Output is correct
43 Correct 123 ms 504 KB Output is correct
44 Correct 103 ms 624 KB Output is correct
45 Correct 115 ms 1584 KB Output is correct
46 Correct 114 ms 632 KB Output is correct
47 Correct 120 ms 624 KB Output is correct
48 Correct 104 ms 624 KB Output is correct
49 Correct 200 ms 3140 KB Output is correct
50 Correct 1 ms 208 KB Output is correct
51 Correct 1 ms 316 KB Output is correct
52 Correct 105 ms 512 KB Output is correct
53 Correct 121 ms 588 KB Output is correct
54 Correct 100 ms 536 KB Output is correct
55 Correct 117 ms 512 KB Output is correct
56 Correct 120 ms 500 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 15 ms 500 KB Output is correct
59 Correct 17 ms 460 KB Output is correct
60 Correct 14 ms 500 KB Output is correct
61 Correct 192 ms 3316 KB Output is correct
62 Correct 181 ms 3292 KB Output is correct
63 Correct 1 ms 204 KB Output is correct