oj.uz

Submission #399090

# Submission time Handle Problem Language Result Execution time Memory
399090 2021-05-05T09:40:09 Z cpp219 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 106 ms 5388 KB 
#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 1e3 + 9;
const ll inf = 1e15 + 7;

ll profit[N][N],n,m,d[N][N],B[N][N],S[N][N],adj[N][N];
ll x,y,w,k;

void out(){
    for (ll i = 1;i <= n;i++){
        for (ll j = 1;j <= n;j++) cout<<adj[i][j]<<" ";
        cout<<"\n";
    }
    exit(0);
}

bool chk(ll x){
    if (!x) return 1;
    for (ll i = 1;i <= n;i++){
        for (ll j = 1;j <= n;j++){
            if (i == j) adj[i][j] = -inf;
            else{
                if (d[i][j] > inf/x) adj[i][j] = -inf;
                else adj[i][j] = profit[i][j] - x*d[i][j];
            }
        }
    }
    //out();
    for (ll l = 1;l <= n;l++){
        for (ll i = 1;i <= n;i++){
            for (ll j = 1;j <= n;j++) adj[i][j] = max(adj[i][j],adj[i][l] + adj[l][j]);
        }
    }
    for (ll i = 1;i <= n;i++) if (adj[i][i] >= 0) return 1;
    return 0;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define task "test"
    if (fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        //freopen(task".out","w",stdout);
    }
    cin>>n>>m>>k;
    for (ll i = 1;i <= n;i++)
        for (ll j = 1;j <= k;j++) cin>>B[i][j]>>S[i][j];
    for (ll i = 1;i <= n;i++)
        for (ll j = 1;j <= n;j++) d[i][j] = inf;
    while(m--){
        cin>>x>>y>>w;
        d[x][y] = w;
    }
    for (ll l = 1;l <= n;l++)
        for (ll i = 1;i <= n;i++)
            for (ll j = 1;j <= n;j++) d[i][j] = min(d[i][j],d[i][l] + d[l][j]);
    for (ll i = 1;i <= n;i++){
        for (ll j = 1;j <= n;j++){
            if (i == j||d[i][j] == inf) continue;
            ll now = 0;
            for (ll l = 1;l <= k;l++)
                if (S[j][l] != -1 && B[i][l] != -1) now = max(now,S[j][l] - B[i][l]);
            profit[i][j] = now;
        }
    }
    ll l,mid,h; //cout<<chk(2); return 0;
    l = 0; h = inf;
    while(l <= h){
        mid = (l + h)/2;
        if (chk(mid)) l = mid + 1;
        else h = mid - 1;
    }
    cout<<h;
}

Compilation message

merchant.cpp:1: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    1 | #pragma GCC optimization "O2"
      | 
