답안 #80298 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
80298	2018-10-19T21:36:40 Z	Plurm	여행하는 상인 (APIO17_merchant)	C++11	54 / 100	136 ms	1788 KB

merchant

#include <bits/stdc++.h>
using namespace std;
int b[128][1024];
int s[128][1024];
int profit[128][128];
long long d1[128][128];
long long d2[128][128];
int main(){
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	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 = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			for(int l = 1; l <= k; l++){
				if(b[i][l] != -1 && s[j][l] != -1){
					profit[i][j] = max(profit[i][j],s[j][l] - b[i][l]);
				}
			}
			d1[i][j] = 1e8;
		}
	}
	for(int i = 1; i <= m; i++){
		int v,w,t;
		scanf("%d%d%d",&v,&w,&t);
		d1[v][w] = t;
	}
	for(int l = 1; l <= n; l++){
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				d1[i][j] = min(d1[i][j],d1[i][l] + d1[l][j]);
			}
		}
	}
	long long lo = 0ll;
	long long hi = 5e12;
	long long mid;
	while(lo < hi){
		mid = (lo + hi + 1ll)/2ll;
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				d2[i][j] = profit[i][j] - mid*min((long long)1e18/mid,d1[i][j]);
			}
		}
		for(int l = 1; l <= n; l++){
			for(int i = 1; i <= n; i++){
				for(int j = 1; j <= n; j++){
					d2[i][j] = max(d2[i][j],d2[i][l] + d2[l][j]);
				}
			}
		}
		bool ok = false;
		for(int i = 1; i <= n; i++){
			if(d2[i][i] >= 0){
				ok = true;
			}
		}
		if(ok){
			lo = mid;
		}else{
			hi = mid-1ll;
		}
	}
	printf("%lld\n",lo);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:10:7: 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:13:9: 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:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&v,&w,&t);
   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	94 ms	1400 KB	Output is correct
2	Incorrect	57 ms	1400 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	71 ms	1632 KB	Output is correct
2	Correct	119 ms	1668 KB	Output is correct
3	Correct	63 ms	1668 KB	Output is correct
4	Correct	64 ms	1760 KB	Output is correct
5	Correct	67 ms	1760 KB	Output is correct
6	Correct	69 ms	1760 KB	Output is correct
7	Correct	12 ms	1400 KB	Output is correct
8	Correct	2 ms	1400 KB	Output is correct
9	Correct	12 ms	1400 KB	Output is correct
10	Correct	11 ms	1400 KB	Output is correct
11	Correct	11 ms	1400 KB	Output is correct
12	Correct	12 ms	1400 KB	Output is correct
13	Correct	11 ms	1400 KB	Output is correct

Subtask #4
0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	1400 KB	Output is correct
2	Correct	10 ms	1400 KB	Output is correct
3	Correct	11 ms	1400 KB	Output is correct
4	Correct	10 ms	1400 KB	Output is correct
5	Correct	13 ms	1400 KB	Output is correct
6	Correct	2 ms	1400 KB	Output is correct
7	Correct	10 ms	1400 KB	Output is correct
8	Correct	16 ms	1400 KB	Output is correct
9	Correct	11 ms	1400 KB	Output is correct
10	Correct	10 ms	1400 KB	Output is correct
11	Correct	13 ms	1400 KB	Output is correct
12	Correct	11 ms	1400 KB	Output is correct
13	Correct	10 ms	1400 KB	Output is correct
14	Correct	11 ms	1400 KB	Output is correct
15	Correct	12 ms	1400 KB	Output is correct
16	Correct	11 ms	1400 KB	Output is correct
17	Correct	71 ms	1632 KB	Output is correct
18	Correct	119 ms	1668 KB	Output is correct
19	Correct	63 ms	1668 KB	Output is correct
20	Correct	64 ms	1760 KB	Output is correct
21	Correct	67 ms	1760 KB	Output is correct
22	Correct	69 ms	1760 KB	Output is correct
23	Correct	12 ms	1400 KB	Output is correct
24	Correct	2 ms	1400 KB	Output is correct
25	Correct	12 ms	1400 KB	Output is correct
26	Correct	11 ms	1400 KB	Output is correct
27	Correct	11 ms	1400 KB	Output is correct
28	Correct	12 ms	1400 KB	Output is correct
29	Correct	11 ms	1400 KB	Output is correct
30	Correct	62 ms	1760 KB	Output is correct
31	Correct	62 ms	1760 KB	Output is correct
32	Correct	82 ms	1760 KB	Output is correct
33	Correct	65 ms	1760 KB	Output is correct
34	Correct	68 ms	1760 KB	Output is correct
35	Correct	102 ms	1760 KB	Output is correct
36	Correct	136 ms	1760 KB	Output is correct
37	Correct	3 ms	1760 KB	Output is correct
38	Correct	2 ms	1760 KB	Output is correct
39	Correct	60 ms	1760 KB	Output is correct
40	Correct	61 ms	1760 KB	Output is correct
41	Correct	63 ms	1788 KB	Output is correct
42	Correct	59 ms	1788 KB	Output is correct
43	Correct	60 ms	1788 KB	Output is correct
44	Correct	2 ms	1788 KB	Output is correct
45	Correct	12 ms	1788 KB	Output is correct
46	Correct	12 ms	1788 KB	Output is correct
47	Correct	12 ms	1788 KB	Output is correct
48	Correct	131 ms	1788 KB	Output is correct
49	Correct	128 ms	1788 KB	Output is correct
50	Correct	2 ms	1788 KB	Output is correct
51	Correct	94 ms	1400 KB	Output is correct
52	Incorrect	57 ms	1400 KB	Output isn't correct
53	Halted	0 ms	0 KB	-

답안 #80298

Compilation message

Subtask #1 0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 0 / 34.0

Subtask #1
0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
0 / 34.0