oj.uz

답안 #945500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945500 2024-03-14T01:24:18 Z Wael 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 76 ms 4232 KB 
#include <bits/stdc++.h>
using namespace std;
#define log(x) (63^__builtin_clzll(x))
#define endl '\n'
#define all(x) (x).begin() , (x).end()
const int mod = 1e9 + 7, lg = 22 , N = 1e6 + 1;
#define int long long

void solve() {
    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 item = 0; item < k; ++item)
            cin >> b[i][item] >> s[i][item];

    vector<vector<int>> dis(n, vector<int>(n, 1e9)), maxGain(n, vector<int>(n, 0));

    for(int i = 0; i < m; ++i) {
        int u, v, len;
        cin >> u >> v >> len;
        --u, --v;
        dis[u][v] = min(dis[u][v], len);
    }

    for(int mid = 0; mid < n; ++mid) 
        for(int start = 0; start < n; ++start)
            for(int end = 0; end < n; ++end)
                dis[start][end] = min(dis[start][end], dis[start][mid] + dis[mid][end]);
    
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            if(dis[i][j] == 1e9) continue;
            for(int item = 0; item < k; ++item) 
                if(s[j][item] != -1 && b[i][item] != -1)
                   maxGain[i][j] = max(maxGain[i][j], s[j][item] - b[i][item]);
        }
    }
    
    int l = 0, r = 2e9;
    while(l <= r) {
        int mid = (l + r) / 2;
        
        vector<vector<long long>> dp(n, vector<long long>(n, -1e18));
        for(int i = 0; i < n; ++i) {
            for(int j = 0; j < n; ++j) {
                if(dis[i][j] == 1e9) continue;
                dp[i][j] = max(dp[i][j], (long long)maxGain[i][j] - (long long)dis[i][j] * mid);
            }
        }

        for(int mid = 0; mid < n; ++mid) 
            for(int start = 0; start < n; ++start)
                for(int end = 0; end < n; ++end)
                    dp[start][end] = max(dp[start][end], dp[start][mid] + dp[mid][end]);

        int ok = 0;
        for(int i = 0; i < n; ++i) {
            if(dp[i][i] >= 0) ok = 1;
        }

        if(ok) l = mid + 1;
        else r = mid - 1;
    }

    cout << max(0ll, l - 1) << endl;
    return;
}

main() {
    ios_base::sync_with_stdio(false);cout.tie(nullptr);cin.tie(nullptr);
   
    int t;
    //cin >> t; 
    t = 1;
    while(t--) solve();

    return 0;
}

Compilation message

merchant.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main() {
      | ^~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 2140 KB Output is correct
2 Correct 28 ms 604 KB Output is correct
3 Correct 29 ms 600 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 528 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 524 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 344 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 524 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 33 ms 856 KB Output is correct
9 Correct 69 ms 2240 KB Output is correct
10 Correct 31 ms 600 KB Output is correct
11 Correct 33 ms 860 KB Output is correct
12 Correct 35 ms 1072 KB Output is correct
13 Correct 30 ms 600 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 4 ms 568 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 528 KB Output is correct
17 Correct 33 ms 856 KB Output is correct
18 Correct 69 ms 2240 KB Output is correct
19 Correct 31 ms 600 KB Output is correct
20 Correct 33 ms 860 KB Output is correct
21 Correct 35 ms 1072 KB Output is correct
22 Correct 30 ms 600 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 5 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 524 KB Output is correct
29 Correct 4 ms 348 KB Output is correct
30 Correct 50 ms 2140 KB Output is correct
31 Correct 28 ms 604 KB Output is correct
32 Correct 29 ms 600 KB Output is correct
33 Correct 4 ms 348 KB Output is correct
34 Correct 4 ms 528 KB Output is correct
35 Correct 6 ms 348 KB Output is correct
36 Correct 4 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 524 KB Output is correct
39 Correct 4 ms 348 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 4 ms 344 KB Output is correct
43 Correct 29 ms 600 KB Output is correct
44 Correct 31 ms 856 KB Output is correct
45 Correct 43 ms 2448 KB Output is correct
46 Correct 31 ms 932 KB Output is correct
47 Correct 31 ms 860 KB Output is correct
48 Correct 31 ms 860 KB Output is correct
49 Correct 74 ms 3932 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 29 ms 604 KB Output is correct
53 Correct 30 ms 600 KB Output is correct
54 Correct 30 ms 600 KB Output is correct
55 Correct 29 ms 604 KB Output is correct
56 Correct 29 ms 604 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 5 ms 684 KB Output is correct
59 Correct 5 ms 600 KB Output is correct
60 Correct 5 ms 600 KB Output is correct
61 Correct 75 ms 4232 KB Output is correct
62 Correct 76 ms 3960 KB Output is correct
63 Correct 0 ms 344 KB Output is correct