답안 #50123 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50123	2018-06-07T16:00:32 Z	mohammad_kilani	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	346 ms	2068 KB

merchant

#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define oo 2000000000
const int N = 150 , K = 1100;
long long dist[N][N] , best[N][N]; 
long double cur[N][N]; 
int b[N][K] , s[N][K];
int n , m , k , u , v , w;

bool check(long long mid){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i == j) continue;
            cur[i][j] = (long double)dist[i][j] * mid - best[i][j];
        }
    }
    for(int i=1;i<=n;i++)
        cur[i][i] = 1e25;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                cur[j][k] = min(cur[j][k],cur[j][i] + cur[i][k]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(cur[i][i] <= 0)
            return true;
    }
    return false;
}

int main() {
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i != j)
                dist[i][j] = 1e18;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            scanf("%d%d",&b[i][j],&s[i][j]);
        }
    }
    for(int i=0;i<m;i++){
        scanf("%d%d%d",&u,&v,&w);
        dist[u][v] = min(dist[u][v],(long long)w);
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                    dist[j][k] = min(dist[j][k],(long long) dist[j][i] + dist[i][k]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i == j) continue;
            for(int l=1;l<=k;l++){
                if(b[i][l] != -1 && s[j][l] != -1)
                    best[i][j] = max(best[i][j], (long long)s[j][l] - b[i][l]);
            }
        }
    }
    long long low = 1 , high = 1e11 , ans = 0 , mid = 0;
    while(high >= low){
        mid = (low + high) / 2;
        if(check(mid)){
            ans = mid;
            low = mid + 1;
            continue;
        }
        else
            high = mid - 1;
    }
    cout << ans << endl;
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:35: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:44:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d%d",&b[i][j],&s[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:48: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	287 ms	1656 KB	Output is correct
2	Correct	237 ms	1696 KB	Output is correct
3	Correct	221 ms	1696 KB	Output is correct
4	Correct	30 ms	1696 KB	Output is correct
5	Correct	29 ms	1696 KB	Output is correct
6	Correct	30 ms	1696 KB	Output is correct
7	Correct	32 ms	1696 KB	Output is correct
8	Correct	2 ms	1696 KB	Output is correct
9	Correct	33 ms	1696 KB	Output is correct
10	Correct	38 ms	1696 KB	Output is correct
11	Correct	34 ms	1696 KB	Output is correct
12	Correct	2 ms	1696 KB	Output is correct
13	Correct	33 ms	1696 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	34 ms	1696 KB	Output is correct
2	Correct	36 ms	1696 KB	Output is correct
3	Correct	34 ms	1696 KB	Output is correct
4	Correct	32 ms	1696 KB	Output is correct
5	Correct	35 ms	1696 KB	Output is correct
6	Correct	3 ms	1696 KB	Output is correct
7	Correct	33 ms	1696 KB	Output is correct
8	Correct	34 ms	1696 KB	Output is correct
9	Correct	37 ms	1696 KB	Output is correct
10	Correct	31 ms	1696 KB	Output is correct
11	Correct	31 ms	1696 KB	Output is correct
12	Correct	34 ms	1696 KB	Output is correct
13	Correct	34 ms	1696 KB	Output is correct
14	Correct	39 ms	1696 KB	Output is correct
15	Correct	31 ms	1696 KB	Output is correct
16	Correct	30 ms	1696 KB	Output is correct
17	Correct	35 ms	1696 KB	Output is correct
18	Correct	3 ms	1696 KB	Output is correct
19	Correct	36 ms	1696 KB	Output is correct
20	Correct	43 ms	1696 KB	Output is correct
21	Correct	35 ms	1696 KB	Output is correct
22	Correct	37 ms	1696 KB	Output is correct
23	Correct	38 ms	1696 KB	Output is correct
24	Correct	30 ms	1696 KB	Output is correct
25	Correct	32 ms	1696 KB	Output is correct
26	Correct	2 ms	1696 KB	Output is correct
27	Correct	33 ms	1696 KB	Output is correct
28	Correct	38 ms	1696 KB	Output is correct
29	Correct	34 ms	1696 KB	Output is correct
30	Correct	2 ms	1696 KB	Output is correct
31	Correct	33 ms	1696 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	259 ms	1964 KB	Output is correct
2	Correct	346 ms	2044 KB	Output is correct
3	Correct	239 ms	2044 KB	Output is correct
4	Correct	231 ms	2044 KB	Output is correct
5	Correct	270 ms	2044 KB	Output is correct
6	Correct	234 ms	2044 KB	Output is correct
7	Correct	35 ms	1696 KB	Output is correct
8	Correct	3 ms	1696 KB	Output is correct
9	Correct	36 ms	1696 KB	Output is correct
10	Correct	43 ms	1696 KB	Output is correct
11	Correct	35 ms	1696 KB	Output is correct
12	Correct	37 ms	1696 KB	Output is correct
13	Correct	38 ms	1696 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	34 ms	1696 KB	Output is correct
2	Correct	36 ms	1696 KB	Output is correct
3	Correct	34 ms	1696 KB	Output is correct
4	Correct	32 ms	1696 KB	Output is correct
5	Correct	35 ms	1696 KB	Output is correct
6	Correct	3 ms	1696 KB	Output is correct
7	Correct	33 ms	1696 KB	Output is correct
8	Correct	34 ms	1696 KB	Output is correct
9	Correct	37 ms	1696 KB	Output is correct
10	Correct	31 ms	1696 KB	Output is correct
11	Correct	31 ms	1696 KB	Output is correct
12	Correct	34 ms	1696 KB	Output is correct
13	Correct	34 ms	1696 KB	Output is correct
14	Correct	39 ms	1696 KB	Output is correct
15	Correct	31 ms	1696 KB	Output is correct
16	Correct	30 ms	1696 KB	Output is correct
17	Correct	259 ms	1964 KB	Output is correct
18	Correct	346 ms	2044 KB	Output is correct
19	Correct	239 ms	2044 KB	Output is correct
20	Correct	231 ms	2044 KB	Output is correct
21	Correct	270 ms	2044 KB	Output is correct
22	Correct	234 ms	2044 KB	Output is correct
23	Correct	35 ms	1696 KB	Output is correct
24	Correct	3 ms	1696 KB	Output is correct
25	Correct	36 ms	1696 KB	Output is correct
26	Correct	43 ms	1696 KB	Output is correct
27	Correct	35 ms	1696 KB	Output is correct
28	Correct	37 ms	1696 KB	Output is correct
29	Correct	38 ms	1696 KB	Output is correct
30	Correct	243 ms	2044 KB	Output is correct
31	Correct	227 ms	2044 KB	Output is correct
32	Correct	288 ms	2044 KB	Output is correct
33	Correct	262 ms	2044 KB	Output is correct
34	Correct	250 ms	2044 KB	Output is correct
35	Correct	260 ms	2044 KB	Output is correct
36	Correct	328 ms	2044 KB	Output is correct
37	Correct	3 ms	2044 KB	Output is correct
38	Correct	2 ms	2044 KB	Output is correct
39	Correct	253 ms	2044 KB	Output is correct
40	Correct	259 ms	2044 KB	Output is correct
41	Correct	256 ms	2044 KB	Output is correct
42	Correct	263 ms	2044 KB	Output is correct
43	Correct	252 ms	2044 KB	Output is correct
44	Correct	3 ms	2044 KB	Output is correct
45	Correct	36 ms	2044 KB	Output is correct
46	Correct	32 ms	2044 KB	Output is correct
47	Correct	31 ms	2044 KB	Output is correct
48	Correct	290 ms	2044 KB	Output is correct
49	Correct	300 ms	2068 KB	Output is correct
50	Correct	2 ms	2068 KB	Output is correct
51	Correct	287 ms	1656 KB	Output is correct
52	Correct	237 ms	1696 KB	Output is correct
53	Correct	221 ms	1696 KB	Output is correct
54	Correct	30 ms	1696 KB	Output is correct
55	Correct	29 ms	1696 KB	Output is correct
56	Correct	30 ms	1696 KB	Output is correct
57	Correct	32 ms	1696 KB	Output is correct
58	Correct	2 ms	1696 KB	Output is correct
59	Correct	33 ms	1696 KB	Output is correct
60	Correct	38 ms	1696 KB	Output is correct
61	Correct	34 ms	1696 KB	Output is correct
62	Correct	2 ms	1696 KB	Output is correct
63	Correct	33 ms	1696 KB	Output is correct

답안 #50123

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0