oj.uz

Submission #157000

# Submission time Handle Problem Language Result Execution time Memory
157000 2019-10-09T02:10:42 Z Mercenary Travelling Merchant (APIO17_merchant) C++14
100 / 100
 105 ms 4344 KB 
#include<bits/stdc++.h>
#define taskname "A"
#define pb push_back
#define mp make_pair
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
#define next aoisfdhjaoif
const int maxn = 1e2 + 5;
const int mod = 1e9 + 7;
const ll inf = 1e11 + 1;

int n , m , k;

int s[maxn][maxn * maxn] , b[maxn][maxn * maxn];

int profit[maxn][maxn];
ll dis[maxn][maxn];
ll dis1[maxn][maxn];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
        freopen(taskname".INP","r",stdin);
        freopen(taskname".OUT","w",stdout);
    }
    cin >> n >> m >> k;
    for(int i = 1 ; i <= n ; ++i){
        for(int j = 1 ; j <= k ; ++j){
            cin >> b[i][j] >> s[i][j];
        }
    }
    for(int i = 1 ; i <= n ; ++i){
        for(int j = 1 ; j <= n ; ++j){
            for(int t = 1 ; t <= k ; ++t){
                if(s[j][t] != -1 && b[i][t] != -1)
                   profit[i][j] = max(profit[i][j] , s[j][t] - b[i][t]);
            }
        }
    }
    for(int i = 1 ; i <= n ; ++i){
        for(int j = 1 ; j <= n ; ++j){
            dis[i][j] = inf;
        }
    }
    for(int i = 1 ; i <= m ; ++i){
        int u , v , w;cin >> u >> v >> w;
        dis[u][v] = min(dis[u][v] , (ll)w);
    }
    for(int t = 1 ; t <= n ; ++t){
        for(int i = 1 ; i <= n ; ++i){
            for(int j = 1 ; j <= n ; ++j){
                dis[i][j] = min(dis[i][j] , dis[i][t] + dis[t][j]);
            }
        }
    }
    int l = 1;
    int h = 1e9;
//    for(int i = 1 ; i <= n ; ++i){
//        for(int j = 1 ; j <= n ; ++j)cout << dis[i][j] << " \n"[j == n];
//    }
//    for(int i = 1 ; i <= n ; ++i){
//        for(int j = 1 ; j <= n ; ++j)cout << profit[i][j] << " \n"[j == n];
//    }
    while(l <= h){
        int mid = l + h >> 1;
        for(int i = 1 ; i <= n ; ++i){
            for(int j = 1 ; j <= n ; ++j){
                if(1e15 / mid < dis[i][j])dis1[i][j] = 1e13 + 1;
                else dis1[i][j] = dis[i][j] * mid - profit[i][j];
            }
        }
        for(int t = 1 ; t <= n ; ++t){
            for(int i = 1 ; i <= n ; ++i){
                for(int j = 1 ; j <= n ; ++j){
                    dis1[i][j] = min(dis1[i][j] , dis1[i][t] + dis1[t][j]);
                }
            }
        }
        bool ok = 0;
        for(int i = 1 ; i <= n ; ++i)ok |= dis1[i][i] <= 0;
        if(ok == 0)h = mid - 1;
        else l = mid + 1;
    }
    cout << h;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:72:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int mid = l + h >> 1;
                   ~~^~~
merchant.cpp:30:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(taskname".INP","r",stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:31:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(taskname".OUT","w",stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 2296 KB Output is correct
2 Correct 41 ms 1272 KB Output is correct
3 Correct 43 ms 1400 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 8 ms 888 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 8 ms 860 KB Output is correct
10 Correct 8 ms 892 KB Output is correct
11 Correct 8 ms 932 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 9 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1656 KB Output is correct
2 Correct 96 ms 2244 KB Output is correct
3 Correct 46 ms 1528 KB Output is correct
4 Correct 49 ms 1736 KB Output is correct
5 Correct 49 ms 1784 KB Output is correct
6 Correct 45 ms 1572 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 9 ms 1020 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 9 ms 892 KB Output is correct
13 Correct 8 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 8 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 892 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 9 ms 988 KB Output is correct
13 Correct 9 ms 888 KB Output is correct
14 Correct 9 ms 888 KB Output is correct
15 Correct 10 ms 976 KB Output is correct
16 Correct 8 ms 888 KB Output is correct
17 Correct 48 ms 1656 KB Output is correct
18 Correct 96 ms 2244 KB Output is correct
19 Correct 46 ms 1528 KB Output is correct
20 Correct 49 ms 1736 KB Output is correct
21 Correct 49 ms 1784 KB Output is correct
22 Correct 45 ms 1572 KB Output is correct
23 Correct 9 ms 888 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 9 ms 1020 KB Output is correct
26 Correct 9 ms 888 KB Output is correct
27 Correct 9 ms 888 KB Output is correct
28 Correct 9 ms 892 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 43 ms 1400 KB Output is correct
31 Correct 46 ms 1560 KB Output is correct
32 Correct 63 ms 2424 KB Output is correct
33 Correct 45 ms 1528 KB Output is correct
34 Correct 45 ms 1528 KB Output is correct
35 Correct 45 ms 1528 KB Output is correct
36 Correct 103 ms 4128 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 43 ms 1424 KB Output is correct
40 Correct 46 ms 1528 KB Output is correct
41 Correct 44 ms 1400 KB Output is correct
42 Correct 43 ms 1400 KB Output is correct
43 Correct 43 ms 1400 KB Output is correct
44 Correct 3 ms 376 KB Output is correct
45 Correct 11 ms 1016 KB Output is correct
46 Correct 11 ms 1016 KB Output is correct
47 Correct 11 ms 1016 KB Output is correct
48 Correct 105 ms 4344 KB Output is correct
49 Correct 105 ms 4216 KB Output is correct
50 Correct 3 ms 376 KB Output is correct
51 Correct 74 ms 2296 KB Output is correct
52 Correct 41 ms 1272 KB Output is correct
53 Correct 43 ms 1400 KB Output is correct
54 Correct 8 ms 760 KB Output is correct
55 Correct 8 ms 888 KB Output is correct
56 Correct 8 ms 888 KB Output is correct
57 Correct 9 ms 888 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 8 ms 860 KB Output is correct
60 Correct 8 ms 892 KB Output is correct
61 Correct 8 ms 932 KB Output is correct
62 Correct 2 ms 504 KB Output is correct
63 Correct 9 ms 888 KB Output is correct