oj.uz

답안 #250817

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250817 2020-07-19T08:55:15 Z receed 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 84 ms 4216 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <string>
#include <set>
#include <map>
#include <random>
#include <bitset>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;

const int N = 101, K = 1001;
ll inf = 1e15;
ll md[N][N], mx[N][N], b[N][K], s[N][K], g[N][N];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    ll n, m, k, u, v, w;
    cin >> n >> m >> k;
    rep(i, n)
        rep(j, k) {
            cin >> b[i][j] >> s[i][j];
            if (b[i][j] < 0)
                b[i][j] = inf;
        }
    rep(i, n)
        rep(j, n) {
            md[i][j] = inf;
            rep(l, k)
                mx[i][j] = max(mx[i][j], s[j][l] - b[i][l]);
        }
    rep(i, m) {
        cin >> u >> v >> w;
        u--; v--;
        md[u][v] = min(md[u][v], w);
    }
    rep(i, n)
        rep(j, n)
            rep(l, n)
                md[j][l] = min(md[j][l], md[j][i] + md[i][l]);
    ll cl = 0, cr = 1e9, cm;
    while (cr - cl > 1) {
        cm = (cl + cr) / 2;
        rep(i, n)
            rep(j, n) {
                if (i == j || md[i][j] == inf)
                    g[i][j] = -inf;
                else
                    g[i][j] = mx[i][j] - cm * md[i][j];
            }
        rep(i, n)
            rep(j, n)
                rep(l, n)
                    g[j][l] = max(g[j][l], g[j][i] + g[i][l]);
        rep(i, n)
            if (g[i][i] >= 0)
                cl = cm;
        if (cl != cm)
            cr = cm;
    }
    cout << cl;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 3064 KB Output is correct
2 Correct 36 ms 1432 KB Output is correct
3 Correct 37 ms 1408 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 6 ms 896 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 6 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 6 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 1784 KB Output is correct
2 Correct 73 ms 2936 KB Output is correct
3 Correct 40 ms 1536 KB Output is correct
4 Correct 41 ms 1792 KB Output is correct
5 Correct 52 ms 1792 KB Output is correct
6 Correct 39 ms 1536 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 1024 KB Output is correct
10 Correct 12 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 6 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 896 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 6 ms 896 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 6 ms 896 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 6 ms 896 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 6 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 6 ms 896 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 7 ms 1024 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 56 ms 1784 KB Output is correct
18 Correct 73 ms 2936 KB Output is correct
19 Correct 40 ms 1536 KB Output is correct
20 Correct 41 ms 1792 KB Output is correct
21 Correct 52 ms 1792 KB Output is correct
22 Correct 39 ms 1536 KB Output is correct
23 Correct 6 ms 896 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 6 ms 1024 KB Output is correct
26 Correct 12 ms 896 KB Output is correct
27 Correct 7 ms 896 KB Output is correct
28 Correct 6 ms 896 KB Output is correct
29 Correct 6 ms 896 KB Output is correct
30 Correct 49 ms 1408 KB Output is correct
31 Correct 40 ms 1664 KB Output is correct
32 Correct 57 ms 2680 KB Output is correct
33 Correct 40 ms 1536 KB Output is correct
34 Correct 40 ms 1664 KB Output is correct
35 Correct 44 ms 1784 KB Output is correct
36 Correct 75 ms 4088 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 37 ms 1408 KB Output is correct
40 Correct 41 ms 1536 KB Output is correct
41 Correct 39 ms 1408 KB Output is correct
42 Correct 38 ms 1408 KB Output is correct
43 Correct 38 ms 1408 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 8 ms 1024 KB Output is correct
46 Correct 8 ms 1024 KB Output is correct
47 Correct 7 ms 1024 KB Output is correct
48 Correct 84 ms 4216 KB Output is correct
49 Correct 81 ms 4216 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 70 ms 3064 KB Output is correct
52 Correct 36 ms 1432 KB Output is correct
53 Correct 37 ms 1408 KB Output is correct
54 Correct 6 ms 896 KB Output is correct
55 Correct 6 ms 896 KB Output is correct
56 Correct 6 ms 896 KB Output is correct
57 Correct 6 ms 896 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 6 ms 896 KB Output is correct
60 Correct 6 ms 896 KB Output is correct
61 Correct 5 ms 896 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 6 ms 896 KB Output is correct