oj.uz

답안 #484762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484762 2021-11-05T11:37:46 Z sam571128 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 88 ms 5316 KB 
#include <bits/stdc++.h>

#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 1e3+5;
int dis[N][N], profit[N][N], b[N][N], s[N][N], dis2[N][N];
int n,m,k;

bool check(int x){
    assert(x!=0);
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            dis2[i][j] = x*min(dis[i][j],(int)1e18/x) - profit[i][j];
        }
    }

    for(int k = 1;k <= n;k++){
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <= n;j++){
                dis2[i][j] = min(dis2[i][j],dis2[i][k]+dis2[k][j]);
            }
        }
    }

    for(int i = 1;i <= n;i++) if(dis2[i][i] <= 0) return true;
    return false;
}

signed main(){
    fastio
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++){
        for(int j = 1;j <= n;j++){
            dis[i][j] = 1e18;
        }
        for(int j = 1;j <= k;j++){
            cin >> b[i][j] >> s[i][j];
            //Meaning that the cost to buy item j in market i 
        }
    }

    for(int i = 0;i < m;i++){
        int u,v,w;
        cin >> u >> v >> w;
        dis[u][v] = w;
    }

    for(int k = 1;k <= n;k++){
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <= n;j++){
                dis[i][j] = min(dis[i][j],dis[i][k]+dis[k][j]);
            }
        }
    }

    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            for(int x = 1; x <= k; x++){
                if(s[j][x] == -1 || b[i][x] == -1) continue;
                profit[i][j] = max(profit[i][j],s[j][x]-b[i][x]);
            }
        }
    }

    int l = 1, r = 1e9;

    while(l+1 < r){
        //cout << l << " " << r << "\n";
        int mid = l+r>>1;
        if(!check(mid)) r = mid-1;
        else l = mid;
    }
    if(check(r)) cout << r << "\n";
    else if(check(l)) cout << l << "\n";
    else cout << 0 << "\n";
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:72:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |         int mid = l+r>>1;
      |                   ~^~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 2884 KB Output is correct
2 Correct 33 ms 2124 KB Output is correct
3 Correct 34 ms 2124 KB Output is correct
4 Correct 5 ms 1100 KB Output is correct
5 Correct 5 ms 1092 KB Output is correct
6 Correct 6 ms 1196 KB Output is correct
7 Correct 7 ms 1228 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 7 ms 1100 KB Output is correct
10 Correct 5 ms 1100 KB Output is correct
11 Correct 5 ms 1100 KB Output is correct
12 Correct 0 ms 460 KB Output is correct
13 Correct 6 ms 1228 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1196 KB Output is correct
2 Correct 7 ms 1228 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 7 ms 1100 KB Output is correct
5 Correct 5 ms 1100 KB Output is correct
6 Correct 5 ms 1100 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 6 ms 1228 KB Output is correct
9 Correct 5 ms 1356 KB Output is correct
10 Correct 5 ms 1228 KB Output is correct
11 Correct 5 ms 1356 KB Output is correct
12 Correct 5 ms 1356 KB Output is correct
13 Correct 6 ms 1356 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 5 ms 1228 KB Output is correct
16 Correct 7 ms 1356 KB Output is correct
17 Correct 5 ms 1228 KB Output is correct
18 Correct 6 ms 1320 KB Output is correct
19 Correct 6 ms 1356 KB Output is correct
20 Correct 6 ms 1356 KB Output is correct
21 Correct 6 ms 1484 KB Output is correct
22 Correct 6 ms 1356 KB Output is correct
23 Correct 6 ms 1420 KB Output is correct
24 Correct 5 ms 1228 KB Output is correct
25 Correct 6 ms 1356 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 6 ms 1356 KB Output is correct
28 Correct 6 ms 1356 KB Output is correct
29 Correct 6 ms 1356 KB Output is correct
30 Correct 5 ms 1356 KB Output is correct
31 Correct 5 ms 1356 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1356 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 6 ms 1356 KB Output is correct
4 Correct 6 ms 1356 KB Output is correct
5 Correct 6 ms 1356 KB Output is correct
6 Correct 5 ms 1356 KB Output is correct
7 Correct 5 ms 1356 KB Output is correct
8 Correct 39 ms 2636 KB Output is correct
9 Correct 79 ms 3308 KB Output is correct
10 Correct 37 ms 2636 KB Output is correct
11 Correct 43 ms 2756 KB Output is correct
12 Correct 41 ms 2740 KB Output is correct
13 Correct 36 ms 2632 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1356 KB Output is correct
2 Correct 5 ms 1228 KB Output is correct
3 Correct 5 ms 1356 KB Output is correct
4 Correct 5 ms 1356 KB Output is correct
5 Correct 6 ms 1356 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 5 ms 1228 KB Output is correct
8 Correct 7 ms 1356 KB Output is correct
9 Correct 5 ms 1228 KB Output is correct
10 Correct 6 ms 1320 KB Output is correct
11 Correct 6 ms 1356 KB Output is correct
12 Correct 6 ms 1356 KB Output is correct
13 Correct 6 ms 1484 KB Output is correct
14 Correct 6 ms 1356 KB Output is correct
15 Correct 6 ms 1420 KB Output is correct
16 Correct 5 ms 1228 KB Output is correct
17 Correct 39 ms 2636 KB Output is correct
18 Correct 79 ms 3308 KB Output is correct
19 Correct 37 ms 2636 KB Output is correct
20 Correct 43 ms 2756 KB Output is correct
21 Correct 41 ms 2740 KB Output is correct
22 Correct 36 ms 2632 KB Output is correct
23 Correct 6 ms 1356 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 6 ms 1356 KB Output is correct
26 Correct 6 ms 1356 KB Output is correct
27 Correct 6 ms 1356 KB Output is correct
28 Correct 5 ms 1356 KB Output is correct
29 Correct 5 ms 1356 KB Output is correct
30 Correct 54 ms 2884 KB Output is correct
31 Correct 33 ms 2124 KB Output is correct
32 Correct 34 ms 2124 KB Output is correct
33 Correct 5 ms 1100 KB Output is correct
34 Correct 5 ms 1092 KB Output is correct
35 Correct 6 ms 1196 KB Output is correct
36 Correct 7 ms 1228 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 7 ms 1100 KB Output is correct
39 Correct 5 ms 1100 KB Output is correct
40 Correct 5 ms 1100 KB Output is correct
41 Correct 0 ms 460 KB Output is correct
42 Correct 6 ms 1228 KB Output is correct
43 Correct 35 ms 2252 KB Output is correct
44 Correct 45 ms 2808 KB Output is correct
45 Correct 48 ms 3824 KB Output is correct
46 Correct 35 ms 2764 KB Output is correct
47 Correct 40 ms 2700 KB Output is correct
48 Correct 37 ms 2764 KB Output is correct
49 Correct 83 ms 5296 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 34 ms 2128 KB Output is correct
53 Correct 35 ms 2320 KB Output is correct
54 Correct 34 ms 2508 KB Output is correct
55 Correct 38 ms 2364 KB Output is correct
56 Correct 35 ms 2180 KB Output is correct
57 Correct 0 ms 332 KB Output is correct
58 Correct 7 ms 1488 KB Output is correct
59 Correct 7 ms 1484 KB Output is correct
60 Correct 8 ms 1580 KB Output is correct
61 Correct 88 ms 5316 KB Output is correct
62 Correct 85 ms 5312 KB Output is correct
63 Correct 0 ms 332 KB Output is correct