oj.uz

답안 #603151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
603151 2022-07-23T16:04:54 Z AA_Surely 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 133 ms 4188 KB 
#include <bits/stdc++.h>

#define FOR(i, x, n) for(int i = x; i < n; i++)
#define F0R(i, n) FOR(i, 0, n)
#define ROF(i, x, n) for(int i = n - 1; i >= x; i--)
#define R0F(i, n) ROF(i, 0, n)

#define WTF cout << "WTF" << endl

#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define F first
#define PB push_back

#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()

using namespace std;

typedef long long LL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, PII> PPI;

typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;

const int N = 100 + 7;
const int K = 1000 + 7;
const LL INF = 1e18;

#define B 0
#define S 1

LL n, m, k;
LL dist[N][N], obj[N][K][2], opt[N][N], adj[N][N];

void init() {
    cin >> n >> m >> k;
    F0R(i, n) F0R(j, k) cin >> obj[i][j][B] >> obj[i][j][S];
    
    F0R(i, n) F0R(j, n) dist[i][j] = INF;
    F0R(i, n) dist[i][i] = 0;

    F0R(i, m) {
        int u, v, w;
        cin >> u >> v >> w;
        u--; v--;
        dist[u][v] = w;
    }

    return;
}

void precalc() {
    F0R(x, n) F0R(i, n) F0R(j, n)
        dist[i][j] = min(dist[i][j], dist[i][x] + dist[x][j]);

    F0R(i, n) F0R(j, n) F0R(x, k) if (obj[i][x][B] != -1 && obj[j][x][S] != -1) 
        opt[i][j] = max(opt[i][j], - obj[i][x][B] + obj[j][x][S]);

    return;
}

bool check(LL m) {
    F0R(i, n) F0R(j, n) adj[i][j] = -INF;

    F0R(i, n) F0R(j, n) 
        if (dist[i][j] != INF && i != j) adj[i][j] = opt[i][j] - m * dist[i][j];

    F0R(go, n) F0R(i, n) F0R(j, n) if (adj[i][j] != INF) 
        adj[i][j] = max(adj[i][j], min(INF, adj[i][go] + adj[go][j]));

    F0R(i, n) if (adj[i][i] >= 0) return 1;
    return 0;
}

int main() {
    IOS;

    init();
    precalc();
    
    //cout << check(2) << endl;
    //F0R(i, 10) cout << check(i) << ' '; cout << endl; return 0;

    LL l = 0, r = 1e9, mid;
    while(l < r) {
        mid = (l + r) >> 1;
        if (check(mid)) l = mid + 1;
        else r = mid;
    }

    cout << l - 1 << endl;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 2056 KB Output is correct
2 Correct 47 ms 852 KB Output is correct
3 Correct 42 ms 852 KB Output is correct
4 Correct 10 ms 584 KB Output is correct
5 Correct 7 ms 596 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 11 ms 668 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 11 ms 616 KB Output is correct
10 Correct 11 ms 596 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 9 ms 664 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 596 KB Output is correct
2 Correct 11 ms 668 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 11 ms 616 KB Output is correct
5 Correct 11 ms 596 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 9 ms 664 KB Output is correct
9 Correct 10 ms 676 KB Output is correct
10 Correct 9 ms 664 KB Output is correct
11 Correct 11 ms 692 KB Output is correct
12 Correct 8 ms 596 KB Output is correct
13 Correct 11 ms 708 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 7 ms 596 KB Output is correct
16 Correct 8 ms 708 KB Output is correct
17 Correct 8 ms 624 KB Output is correct
18 Correct 9 ms 688 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 11 ms 712 KB Output is correct
21 Correct 7 ms 596 KB Output is correct
22 Correct 9 ms 596 KB Output is correct
23 Correct 18 ms 656 KB Output is correct
24 Correct 7 ms 596 KB Output is correct
25 Correct 7 ms 596 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 8 ms 712 KB Output is correct
28 Correct 8 ms 708 KB Output is correct
29 Correct 8 ms 708 KB Output is correct
30 Correct 9 ms 664 KB Output is correct
31 Correct 9 ms 596 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 596 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 8 ms 712 KB Output is correct
4 Correct 8 ms 708 KB Output is correct
5 Correct 8 ms 708 KB Output is correct
6 Correct 9 ms 664 KB Output is correct
7 Correct 9 ms 596 KB Output is correct
8 Correct 74 ms 1132 KB Output is correct
9 Correct 107 ms 2140 KB Output is correct
10 Correct 65 ms 1032 KB Output is correct
11 Correct 68 ms 1148 KB Output is correct
12 Correct 65 ms 1348 KB Output is correct
13 Correct 53 ms 1108 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 676 KB Output is correct
2 Correct 9 ms 664 KB Output is correct
3 Correct 11 ms 692 KB Output is correct
4 Correct 8 ms 596 KB Output is correct
5 Correct 11 ms 708 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 8 ms 708 KB Output is correct
9 Correct 8 ms 624 KB Output is correct
10 Correct 9 ms 688 KB Output is correct
11 Correct 10 ms 596 KB Output is correct
12 Correct 11 ms 712 KB Output is correct
13 Correct 7 ms 596 KB Output is correct
14 Correct 9 ms 596 KB Output is correct
15 Correct 18 ms 656 KB Output is correct
16 Correct 7 ms 596 KB Output is correct
17 Correct 74 ms 1132 KB Output is correct
18 Correct 107 ms 2140 KB Output is correct
19 Correct 65 ms 1032 KB Output is correct
20 Correct 68 ms 1148 KB Output is correct
21 Correct 65 ms 1348 KB Output is correct
22 Correct 53 ms 1108 KB Output is correct
23 Correct 7 ms 596 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 8 ms 712 KB Output is correct
26 Correct 8 ms 708 KB Output is correct
27 Correct 8 ms 708 KB Output is correct
28 Correct 9 ms 664 KB Output is correct
29 Correct 9 ms 596 KB Output is correct
30 Correct 67 ms 2056 KB Output is correct
31 Correct 47 ms 852 KB Output is correct
32 Correct 42 ms 852 KB Output is correct
33 Correct 10 ms 584 KB Output is correct
34 Correct 7 ms 596 KB Output is correct
35 Correct 7 ms 596 KB Output is correct
36 Correct 11 ms 668 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 11 ms 616 KB Output is correct
39 Correct 11 ms 596 KB Output is correct
40 Correct 7 ms 596 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 9 ms 664 KB Output is correct
43 Correct 55 ms 1012 KB Output is correct
44 Correct 66 ms 1208 KB Output is correct
45 Correct 74 ms 2636 KB Output is correct
46 Correct 55 ms 1200 KB Output is correct
47 Correct 57 ms 1212 KB Output is correct
48 Correct 66 ms 1208 KB Output is correct
49 Correct 121 ms 4032 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 51 ms 980 KB Output is correct
53 Correct 59 ms 980 KB Output is correct
54 Correct 54 ms 976 KB Output is correct
55 Correct 53 ms 1024 KB Output is correct
56 Correct 65 ms 952 KB Output is correct
57 Correct 1 ms 324 KB Output is correct
58 Correct 12 ms 844 KB Output is correct
59 Correct 13 ms 844 KB Output is correct
60 Correct 10 ms 844 KB Output is correct
61 Correct 123 ms 4184 KB Output is correct
62 Correct 133 ms 4188 KB Output is correct
63 Correct 1 ms 340 KB Output is correct