답안 #246875

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246875	2020-07-10T13:18:51 Z	errorgorn	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	150 ms	4276 KB

merchant

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

ll MAX(ll a){return a;}
ll MIN(ll a){return a;}
template<typename... Args>
ll MAX(ll a,Args... args){return max(a,MAX(args...));}
template<typename... Args>
ll MIN(ll a,Args... args){return min(a,MIN(args...));}

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m,k;
ll buy[105][1005];
ll sell[105][1005];

ll dist[105][105];
ll val[105][105];

ll APSP[105][105];

bool can(ll i){
	rep(x,0,n) rep(y,0,n){
		APSP[x][y]=val[x][y]-dist[x][y]*i;
	}
	
	rep(k,0,n){
		rep(i,0,n){
			rep(j,0,n){
				APSP[i][j]=max(APSP[i][j],APSP[i][k]+APSP[k][j]);
			}
		}
	}
	
	rep(x,0,n) if (APSP[x][x]>=0) return true;
	return false;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n>>m>>k;
	
	rep(x,0,n) rep(y,0,k){
		cin>>buy[x][y]>>sell[x][y];
		
		if (buy[x][y]==-1) buy[x][y]=1e18;
		if (sell[x][y]==-1) sell[x][y]=-1e18;
	}
	
	rep(x,0,n) rep(y,0,n) dist[x][y]=1e9;
	
	int a,b,c;
	rep(x,0,m){
		cin>>a>>b>>c;
		a--,b--;
		
		dist[a][b]=c;
	}
	
	rep(k,0,n){
		rep(i,0,n){
			rep(j,0,n){
				dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
			}
		}
	}
	
	rep(x,0,n) rep(y,0,n){
		rep(z,0,k) val[x][y]=max(val[x][y],sell[y][z]-buy[x][z]);
	}
	
	
	ll lo=0,hi=1e9+100,mi;
	
	while (hi-lo>1){
		mi=hi+lo>>1;
		
		if (can(mi)) lo=mi;
		else hi=mi;
	}
	
	cout<<lo<<endl;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:100:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   mi=hi+lo>>1;
      ~~^~~

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	125 ms	3448 KB	Output is correct
2	Correct	91 ms	1440 KB	Output is correct
3	Correct	71 ms	1452 KB	Output is correct
4	Correct	13 ms	896 KB	Output is correct
5	Correct	13 ms	896 KB	Output is correct
6	Correct	14 ms	896 KB	Output is correct
7	Correct	15 ms	1024 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	14 ms	896 KB	Output is correct
10	Correct	13 ms	896 KB	Output is correct
11	Correct	13 ms	896 KB	Output is correct
12	Correct	5 ms	512 KB	Output is correct
13	Correct	14 ms	1024 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	896 KB	Output is correct
2	Correct	13 ms	896 KB	Output is correct
3	Correct	14 ms	1024 KB	Output is correct
4	Correct	13 ms	896 KB	Output is correct
5	Correct	18 ms	1024 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	13 ms	896 KB	Output is correct
8	Correct	16 ms	896 KB	Output is correct
9	Correct	13 ms	896 KB	Output is correct
10	Correct	13 ms	896 KB	Output is correct
11	Correct	14 ms	1024 KB	Output is correct
12	Correct	15 ms	1024 KB	Output is correct
13	Correct	15 ms	896 KB	Output is correct
14	Correct	22 ms	896 KB	Output is correct
15	Correct	20 ms	1024 KB	Output is correct
16	Correct	18 ms	896 KB	Output is correct
17	Correct	20 ms	1024 KB	Output is correct
18	Correct	6 ms	384 KB	Output is correct
19	Correct	19 ms	1024 KB	Output is correct
20	Correct	16 ms	1024 KB	Output is correct
21	Correct	17 ms	1024 KB	Output is correct
22	Correct	13 ms	964 KB	Output is correct
23	Correct	13 ms	896 KB	Output is correct
24	Correct	14 ms	896 KB	Output is correct
25	Correct	15 ms	1024 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	14 ms	896 KB	Output is correct
28	Correct	13 ms	896 KB	Output is correct
29	Correct	13 ms	896 KB	Output is correct
30	Correct	5 ms	512 KB	Output is correct
31	Correct	14 ms	1024 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	74 ms	1664 KB	Output is correct
2	Correct	141 ms	3936 KB	Output is correct
3	Correct	69 ms	1536 KB	Output is correct
4	Correct	88 ms	1856 KB	Output is correct
5	Correct	116 ms	1792 KB	Output is correct
6	Correct	114 ms	1536 KB	Output is correct
7	Correct	20 ms	1024 KB	Output is correct
8	Correct	6 ms	384 KB	Output is correct
9	Correct	19 ms	1024 KB	Output is correct
10	Correct	16 ms	1024 KB	Output is correct
11	Correct	17 ms	1024 KB	Output is correct
12	Correct	13 ms	964 KB	Output is correct
13	Correct	13 ms	896 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	896 KB	Output is correct
2	Correct	13 ms	896 KB	Output is correct
3	Correct	14 ms	1024 KB	Output is correct
4	Correct	13 ms	896 KB	Output is correct
5	Correct	18 ms	1024 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	13 ms	896 KB	Output is correct
8	Correct	16 ms	896 KB	Output is correct
9	Correct	13 ms	896 KB	Output is correct
10	Correct	13 ms	896 KB	Output is correct
11	Correct	14 ms	1024 KB	Output is correct
12	Correct	15 ms	1024 KB	Output is correct
13	Correct	15 ms	896 KB	Output is correct
14	Correct	22 ms	896 KB	Output is correct
15	Correct	20 ms	1024 KB	Output is correct
16	Correct	18 ms	896 KB	Output is correct
17	Correct	74 ms	1664 KB	Output is correct
18	Correct	141 ms	3936 KB	Output is correct
19	Correct	69 ms	1536 KB	Output is correct
20	Correct	88 ms	1856 KB	Output is correct
21	Correct	116 ms	1792 KB	Output is correct
22	Correct	114 ms	1536 KB	Output is correct
23	Correct	20 ms	1024 KB	Output is correct
24	Correct	6 ms	384 KB	Output is correct
25	Correct	19 ms	1024 KB	Output is correct
26	Correct	16 ms	1024 KB	Output is correct
27	Correct	17 ms	1024 KB	Output is correct
28	Correct	13 ms	964 KB	Output is correct
29	Correct	13 ms	896 KB	Output is correct
30	Correct	81 ms	1504 KB	Output is correct
31	Correct	90 ms	1716 KB	Output is correct
32	Correct	111 ms	2680 KB	Output is correct
33	Correct	82 ms	1784 KB	Output is correct
34	Correct	74 ms	1664 KB	Output is correct
35	Correct	72 ms	1664 KB	Output is correct
36	Correct	136 ms	4092 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Correct	5 ms	384 KB	Output is correct
39	Correct	73 ms	1408 KB	Output is correct
40	Correct	78 ms	1536 KB	Output is correct
41	Correct	81 ms	1536 KB	Output is correct
42	Correct	77 ms	1536 KB	Output is correct
43	Correct	69 ms	1536 KB	Output is correct
44	Correct	5 ms	384 KB	Output is correct
45	Correct	17 ms	1024 KB	Output is correct
46	Correct	16 ms	1024 KB	Output is correct
47	Correct	16 ms	1024 KB	Output is correct
48	Correct	138 ms	4216 KB	Output is correct
49	Correct	150 ms	4276 KB	Output is correct
50	Correct	5 ms	384 KB	Output is correct
51	Correct	125 ms	3448 KB	Output is correct
52	Correct	91 ms	1440 KB	Output is correct
53	Correct	71 ms	1452 KB	Output is correct
54	Correct	13 ms	896 KB	Output is correct
55	Correct	13 ms	896 KB	Output is correct
56	Correct	14 ms	896 KB	Output is correct
57	Correct	15 ms	1024 KB	Output is correct
58	Correct	5 ms	384 KB	Output is correct
59	Correct	14 ms	896 KB	Output is correct
60	Correct	13 ms	896 KB	Output is correct
61	Correct	13 ms	896 KB	Output is correct
62	Correct	5 ms	512 KB	Output is correct
63	Correct	14 ms	1024 KB	Output is correct

답안 #246875

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