oj.uz

답안 #333751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
333751 2020-12-07T16:08:06 Z NhatMinh0208 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 287 ms 5100 KB 
/*
	Normie's Template v2.0
*/
 
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
vector<piii(ll)> gt[101];
ll b[101][1001],s[101][1001];
ll dis[101][101];
ld cur[101];
ll eu[10001],ew[10001],ev[10001];
ll n,m,i,j,k,t,t1,u,v,a;
ll check(ll mul)
{
//	cout<<"\ncheck "<<mul<<endl;
	for (ll i=1;i<=n;i++) cur[i]=9e18;
	cur[1]=0;
	for (ll cnt=0;cnt<2*n;cnt++)
	{
		u=0;
		for (ll i=1;i<=n;i++)
		{
			for (piii(ll) g : gt[i]) 
			{
		//		cout<<"relax "<<i<<' '<<g.fi<<' '<<cur[i]<<' '<<cur[g.fi]<<' '<<(ld)cur[i]-g.se.fi-(1e-9)+g.se.se*mul<<endl;
			if (cur[g.fi]>(ld)cur[i]-g.se.fi-(1e-9)+g.se.se*mul)
			{
				cur[g.fi]=(ld)cur[i]-g.se.fi-(1e-9)+g.se.se*mul;
				u=1;
			}
			}
		}
	//	cout<<cnt<<endl;
	//	for (ll i=0;i<n;i++) cout<<cur[i]<<' ';
		if (!u) return 0;

	}
	return 1;
}
ll bs(ll l, ll r)
{
	ll mid=(l+r)/2+1;
	if (l==r) return l;
	if (check(mid)) return bs(mid,r);
	else return bs(l,mid-1);
}
int main()
{
	fio;
	cin>>n>>m>>t;
	for (i=1;i<=n;i++)
	{
		for (j=1;j<=t;j++)
		{
			cin>>b[i][j]>>s[i][j];
		}
		for (j=1;j<=n;j++)
		{
			dis[i][j]=2e9;
		}
		dis[i][i]=0;
	}
	for (i=1;i<=m;i++)
	{
		cin>>eu[i]>>ev[i]>>ew[i];
		dis[eu[i]][ev[i]]=min(dis[eu[i]][ev[i]],ew[i]);
		gt[eu[i]].push_back({ev[i],{0,ew[i]}});
		//cout<<eu[i]<<' '<<ev[i]<<' '<<0<<' '<<ew[i]<<endl;
	}
	for (k=1;k<=n;k++)
	for (i=1;i<=n;i++)
	for (j=1;j<=n;j++)
	{
		dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
	}
	for (i=1;i<=n;i++) for (j=1;j<=n;j++) if (dis[i][j]!=2e9)
	{
		u=-2e9-7;
		for (k=1;k<=t;k++) if ((b[i][k]!=-1)and(s[j][k]!=-1)) u=max(u,s[j][k]-b[i][k]);
		if (u>0) gt[i].push_back({j,{u,dis[i][j]}});
		//if (u>0) cout<<i<<' '<<j<<' '<<u<<' '<<dis[i][j]<<endl;
	}
	cout<<bs(0,1e9);
}

Compilation message

merchant.cpp:20: warning: ignoring #pragma comment  [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 2028 KB Output is correct
2 Correct 3 ms 1260 KB Output is correct
3 Correct 7 ms 1280 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 2 ms 876 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 2 ms 876 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 876 KB Output is correct
2 Correct 2 ms 748 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 2 ms 876 KB Output is correct
5 Correct 13 ms 876 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 792 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 3 ms 896 KB Output is correct
11 Correct 15 ms 1004 KB Output is correct
12 Correct 10 ms 876 KB Output is correct
13 Correct 17 ms 1004 KB Output is correct
14 Correct 8 ms 876 KB Output is correct
15 Correct 37 ms 1152 KB Output is correct
16 Correct 2 ms 876 KB Output is correct
17 Correct 18 ms 1004 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 39 ms 1004 KB Output is correct
20 Correct 25 ms 1152 KB Output is correct
21 Correct 14 ms 1004 KB Output is correct
22 Correct 31 ms 1112 KB Output is correct
23 Correct 12 ms 876 KB Output is correct
24 Correct 1 ms 748 KB Output is correct
25 Correct 2 ms 876 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 2 ms 748 KB Output is correct
28 Correct 2 ms 876 KB Output is correct
29 Correct 2 ms 876 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 2 ms 876 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 1644 KB Output is correct
2 Correct 180 ms 4076 KB Output is correct
3 Correct 146 ms 1772 KB Output is correct
4 Correct 111 ms 2048 KB Output is correct
5 Correct 287 ms 2028 KB Output is correct
6 Correct 140 ms 1800 KB Output is correct
7 Correct 18 ms 1004 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 39 ms 1004 KB Output is correct
10 Correct 25 ms 1152 KB Output is correct
11 Correct 14 ms 1004 KB Output is correct
12 Correct 31 ms 1112 KB Output is correct
13 Correct 12 ms 876 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 876 KB Output is correct
2 Correct 2 ms 748 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 2 ms 876 KB Output is correct
5 Correct 13 ms 876 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 792 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 3 ms 896 KB Output is correct
11 Correct 15 ms 1004 KB Output is correct
12 Correct 10 ms 876 KB Output is correct
13 Correct 17 ms 1004 KB Output is correct
14 Correct 8 ms 876 KB Output is correct
15 Correct 37 ms 1152 KB Output is correct
16 Correct 2 ms 876 KB Output is correct
17 Correct 149 ms 1644 KB Output is correct
18 Correct 180 ms 4076 KB Output is correct
19 Correct 146 ms 1772 KB Output is correct
20 Correct 111 ms 2048 KB Output is correct
21 Correct 287 ms 2028 KB Output is correct
22 Correct 140 ms 1800 KB Output is correct
23 Correct 18 ms 1004 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 39 ms 1004 KB Output is correct
26 Correct 25 ms 1152 KB Output is correct
27 Correct 14 ms 1004 KB Output is correct
28 Correct 31 ms 1112 KB Output is correct
29 Correct 12 ms 876 KB Output is correct
30 Correct 6 ms 1260 KB Output is correct
31 Correct 19 ms 1516 KB Output is correct
32 Correct 39 ms 2540 KB Output is correct
33 Correct 8 ms 1516 KB Output is correct
34 Correct 19 ms 1644 KB Output is correct
35 Correct 21 ms 1516 KB Output is correct
36 Correct 110 ms 4332 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 17 ms 1388 KB Output is correct
40 Correct 46 ms 2028 KB Output is correct
41 Correct 6 ms 1388 KB Output is correct
42 Correct 6 ms 1260 KB Output is correct
43 Correct 15 ms 1388 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 9 ms 1004 KB Output is correct
46 Correct 8 ms 1004 KB Output is correct
47 Correct 7 ms 1004 KB Output is correct
48 Correct 168 ms 5100 KB Output is correct
49 Correct 253 ms 5100 KB Output is correct
50 Correct 1 ms 376 KB Output is correct
51 Correct 31 ms 2028 KB Output is correct
52 Correct 3 ms 1260 KB Output is correct
53 Correct 7 ms 1280 KB Output is correct
54 Correct 1 ms 748 KB Output is correct
55 Correct 2 ms 748 KB Output is correct
56 Correct 1 ms 748 KB Output is correct
57 Correct 2 ms 876 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 2 ms 748 KB Output is correct
60 Correct 2 ms 876 KB Output is correct
61 Correct 2 ms 876 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 2 ms 876 KB Output is correct