oj.uz

답안 #953193

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953193 2024-03-25T16:38:45 Z Itamar 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 162 ms 4296 KB 
#include <iostream>
using namespace std;
#include <vector>
#define vi vector<int>
#define ll long long
#include <algorithm>
#include <set>
#include <string>
#include <bitset>
#include <cmath>
#include <math.h>
#define pll pair<ll,ll>
#define vll vector<ll>
#define pi pair<int,int>
#include <map>
#include <queue>
#define x first
#define y second
#define pd pair<double,double>

const int siz = 101;
const int MK = 1001;
ll dis[siz][siz];
ll pro[siz][siz];
ll pr[siz][2*MK];
int main()
{
    int n, m, K;
    cin >> n >> m >> K;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i != j)dis[i][j] = 1e9;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 2 * K; j++) {
            cin >> pr[i][j];
            if (pr[i][j] == -1) {
                if (j % 2)pr[i][j] = -1e18;
                else pr[i][j] = 1e18;
            }
        }
    }
    for (int i = 0; i < m; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        dis[a][b] = min(dis[a][b],c);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < n; k++) {
                dis[j][k] = min(dis[j][k], dis[j][i] + dis[i][k]);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < 2*K; k+=2) {
                pro[i][j] = max(pro[i][j], -pr[i][k] + pr[j][k + 1]);
            }
        }
    }
    int l = 0, r=1e9;
    while (l < r) {
        int mid = (l + r+1) / 2;
        // is it possible that profit/dis >= mid  <--> mid*dis - profit <= 0?
        vector<vll> procur(n, vll(n,1e18));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < n; k++) {
                    procur[i][j] = min(procur[i][j], mid * (dis[i][k] + dis[k][j]) - pro[k][j]);
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if(i!=j)procur[i][j] = 200 * procur[i][j] - 1;
            }
        }
        vll dp(n,1e18);
        dp[0] = 0;
        bool f = 0;
        for (int it = 0; it <= n; it++) {
            vll dpt= dp;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (it == n && dpt[i] > dp[j] + procur[j][i])f = 1;
                    dpt[i] = min(dpt[i], dp[j] + procur[j][i]);
                }
            }
            dp = dpt;
        }
        if (f == 1) {
            l = mid;
        }
        else {
            r = mid-1;
        }
    }
    cout << l;
}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 2128 KB Output is correct
2 Correct 73 ms 1056 KB Output is correct
3 Correct 70 ms 860 KB Output is correct
4 Correct 9 ms 604 KB Output is correct
5 Correct 9 ms 744 KB Output is correct
6 Correct 9 ms 600 KB Output is correct
7 Correct 11 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 9 ms 600 KB Output is correct
10 Correct 10 ms 604 KB Output is correct
11 Correct 10 ms 856 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 10 ms 604 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 11 ms 784 KB Output is correct
4 Correct 11 ms 604 KB Output is correct
5 Correct 11 ms 612 KB Output is correct
6 Correct 11 ms 772 KB Output is correct
7 Correct 9 ms 612 KB Output is correct
8 Correct 75 ms 1208 KB Output is correct
9 Correct 128 ms 2136 KB Output is correct
10 Correct 73 ms 1332 KB Output is correct
11 Correct 77 ms 1204 KB Output is correct
12 Correct 79 ms 1204 KB Output is correct
13 Correct 76 ms 1112 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 604 KB Output is correct
2 Correct 10 ms 604 KB Output is correct
3 Correct 11 ms 780 KB Output is correct
4 Correct 9 ms 760 KB Output is correct
5 Correct 14 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 12 ms 604 KB Output is correct
8 Correct 10 ms 604 KB Output is correct
9 Correct 11 ms 604 KB Output is correct
10 Correct 10 ms 604 KB Output is correct
11 Correct 11 ms 776 KB Output is correct
12 Correct 11 ms 604 KB Output is correct
13 Correct 10 ms 604 KB Output is correct
14 Correct 10 ms 604 KB Output is correct
15 Correct 13 ms 848 KB Output is correct
16 Correct 10 ms 604 KB Output is correct
17 Correct 75 ms 1208 KB Output is correct
18 Correct 128 ms 2136 KB Output is correct
19 Correct 73 ms 1332 KB Output is correct
20 Correct 77 ms 1204 KB Output is correct
21 Correct 79 ms 1204 KB Output is correct
22 Correct 76 ms 1112 KB Output is correct
23 Correct 10 ms 604 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 11 ms 784 KB Output is correct
26 Correct 11 ms 604 KB Output is correct
27 Correct 11 ms 612 KB Output is correct
28 Correct 11 ms 772 KB Output is correct
29 Correct 9 ms 612 KB Output is correct
30 Correct 120 ms 2128 KB Output is correct
31 Correct 73 ms 1056 KB Output is correct
32 Correct 70 ms 860 KB Output is correct
33 Correct 9 ms 604 KB Output is correct
34 Correct 9 ms 744 KB Output is correct
35 Correct 9 ms 600 KB Output is correct
36 Correct 11 ms 604 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 9 ms 600 KB Output is correct
39 Correct 10 ms 604 KB Output is correct
40 Correct 10 ms 856 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 10 ms 604 KB Output is correct
43 Correct 75 ms 860 KB Output is correct
44 Correct 77 ms 1368 KB Output is correct
45 Correct 100 ms 2648 KB Output is correct
46 Correct 74 ms 1116 KB Output is correct
47 Correct 91 ms 1116 KB Output is correct
48 Correct 77 ms 1116 KB Output is correct
49 Correct 136 ms 4168 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 71 ms 860 KB Output is correct
53 Correct 76 ms 1116 KB Output is correct
54 Correct 74 ms 1148 KB Output is correct
55 Correct 72 ms 1116 KB Output is correct
56 Correct 71 ms 1084 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 13 ms 860 KB Output is correct
59 Correct 12 ms 860 KB Output is correct
60 Correct 13 ms 860 KB Output is correct
61 Correct 147 ms 4296 KB Output is correct
62 Correct 162 ms 4232 KB Output is correct
63 Correct 1 ms 348 KB Output is correct