oj.uz

Submission #768517

# Submission time Handle Problem Language Result Execution time Memory
768517 2023-06-28T08:32:16 Z raysh07 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 74 ms 4432 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

int n, m, k;
const int N = 101;
const int K = 1e3 + 1;
int buy[N][K];
int sell[N][K];
vector <pair<int, int>> adj[N];
int floyd[N][N];
int best[N][N];

bool check(int x){
    vector<vector<int>> ok(n + 1, vector<int>(n + 1, -INF));
    
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            if (floyd[i][j] == INF) continue;
            
            ok[i][j] = max(ok[i][j], best[i][j] - x * floyd[i][j]);
        }
    }
    
    for (int k = 1; k <= n; k++){
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= n; j++){
                ok[i][j] = max(ok[i][j], ok[i][k] + ok[k][j]);
                if (ok[i][j] > INF) ok[i][j] = INF;
            }
        }
    }
    
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            if (i != j && ok[i][j] + ok[j][i] >= 0) return true;
        }
    }
    
    return false;
}

void Solve() 
{
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= k; j++){
            cin >> buy[i][j] >> sell[i][j];
            if (buy[i][j] == -1) buy[i][j] = INF;
            if (sell[i][j] == -1) sell[i][j] = 0;
        }
    }
    
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++){
            floyd[i][j] = INF;
        }
    }
    
    for (int i = 1; i <= m; i++) {
        int u, v, w; cin >> u >> v >> w;
        
        adj[u].push_back({v, w});
        floyd[u][v] = w;
    }
    
    for (int k = 1; k <= n; k++){
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= n; j++){
                floyd[i][j] = min(floyd[i][j], floyd[i][k] + floyd[k][j]);
            }
        }
    }
    
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            for (int i1 = 1; i1 <= k; i1++){
                best[i][j] = max(best[i][j], sell[j][i1] - buy[i][i1]);
            }
        }
    }
    
    int lo = 0, hi = 1e9;
    while (lo != hi){
        int mid = (lo + hi + 1) / 2;
        
        if (check(mid)) lo = mid;
        else hi = mid - 1;
    }
    
    cout << lo << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 2132 KB Output is correct
2 Correct 52 ms 1364 KB Output is correct
3 Correct 45 ms 1368 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 6 ms 916 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 7 ms 876 KB Output is correct
10 Correct 8 ms 852 KB Output is correct
11 Correct 7 ms 880 KB Output is correct
12 Correct 1 ms 500 KB Output is correct
13 Correct 6 ms 912 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 6 ms 916 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 7 ms 876 KB Output is correct
5 Correct 8 ms 852 KB Output is correct
6 Correct 7 ms 880 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 6 ms 912 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 892 KB Output is correct
13 Correct 7 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 6 ms 888 KB Output is correct
18 Correct 10 ms 908 KB Output is correct
19 Correct 7 ms 852 KB Output is correct
20 Correct 6 ms 920 KB Output is correct
21 Correct 10 ms 952 KB Output is correct
22 Correct 7 ms 860 KB Output is correct
23 Correct 7 ms 1056 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 6 ms 860 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 6 ms 976 KB Output is correct
28 Correct 7 ms 860 KB Output is correct
29 Correct 7 ms 976 KB Output is correct
30 Correct 7 ms 864 KB Output is correct
31 Correct 6 ms 864 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 860 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 6 ms 976 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 7 ms 976 KB Output is correct
6 Correct 7 ms 864 KB Output is correct
7 Correct 6 ms 864 KB Output is correct
8 Correct 54 ms 1516 KB Output is correct
9 Correct 67 ms 3908 KB Output is correct
10 Correct 46 ms 1532 KB Output is correct
11 Correct 54 ms 1732 KB Output is correct
12 Correct 48 ms 1752 KB Output is correct
13 Correct 46 ms 1492 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 892 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 6 ms 888 KB Output is correct
10 Correct 10 ms 908 KB Output is correct
11 Correct 7 ms 852 KB Output is correct
12 Correct 6 ms 920 KB Output is correct
13 Correct 10 ms 952 KB Output is correct
14 Correct 7 ms 860 KB Output is correct
15 Correct 7 ms 1056 KB Output is correct
16 Correct 6 ms 860 KB Output is correct
17 Correct 54 ms 1516 KB Output is correct
18 Correct 67 ms 3908 KB Output is correct
19 Correct 46 ms 1532 KB Output is correct
20 Correct 54 ms 1732 KB Output is correct
21 Correct 48 ms 1752 KB Output is correct
22 Correct 46 ms 1492 KB Output is correct
23 Correct 6 ms 860 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 6 ms 976 KB Output is correct
26 Correct 7 ms 860 KB Output is correct
27 Correct 7 ms 976 KB Output is correct
28 Correct 7 ms 864 KB Output is correct
29 Correct 6 ms 864 KB Output is correct
30 Correct 65 ms 2132 KB Output is correct
31 Correct 52 ms 1364 KB Output is correct
32 Correct 45 ms 1368 KB Output is correct
33 Correct 6 ms 852 KB Output is correct
34 Correct 6 ms 852 KB Output is correct
35 Correct 6 ms 852 KB Output is correct
36 Correct 6 ms 916 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 7 ms 876 KB Output is correct
39 Correct 8 ms 852 KB Output is correct
40 Correct 7 ms 880 KB Output is correct
41 Correct 1 ms 500 KB Output is correct
42 Correct 6 ms 912 KB Output is correct
43 Correct 45 ms 1364 KB Output is correct
44 Correct 47 ms 1588 KB Output is correct
45 Correct 60 ms 2608 KB Output is correct
46 Correct 54 ms 1580 KB Output is correct
47 Correct 47 ms 1620 KB Output is correct
48 Correct 47 ms 1620 KB Output is correct
49 Correct 71 ms 4072 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 45 ms 1364 KB Output is correct
53 Correct 63 ms 1852 KB Output is correct
54 Correct 46 ms 1364 KB Output is correct
55 Correct 46 ms 1364 KB Output is correct
56 Correct 47 ms 1364 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 7 ms 1040 KB Output is correct
59 Correct 7 ms 1048 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 73 ms 4432 KB Output is correct
62 Correct 74 ms 4404 KB Output is correct
63 Correct 1 ms 340 KB Output is correct