oj.uz

Submission #101039

# Submission time Handle Problem Language Result Execution time Memory
101039 2019-03-16T06:01:27 Z oolimry Travelling Merchant (APIO17_merchant) C++14
100 / 100
 150 ms 2340 KB 
#include <bits/stdc++.h>
using namespace std;
long long inf = 1000000000000000ll;
int main()
{
    int n, m, t;
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m >> t;

    static long long buy[105][1005];
    static long long sell[105][1005];
    static long long dist[105][105];
    static long long profit[105][105];

    for(int i = 0;i < n;i++){
        for(int j = 0;j < n;j++){
            buy[i][j] = inf;
            sell[i][j] = inf;
            profit[i][j] = 0;
            dist[i][j] = inf;
        }
    }

    for(int i = 0;i < n;i++){
        for(int k = 0;k < t;k++){
            cin >> buy[i][k];
            cin >> sell[i][k];
        }
    }

    ///Max Profit btw two nodes
    for(int i = 0;i < n;i++){
        for(int j = 0;j < n;j++){
            for(int k = 0;k < t;k++){
                if(buy[i][k] != -1 && sell[j][k] != -1)
                    profit[i][j] = max(profit[i][j],sell[j][k] -  buy[i][k]);

            }
        }
    }

    ///adjMat
    for(int i = 0;i < m;i++){
        int a, b, c;
        cin >> a >> b >> c;
        a--;
        b--;
        dist[a][b] = c;
    }

    ///Floyd
    for(int k = 0;k < n;k++){
        for(int i = 0;i < n;i++){
            for(int j = 0;j < n;j++){
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }

    ///p/d >= v
    ///p - dv >= 0 for a cycle, where p is total profit, d is total distance
    ///monotonous in terms of v
    static long long diff[105][105];

    long long low = 0ll;
    long long high = inf;
    while(true){
        if(low == high - 1) break;
        long long v = (low + high) / 2ll;
        for(int i =0 ;i < n;i++){
            for(int j = 0;j < n;j++){
                ///new graph with edge weight = p - dv
                diff[i][j] = profit[i][j] - v * min(inf/v,dist[i][j]);
            }
        }

        ///Floyd
        for(int k = 0;k < n;k++){
            for(int i = 0;i < n;i++){
                for(int j = 0;j < n;j++){
                    diff[i][j] = max(diff[i][j], diff[i][k] + diff[k][j]);

                }
            }
        }

        bool can = false;
        for(int i = 0;i < n;i++){
            if(diff[i][i] >= 0){
                can = true;
                break;
            }
        }
        if(can) low = v;
        else high = v;
    }
    cout << low;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 2168 KB Output is correct
2 Correct 60 ms 1656 KB Output is correct
3 Correct 68 ms 1604 KB Output is correct
4 Correct 12 ms 896 KB Output is correct
5 Correct 14 ms 896 KB Output is correct
6 Correct 12 ms 896 KB Output is correct
7 Correct 14 ms 972 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 13 ms 896 KB Output is correct
10 Correct 12 ms 896 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 1536 KB Output is correct
2 Correct 111 ms 2168 KB Output is correct
3 Correct 73 ms 1536 KB Output is correct
4 Correct 72 ms 1536 KB Output is correct
5 Correct 75 ms 1536 KB Output is correct
6 Correct 71 ms 1664 KB Output is correct
7 Correct 15 ms 896 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 12 ms 896 KB Output is correct
10 Correct 16 ms 896 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 13 ms 896 KB Output is correct
13 Correct 12 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 896 KB Output is correct
2 Correct 14 ms 896 KB Output is correct
3 Correct 12 ms 896 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 18 ms 1008 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 13 ms 896 KB Output is correct
8 Correct 12 ms 896 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 13 ms 896 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 13 ms 896 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 14 ms 896 KB Output is correct
15 Correct 15 ms 896 KB Output is correct
16 Correct 13 ms 896 KB Output is correct
17 Correct 88 ms 1536 KB Output is correct
18 Correct 111 ms 2168 KB Output is correct
19 Correct 73 ms 1536 KB Output is correct
20 Correct 72 ms 1536 KB Output is correct
21 Correct 75 ms 1536 KB Output is correct
22 Correct 71 ms 1664 KB Output is correct
23 Correct 15 ms 896 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 12 ms 896 KB Output is correct
26 Correct 16 ms 896 KB Output is correct
27 Correct 12 ms 896 KB Output is correct
28 Correct 13 ms 896 KB Output is correct
29 Correct 12 ms 896 KB Output is correct
30 Correct 77 ms 1608 KB Output is correct
31 Correct 79 ms 1536 KB Output is correct
32 Correct 110 ms 2228 KB Output is correct
33 Correct 69 ms 1604 KB Output is correct
34 Correct 74 ms 1616 KB Output is correct
35 Correct 70 ms 1536 KB Output is correct
36 Correct 119 ms 2168 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 3 ms 512 KB Output is correct
39 Correct 96 ms 1536 KB Output is correct
40 Correct 78 ms 1536 KB Output is correct
41 Correct 111 ms 1536 KB Output is correct
42 Correct 75 ms 1664 KB Output is correct
43 Correct 68 ms 1536 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 16 ms 896 KB Output is correct
46 Correct 16 ms 1024 KB Output is correct
47 Correct 13 ms 1024 KB Output is correct
48 Correct 150 ms 2296 KB Output is correct
49 Correct 148 ms 2340 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 104 ms 2168 KB Output is correct
52 Correct 60 ms 1656 KB Output is correct
53 Correct 68 ms 1604 KB Output is correct
54 Correct 12 ms 896 KB Output is correct
55 Correct 14 ms 896 KB Output is correct
56 Correct 12 ms 896 KB Output is correct
57 Correct 14 ms 972 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 13 ms 896 KB Output is correct
60 Correct 12 ms 896 KB Output is correct
61 Correct 12 ms 896 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 11 ms 896 KB Output is correct