oj.uz

답안 #155114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155114 2019-09-26T11:36:03 Z arnold518 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 114 ms 3464 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 100;
const int MAXM = 9900;
const int MAXK = 1000;
const ll INF = 2e9;

int N, M, K;
int B[MAXN+10][MAXK+10], S[MAXN+10][MAXK+10];
ll dist[MAXN+10][MAXN+10], adj[MAXN+10][MAXN+10], A[MAXN+10][MAXN+10];

bool decide(ll X)
{
    int i, j, k;
    for(i=1; i<=N; i++) for(j=1; j<=N; j++) adj[i][j]=X*dist[i][j]-A[i][j];
    for(k=1; k<=N; k++) for(i=1; i<=N; i++) for(j=1; j<=N; j++) adj[i][j]=min(adj[i][k]+adj[k][j], adj[i][j]);
    for(i=1; i<=N; i++) if(adj[i][i]<=0) return true;
    return false;
}

int main()
{
    int i, j, k;

    scanf("%d%d%d", &N, &M, &K);
    for(i=1; i<=N; i++) for(j=1; j<=K; j++) scanf("%d%d", &B[i][j], &S[i][j]);

    for(i=1; i<=N; i++) for(j=1; j<=N; j++) dist[i][j]=INF;
    for(i=1; i<=M; i++)
    {
        int u, v, w;
        scanf("%d%d%d", &u, &v, &w);
        dist[u][v]=w;
    }

    for(i=1; i<=N; i++) for(j=1; j<=N; j++)
    {
        if(i==j) continue;
        else for(k=1; k<=K; k++) if(B[i][k]!=-1 && S[j][k]!=-1) A[i][j]=max(A[i][j], (ll)S[j][k]-B[i][k]);
    }

    for(k=1; k<=N; k++) for(i=1; i<=N; i++) for(j=1; j<=N; j++) if(dist[i][k]!=INF && dist[k][j]!=INF) dist[i][j]=min(dist[i][k]+dist[k][j], dist[i][j]);

    ll lo=0, hi=2e9;
    while(lo+1<hi)
    {
        ll mid=lo+hi>>1;
        if(decide(mid)) lo=mid;
        else hi=mid;
    }
    printf("%lld", lo);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:52:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         ll mid=lo+hi>>1;
                ~~^~~
merchant.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &N, &M, &K);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:31:50: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=N; i++) for(j=1; j<=K; j++) scanf("%d%d", &B[i][j], &S[i][j]);
                                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &u, &v, &w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 2552 KB Output is correct
2 Correct 42 ms 1272 KB Output is correct
3 Correct 43 ms 1400 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 8 ms 760 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 8 ms 760 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 2 ms 508 KB Output is correct
13 Correct 9 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 892 KB Output is correct
2 Correct 9 ms 888 KB Output is correct
3 Correct 9 ms 888 KB Output is correct
4 Correct 8 ms 892 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 424 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 10 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 9 ms 924 KB Output is correct
14 Correct 9 ms 1016 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 8 ms 1016 KB Output is correct
17 Correct 9 ms 888 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 9 ms 888 KB Output is correct
20 Correct 10 ms 888 KB Output is correct
21 Correct 9 ms 888 KB Output is correct
22 Correct 9 ms 888 KB Output is correct
23 Correct 8 ms 888 KB Output is correct
24 Correct 8 ms 760 KB Output is correct
25 Correct 9 ms 888 KB Output is correct
26 Correct 2 ms 380 KB Output is correct
27 Correct 8 ms 760 KB Output is correct
28 Correct 8 ms 760 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 2 ms 508 KB Output is correct
31 Correct 9 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 1656 KB Output is correct
2 Correct 103 ms 3192 KB Output is correct
3 Correct 46 ms 1528 KB Output is correct
4 Correct 49 ms 1656 KB Output is correct
5 Correct 49 ms 1656 KB Output is correct
6 Correct 46 ms 1400 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 8 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 892 KB Output is correct
2 Correct 9 ms 888 KB Output is correct
3 Correct 9 ms 888 KB Output is correct
4 Correct 8 ms 892 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 424 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 10 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 9 ms 924 KB Output is correct
14 Correct 9 ms 1016 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 8 ms 1016 KB Output is correct
17 Correct 49 ms 1656 KB Output is correct
18 Correct 103 ms 3192 KB Output is correct
19 Correct 46 ms 1528 KB Output is correct
20 Correct 49 ms 1656 KB Output is correct
21 Correct 49 ms 1656 KB Output is correct
22 Correct 46 ms 1400 KB Output is correct
23 Correct 9 ms 888 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 9 ms 888 KB Output is correct
26 Correct 10 ms 888 KB Output is correct
27 Correct 9 ms 888 KB Output is correct
28 Correct 9 ms 888 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 45 ms 1400 KB Output is correct
31 Correct 46 ms 1628 KB Output is correct
32 Correct 64 ms 1912 KB Output is correct
33 Correct 50 ms 1520 KB Output is correct
34 Correct 47 ms 1400 KB Output is correct
35 Correct 49 ms 1572 KB Output is correct
36 Correct 111 ms 3404 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 44 ms 1400 KB Output is correct
40 Correct 47 ms 1400 KB Output is correct
41 Correct 44 ms 1400 KB Output is correct
42 Correct 44 ms 1400 KB Output is correct
43 Correct 44 ms 1404 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 11 ms 1016 KB Output is correct
46 Correct 11 ms 888 KB Output is correct
47 Correct 11 ms 888 KB Output is correct
48 Correct 114 ms 3448 KB Output is correct
49 Correct 114 ms 3464 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 76 ms 2552 KB Output is correct
52 Correct 42 ms 1272 KB Output is correct
53 Correct 43 ms 1400 KB Output is correct
54 Correct 8 ms 888 KB Output is correct
55 Correct 8 ms 888 KB Output is correct
56 Correct 8 ms 760 KB Output is correct
57 Correct 9 ms 888 KB Output is correct
58 Correct 2 ms 380 KB Output is correct
59 Correct 8 ms 760 KB Output is correct
60 Correct 8 ms 760 KB Output is correct
61 Correct 8 ms 888 KB Output is correct
62 Correct 2 ms 508 KB Output is correct
63 Correct 9 ms 888 KB Output is correct