oj.uz

Submission #52095

# Submission time Handle Problem Language Result Execution time Memory
52095 2018-06-23T20:35:28 Z Angelos Travelling Merchant (APIO17_merchant) C++17
100 / 100
 404 ms 1852 KB 
#include <iostream>
#include <cstring>
#define MAXN 103
#define MAXK 1003
const long long INF = 1e10;
using namespace std;
typedef long long ll;
int N , M , K , T[MAXN][MAXN] , B[MAXN][MAXK] , S[MAXN][MAXK];
long long profit[MAXN][MAXN] , adj[MAXN][MAXN] , adj2[MAXN][MAXN]  , dist[MAXN][MAXN];

bool check(ll x){
    for(int i=1; i<=N; i++){
        for(int j=1; j<=N; j++){
            if(i == j || dist[i][j] == INF){adj[i][j] = -INF; continue;}
            adj[i][j] = (ll)profit[i][j] - (ll)dist[i][j]*x;
            adj[i][j] = max(-INF, adj[i][j]);
        }
    }



    for(int k=1; k<=N; k++)
        for(int i=1; i<=N; i++)
            for(int j=1; j<=N; j++){
                adj[i][j] = max(adj[i][j] , adj[i][k] + adj[k][j]);

                if(adj[i][i] >= 0) return true;

                adj[i][j] = min(INF , adj[i][j]);
                adj2[i][j] = adj[i][j];
            }


    /*cout << endl;

    for(int i=1; i<=N; i++){
        for(int j=1; j<=N; j++)
            cout << adj[i][j] << " " ;
        cout << endl;
    }

    cout << endl;*/

    for(int k=1; k<=N; k++)
        for(int i=1; i<=N; i++)
            for(int j=1; j<=N; j++){
                adj2[i][j] = max(adj2[i][j] , adj2[i][k] + adj2[k][j]);
                if(adj2[i][j] > adj[i][j]) return true;
            }

    return false;
}

int main(){
    cin >> N >> M >> K;


    for(int i=1; i<=N; i++)
        for(int k=0; k<K; k++)  cin >> B[i][k] >> S[i][k];


    for(int i=0; i<=N; i++)
        for(int j=0; j<=N; j++) dist[i][j] = INF;

    for(int i=1; i<=N; i++)    dist[i][i] = 0;

    for(int i=0; i<M; i++){
        int u,v;
        ll w; cin >> u >> v >> w;

        dist[u][v] = min(dist[u][v] , w);
    }



    for(int k=1; k<=N; k++)
        for(int i=1; i<=N; i++)
            for(int j=1; j<=N; j++)
                    dist[i][j] = min(dist[i][j] , dist[i][k] + dist[k][j]);


    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++){
            profit[i][j] = 0;
            for(int k=0; k<K; k++){
                if(B[i][k] == -1 || S[j][k] == -1) continue;
                profit[i][j] = max(profit[i][j] , (ll)S[j][k] - (ll)B[i][k]);
            }
        }


    /*for(int i=1; i<=N; i++){
        for(int j=1; j<=N; j++)
            cout << dist[i][j] << " " ;
        cout << endl;
    }*/

    long long low = 1 , high = 1e9 + 1 , ANS = 0;


    while(low <= high){
        ll mid = (low + high)/2;

        //cout << low << " " << mid << " " << high << endl;

        if(check(mid)) {ANS = max(ANS , mid); low = mid + 1;}
        else    high = mid - 1;
    }

    cout << ANS << endl;



    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 1400 KB Output is correct
