oj.uz

Submission #55395

# Submission time Handle Problem Language Result Execution time Memory
55395 2018-07-07T06:55:47 Z fefe Travelling Merchant (APIO17_merchant) C++17
100 / 100
 134 ms 10476 KB 
#include<bits/stdc++.h>
//#include<inttypes.h>//__int64,__int128..
#define MAX_N 105
#define MAX_K 1005
//vector&pair
#define pb push_back
#define mp make_pair
//math
#define sq(x) ((x)*(x))
#define abs(x) ((x)>0?(x):(-(x)))//Regardless of type
//for pair
#define fi first
#define se second
//infinit
#define inf (1LL<<60)
#define full_inf 0x7fffffff
#define half_inf 0x3fffffff
//MOD
#define MOD 1000000007LL*/
using namespace std;
//type
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pil;
typedef long double LD;
struct im{
	LL b,s;
}pd[MAX_N][MAX_K];
LL n,m,c;
LL net[MAX_N][MAX_N],dst[MAX_N][MAX_N],rev[MAX_N][MAX_N];
bool is_ok(LL K){
	LL i,j,k;
	for(i=1;i<=n;i++){
		for(j=1;j<=n;j++){
			if(net[i][j]==inf)	dst[i][j]=inf;
			else	dst[i][j]=K*net[i][j]-rev[i][j];
		}
	}
	for(k=1;k<=n;k++){
		for(i=1;i<=n;i++){
			for(j=1;j<=n;j++){
				dst[i][j]=min(dst[i][j],dst[i][k]+dst[k][j]);
			}
		}
	}
	for(i=1;i<=n;i++){
		if(dst[i][i]<=0)	return true;
	}
	return false;
}
LL bin(){
	LL s,e,mid;
	bool x;
	s=1;
	e=1000000000;
	while(s<=e){
		mid=(s+e)>>1;
		x=is_ok(mid);
		if(x){
			if(!is_ok(mid+1))	return mid;
			s=mid+1;
		}else{
			if(is_ok(mid-1))	return mid-1;
			e=mid-1;
		}
	}
	return 0;
}
int main(){
	LL i,j,k,s,e;
	scanf("%lld %lld %lld",&n,&m,&c);
	for(i=1;i<=n;i++){
		for(j=1;j<=c;j++){
			scanf("%lld %lld",&pd[i][j].b,&pd[i][j].s);
			if(pd[i][j].b==-1)	pd[i][j].b=inf;
			if(pd[i][j].s==-1)	pd[i][j].s=-inf;
		}
	}
	for(i=1;i<=n;i++){
		for(j=1;j<=n;j++){
			net[i][j]=inf;
			for(k=1;k<=c;k++)	rev[i][j]=max(rev[i][j],pd[j][k].s-pd[i][k].b);
		}
	}
	for(i=1;i<=m;i++){scanf("%lld %lld",&s,&e);scanf("%lld",&net[s][e]);}
	//Floyd-Warshall
	for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++){
		net[i][j]=min(net[i][j],net[i][k]+net[k][j]);
	}	
	printf("%lld\n",bin());
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:71:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld",&n,&m,&c);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:74:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld %lld",&pd[i][j].b,&pd[i][j].s);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:85:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=m;i++){scanf("%lld %lld",&s,&e);scanf("%lld",&net[s][e]);}
                    ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:85:50: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=m;i++){scanf("%lld %lld",&s,&e);scanf("%lld",&net[s][e]);}
                                             ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 2168 KB Output is correct
