oj.uz

Submission #104719

# Submission time Handle Problem Language Result Execution time Memory
104719 2019-04-09T02:59:11 Z puyu_liao Travelling Merchant (APIO17_merchant) C++14
0 / 100
 160 ms 2424 KB 
#include<bits/stdc++.h>
#include<stdint.h>
using namespace std;
#define IOS {cin.tie(0);ios_base::sync_with_stdio(false);}
#define int int64_t
#define N 105
#define K 1005
const int INF = 1e17;

int bb[N][K],ss[N][K];
int w[N][N],dis[N][N];
double dp[N][N];
bitset<N> vis;
vector<pair<int,int> > v[N];

int32_t main()
{
	IOS;
	int n,m,k,a,b,t;
	cin >> n >> m >> k;
	for(int i=1;i<=n;i++) for(int j=1;j<=k;j++) cin >> bb[i][j] >> ss[i][j];
	for(int i=0;i<m;i++){
		cin >> a >> b >> t;
		v[a].push_back({b,t});
	}
	for(int i=1;i<=n;i++){
		int *dd = dis[i];
		fill(dd+1,dd+n+1,INF);
		vis.reset(); queue<int> q;
		dd[i] = 0; q.push(i); vis[i] = 1;
		while(!q.empty()){
			int x = q.front(); q.pop();
			vis[x] = 0;
			for(auto i : v[x]) if(dd[i.first] > dd[x] + i.second){
				dd[i.first] = dd[x] + i.second;
				if(!vis[i.first]) vis[i.first]=1,q.push(i.first);
			}
		}
		for(int j=1;j<=n;j++){
			if(j != i && dd[j] != INF) {
				for(int x=1;x<=k;x++) if(ss[j][x] >= 0 && bb[i][x] >= 0) w[i][j] = max(w[i][j],ss[j][x] - bb[i][x]);
			}
			else w[i][j] = 0;
		}
	}

	
	double l=0,r = 1e14;
	for(int cnt=0;cnt<80;cnt++){
		double mm = (l+r)*0.5;
		for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) {
			dp[i][j] = mm*dis[i][j] - w[i][j];
		}
		for(int x=1;x<=n;x++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) {
			dp[i][j] = min(dp[i][j],dp[i][x] + dp[x][j]);
		}
		bool gg = false;
		for(int i=1;i<=n;i++) if(dp[i][i] < 0) gg = true;
		if(gg) l = mm;
		else r = mm;
	}
	cout << (int)(round(l)+0.5) << '\n';
  return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 2424 KB Output is correct
2 Incorrect 78 ms 1528 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 896 KB Output is correct
2 Correct 16 ms 932 KB Output is correct
3 Incorrect 13 ms 896 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 1664 KB Output is correct
2 Correct 160 ms 2416 KB Output is correct
3 Correct 78 ms 1536 KB Output is correct
4 Correct 116 ms 1656 KB Output is correct
5 Correct 128 ms 1700 KB Output is correct
6 Correct 83 ms 1536 KB Output is correct
7 Incorrect 18 ms 1024 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 896 KB Output is correct
2 Correct 16 ms 932 KB Output is correct
3 Incorrect 13 ms 896 KB Output isn't correct
4 Halted 0 ms 0 KB -