oj.uz

Submission #111529

# Submission time Handle Problem Language Result Execution time Memory
111529 2019-05-15T14:12:25 Z Segtree Travelling Merchant (APIO17_merchant) C++14
100 / 100
 528 ms 3960 KB 
#include<iostream>
#include<algorithm>
using namespace std;
typedef long double ll;
typedef long double ld;
#define chmax(a,b) a=max(a,b);
#define chmin(a,b) a=min(a,b);
#define N 110
#define K 1010
ll n,m,k,d[N][N],v[N][N];
ll s[N][K],b[N][K];
void wf(){
    for(int r=1;r<=n;r++){
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){
	    d[i][j]=min(d[i][j],d[i][r]+d[r][j]);
	}
    }
}
 
ld dist[N];
bool solve(ll t){
    /*cout<<"-----"<<t<<endl;
    for(int i=1;i<=n;i++){
	cout<<i<<":";
	for(int j=1;j<=n;j++)cout<<v[i][j]-t*d[i][j]<<" ";
	cout<<endl;
    }*/
    for(int i=1;i<=n;i++)dist[i]=0;
    for(int u=0;u<=N;u++){
	for(int i=1;i<=n;i++){
	    for(int j=1;j<=n;j++)if(i!=j){
		ld ne=dist[i]-(v[i][j]-t*d[i][j]+1e-5);
		if(u==N&&dist[j]>ne)return 1;
		chmin(dist[j],ne);
	    }
	}
    }
    return 0;
}
 
int main(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){
	d[i][j]=1e17;
    }
    for(int i=1;i<=n;i++){
	for(int j=0;j<k;j++){
	    cin>>b[i][j]>>s[i][j];
	    d[i][i]=0;
	}
    } 
    for(int i=0;i<m;i++){
	ll x,y,z;cin>>x>>y>>z;
	d[(int)x][(int)y]=z;
    }
    wf();
    /*
    for(int i=1;i<=n;i++){
	cout<<i<<":";
	for(int j=1;j<=n;j++)cout<<d[i][j]<<" ";
	cout<<endl;
    }*/
    for(int r=1;r<=n;r++){
	for(int i=1;i<=n;i++){
	    ll ma=0;
	    for(int j=0;j<k;j++){
		if(-1!=s[i][j]&&-1!=b[r][j])ma=max(ma,s[i][j]-b[r][j]);
	    }
	    v[r][i]=ma;
	}
    }
    long long l=0,r=2e9,mid;
    while(l<r-1){
	mid=(l+r)/2;
	if(solve(mid))l=mid;
	else r=mid;
    }
    cout<<l<<endl;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 417 ms 3892 KB Output is correct
