oj.uz

답안 #297762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297762 2020-09-11T21:51:10 Z BeanZ Olympic Bus (JOI20_ho_t4) C++14
32 / 100
 39 ms 3484 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)

using ll = long long;

template<class T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

const int N = 1 << 9, M = 1 << 16;
const ll inf = 1e18;

int n;
ll d[N][N], dist[N];
int a[M], b[M], w[M], c[M];
vector<int> g[N];
bool vis[N];

ll dij(int s, int t) {
	fill(dist, dist + n + 1, inf);
	fill(vis, vis + n, false);
	dist[s] = 0;
	rep(i, 0, n) {
		int u = n;
		rep(v, 0, n) if (!vis[v] && dist[v] < dist[u]) u = v;
		vis[u] = true;
		if (dist[u] == inf) break;
		for (int e : g[u]) ckmin(dist[b[e]], dist[u] + w[e]);
	}
	return dist[t];
}

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);

	int m; cin >> n >> m;
	rep(u, 0, n) rep(v, 0, n) d[u][v] = inf;
	rep(u, 0, n) d[u][u] = 0;
	rep(e, 0, m) {
		cin >> a[e] >> b[e] >> w[e] >> c[e], --a[e], --b[e];
		ckmin(d[a[e]][b[e]], ll(w[e]));
		g[a[e]].push_back(e);
	}

	rep(w, 0, n) rep(u, 0, n) rep(v, 0, n) ckmin(d[u][v], d[u][w] + d[w][v]);

	int s = 0, t = n - 1;
	ll ans = d[s][t] + d[t][s];
	rep(e, 0, m) {
		ll to = min(d[s][t], d[s][b[e]] + w[e] + d[a[e]][t]);
		ll fr = min(d[t][s], d[t][b[e]] + w[e] + d[a[e]][s]);
		if (c[e] + to + fr < ans) {
			g[a[e]].erase(find(all(g[a[e]]), e)); swap(a[e], b[e]); g[a[e]].push_back(e);
			bool flag = (dij(s, t) < inf) && (dij(t, s) < inf);
			if (flag) ckmin(ans, c[e] + to + fr);
			g[a[e]].pop_back(); swap(a[e], b[e]); g[a[e]].push_back(e);
		}
	}

	cout << (ans < inf ? ans : -1);
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1280 KB Output is correct
2 Correct 10 ms 1152 KB Output is correct
3 Correct 12 ms 1280 KB Output is correct
4 Correct 12 ms 1280 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Incorrect 13 ms 1280 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 3320 KB Output is correct
2 Correct 34 ms 3196 KB Output is correct
3 Correct 35 ms 3448 KB Output is correct
4 Correct 13 ms 1324 KB Output is correct
5 Correct 12 ms 1280 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 9 ms 1152 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 39 ms 3448 KB Output is correct
10 Correct 36 ms 3448 KB Output is correct
11 Correct 35 ms 3484 KB Output is correct
12 Correct 34 ms 3456 KB Output is correct
13 Correct 33 ms 3456 KB Output is correct
14 Correct 33 ms 3452 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1152 KB Output is correct
2 Correct 10 ms 1264 KB Output is correct
3 Correct 24 ms 2688 KB Output is correct
4 Correct 10 ms 1152 KB Output is correct
5 Correct 29 ms 3200 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 34 ms 3320 KB Output is correct
9 Correct 36 ms 3192 KB Output is correct
10 Correct 28 ms 3200 KB Output is correct
11 Correct 29 ms 3200 KB Output is correct
12 Correct 31 ms 3200 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 32 ms 3200 KB Output is correct
20 Correct 29 ms 3200 KB Output is correct
21 Correct 29 ms 3200 KB Output is correct
22 Correct 29 ms 3200 KB Output is correct

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1280 KB Output is correct
2 Correct 10 ms 1152 KB Output is correct
3 Correct 12 ms 1280 KB Output is correct
4 Correct 12 ms 1280 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Incorrect 13 ms 1280 KB Output isn't correct
11 Halted 0 ms 0 KB -