Submission #365204

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
365204	2021-02-11T08:21:02 Z	YJU	Travelling Merchant (APIO17_merchant)	C++14	100 / 100	97 ms	5612 KB

merchant

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e3+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
 
ll n,x,y,c,dp[N],val[N][N],dis[N][N],vis[N],m,k,sell[N][N],buy[N][N];
 
ll DIS[N][N];
 
bool ck(ll t){
	REP1(i,n)REP1(j,n)DIS[i][j]=(i==j||dis[i][j]==INF?-INF:val[i][j]-t*dis[i][j]);
	
	REP1(ii,n)REP1(i,n)REP1(j,n)DIS[i][j]=min(INF,max(DIS[i][j],DIS[i][ii]+DIS[ii][j]));
	REP1(i,n)REP1(j,n)if(i!=j&&DIS[i][j]+DIS[j][i]>=0)return 1;
	return 0;
}
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m>>k;
	REP1(i,n)REP1(j,n)dis[i][j]=(i==j?0:INF);
	REP1(i,n)REP1(j,k)cin>>buy[i][j]>>sell[i][j];
	REP(i,m){
		cin>>x>>y>>c;
		dis[x][y]=min(dis[x][y],c);
	}
	for(int ii=1;ii<=n;ii++){
		REP1(i,n)REP1(j,n){
			dis[i][j]=min(dis[i][j],dis[i][ii]+dis[ii][j]);
		}
	}
	REP1(i,n)REP1(j,n){
		REP1(ii,k){
			val[i][j]=max(val[i][j],(buy[i][ii]!=-1&&sell[j][ii]!=-1?sell[j][ii]-buy[i][ii]:0));
		}
	}
	/*
	cout<<"dis\n";
	REP1(i,n)REP1(j,n)cout<<dis[i][j]<<(j==n?"\n":" ");
	cout<<"val\n";
	REP1(i,n)REP1(j,n)cout<<val[i][j]<<(j==n?"\n":" ");
	*/
	ll ans=0;
	for(int i=30;i>=0;i--){
		if(ck(ans+(1LL<<i)))ans+=(1LL<<i);
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	88 ms	3564 KB	Output is correct
2	Correct	56 ms	2668 KB	Output is correct
3	Correct	51 ms	2668 KB	Output is correct
4	Correct	8 ms	1388 KB	Output is correct
5	Correct	8 ms	1388 KB	Output is correct
6	Correct	12 ms	1388 KB	Output is correct
7	Correct	11 ms	1516 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	8 ms	1388 KB	Output is correct
10	Correct	11 ms	1388 KB	Output is correct
11	Correct	8 ms	1388 KB	Output is correct
12	Correct	1 ms	620 KB	Output is correct
13	Correct	9 ms	1388 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	1516 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	9 ms	1516 KB	Output is correct
4	Correct	9 ms	1516 KB	Output is correct
5	Correct	9 ms	1516 KB	Output is correct
6	Correct	9 ms	1516 KB	Output is correct
7	Correct	8 ms	1388 KB	Output is correct
8	Correct	56 ms	2816 KB	Output is correct
9	Correct	91 ms	3476 KB	Output is correct
10	Correct	59 ms	2688 KB	Output is correct
11	Correct	61 ms	2796 KB	Output is correct
12	Correct	58 ms	2796 KB	Output is correct
13	Correct	56 ms	2668 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	1516 KB	Output is correct
2	Correct	8 ms	1388 KB	Output is correct
3	Correct	9 ms	1516 KB	Output is correct
4	Correct	8 ms	1408 KB	Output is correct
5	Correct	9 ms	1516 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	9 ms	1388 KB	Output is correct
8	Correct	9 ms	1664 KB	Output is correct
9	Correct	11 ms	1516 KB	Output is correct
10	Correct	9 ms	1516 KB	Output is correct
11	Correct	9 ms	1516 KB	Output is correct
12	Correct	9 ms	1516 KB	Output is correct
13	Correct	9 ms	1516 KB	Output is correct
14	Correct	9 ms	1516 KB	Output is correct
15	Correct	11 ms	1644 KB	Output is correct
16	Correct	8 ms	1388 KB	Output is correct
17	Correct	56 ms	2816 KB	Output is correct
18	Correct	91 ms	3476 KB	Output is correct
19	Correct	59 ms	2688 KB	Output is correct
20	Correct	61 ms	2796 KB	Output is correct
21	Correct	58 ms	2796 KB	Output is correct
22	Correct	56 ms	2668 KB	Output is correct
23	Correct	11 ms	1516 KB	Output is correct
24	Correct	1 ms	492 KB	Output is correct
25	Correct	9 ms	1516 KB	Output is correct
26	Correct	9 ms	1516 KB	Output is correct
27	Correct	9 ms	1516 KB	Output is correct
28	Correct	9 ms	1516 KB	Output is correct
29	Correct	8 ms	1388 KB	Output is correct
30	Correct	88 ms	3564 KB	Output is correct
31	Correct	56 ms	2668 KB	Output is correct
32	Correct	51 ms	2668 KB	Output is correct
33	Correct	8 ms	1388 KB	Output is correct
34	Correct	8 ms	1388 KB	Output is correct
35	Correct	12 ms	1388 KB	Output is correct
36	Correct	11 ms	1516 KB	Output is correct
37	Correct	1 ms	492 KB	Output is correct
38	Correct	8 ms	1388 KB	Output is correct
39	Correct	11 ms	1388 KB	Output is correct
40	Correct	8 ms	1388 KB	Output is correct
41	Correct	1 ms	620 KB	Output is correct
42	Correct	9 ms	1388 KB	Output is correct
43	Correct	56 ms	2668 KB	Output is correct
44	Correct	56 ms	2796 KB	Output is correct
45	Correct	76 ms	3948 KB	Output is correct
46	Correct	56 ms	2796 KB	Output is correct
47	Correct	56 ms	2796 KB	Output is correct
48	Correct	57 ms	2796 KB	Output is correct
49	Correct	97 ms	5356 KB	Output is correct
50	Correct	1 ms	492 KB	Output is correct
51	Correct	1 ms	640 KB	Output is correct
52	Correct	55 ms	2720 KB	Output is correct
53	Correct	59 ms	2724 KB	Output is correct
54	Correct	58 ms	2668 KB	Output is correct
55	Correct	56 ms	2796 KB	Output is correct
56	Correct	72 ms	2716 KB	Output is correct
57	Correct	1 ms	492 KB	Output is correct
58	Correct	10 ms	1644 KB	Output is correct
59	Correct	14 ms	1644 KB	Output is correct
60	Correct	10 ms	1644 KB	Output is correct
61	Correct	92 ms	5612 KB	Output is correct
62	Correct	91 ms	5484 KB	Output is correct
63	Correct	1 ms	492 KB	Output is correct

Submission #365204

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0