oj.uz

Submission #235091

# Submission time Handle Problem Language Result Execution time Memory
235091 2020-05-27T01:24:45 Z thtsshz_bgwrswh Travelling Merchant (APIO17_merchant) C++17
100 / 100
 136 ms 2424 KB 
#pragma GCC optimize("Ofast")
#include<stdio.h>
#include<vector> 
#include<algorithm> 
using namespace std;
struct Edge{
	long long to,d,p;
};
vector<Edge> g[105];
long long n,m,amount,num[105][1005][2],dis[105][105];
bool check(long long v){
	long long i,j,k;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			dis[i][j]=1000000000000000;
	//for(i=1;i<=n;i++)
	//	dis[i][i]=0;
	for(i=1;i<=n;i++)
		for(auto x:g[i])
			dis[i][x.to]=v*x.d-x.p;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			for(k=1;k<=n;k++)
				if(dis[j][k]>dis[j][i]+dis[i][k])
					dis[j][k]=dis[j][i]+dis[i][k];
	for(i=1;i<=n;i++)
		if(dis[i][i]<=0)
			return 1;
	return 0;
}
int main(){
	long long i,j,k,v,w,t;
	scanf("%lld%lld%lld",&n,&m,&amount);
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			dis[i][j]=1000000000000000;
	for(i=1;i<=n;i++)
		for(j=1;j<=amount;j++)
			scanf("%lld%lld",&num[i][j][0],&num[i][j][1]);//buy sell
	for(i=1;i<=n;i++)
		dis[i][i]=0;
	for(i=0;i<m;i++){
		scanf("%lld%lld%lld",&v,&w,&t);
		dis[v][w]=min(dis[v][w],t);
	}
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			for(k=1;k<=n;k++)
				if(dis[j][k]>dis[j][i]+dis[i][k])
					dis[j][k]=dis[j][i]+dis[i][k];
	for(i=1;i<=n;i++){
		for(j=1;j<=n;j++){
			if(i==j||dis[i][j]==1000000000000000)
				continue;
			long long maxv=0;
			for(k=1;k<=amount;k++){
				if(num[i][k][0]==-1||num[j][k][1]==-1)
					continue;
				maxv=max(maxv,num[j][k][1]-num[i][k][0]);
			}
			g[i].emplace_back((Edge){j,dis[i][j],maxv});
		} 
	}
	long long left=-1,right=1000000005;
	while(right-left>1){
		long long mid=(right+left)>>1;
		if(check(mid))
			left=mid;
		else
			right=mid;
	}
	printf("%lld\n",left);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld",&n,&m,&amount);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:39:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld%lld",&num[i][j][0],&num[i][j][1]);//buy sell
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld",&v,&w,&t);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 2296 KB Output is correct
2 Correct 36 ms 1144 KB Output is correct
3 Correct 38 ms 1152 KB Output is correct
4 Correct 11 ms 640 KB Output is correct
5 Correct 10 ms 640 KB Output is correct
6 Correct 9 ms 640 KB Output is correct
7 Correct 11 ms 640 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 10 ms 640 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
11 Correct 10 ms 640 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 10 ms 640 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 640 KB Output is correct
2 Correct 10 ms 640 KB Output is correct
3 Correct 10 ms 640 KB Output is correct
4 Correct 10 ms 640 KB Output is correct
5 Correct 15 ms 640 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 10 ms 640 KB Output is correct
9 Correct 10 ms 640 KB Output is correct
10 Correct 10 ms 640 KB Output is correct
11 Correct 13 ms 640 KB Output is correct
12 Correct 14 ms 640 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 11 ms 640 KB Output is correct
15 Correct 12 ms 640 KB Output is correct
16 Correct 10 ms 640 KB Output is correct
17 Correct 20 ms 640 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 17 ms 640 KB Output is correct
20 Correct 14 ms 640 KB Output is correct
21 Correct 12 ms 640 KB Output is correct
22 Correct 10 ms 640 KB Output is correct
23 Correct 11 ms 640 KB Output is correct
24 Correct 9 ms 640 KB Output is correct
25 Correct 11 ms 640 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 10 ms 640 KB Output is correct
28 Correct 9 ms 640 KB Output is correct
29 Correct 10 ms 640 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 10 ms 640 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 1280 KB Output is correct
2 Correct 136 ms 2296 KB Output is correct
3 Correct 77 ms 1272 KB Output is correct
4 Correct 100 ms 1280 KB Output is correct
5 Correct 98 ms 1280 KB Output is correct
6 Correct 51 ms 1152 KB Output is correct
7 Correct 20 ms 640 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 17 ms 640 KB Output is correct
10 Correct 14 ms 640 KB Output is correct
11 Correct 12 ms 640 KB Output is correct
12 Correct 10 ms 640 KB Output is correct
13 Correct 11 ms 640 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 640 KB Output is correct
2 Correct 10 ms 640 KB Output is correct
3 Correct 10 ms 640 KB Output is correct
4 Correct 10 ms 640 KB Output is correct
5 Correct 15 ms 640 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 10 ms 640 KB Output is correct
9 Correct 10 ms 640 KB Output is correct
10 Correct 10 ms 640 KB Output is correct
11 Correct 13 ms 640 KB Output is correct
12 Correct 14 ms 640 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 11 ms 640 KB Output is correct
15 Correct 12 ms 640 KB Output is correct
16 Correct 10 ms 640 KB Output is correct
17 Correct 93 ms 1280 KB Output is correct
18 Correct 136 ms 2296 KB Output is correct
19 Correct 77 ms 1272 KB Output is correct
20 Correct 100 ms 1280 KB Output is correct
21 Correct 98 ms 1280 KB Output is correct
22 Correct 51 ms 1152 KB Output is correct
23 Correct 20 ms 640 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 17 ms 640 KB Output is correct
26 Correct 14 ms 640 KB Output is correct
27 Correct 12 ms 640 KB Output is correct
28 Correct 10 ms 640 KB Output is correct
29 Correct 11 ms 640 KB Output is correct
30 Correct 41 ms 1152 KB Output is correct
31 Correct 46 ms 1280 KB Output is correct
32 Correct 62 ms 2300 KB Output is correct
33 Correct 40 ms 1280 KB Output is correct
34 Correct 43 ms 1280 KB Output is correct
35 Correct 44 ms 1280 KB Output is correct
36 Correct 109 ms 2296 KB Output is correct
37 Correct 4 ms 384 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 39 ms 1152 KB Output is correct
40 Correct 40 ms 1152 KB Output is correct
41 Correct 38 ms 1024 KB Output is correct
42 Correct 38 ms 1152 KB Output is correct
43 Correct 38 ms 1152 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 13 ms 768 KB Output is correct
46 Correct 12 ms 768 KB Output is correct
47 Correct 12 ms 640 KB Output is correct
48 Correct 95 ms 2296 KB Output is correct
49 Correct 102 ms 2424 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 69 ms 2296 KB Output is correct
52 Correct 36 ms 1144 KB Output is correct
53 Correct 38 ms 1152 KB Output is correct
54 Correct 11 ms 640 KB Output is correct
55 Correct 10 ms 640 KB Output is correct
56 Correct 9 ms 640 KB Output is correct
57 Correct 11 ms 640 KB Output is correct
58 Correct 4 ms 384 KB Output is correct
59 Correct 10 ms 640 KB Output is correct
60 Correct 9 ms 640 KB Output is correct
61 Correct 10 ms 640 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 10 ms 640 KB Output is correct