oj.uz

Submission #736675

# Submission time Handle Problem Language Result Execution time Memory
736675 2023-05-06T05:27:38 Z baokhue232005 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 81 ms 12740 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
// lethal option
//  #pragma GCC optimize ("trapv")

#include<bits/stdc++.h>
using namespace std;

#define all(flg) flg.begin(), flg.end()
#define int long long
#define pb push_back
#define fi first
#define se second
#define endl "\n"
#define eb emplace_back
#define ii pair<int, int>
#define vi vector<int>
#define PI 3.141592653589793238462643383279502884
#define ll long long
#define ld long double
#define for1(i, ff, gg) for(int i = ff; i <= gg; ++i)
#define for2(i, ff, gg) for(int i = ff; i >= gg; --i)
const ll mod = 1e9 + 7;
const int maxN = 1005;
const ll oo = 1e18 + 7;
int n, a[maxN];
int x, y, z, k, m;

int table[maxN][maxN];
int origin[maxN][maxN];
int b[maxN][maxN];
int s[maxN][maxN];

void floyd(){
    for1(i, 1, n){
        for1(j, 1, n) for1(k, 1, n){
            table[j][k] = min(table[j][k], table[j][i] + table[i][k]);
        }
    }
}

int protrade[maxN][maxN];

bool solve(int multer){
    for1(i, 1, n) for1(j, 1, n){
        table[i][j] = origin[i][j] * multer - protrade[i][j];
        if(oo / multer < origin[i][j]) table[i][j] = oo;
    }
    for1(i, 1, n) table[i][i] = oo;
    floyd();
    for1(i, 1, n) if(table[i][i] <= 0) return 1;
    return 0;
}

