oj.uz

Submission #75806

# Submission time Handle Problem Language Result Execution time Memory
75806 2018-09-11T07:30:41 Z tmwilliamlin168 Travelling Merchant (APIO17_merchant) C++14
0 / 100
 100 ms 5752 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int mxN=100, mxK=1000;
int n, m, k, b[mxN][mxK], s[mxN][mxK], a[mxN][mxN];
ll d1[mxN][mxN], d2[mxN][mxN];

void fw(ll d[mxN][mxN]) {
	for(int k=0; k<n; ++k)
		for(int i=0; i<n; ++i)
			for(int j=0; j<n; ++j)
				d[i][j]=min(d[i][k]+d[k][j], d[i][j]);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m >> k;
	for(int i=0; i<n; ++i)
		for(int j=0; j<k; ++j)
			cin >> b[i][j] >> s[i][j];
	for(int i=0; i<n; ++i)
		for(int j=0; j<n; ++j)
			for(int l=0; l<k; ++l)
				if(b[i][l]!=-1&&s[j][l]!=-1)
					a[i][j]=max(s[j][l]-b[i][l], a[i][j]);
//	for(int i=0; i<n; ++i) {
//		for(int j=0; j<n; ++j)
//			cout << a[i][j] << " ";
//		cout << endl;
//	}
	memset(d1, 0x3F, sizeof(d1));
	while(m--) {
		int v, w, t;
		cin >> v >> w >> t, --v, --w;
		d1[v][w]=t;
	}
	fw(d1);
	ll lb=1, rb=1e9;
	while(lb<=rb) {
		ll mb=(lb+rb)/2;
		for(int i=0; i<n; ++i)
			for(int j=0; j<n; ++j)
				d2[i][j]=mb*d1[i][j]-a[i][j];
		fw(d2);
		bool ok=0;
		for(int i=0; i<n&&!ok; ++i)
			ok=d2[i][i]<=0;
		if(ok)
			lb=mb+1;
		else
			rb=mb-1;
	}
	cout << rb;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 2680 KB Output is correct
2 Correct 42 ms 2680 KB Output is correct
3 Correct 46 ms 2760 KB Output is correct
4 Correct 9 ms 2760 KB Output is correct
5 Correct 8 ms 2760 KB Output is correct
6 Correct 9 ms 2760 KB Output is correct
7 Correct 9 ms 2760 KB Output is correct
8 Correct 3 ms 2760 KB Output is correct
9 Correct 8 ms 2760 KB Output is correct
10 Correct 10 ms 2760 KB Output is correct
11 Correct 8 ms 2760 KB Output is correct
12 Correct 3 ms 2760 KB Output is correct
13 Incorrect 9 ms 2760 KB Output isn't correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2760 KB Output is correct
2 Correct 8 ms 2760 KB Output is correct
3 Correct 12 ms 2760 KB Output is correct
4 Correct 8 ms 2760 KB Output is correct
5 Correct 10 ms 2760 KB Output is correct
6 Correct 2 ms 2760 KB Output is correct
7 Incorrect 8 ms 2788 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 3408 KB Output is correct
2 Correct 100 ms 5172 KB Output is correct
3 Correct 47 ms 5264 KB Output is correct
4 Correct 54 ms 5424 KB Output is correct
5 Correct 51 ms 5640 KB Output is correct
6 Correct 49 ms 5752 KB Output is correct
7 Correct 9 ms 5752 KB Output is correct
8 Correct 3 ms 5752 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 9 ms 5752 KB Output is correct
11 Incorrect 10 ms 5752 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2760 KB Output is correct
2 Correct 8 ms 2760 KB Output is correct
3 Correct 12 ms 2760 KB Output is correct
4 Correct 8 ms 2760 KB Output is correct
5 Correct 10 ms 2760 KB Output is correct
6 Correct 2 ms 2760 KB Output is correct
7 Incorrect 8 ms 2788 KB Output isn't correct
8 Halted 0 ms 0 KB -