merchant.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
merchant.cpp: In function 'int main()':
merchant.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   51 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 3268 KB Output is correct
2 Correct 69 ms 2572 KB Output is correct
3 Correct 69 ms 2580 KB Output is correct
4 Correct 11 ms 1356 KB Output is correct
5 Correct 11 ms 1420 KB Output is correct
6 Correct 11 ms 1356 KB Output is correct
7 Correct 11 ms 1360 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 11 ms 1356 KB Output is correct
10 Correct 11 ms 1432 KB Output is correct
11 Correct 11 ms 1348 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 11 ms 1436 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1356 KB Output is correct
2 Correct 11 ms 1360 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 11 ms 1356 KB Output is correct
5 Correct 11 ms 1432 KB Output is correct
6 Correct 11 ms 1348 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 11 ms 1436 KB Output is correct
9 Correct 11 ms 1424 KB Output is correct
10 Correct 11 ms 1356 KB Output is correct
11 Correct 11 ms 1356 KB Output is correct
12 Correct 11 ms 1396 KB Output is correct
13 Correct 11 ms 1356 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 11 ms 1360 KB Output is correct
16 Correct 12 ms 1356 KB Output is correct
17 Correct 11 ms 1368 KB Output is correct
18 Correct 11 ms 1396 KB Output is correct
19 Correct 12 ms 1448 KB Output is correct
20 Correct 11 ms 1408 KB Output is correct
21 Correct 12 ms 1356 KB Output is correct
22 Correct 11 ms 1420 KB Output is correct
23 Correct 12 ms 1356 KB Output is correct
24 Correct 11 ms 1356 KB Output is correct
25 Correct 11 ms 1356 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 12 ms 1452 KB Output is correct
28 Correct 12 ms 1452 KB Output is correct
29 Correct 12 ms 1356 KB Output is correct
30 Correct 11 ms 1356 KB Output is correct
31 Correct 11 ms 1356 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1356 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 12 ms 1452 KB Output is correct
4 Correct 12 ms 1452 KB Output is correct
5 Correct 12 ms 1356 KB Output is correct
6 Correct 11 ms 1356 KB Output is correct
7 Correct 11 ms 1356 KB Output is correct
8 Correct 72 ms 2732 KB Output is correct
9 Correct 98 ms 3356 KB Output is correct
10 Correct 73 ms 2636 KB Output is correct
11 Correct 73 ms 2636 KB Output is correct
12 Correct 76 ms 2744 KB Output is correct
13 Correct 71 ms 2636 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1424 KB Output is correct
2 Correct 11 ms 1356 KB Output is correct
3 Correct 11 ms 1356 KB Output is correct
4 Correct 11 ms 1396 KB Output is correct
5 Correct 11 ms 1356 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 11 ms 1360 KB Output is correct
8 Correct 12 ms 1356 KB Output is correct
9 Correct 11 ms 1368 KB Output is correct
10 Correct 11 ms 1396 KB Output is correct
11 Correct 12 ms 1448 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 12 ms 1356 KB Output is correct
14 Correct 11 ms 1420 KB Output is correct
15 Correct 12 ms 1356 KB Output is correct
16 Correct 11 ms 1356 KB Output is correct
17 Correct 72 ms 2732 KB Output is correct
18 Correct 98 ms 3356 KB Output is correct
19 Correct 73 ms 2636 KB Output is correct
20 Correct 73 ms 2636 KB Output is correct
21 Correct 76 ms 2744 KB Output is correct
22 Correct 71 ms 2636 KB Output is correct
23 Correct 11 ms 1356 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 12 ms 1452 KB Output is correct
26 Correct 12 ms 1452 KB Output is correct
27 Correct 12 ms 1356 KB Output is correct
28 Correct 11 ms 1356 KB Output is correct
29 Correct 11 ms 1356 KB Output is correct
30 Correct 95 ms 3268 KB Output is correct
31 Correct 69 ms 2572 KB Output is correct
32 Correct 69 ms 2580 KB Output is correct
33 Correct 11 ms 1356 KB Output is correct
34 Correct 11 ms 1420 KB Output is correct
35 Correct 11 ms 1356 KB Output is correct
36 Correct 11 ms 1360 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 11 ms 1356 KB Output is correct
39 Correct 11 ms 1432 KB Output is correct
40 Correct 11 ms 1348 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 11 ms 1436 KB Output is correct
43 Correct 71 ms 2508 KB Output is correct
44 Correct 73 ms 2808 KB Output is correct
45 Correct 89 ms 3780 KB Output is correct
46 Correct 75 ms 2812 KB Output is correct
47 Correct 72 ms 2816 KB Output is correct
48 Correct 71 ms 2764 KB Output is correct
49 Correct 103 ms 5260 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 440 KB Output is correct
52 Correct 74 ms 2616 KB Output is correct
53 Correct 72 ms 2636 KB Output is correct
54 Correct 71 ms 2616 KB Output is correct
55 Correct 71 ms 2608 KB Output is correct
56 Correct 69 ms 2508 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 12 ms 1580 KB Output is correct
59 Correct 15 ms 1556 KB Output is correct
60 Correct 12 ms 1564 KB Output is correct
61 Correct 106 ms 5388 KB Output is correct
62 Correct 105 ms 5304 KB Output is correct
63 Correct 1 ms 332 KB Output is correct