oj.uz

답안 #891866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891866 2023-12-24T09:29:13 Z serifefedartar 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 75 ms 2276 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 998244353
#define LOGN 21
#define MAXN 105
#define int long long

int temp[MAXN][MAXN], dist[MAXN][MAXN], sell[MAXN][MAXN];
int N, market[MAXN][1005][2];
const ll INF = LLONG_MAX / 2;
bool check(int K) {
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++)
            temp[i][j] = sell[i][j] - K * min(dist[i][j], INF / K);
    }

    for (int k = 1; k <= N; k++) {
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++)
                temp[i][j] = max(temp[i][j], temp[i][k] + temp[k][j]);
        }
    }

    for (int i = 1; i <= N; i++) {
        if (temp[i][i] >= 0)
            return true;
    }
    return false;
}

signed main() {
    fast
    int M, K;
    cin >> N >> M >> K;

    for (int i = 0; i < MAXN; i++) {
        for (int j = 0; j < MAXN; j++)
            dist[i][j] = INF;
    }
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= K; j++)
            cin >> market[i][j][0] >> market[i][j][1];
    }
    for (int i = 0; i < M; i++) {
        int from, to, T;
        cin >> from >> to >> T;
        dist[from][to] = min(dist[from][to], T);
    }

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

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            for (int k = 1; k <= K; k++) {
                if (market[j][k][1] != -1 && market[i][k][0] != -1)
                    sell[i][j] = max(sell[i][j], market[j][k][1] - market[i][k][0]);
            }
        }
    }

    int L = 1;
    int R = 1e9;
    int ans = -1;
    while (R >= L) {
        int mid = L + (R-L) / 2;
        if (check(mid)) {
            ans = mid;
            L = mid + 1;
        } else
            R = mid - 1;
    }
    cout << R << "\n";
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:73:9: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   73 |     int ans = -1;
      |         ^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 2132 KB Output is correct
2 Correct 28 ms 1112 KB Output is correct
3 Correct 31 ms 1364 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 764 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 836 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 4 ms 764 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 836 KB Output is correct
9 Correct 4 ms 856 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 4 ms 604 KB Output is correct
18 Correct 4 ms 860 KB Output is correct
19 Correct 4 ms 876 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 4 ms 604 KB Output is correct
22 Correct 4 ms 604 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 4 ms 604 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 4 ms 604 KB Output is correct
31 Correct 4 ms 604 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 32 ms 1260 KB Output is correct
9 Correct 69 ms 2132 KB Output is correct
10 Correct 30 ms 1116 KB Output is correct
11 Correct 32 ms 1112 KB Output is correct
12 Correct 32 ms 1316 KB Output is correct
13 Correct 31 ms 1180 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 4 ms 600 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 4 ms 876 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 4 ms 604 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 4 ms 604 KB Output is correct
17 Correct 32 ms 1260 KB Output is correct
18 Correct 69 ms 2132 KB Output is correct
19 Correct 30 ms 1116 KB Output is correct
20 Correct 32 ms 1112 KB Output is correct
21 Correct 32 ms 1316 KB Output is correct
22 Correct 31 ms 1180 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 4 ms 604 KB Output is correct
30 Correct 50 ms 2132 KB Output is correct
31 Correct 28 ms 1112 KB Output is correct
32 Correct 31 ms 1364 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 4 ms 604 KB Output is correct
35 Correct 4 ms 604 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 604 KB Output is correct
39 Correct 4 ms 604 KB Output is correct
40 Correct 4 ms 764 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 4 ms 836 KB Output is correct
43 Correct 31 ms 1116 KB Output is correct
44 Correct 32 ms 1112 KB Output is correct
45 Correct 45 ms 2140 KB Output is correct
46 Correct 32 ms 1116 KB Output is correct
47 Correct 32 ms 1280 KB Output is correct
48 Correct 32 ms 1112 KB Output is correct
49 Correct 59 ms 2276 KB Output is correct
50 Correct 0 ms 600 KB Output is correct
51 Correct 0 ms 604 KB Output is correct
52 Correct 30 ms 860 KB Output is correct
53 Correct 31 ms 856 KB Output is correct
54 Correct 30 ms 1112 KB Output is correct
55 Correct 30 ms 1116 KB Output is correct
56 Correct 30 ms 856 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 5 ms 924 KB Output is correct
59 Correct 5 ms 860 KB Output is correct
60 Correct 5 ms 924 KB Output is correct
61 Correct 75 ms 2160 KB Output is correct
62 Correct 59 ms 2128 KB Output is correct
63 Correct 1 ms 344 KB Output is correct