oj.uz

Submission #274887

# Submission time Handle Problem Language Result Execution time Memory
274887 2020-08-19T20:46:12 Z infinitepro Travelling Merchant (APIO17_merchant) C++17
100 / 100
 137 ms 8312 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define int ll

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

#define INF INT_MAX
#define MOD 1000000007
#define all(x) x.begin(), x.end()

bool calc(vvi &dist, vvi &profit, int &N, int R){
    vvi G(N, vi(N, -INF));
    for(int u = 0; u < N; u++){
        for(int v = 0; v < N; v++){
            if(u == v || dist[u][v] == INF) continue;
            G[u][v] = profit[u][v] - R*dist[u][v];
        }
    }

    for(int i = 0; i < N; i++)
        for(int u = 0; u < N; u++)
            for(int v = 0; v < N; v++)
                G[u][v] = max(G[u][v], G[u][i]+G[i][v]);
    
    for(int x = 0; x < N; x++)
        if(G[x][x] >= 0) return true;
    return false;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int N, M, K; cin >> N >> M >> K;
    vector<vvi> C(N, vvi(K, vi(2))); // C[i][k] = {buy, sell}
    for(int x = 0; x < N; x++)
        for(int k = 0; k < K; k++)
            cin >> C[x][k][0] >> C[x][k][1];
    
    vvi dist(N, vi(N, INF)), profit(N, vi(N));
    while(M--){
        int u, v, c; cin >> u >> v >> c;
        u--, v--; dist[u][v] = c;
    }
    for(int x = 0; x < N; x++) dist[x][x] = 0;

    for(int i = 0; i < N; i++)
        for(int u = 0; u < N; u++)
            for(int v = 0; v < N; v++)
                dist[u][v] = min(dist[u][v], dist[u][i]+dist[i][v]);

    for(int u = 0; u < N; u++){
        for(int v = 0; v < N; v++){
            for(int k = 0; k < K; k++){
                if(C[u][k][0] != -1 && C[v][k][1] != -1)
                    profit[u][v] = max(profit[u][v], C[v][k][1]-C[u][k][0]);
            }
        }
    }

    int low = 0, high = 1e9;
    while(low < high){
        int mid = (low+high+1)/2;
        if(calc(dist, profit, N, mid)) low = mid;
        else high = mid-1;
    }

    cout << low << endl;

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 7288 KB Output is correct
2 Correct 40 ms 640 KB Output is correct
3 Correct 40 ms 640 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 7 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 8 ms 640 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 8 ms 640 KB Output is correct
12 Correct 8 ms 640 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 12 ms 640 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 8 ms 512 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 8 ms 640 KB Output is correct
20 Correct 8 ms 640 KB Output is correct
21 Correct 8 ms 640 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 7 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 7 ms 512 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 1280 KB Output is correct
2 Correct 124 ms 7380 KB Output is correct
3 Correct 49 ms 896 KB Output is correct
4 Correct 51 ms 1400 KB Output is correct
5 Correct 52 ms 1404 KB Output is correct
6 Correct 45 ms 948 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 8 ms 640 KB Output is correct
10 Correct 8 ms 640 KB Output is correct
11 Correct 8 ms 640 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 8 ms 640 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 8 ms 640 KB Output is correct
12 Correct 8 ms 640 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 12 ms 640 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 59 ms 1280 KB Output is correct
18 Correct 124 ms 7380 KB Output is correct
19 Correct 49 ms 896 KB Output is correct
20 Correct 51 ms 1400 KB Output is correct
21 Correct 52 ms 1404 KB Output is correct
22 Correct 45 ms 948 KB Output is correct
23 Correct 8 ms 512 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 8 ms 640 KB Output is correct
26 Correct 8 ms 640 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 49 ms 768 KB Output is correct
31 Correct 47 ms 1152 KB Output is correct
32 Correct 93 ms 5504 KB Output is correct
33 Correct 45 ms 1260 KB Output is correct
34 Correct 44 ms 1272 KB Output is correct
35 Correct 44 ms 1152 KB Output is correct
36 Correct 126 ms 8056 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 41 ms 640 KB Output is correct
40 Correct 45 ms 768 KB Output is correct
41 Correct 43 ms 896 KB Output is correct
42 Correct 46 ms 768 KB Output is correct
43 Correct 41 ms 640 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 9 ms 768 KB Output is correct
46 Correct 11 ms 768 KB Output is correct
47 Correct 10 ms 768 KB Output is correct
48 Correct 131 ms 8312 KB Output is correct
49 Correct 137 ms 8076 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 78 ms 7288 KB Output is correct
52 Correct 40 ms 640 KB Output is correct
53 Correct 40 ms 640 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 6 ms 384 KB Output is correct
56 Correct 6 ms 384 KB Output is correct
57 Correct 7 ms 512 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 7 ms 384 KB Output is correct
61 Correct 6 ms 384 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 7 ms 512 KB Output is correct