oj.uz

Submission #144520

# Submission time Handle Problem Language Result Execution time Memory
144520 2019-08-17T02:23:43 Z cheetose Travelling Merchant (APIO17_merchant) C++11
100 / 100
 110 ms 4216 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 9876543219876543
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int n,m,k;
ll b[101][1001],s[101][1001],d[101][101],pro[101][101],t[101][101];
bool ok(ll kk)
{
	fup(i,1,n,1)fup(j,1,n,1)
	{
		if(d[i][j]==INF)t[i][j]=-INF;
		else t[i][j]=pro[i][j]-d[i][j]*kk;
	}
	fup(i,1,n,1)t[i][i]=-INF;
	fup(K,1,n,1)fup(i,1,n,1)fup(j,1,n,1)t[i][j]=max(t[i][j],t[i][K]+t[K][j]);
	fup(i,1,n,1)if(t[i][i]>=0)return 1;
	return 0;
}
int main() {
	scanf("%d%d%d",&n,&m,&k);
	fup(i,1,n,1)fup(j,1,k,1)scanf("%lld%lld",&b[i][j],&s[i][j]);
	fup(i,1,n,1)fup(j,1,n,1)if(i!=j)d[i][j]=INF;
	fup(i,1,m,1)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		d[x][y]=z;
	}
	fup(kk,1,n,1)fup(i,1,n,1)fup(j,1,n,1)
		d[i][j]=min(d[i][j],d[i][kk]+d[kk][j]);
	fup(i,1,n,1)fup(j,1,n,1)fup(kk,1,k,1)
		if(~b[i][kk] && ~s[j][kk])pro[i][j]=max(pro[i][j],s[j][kk]-b[i][kk]);
	ll l=1,r=1e9+5;
	while(l<=r)
	{
		ll kk=(l+r)>>1;
		if(ok(kk))l=kk+1;
		else r=kk-1;
	}
	printf("%lld",r);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:78:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&m,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:79:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,1,n,1)fup(j,1,k,1)scanf("%lld%lld",&b[i][j],&s[i][j]);
                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:84:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&x,&y,&z);
   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 2296 KB Output is correct
2 Correct 39 ms 1400 KB Output is correct
3 Correct 41 ms 1400 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 8 ms 888 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 8 ms 760 KB Output is correct
10 Correct 8 ms 860 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 8 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 940 KB Output is correct
2 Correct 8 ms 760 KB Output is correct
3 Correct 8 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 8 ms 1016 KB Output is correct
9 Correct 8 ms 892 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 9 ms 1016 KB Output is correct
12 Correct 9 ms 1016 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
14 Correct 8 ms 888 KB Output is correct
15 Correct 10 ms 1016 KB Output is correct
16 Correct 8 ms 760 KB Output is correct
17 Correct 8 ms 964 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 9 ms 892 KB Output is correct
20 Correct 9 ms 888 KB Output is correct
21 Correct 9 ms 888 KB Output is correct
22 Correct 8 ms 888 KB Output is correct
23 Correct 8 ms 888 KB Output is correct
24 Correct 8 ms 888 KB Output is correct
25 Correct 8 ms 888 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 760 KB Output is correct
28 Correct 8 ms 860 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 8 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1556 KB Output is correct
2 Correct 100 ms 2128 KB Output is correct
3 Correct 43 ms 1464 KB Output is correct
4 Correct 46 ms 1552 KB Output is correct
5 Correct 46 ms 1572 KB Output is correct
6 Correct 43 ms 1528 KB Output is correct
7 Correct 8 ms 964 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 9 ms 892 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 8 ms 888 KB Output is correct
13 Correct 8 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 940 KB Output is correct
2 Correct 8 ms 760 KB Output is correct
3 Correct 8 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 8 ms 1016 KB Output is correct
9 Correct 8 ms 892 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 9 ms 1016 KB Output is correct
12 Correct 9 ms 1016 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
14 Correct 8 ms 888 KB Output is correct
15 Correct 10 ms 1016 KB Output is correct
16 Correct 8 ms 760 KB Output is correct
17 Correct 46 ms 1556 KB Output is correct
18 Correct 100 ms 2128 KB Output is correct
19 Correct 43 ms 1464 KB Output is correct
20 Correct 46 ms 1552 KB Output is correct
21 Correct 46 ms 1572 KB Output is correct
22 Correct 43 ms 1528 KB Output is correct
23 Correct 8 ms 964 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 9 ms 892 KB Output is correct
26 Correct 9 ms 888 KB Output is correct
27 Correct 9 ms 888 KB Output is correct
28 Correct 8 ms 888 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 41 ms 1528 KB Output is correct
31 Correct 44 ms 1656 KB Output is correct
32 Correct 64 ms 2604 KB Output is correct
33 Correct 43 ms 1620 KB Output is correct
34 Correct 43 ms 1528 KB Output is correct
35 Correct 43 ms 1528 KB Output is correct
36 Correct 108 ms 4088 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 41 ms 1400 KB Output is correct
40 Correct 43 ms 1532 KB Output is correct
41 Correct 42 ms 1528 KB Output is correct
42 Correct 41 ms 1400 KB Output is correct
43 Correct 41 ms 1276 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 10 ms 1016 KB Output is correct
46 Correct 10 ms 1016 KB Output is correct
47 Correct 10 ms 1096 KB Output is correct
48 Correct 110 ms 4216 KB Output is correct
49 Correct 110 ms 4156 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 75 ms 2296 KB Output is correct
52 Correct 39 ms 1400 KB Output is correct
53 Correct 41 ms 1400 KB Output is correct
54 Correct 8 ms 888 KB Output is correct
55 Correct 8 ms 888 KB Output is correct
56 Correct 8 ms 888 KB Output is correct
57 Correct 8 ms 888 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 8 ms 760 KB Output is correct
60 Correct 8 ms 860 KB Output is correct
61 Correct 8 ms 888 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 8 ms 888 KB Output is correct