oj.uz

Submission #106035

# Submission time Handle Problem Language Result Execution time Memory
106035 2019-04-16T08:26:53 Z username Travelling Merchant (APIO17_merchant) C++14
54 / 100
 551 ms 2324 KB 
#pragma GCC optimize("O3")
#include<stdint.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define VIS(it,con) for(auto it=con.begin();it!=con.end();++it)
#define pob pop_back
#define pf push_front
#define pof pop_front
#define MIN(x,y) (x=min(x,(y)))
#define MAX(x,y) (x=max(x,(y)))
#define mid ((l+r)/2)
#define lch (idx*2+1)
#define rch (idx*2+2)
/*****************************************************************************/
#include<bits/stdc++.h>
#define int int_fast64_t
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> VI;
#define REP(i,j,k) for(register int i=(j);i<(k);++i)
#define RREP(i,j,k) for(register int i=(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define MST(a,v) memset(a,(v),sizeof a)
#define pb push_back
#define F first
#define S second
#define endl '\n'
																#define __debug
#ifdef __debug
	#define IOS (void)0
	#define de(...) cerr<<__VA_ARGS__
	#define ar(a,s,t) {REP(__i,s,t)de(min((int)1e9-1,a[__i])<<' ');de(endl);}
#else
	#define IOS cin.tie(0),cout.tie(0),ios_base::sync_with_stdio(false)
	#define de(...) (void)0
	#define ar(...) (void)0
#endif
/***********************************default***********************************/
#define double long double
const int maxn=109,maxm=99e2+9,maxk=1e3+9,inf=1ll<<50;
const double eps=1e-7;
int n,m,k,b[maxn][maxk],s[maxn][maxk],t[maxn][maxn],c[maxn][maxn];
double d[maxn][maxn];
 
bool check(double x){
	REP(i,0,n)REP(j,0,n)d[i][j]=x*t[i][j]-(double)c[i][j];
	REP(p,0,n)REP(i,0,n)REP(j,0,n)MIN(d[i][j],d[i][p]+d[p][j]);
	REP(i,0,n)if(d[i][i]<=0)return 1;
	return 0;
}
 
main(){
	IOS;
	cin>>n>>m>>k;
	REP(i,0,n)REP(j,0,k){
		cin>>b[i][j]>>s[i][j];
		if(b[i][j]<0)b[i][j]=inf;
		if(s[i][j]<0)s[i][j]=-inf;
	}
	REP(i,0,n)REP(j,0,n)t[i][j]=inf,c[i][j]=0;
	REP(i,0,m){
		int v,w,tt;cin>>v>>w>>tt,--v,--w;
		t[v][w]=tt;
	}
	REP(p,0,n)REP(i,0,n)REP(j,0,n)MIN(t[i][j],t[i][p]+t[p][j]);
	REP(p,0,k)REP(i,0,n)REP(j,0,n)MAX(c[i][j],s[j][p]-b[i][p]);
	double l=0,r=1e11L+9;
	while(l+eps<r){
		if(check(mid))l=mid;
		else r=mid;
	}
	if(l-floor(l)<=eps)cout<<(int)floor(l)<<endl;
	else if(ceil(l)-l<=eps)cout<<(int)ceil(l)<<endl;
	else cout<<(int)floor(l)<<endl;
}

Compilation message

merchant.cpp:55:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 2296 KB Output is correct
2 Incorrect 186 ms 1532 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 896 KB Output is correct
2 Correct 20 ms 896 KB Output is correct
3 Correct 21 ms 896 KB Output is correct
4 Correct 23 ms 944 KB Output is correct
5 Correct 48 ms 964 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 19 ms 896 KB Output is correct
8 Correct 23 ms 896 KB Output is correct
9 Correct 20 ms 1024 KB Output is correct
10 Correct 20 ms 896 KB Output is correct
11 Correct 28 ms 896 KB Output is correct
12 Correct 34 ms 992 KB Output is correct
13 Correct 23 ms 940 KB Output is correct
14 Correct 27 ms 896 KB Output is correct
15 Correct 28 ms 896 KB Output is correct
16 Correct 20 ms 896 KB Output is correct
17 Correct 67 ms 956 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 51 ms 896 KB Output is correct
20 Correct 32 ms 960 KB Output is correct
21 Correct 28 ms 956 KB Output is correct
22 Correct 22 ms 896 KB Output is correct
23 Correct 23 ms 896 KB Output is correct
24 Correct 18 ms 896 KB Output is correct
25 Correct 26 ms 1016 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 49 ms 896 KB Output is correct
28 Correct 31 ms 896 KB Output is correct
29 Correct 22 ms 944 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 23 ms 896 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 1720 KB Output is correct
2 Correct 551 ms 2296 KB Output is correct
3 Correct 318 ms 1564 KB Output is correct
4 Correct 397 ms 1664 KB Output is correct
5 Correct 414 ms 1660 KB Output is correct
6 Correct 183 ms 1656 KB Output is correct
7 Correct 67 ms 956 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 51 ms 896 KB Output is correct
10 Correct 32 ms 960 KB Output is correct
11 Correct 28 ms 956 KB Output is correct
12 Correct 22 ms 896 KB Output is correct
13 Correct 23 ms 896 KB Output is correct

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 896 KB Output is correct
2 Correct 20 ms 896 KB Output is correct
3 Correct 21 ms 896 KB Output is correct
4 Correct 23 ms 944 KB Output is correct
5 Correct 48 ms 964 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 19 ms 896 KB Output is correct
8 Correct 23 ms 896 KB Output is correct
9 Correct 20 ms 1024 KB Output is correct
10 Correct 20 ms 896 KB Output is correct
11 Correct 28 ms 896 KB Output is correct
12 Correct 34 ms 992 KB Output is correct
13 Correct 23 ms 940 KB Output is correct
14 Correct 27 ms 896 KB Output is correct
15 Correct 28 ms 896 KB Output is correct
16 Correct 20 ms 896 KB Output is correct
17 Correct 446 ms 1720 KB Output is correct
18 Correct 551 ms 2296 KB Output is correct
19 Correct 318 ms 1564 KB Output is correct
20 Correct 397 ms 1664 KB Output is correct
21 Correct 414 ms 1660 KB Output is correct
22 Correct 183 ms 1656 KB Output is correct
23 Correct 67 ms 956 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 51 ms 896 KB Output is correct
26 Correct 32 ms 960 KB Output is correct
27 Correct 28 ms 956 KB Output is correct
28 Correct 22 ms 896 KB Output is correct
29 Correct 23 ms 896 KB Output is correct
30 Correct 153 ms 1536 KB Output is correct
31 Correct 166 ms 1664 KB Output is correct
32 Correct 199 ms 2296 KB Output is correct
33 Correct 159 ms 1664 KB Output is correct
34 Correct 169 ms 1784 KB Output is correct
35 Correct 162 ms 1664 KB Output is correct
36 Correct 378 ms 2296 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 3 ms 384 KB Output is correct
39 Correct 164 ms 1656 KB Output is correct
40 Correct 185 ms 1556 KB Output is correct
41 Correct 166 ms 1536 KB Output is correct
42 Correct 170 ms 1656 KB Output is correct
43 Correct 144 ms 1628 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 34 ms 1028 KB Output is correct
46 Correct 41 ms 1024 KB Output is correct
47 Correct 29 ms 1024 KB Output is correct
48 Correct 302 ms 2324 KB Output is correct
49 Correct 290 ms 2296 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 242 ms 2296 KB Output is correct
52 Incorrect 186 ms 1532 KB Output isn't correct
53 Halted 0 ms 0 KB -