2 Correct 122 ms 1640 KB Output is correct
3 Correct 72 ms 1640 KB Output is correct
4 Correct 16 ms 1640 KB Output is correct
5 Correct 14 ms 1640 KB Output is correct
6 Correct 18 ms 1640 KB Output is correct
7 Correct 14 ms 1640 KB Output is correct
8 Correct 2 ms 1640 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 12 ms 1640 KB Output is correct
11 Correct 13 ms 1640 KB Output is correct
12 Correct 2 ms 1640 KB Output is correct
13 Correct 20 ms 1640 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 1744 KB Output is correct
2 Correct 222 ms 1744 KB Output is correct
3 Correct 110 ms 1744 KB Output is correct
4 Correct 131 ms 1788 KB Output is correct
5 Correct 92 ms 1832 KB Output is correct
6 Correct 100 ms 1832 KB Output is correct
7 Correct 19 ms 1640 KB Output is correct
8 Correct 2 ms 1640 KB Output is correct
9 Correct 15 ms 1640 KB Output is correct
10 Correct 15 ms 1640 KB Output is correct
11 Correct 18 ms 1640 KB Output is correct
12 Correct 14 ms 1640 KB Output is correct
13 Correct 13 ms 1640 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1640 KB Output is correct
2 Correct 15 ms 1640 KB Output is correct
3 Correct 19 ms 1640 KB Output is correct
4 Correct 16 ms 1640 KB Output is correct
5 Correct 18 ms 1640 KB Output is correct
6 Correct 2 ms 1640 KB Output is correct
7 Correct 15 ms 1640 KB Output is correct
8 Correct 18 ms 1640 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 14 ms 1640 KB Output is correct
11 Correct 16 ms 1640 KB Output is correct
12 Correct 16 ms 1640 KB Output is correct
13 Correct 15 ms 1640 KB Output is correct
14 Correct 15 ms 1640 KB Output is correct
15 Correct 16 ms 1640 KB Output is correct
16 Correct 15 ms 1640 KB Output is correct
17 Correct 113 ms 1744 KB Output is correct
18 Correct 222 ms 1744 KB Output is correct
19 Correct 110 ms 1744 KB Output is correct
20 Correct 131 ms 1788 KB Output is correct
21 Correct 92 ms 1832 KB Output is correct
22 Correct 100 ms 1832 KB Output is correct
23 Correct 19 ms 1640 KB Output is correct
24 Correct 2 ms 1640 KB Output is correct
25 Correct 15 ms 1640 KB Output is correct
26 Correct 15 ms 1640 KB Output is correct
27 Correct 18 ms 1640 KB Output is correct
28 Correct 14 ms 1640 KB Output is correct
29 Correct 13 ms 1640 KB Output is correct
30 Correct 110 ms 1832 KB Output is correct
31 Correct 118 ms 1832 KB Output is correct
32 Correct 150 ms 1832 KB Output is correct
33 Correct 123 ms 1832 KB Output is correct
34 Correct 122 ms 1832 KB Output is correct
35 Correct 119 ms 1832 KB Output is correct
36 Correct 270 ms 1836 KB Output is correct
37 Correct 2 ms 1836 KB Output is correct
38 Correct 2 ms 1836 KB Output is correct
39 Correct 103 ms 1836 KB Output is correct
40 Correct 127 ms 1852 KB Output is correct
41 Correct 117 ms 1852 KB Output is correct
42 Correct 404 ms 1852 KB Output is correct
43 Correct 121 ms 1852 KB Output is correct
44 Correct 2 ms 1852 KB Output is correct
45 Correct 22 ms 1852 KB Output is correct
46 Correct 23 ms 1852 KB Output is correct
47 Correct 20 ms 1852 KB Output is correct
48 Correct 248 ms 1852 KB Output is correct
49 Correct 237 ms 1852 KB Output is correct
50 Correct 2 ms 1852 KB Output is correct
51 Correct 206 ms 1400 KB Output is correct
52 Correct 122 ms 1640 KB Output is correct
53 Correct 72 ms 1640 KB Output is correct
54 Correct 16 ms 1640 KB Output is correct
55 Correct 14 ms 1640 KB Output is correct
56 Correct 18 ms 1640 KB Output is correct
57 Correct 14 ms 1640 KB Output is correct
58 Correct 2 ms 1640 KB Output is correct
59 Correct 12 ms 1640 KB Output is correct
60 Correct 12 ms 1640 KB Output is correct
61 Correct 13 ms 1640 KB Output is correct
62 Correct 2 ms 1640 KB Output is correct
63 Correct 20 ms 1640 KB Output is correct