oj.uz

Submission #106037

# Submission time Handle Problem Language Result Execution time Memory
106037 2019-04-16T08:30:15 Z username Travelling Merchant (APIO17_merchant) C++14
100 / 100
 218 ms 2168 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***********************************/
const int maxn=109,maxm=99e2+9,maxk=1e3+9,inf=1ll<<50;
int n,m,k,b[maxn][maxk],s[maxn][maxk],t[maxn][maxn],c[maxn][maxn],d[maxn][maxn];
 
bool check(int x){
	REP(i,0,n)REP(j,0,n)d[i][j]=x<inf/t[i][j]?x*t[i][j]-c[i][j]:inf;
	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]);
	int l=0,r=1e11L+9;
	while(l+1<r){
		if(check(mid))l=mid;
		else r=mid;
	}
	cout<<l<<endl;
}

Compilation message

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

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 2168 KB Output is correct
2 Correct 48 ms 1408 KB Output is correct
3 Correct 51 ms 1408 KB Output is correct
4 Correct 15 ms 896 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 11 ms 896 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 2 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 12 ms 896 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 16 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 896 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 11 ms 896 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 14 ms 896 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 11 ms 940 KB Output is correct
8 Correct 13 ms 896 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 13 ms 896 KB Output is correct
13 Correct 12 ms 888 KB Output is correct
14 Correct 12 ms 916 KB Output is correct
15 Correct 19 ms 896 KB Output is correct
16 Correct 12 ms 896 KB Output is correct
17 Correct 12 ms 976 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 12 ms 896 KB Output is correct
20 Correct 14 ms 896 KB Output is correct
21 Correct 11 ms 1024 KB Output is correct
22 Correct 11 ms 896 KB Output is correct
23 Correct 10 ms 896 KB Output is correct
24 Correct 11 ms 896 KB Output is correct
25 Correct 11 ms 896 KB Output is correct
26 Correct 2 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 12 ms 896 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 16 ms 896 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 1536 KB Output is correct
2 Correct 166 ms 2168 KB Output is correct
3 Correct 64 ms 1408 KB Output is correct
4 Correct 69 ms 1584 KB Output is correct
5 Correct 67 ms 1536 KB Output is correct
6 Correct 65 ms 1528 KB Output is correct
7 Correct 12 ms 976 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 12 ms 896 KB Output is correct
10 Correct 14 ms 896 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 10 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 896 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 11 ms 896 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 14 ms 896 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 11 ms 940 KB Output is correct
8 Correct 13 ms 896 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 13 ms 896 KB Output is correct
13 Correct 12 ms 888 KB Output is correct
14 Correct 12 ms 916 KB Output is correct
15 Correct 19 ms 896 KB Output is correct
16 Correct 12 ms 896 KB Output is correct
17 Correct 61 ms 1536 KB Output is correct
18 Correct 166 ms 2168 KB Output is correct
19 Correct 64 ms 1408 KB Output is correct
20 Correct 69 ms 1584 KB Output is correct
21 Correct 67 ms 1536 KB Output is correct
22 Correct 65 ms 1528 KB Output is correct
23 Correct 12 ms 976 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 12 ms 896 KB Output is correct
26 Correct 14 ms 896 KB Output is correct
27 Correct 11 ms 1024 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 10 ms 896 KB Output is correct
30 Correct 76 ms 1452 KB Output is correct
31 Correct 61 ms 1536 KB Output is correct
32 Correct 103 ms 2168 KB Output is correct
33 Correct 80 ms 1580 KB Output is correct
34 Correct 62 ms 1508 KB Output is correct
35 Correct 69 ms 1536 KB Output is correct
36 Correct 203 ms 2168 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 75 ms 1408 KB Output is correct
40 Correct 81 ms 1408 KB Output is correct
41 Correct 77 ms 1488 KB Output is correct
42 Correct 65 ms 1528 KB Output is correct
43 Correct 72 ms 1436 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 22 ms 896 KB Output is correct
46 Correct 16 ms 896 KB Output is correct
47 Correct 21 ms 896 KB Output is correct
48 Correct 218 ms 2152 KB Output is correct
49 Correct 160 ms 2148 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 116 ms 2168 KB Output is correct
52 Correct 48 ms 1408 KB Output is correct
53 Correct 51 ms 1408 KB Output is correct
54 Correct 15 ms 896 KB Output is correct
55 Correct 12 ms 896 KB Output is correct
56 Correct 11 ms 896 KB Output is correct
57 Correct 11 ms 896 KB Output is correct
58 Correct 2 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 12 ms 896 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 16 ms 896 KB Output is correct