oj.uz

답안 #739391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
739391 2023-05-10T11:48:35 Z Magikarp4000 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 95 ms 2160 KB 
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long

const int MAXN = 1e2+1, MAXK = 1e3+1;
int n,m,K;
int b[MAXN][MAXK], s[MAXN][MAXK];
int dist[MAXN][MAXN], d[MAXN][MAXN], prof[MAXN][MAXN];

bool check(int val) {
    FOR(i,1,n+1) {
        FOR(j,1,n+1) {
            d[i][j] = LLINF;
        }
    }
    FOR(i,1,n+1) {
        FOR(j,1,n+1) {
            if (dist[i][j] == LLINF) continue;
            if (i == j || dist[i][j] == LLINF) continue;
            d[i][j] = dist[i][j]*val-prof[i][j];
        }
    }
    FOR(k,1,n+1) {
        FOR(i,1,n+1) {
            FOR(j,1,n+1) {
                d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
            }
        }
    }
    FOR(i,1,n+1) if (d[i][i] <= 0) return 1;
    return 0;
}

signed main() {
    OPTM;
    cin >> n >> m >> K;
    FOR(i,1,n+1) {
        FOR(j,1,K+1) cin >> b[i][j] >> s[i][j];
    }
    FOR(i,1,n+1) {
        FOR(j,1,n+1) {
            dist[i][j] = LLINF;
        }
    }
    FOR(i,0,m) {
        int x,y,w; cin >> x >> y >> w;
        int mx = 0;
        FOR(j,1,K+1) 
        dist[x][y] = w;
    }
    FOR(k,1,n+1) {
        FOR(i,1,n+1) {
            FOR(j,1,n+1) { 
                dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j]);
            }
        }
    }
    FOR(i,1,n+1) {
        FOR(j,1,n+1) {
            FOR(x,1,K+1) {
                if (dist[i][j] == LLINF) continue;
                if (s[j][x] != -1 && b[i][x] != -1) prof[i][j] = max(prof[i][j], s[j][x]-b[i][x]);
            }
        }
    }
    int l = 1, r = 1LL*(1e9+1);
    while (l < r) {
        int mid = (l+r)/2;
        if (check(mid)) l = mid+1;
        else r = mid;
    }
    cout << l-1;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:68:13: warning: unused variable 'mx' [-Wunused-variable]
   68 |         int mx = 0;
      |             ^~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 2052 KB Output is correct
2 Correct 34 ms 1236 KB Output is correct
3 Correct 33 ms 1236 KB Output is correct
4 Correct 7 ms 812 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 812 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 6 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 812 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 6 ms 792 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 5 ms 864 KB Output is correct
16 Correct 7 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 6 ms 980 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 6 ms 852 KB Output is correct
21 Correct 6 ms 852 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 6 ms 852 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 41 ms 1520 KB Output is correct
9 Correct 82 ms 1996 KB Output is correct
10 Correct 35 ms 1416 KB Output is correct
11 Correct 40 ms 1492 KB Output is correct
12 Correct 38 ms 1492 KB Output is correct
13 Correct 34 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 792 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 5 ms 864 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 6 ms 896 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 41 ms 1520 KB Output is correct
18 Correct 82 ms 1996 KB Output is correct
19 Correct 35 ms 1416 KB Output is correct
20 Correct 40 ms 1492 KB Output is correct
21 Correct 38 ms 1492 KB Output is correct
22 Correct 34 ms 1364 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 64 ms 2052 KB Output is correct
31 Correct 34 ms 1236 KB Output is correct
32 Correct 33 ms 1236 KB Output is correct
33 Correct 7 ms 812 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 5 ms 852 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 5 ms 812 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 6 ms 860 KB Output is correct
43 Correct 35 ms 1364 KB Output is correct
44 Correct 36 ms 1492 KB Output is correct
45 Correct 55 ms 2112 KB Output is correct
46 Correct 40 ms 1496 KB Output is correct
47 Correct 35 ms 1492 KB Output is correct
48 Correct 36 ms 1500 KB Output is correct
49 Correct 86 ms 2120 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 37 ms 1236 KB Output is correct
53 Correct 34 ms 1236 KB Output is correct
54 Correct 34 ms 1364 KB Output is correct
55 Correct 34 ms 1372 KB Output is correct
56 Correct 38 ms 1312 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 7 ms 852 KB Output is correct
59 Correct 7 ms 852 KB Output is correct
60 Correct 7 ms 852 KB Output is correct
61 Correct 95 ms 2160 KB Output is correct
62 Correct 88 ms 2004 KB Output is correct
63 Correct 1 ms 340 KB Output is correct