oj.uz

Submission #110975

# Submission time Handle Problem Language Result Execution time Memory
110975 2019-05-13T12:45:45 Z nxteru Travelling Merchant (APIO17_merchant) C++14
100 / 100
 112 ms 4344 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll,ll> P;
typedef pair<ll,P> T;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 1000000001
ll n,m,k,s[105][1005],b[105][1005],d[105][105];
vector<T>g[105];
bool check(ll x){
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)d[i][j]=INF;
	for(int i=0;i<n;i++){
		for(int j=0;j<g[i].size();j++){
			d[i][g[i][j].F]=x*g[i][j].S.S-g[i][j].S.F;
		}
	}
	for(int l=0;l<n;l++){
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				if(d[i][l]!=INF&&d[l][j]!=INF)d[i][j]=min(d[i][j],d[i][l]+d[l][j]);
			}
			if(d[i][i]<=0)return true;
		}
	}
	return false;
}
int main(void){
	scanf("%lld%lld%lld",&n,&m,&k);
	for(int i=0;i<n;i++){
		for(int j=0;j<k;j++){
			scanf("%lld%lld",&s[i][j],&b[i][j]);
		}
	}
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)d[i][j]=INF;
	for(int i=0;i<m;i++){
		ll v,w,t;
		scanf("%lld%lld%lld",&v,&w,&t);
		v--,w--;
		d[v][w]=t;
	}
	for(int i=0;i<n;i++)d[i][i]=0;
	for(int l=0;l<n;l++){
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				d[i][j]=min(d[i][j],d[i][l]+d[l][j]);
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j||d[i][j]==INF)continue;
			ll ma=0;
			for(int l=0;l<k;l++){
				if(s[i][l]!=-1&&b[j][l]!=-1){
					ma=max(ma,b[j][l]-s[i][l]);
				}
			}
			g[i].PB(T(j,P(ma,d[i][j])));
		}
	}
	ll l=0,r=INF;
	while(r-l>1){
		ll x=(l+r)/2LL;
		if(check(x))l=x;
		else r=x;
	}
	printf("%lld\n",l);
}

Compilation message

merchant.cpp: In function 'bool check(ll)':
merchant.cpp:17:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<g[i].size();j++){
               ~^~~~~~~~~~~~
merchant.cpp: In function 'int main()':
merchant.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld",&n,&m,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:35:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld%lld",&s[i][j],&b[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:41: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 75 ms 2296 KB Output is correct
2 Correct 52 ms 1656 KB Output is correct
3 Correct 29 ms 1536 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 10 ms 768 KB Output is correct
6 Correct 9 ms 896 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 6 ms 896 KB Output is correct
11 Correct 7 ms 924 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 10 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1748 KB Output is correct
2 Correct 84 ms 4088 KB Output is correct
3 Correct 51 ms 1704 KB Output is correct
4 Correct 50 ms 1920 KB Output is correct
5 Correct 49 ms 1920 KB Output is correct
6 Correct 56 ms 1664 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 9 ms 896 KB Output is correct
13 Correct 9 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 896 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 7 ms 768 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 8 ms 896 KB Output is correct
16 Correct 8 ms 896 KB Output is correct
17 Correct 46 ms 1748 KB Output is correct
18 Correct 84 ms 4088 KB Output is correct
19 Correct 51 ms 1704 KB Output is correct
20 Correct 50 ms 1920 KB Output is correct
21 Correct 49 ms 1920 KB Output is correct
22 Correct 56 ms 1664 KB Output is correct
23 Correct 8 ms 896 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 11 ms 896 KB Output is correct
26 Correct 10 ms 896 KB Output is correct
27 Correct 9 ms 896 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 9 ms 896 KB Output is correct
30 Correct 73 ms 1536 KB Output is correct
31 Correct 50 ms 1664 KB Output is correct
32 Correct 68 ms 2936 KB Output is correct
33 Correct 52 ms 1764 KB Output is correct
34 Correct 52 ms 1808 KB Output is correct
35 Correct 69 ms 1664 KB Output is correct
36 Correct 112 ms 4280 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 3 ms 384 KB Output is correct
39 Correct 48 ms 1536 KB Output is correct
40 Correct 49 ms 1664 KB Output is correct
41 Correct 48 ms 1536 KB Output is correct
42 Correct 40 ms 1536 KB Output is correct
43 Correct 46 ms 1536 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 13 ms 1024 KB Output is correct
46 Correct 9 ms 1152 KB Output is correct
47 Correct 10 ms 896 KB Output is correct
48 Correct 106 ms 4344 KB Output is correct
49 Correct 96 ms 4316 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 75 ms 2296 KB Output is correct
52 Correct 52 ms 1656 KB Output is correct
53 Correct 29 ms 1536 KB Output is correct
54 Correct 9 ms 896 KB Output is correct
55 Correct 10 ms 768 KB Output is correct
56 Correct 9 ms 896 KB Output is correct
57 Correct 8 ms 896 KB Output is correct
58 Correct 3 ms 384 KB Output is correct
59 Correct 6 ms 768 KB Output is correct
60 Correct 6 ms 896 KB Output is correct
61 Correct 7 ms 924 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 10 ms 896 KB Output is correct