2 Correct 83 ms 2168 KB Output is correct
3 Correct 79 ms 2168 KB Output is correct
4 Correct 12 ms 2168 KB Output is correct
5 Correct 13 ms 2168 KB Output is correct
6 Correct 12 ms 2168 KB Output is correct
7 Correct 12 ms 2168 KB Output is correct
8 Correct 3 ms 2168 KB Output is correct
9 Correct 21 ms 2168 KB Output is correct
10 Correct 14 ms 2168 KB Output is correct
11 Correct 15 ms 2168 KB Output is correct
12 Correct 2 ms 2168 KB Output is correct
13 Correct 17 ms 2168 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 2168 KB Output is correct
2 Correct 111 ms 3056 KB Output is correct
3 Correct 85 ms 3056 KB Output is correct
4 Correct 79 ms 3056 KB Output is correct
5 Correct 83 ms 3056 KB Output is correct
6 Correct 81 ms 3056 KB Output is correct
7 Correct 12 ms 2168 KB Output is correct
8 Correct 2 ms 2168 KB Output is correct
9 Correct 14 ms 2168 KB Output is correct
10 Correct 14 ms 2168 KB Output is correct
11 Correct 13 ms 2168 KB Output is correct
12 Correct 13 ms 2168 KB Output is correct
13 Correct 15 ms 2168 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2168 KB Output is correct
2 Correct 17 ms 2168 KB Output is correct
3 Correct 14 ms 2168 KB Output is correct
4 Correct 16 ms 2168 KB Output is correct
5 Correct 15 ms 2168 KB Output is correct
6 Correct 2 ms 2168 KB Output is correct
7 Correct 14 ms 2168 KB Output is correct
8 Correct 19 ms 2168 KB Output is correct
9 Correct 15 ms 2168 KB Output is correct
10 Correct 15 ms 2168 KB Output is correct
11 Correct 13 ms 2168 KB Output is correct
12 Correct 13 ms 2168 KB Output is correct
13 Correct 13 ms 2168 KB Output is correct
14 Correct 13 ms 2168 KB Output is correct
15 Correct 19 ms 2168 KB Output is correct
16 Correct 16 ms 2168 KB Output is correct
17 Correct 81 ms 2168 KB Output is correct
18 Correct 111 ms 3056 KB Output is correct
19 Correct 85 ms 3056 KB Output is correct
20 Correct 79 ms 3056 KB Output is correct
21 Correct 83 ms 3056 KB Output is correct
22 Correct 81 ms 3056 KB Output is correct
23 Correct 12 ms 2168 KB Output is correct
24 Correct 2 ms 2168 KB Output is correct
25 Correct 14 ms 2168 KB Output is correct
26 Correct 14 ms 2168 KB Output is correct
27 Correct 13 ms 2168 KB Output is correct
28 Correct 13 ms 2168 KB Output is correct
29 Correct 15 ms 2168 KB Output is correct
30 Correct 81 ms 3056 KB Output is correct
31 Correct 85 ms 3056 KB Output is correct
32 Correct 101 ms 3660 KB Output is correct
33 Correct 82 ms 3660 KB Output is correct
34 Correct 87 ms 3660 KB Output is correct
35 Correct 83 ms 3660 KB Output is correct
36 Correct 123 ms 5820 KB Output is correct
37 Correct 4 ms 5820 KB Output is correct
38 Correct 3 ms 5820 KB Output is correct
39 Correct 80 ms 5820 KB Output is correct
40 Correct 101 ms 5820 KB Output is correct
41 Correct 77 ms 5820 KB Output is correct
42 Correct 81 ms 5820 KB Output is correct
43 Correct 79 ms 5820 KB Output is correct
44 Correct 3 ms 5820 KB Output is correct
45 Correct 19 ms 5820 KB Output is correct
46 Correct 17 ms 5820 KB Output is correct
47 Correct 18 ms 5820 KB Output is correct
48 Correct 134 ms 8372 KB Output is correct
49 Correct 130 ms 10476 KB Output is correct
50 Correct 2 ms 10476 KB Output is correct
51 Correct 114 ms 2168 KB Output is correct
52 Correct 83 ms 2168 KB Output is correct
53 Correct 79 ms 2168 KB Output is correct
54 Correct 12 ms 2168 KB Output is correct
55 Correct 13 ms 2168 KB Output is correct
56 Correct 12 ms 2168 KB Output is correct
57 Correct 12 ms 2168 KB Output is correct
58 Correct 3 ms 2168 KB Output is correct
59 Correct 21 ms 2168 KB Output is correct
60 Correct 14 ms 2168 KB Output is correct
61 Correct 15 ms 2168 KB Output is correct
62 Correct 2 ms 2168 KB Output is correct
63 Correct 17 ms 2168 KB Output is correct