signed main(){
    // freopen(".inp", "r", stdin);
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m >> k;
    for1(i, 1, n){
        for1(j, 1, k){
            cin >> b[i][j] >> s[i][j];
            if(b[i][j] == -1) b[i][j] = mod;
            if(s[i][j] == -1) s[i][j] = 0;

        }
    }
    memset(table, 15, sizeof(table));
    while(m--){
        cin >> x >> y >> z;
        table[x][y] = z;
    }
    for1(i, 1, n) table[i][i] = 0;
    floyd();
    for1(i, 1, n) for1(j, 1, n) origin[i][j] = table[i][j];
    for1(i, 1, n) for1(j, 1, n){
        int val = 0;
        for1(g, 1, k) val = max(val, s[j][g] - b[i][g]);
        protrade[i][j] = val;
    }
    int lb = 0, rb = mod;
    while(lb != rb){
        int mid = (lb + rb + 1) / 2;
        if(solve(mid)) lb = mid;
        else rb = mid - 1;
    }
    cout << lb << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 10732 KB Output is correct
2 Correct 35 ms 10008 KB Output is correct
3 Correct 44 ms 10000 KB Output is correct
4 Correct 9 ms 9092 KB Output is correct
5 Correct 9 ms 9044 KB Output is correct
6 Correct 11 ms 9044 KB Output is correct
7 Correct 9 ms 9044 KB Output is correct
8 Correct 3 ms 8276 KB Output is correct
9 Correct 8 ms 8968 KB Output is correct
10 Correct 10 ms 9044 KB Output is correct
11 Correct 8 ms 9044 KB Output is correct
12 Correct 3 ms 8404 KB Output is correct
13 Correct 8 ms 9044 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9044 KB Output is correct
2 Correct 9 ms 9044 KB Output is correct
3 Correct 3 ms 8276 KB Output is correct
4 Correct 8 ms 8968 KB Output is correct
5 Correct 10 ms 9044 KB Output is correct
6 Correct 8 ms 9044 KB Output is correct
7 Correct 3 ms 8404 KB Output is correct
8 Correct 8 ms 9044 KB Output is correct
9 Correct 9 ms 9044 KB Output is correct
10 Correct 10 ms 9036 KB Output is correct
11 Correct 11 ms 9044 KB Output is correct
12 Correct 8 ms 9044 KB Output is correct
13 Correct 9 ms 9188 KB Output is correct
14 Correct 4 ms 8276 KB Output is correct
15 Correct 8 ms 9036 KB Output is correct
16 Correct 9 ms 9052 KB Output is correct
17 Correct 8 ms 9044 KB Output is correct
18 Correct 9 ms 9044 KB Output is correct
19 Correct 10 ms 9192 KB Output is correct
20 Correct 10 ms 9180 KB Output is correct
21 Correct 8 ms 9044 KB Output is correct
22 Correct 9 ms 9172 KB Output is correct
23 Correct 9 ms 9172 KB Output is correct
24 Correct 8 ms 9032 KB Output is correct
25 Correct 8 ms 9044 KB Output is correct
26 Correct 3 ms 8276 KB Output is correct
27 Correct 9 ms 9136 KB Output is correct
28 Correct 8 ms 9136 KB Output is correct
29 Correct 9 ms 9136 KB Output is correct
30 Correct 9 ms 9120 KB Output is correct
31 Correct 10 ms 9108 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9044 KB Output is correct
2 Correct 3 ms 8276 KB Output is correct
3 Correct 9 ms 9136 KB Output is correct
4 Correct 8 ms 9136 KB Output is correct
5 Correct 9 ms 9136 KB Output is correct
6 Correct 9 ms 9120 KB Output is correct
7 Correct 10 ms 9108 KB Output is correct
8 Correct 41 ms 10088 KB Output is correct
9 Correct 60 ms 10760 KB Output is correct
10 Correct 37 ms 10068 KB Output is correct
11 Correct 39 ms 10156 KB Output is correct
12 Correct 40 ms 10068 KB Output is correct
13 Correct 41 ms 10068 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9044 KB Output is correct
2 Correct 10 ms 9036 KB Output is correct
3 Correct 11 ms 9044 KB Output is correct
4 Correct 8 ms 9044 KB Output is correct
5 Correct 9 ms 9188 KB Output is correct
6 Correct 4 ms 8276 KB Output is correct
7 Correct 8 ms 9036 KB Output is correct
8 Correct 9 ms 9052 KB Output is correct
9 Correct 8 ms 9044 KB Output is correct
10 Correct 9 ms 9044 KB Output is correct
11 Correct 10 ms 9192 KB Output is correct
12 Correct 10 ms 9180 KB Output is correct
13 Correct 8 ms 9044 KB Output is correct
14 Correct 9 ms 9172 KB Output is correct
15 Correct 9 ms 9172 KB Output is correct
16 Correct 8 ms 9032 KB Output is correct
17 Correct 41 ms 10088 KB Output is correct
18 Correct 60 ms 10760 KB Output is correct
19 Correct 37 ms 10068 KB Output is correct
20 Correct 39 ms 10156 KB Output is correct
21 Correct 40 ms 10068 KB Output is correct
22 Correct 41 ms 10068 KB Output is correct
23 Correct 8 ms 9044 KB Output is correct
24 Correct 3 ms 8276 KB Output is correct
25 Correct 9 ms 9136 KB Output is correct
26 Correct 8 ms 9136 KB Output is correct
27 Correct 9 ms 9136 KB Output is correct
28 Correct 9 ms 9120 KB Output is correct
29 Correct 10 ms 9108 KB Output is correct
30 Correct 58 ms 10732 KB Output is correct
31 Correct 35 ms 10008 KB Output is correct
32 Correct 44 ms 10000 KB Output is correct
33 Correct 9 ms 9092 KB Output is correct
34 Correct 9 ms 9044 KB Output is correct
35 Correct 11 ms 9044 KB Output is correct
36 Correct 9 ms 9044 KB Output is correct
37 Correct 3 ms 8276 KB Output is correct
38 Correct 8 ms 8968 KB Output is correct
39 Correct 10 ms 9044 KB Output is correct
40 Correct 8 ms 9044 KB Output is correct
41 Correct 3 ms 8404 KB Output is correct
42 Correct 8 ms 9044 KB Output is correct
43 Correct 45 ms 9940 KB Output is correct
44 Correct 39 ms 10232 KB Output is correct
45 Correct 56 ms 11260 KB Output is correct
46 Correct 39 ms 10196 KB Output is correct
47 Correct 38 ms 10216 KB Output is correct
48 Correct 39 ms 10196 KB Output is correct
49 Correct 81 ms 12720 KB Output is correct
50 Correct 3 ms 8276 KB Output is correct
51 Correct 3 ms 8276 KB Output is correct
52 Correct 37 ms 9940 KB Output is correct
53 Correct 38 ms 10068 KB Output is correct
54 Correct 38 ms 10068 KB Output is correct
55 Correct 41 ms 10068 KB Output is correct
56 Correct 41 ms 10040 KB Output is correct
57 Correct 4 ms 8216 KB Output is correct
58 Correct 9 ms 9172 KB Output is correct
59 Correct 9 ms 9176 KB Output is correct
60 Correct 10 ms 9180 KB Output is correct
61 Correct 66 ms 12740 KB Output is correct
62 Correct 66 ms 12728 KB Output is correct
63 Correct 4 ms 8272 KB Output is correct