2 Correct 299 ms 1528 KB Output is correct
3 Correct 303 ms 1656 KB Output is correct
4 Correct 85 ms 896 KB Output is correct
5 Correct 79 ms 896 KB Output is correct
6 Correct 74 ms 896 KB Output is correct
7 Correct 97 ms 1080 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 82 ms 1016 KB Output is correct
10 Correct 83 ms 896 KB Output is correct
11 Correct 81 ms 896 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 84 ms 1144 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1016 KB Output is correct
2 Correct 72 ms 896 KB Output is correct
3 Correct 77 ms 1144 KB Output is correct
4 Correct 67 ms 1024 KB Output is correct
5 Correct 88 ms 992 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 73 ms 1008 KB Output is correct
8 Correct 99 ms 1024 KB Output is correct
9 Correct 69 ms 996 KB Output is correct
10 Correct 84 ms 1116 KB Output is correct
11 Correct 90 ms 1144 KB Output is correct
12 Correct 83 ms 1040 KB Output is correct
13 Correct 116 ms 896 KB Output is correct
14 Correct 80 ms 996 KB Output is correct
15 Correct 86 ms 1048 KB Output is correct
16 Correct 101 ms 896 KB Output is correct
17 Correct 74 ms 1024 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 84 ms 1024 KB Output is correct
20 Correct 94 ms 1044 KB Output is correct
21 Correct 91 ms 1024 KB Output is correct
22 Correct 98 ms 896 KB Output is correct
23 Correct 84 ms 896 KB Output is correct
24 Correct 74 ms 896 KB Output is correct
25 Correct 97 ms 1080 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 82 ms 1016 KB Output is correct
28 Correct 83 ms 896 KB Output is correct
29 Correct 81 ms 896 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 84 ms 1144 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 1844 KB Output is correct
2 Correct 521 ms 3888 KB Output is correct
3 Correct 320 ms 1664 KB Output is correct
4 Correct 341 ms 1820 KB Output is correct
5 Correct 341 ms 1840 KB Output is correct
6 Correct 317 ms 1664 KB Output is correct
7 Correct 74 ms 1024 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 84 ms 1024 KB Output is correct
10 Correct 94 ms 1044 KB Output is correct
11 Correct 91 ms 1024 KB Output is correct
12 Correct 98 ms 896 KB Output is correct
13 Correct 84 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1016 KB Output is correct
2 Correct 72 ms 896 KB Output is correct
3 Correct 77 ms 1144 KB Output is correct
4 Correct 67 ms 1024 KB Output is correct
5 Correct 88 ms 992 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 73 ms 1008 KB Output is correct
8 Correct 99 ms 1024 KB Output is correct
9 Correct 69 ms 996 KB Output is correct
10 Correct 84 ms 1116 KB Output is correct
11 Correct 90 ms 1144 KB Output is correct
12 Correct 83 ms 1040 KB Output is correct
13 Correct 116 ms 896 KB Output is correct
14 Correct 80 ms 996 KB Output is correct
15 Correct 86 ms 1048 KB Output is correct
16 Correct 101 ms 896 KB Output is correct
17 Correct 296 ms 1844 KB Output is correct
18 Correct 521 ms 3888 KB Output is correct
19 Correct 320 ms 1664 KB Output is correct
20 Correct 341 ms 1820 KB Output is correct
21 Correct 341 ms 1840 KB Output is correct
22 Correct 317 ms 1664 KB Output is correct
23 Correct 74 ms 1024 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 84 ms 1024 KB Output is correct
26 Correct 94 ms 1044 KB Output is correct
27 Correct 91 ms 1024 KB Output is correct
28 Correct 98 ms 896 KB Output is correct
29 Correct 84 ms 896 KB Output is correct
30 Correct 347 ms 1596 KB Output is correct
31 Correct 317 ms 1912 KB Output is correct
32 Correct 416 ms 3960 KB Output is correct
33 Correct 326 ms 1840 KB Output is correct
34 Correct 344 ms 1852 KB Output is correct
35 Correct 322 ms 1912 KB Output is correct
36 Correct 528 ms 3892 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 282 ms 1536 KB Output is correct
40 Correct 347 ms 1528 KB Output is correct
41 Correct 312 ms 1664 KB Output is correct
42 Correct 274 ms 1664 KB Output is correct
43 Correct 306 ms 1536 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 80 ms 1124 KB Output is correct
46 Correct 85 ms 1020 KB Output is correct
47 Correct 84 ms 1024 KB Output is correct
48 Correct 466 ms 3940 KB Output is correct
49 Correct 480 ms 3916 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 417 ms 3892 KB Output is correct
52 Correct 299 ms 1528 KB Output is correct
53 Correct 303 ms 1656 KB Output is correct
54 Correct 85 ms 896 KB Output is correct
55 Correct 79 ms 896 KB Output is correct
56 Correct 74 ms 896 KB Output is correct
57 Correct 97 ms 1080 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 82 ms 1016 KB Output is correct
60 Correct 83 ms 896 KB Output is correct
61 Correct 81 ms 896 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 84 ms 1144 KB Output is correct