oj.uz

답안 #250844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250844 2020-07-19T09:41:15 Z atoiz 여행하는 상인 (APIO17_merchant) C++14
45 / 100
 81 ms 1280 KB 
/*input
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

const int MAXN = 105, MAXK = 1005, INF = 1001001000;
int N, M, K;
int rawdist[MAXN][MAXN], gain[MAXN][MAXN], buy[MAXN][MAXK], sel[MAXN][MAXK];
long long curdist[MAXN][MAXN], dist1[MAXN];

#define FOR(i, a, b) for (int i = a; i <= b; ++i)

bool check(long long val)
{
	FOR(i, 1, N) FOR(j, 1, N) curdist[i][j] = rawdist[i][j] * val - gain[i][j];
	FOR(i, 2, N) dist1[i] = INF; dist1[1] = 0;
	bool cont = true;
	for (int trial = 0; trial <= N + 3 && cont; ++trial) {
		if (trial == N + 3) return true;
		cont = false;
		FOR(i, 1, N) FOR(j, 1, N) if (dist1[i] + curdist[i][j] < dist1[j]) {
			dist1[j] = dist1[i] + curdist[i][j];
			cont = true;
		}
	}

	FOR(i, 2, N) if (dist1[i] + curdist[i][1] <= 0) return true;
	return false;
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> M >> K;
	FOR(i, 1, N) FOR(j, 1, K) cin >> buy[i][j] >> sel[i][j];
	FOR(i, 1, N) FOR(j, 1, N) rawdist[i][j] = INF;
	FOR(_, 0, M - 1) {
		int u, v, w;
		cin >> u >> v >> w;
		rawdist[u][v] = min(rawdist[u][v], w);
	}
	FOR(k, 1, N) FOR(i, 1, N) FOR(j, 1, N) rawdist[i][j] = min(rawdist[i][j], rawdist[i][k] + rawdist[k][j]);
	FOR(i, 1, N) FOR(j, 1, N) FOR(k, 1, K) if (~buy[i][k] && ~sel[j][k]) gain[i][j] = max(gain[i][j], sel[j][k] - buy[i][k]);

	int lo = 0, hi = INF;
	while (lo < hi) {
		int mid = (lo + hi + 1) >> 1;
		if (check(mid)) lo = mid;
		else hi = mid - 1;
	}
	cout << lo << endl;
}

Compilation message

merchant.cpp: In function 'bool check(long long int)':
merchant.cpp:26:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define FOR(i, a, b) for (int i = a; i <= b; ++i)
                      ^
merchant.cpp:31:2: note: in expansion of macro 'FOR'
  FOR(i, 2, N) dist1[i] = INF; dist1[1] = 0;
  ^~~
merchant.cpp:31:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  FOR(i, 2, N) dist1[i] = INF; dist1[1] = 0;
                               ^~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 1272 KB Output is correct
2 Correct 3 ms 1280 KB Output is correct
3 Correct 20 ms 1280 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 4 ms 768 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 4 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 4 ms 768 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 2 ms 768 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 1280 KB Output is correct
2 Correct 81 ms 1276 KB Output is correct
3 Correct 26 ms 1280 KB Output is correct
4 Correct 16 ms 1280 KB Output is correct
5 Correct 47 ms 1280 KB Output is correct
6 Correct 27 ms 1280 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 5 ms 768 KB Output is correct
11 Correct 5 ms 768 KB Output is correct
12 Correct 4 ms 768 KB Output is correct
13 Correct 4 ms 768 KB Output is correct

Subtask #4
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -