oj.uz

답안 #119074

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
119074 2019-06-20T09:10:25 Z Charis02 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 175 ms 12260 KB 
#include<iostream>
#include<vector>
#include<cmath>
#include<queue>
#include<map>
#include<algorithm>
#define ll long long
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 1004
#define INF 1e9+7

using namespace std;

ll n,m,k,u,v,t,ans;
ll buy[N][N];
ll sell[N][N];
ll dist[N][N],cost[N][N],test[N][N];

bool can(ll x)
{
    rep(i,0,n)
    {
        rep(j,0,n)
        {
            if(dist[i][j] != INF && x*dist[i][j] - cost[i][j] < INF)
                test[i][j] = cost[i][j] - x*dist[i][j];
            else
                test[i][j] = -INF;
        }
    }

    rep(p,0,n)
    {
        rep(i,0,n)
        {
            rep(j,0,n)
            {
                if(test[i][p] <= -INF || test[p][j] <= -INF)
                    continue;

                test[i][j] = max(test[i][j],test[i][p] + test[p][j]);

            }
        }
    }

    rep(i,0,n)
    {
        if(test[i][i] >= 0)
            return true;
    }

    return false;
}

int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n >> m >> k;

    rep(j,0,n)
    {
        rep(i,0,k)
        {
            cin >> buy[i][j] >> sell[i][j];
        }
    }

    rep(i,0,n)
    {
        rep(j,0,n)
        {
            dist[i][j] = INF;
        }
    }

    rep(i,0,m)
    {
        cin >> u >> v >> t;
        u--;
        v--;
        dist[u][v] = t;
    }

    rep(p,0,n)
    {
        rep(i,0,n)
        {
            rep(j,0,n)
            {
                dist[i][j] = min(dist[i][j],dist[i][p] + dist[p][j]);
            }
        }
    }

    rep(i,0,n)
    {
        rep(j,0,n)
        {
            if(dist[i][j] == INF)
                continue;

            rep(p,0,k)
            {
                if(buy[p][i] != -1 && sell[p][j] != -1)
                    cost[i][j] = max(cost[i][j],-buy[p][i] + sell[p][j]);
            }
        }

    }

    ll low = 0;
    ll high = 1000000001;
    ll ans = 0;

    while(low < high)
    {
        ll mid = (low + high) / 2;

        if(can(mid))
        {
            ans = max(ans,mid);
            low = mid+1;
        }
        else
        {
            high = mid-1;
        }
    }

    while(can(ans+1))
        ans++;

    cout << ans << endl;

    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 11512 KB Output is correct
2 Correct 35 ms 1408 KB Output is correct
3 Correct 61 ms 1528 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 10 ms 1024 KB Output is correct
7 Correct 11 ms 1280 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 11 ms 768 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1152 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 10 ms 1568 KB Output is correct
5 Correct 12 ms 1536 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 8 ms 1152 KB Output is correct
11 Correct 12 ms 1536 KB Output is correct
12 Correct 9 ms 1536 KB Output is correct
13 Correct 11 ms 1024 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 12 ms 1536 KB Output is correct
16 Correct 11 ms 896 KB Output is correct
17 Correct 11 ms 1536 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 10 ms 1536 KB Output is correct
20 Correct 12 ms 1536 KB Output is correct
21 Correct 10 ms 1536 KB Output is correct
22 Correct 11 ms 1024 KB Output is correct
23 Correct 9 ms 1024 KB Output is correct
24 Correct 10 ms 1024 KB Output is correct
25 Correct 11 ms 1280 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 11 ms 768 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 11 ms 1280 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 2932 KB Output is correct
2 Correct 123 ms 11176 KB Output is correct
3 Correct 40 ms 2424 KB Output is correct
4 Correct 43 ms 3056 KB Output is correct
5 Correct 42 ms 2944 KB Output is correct
6 Correct 46 ms 2304 KB Output is correct
7 Correct 11 ms 1536 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 12 ms 1536 KB Output is correct
11 Correct 10 ms 1536 KB Output is correct
12 Correct 11 ms 1024 KB Output is correct
13 Correct 9 ms 1024 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1152 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 10 ms 1568 KB Output is correct
5 Correct 12 ms 1536 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 8 ms 1152 KB Output is correct
11 Correct 12 ms 1536 KB Output is correct
12 Correct 9 ms 1536 KB Output is correct
13 Correct 11 ms 1024 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 12 ms 1536 KB Output is correct
16 Correct 11 ms 896 KB Output is correct
17 Correct 61 ms 2932 KB Output is correct
18 Correct 123 ms 11176 KB Output is correct
19 Correct 40 ms 2424 KB Output is correct
20 Correct 43 ms 3056 KB Output is correct
21 Correct 42 ms 2944 KB Output is correct
22 Correct 46 ms 2304 KB Output is correct
23 Correct 11 ms 1536 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 10 ms 1536 KB Output is correct
26 Correct 12 ms 1536 KB Output is correct
27 Correct 10 ms 1536 KB Output is correct
28 Correct 11 ms 1024 KB Output is correct
29 Correct 9 ms 1024 KB Output is correct
30 Correct 48 ms 1664 KB Output is correct
31 Correct 53 ms 2844 KB Output is correct
32 Correct 76 ms 9848 KB Output is correct
33 Correct 51 ms 2824 KB Output is correct
34 Correct 53 ms 2816 KB Output is correct
35 Correct 53 ms 2816 KB Output is correct
36 Correct 148 ms 12152 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 54 ms 1656 KB Output is correct
40 Correct 48 ms 1664 KB Output is correct
41 Correct 47 ms 1920 KB Output is correct
42 Correct 50 ms 1664 KB Output is correct
43 Correct 55 ms 1528 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 12 ms 1920 KB Output is correct
46 Correct 11 ms 1920 KB Output is correct
47 Correct 10 ms 2048 KB Output is correct
48 Correct 150 ms 12152 KB Output is correct
49 Correct 175 ms 12260 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 85 ms 11512 KB Output is correct
52 Correct 35 ms 1408 KB Output is correct
53 Correct 61 ms 1528 KB Output is correct
54 Correct 9 ms 896 KB Output is correct
55 Correct 9 ms 896 KB Output is correct
56 Correct 10 ms 1024 KB Output is correct
57 Correct 11 ms 1280 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 11 ms 768 KB Output is correct
60 Correct 10 ms 896 KB Output is correct
61 Correct 11 ms 896 KB Output is correct
62 Correct 2 ms 512 KB Output is correct
63 Correct 11 ms 1280 KB Output is correct