oj.uz

답안 #472602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472602 2021-09-13T19:16:04 Z disastah Toll (BOI17_toll) C++17
46 / 100
 173 ms 39268 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ar array
using namespace std;
typedef long double ld;
typedef long long ll;
const int inf=1e9+9;
const ll linf=4e18+18;
const int N=5e4;

int k, n, m, q;
vector<ar<int,2>> g[N], rg[N];
ll dst[24][N][5]; int dst_mask[N];

void build_dst(int h, int l, int r) {
	int m=(l+r)/2;
	for (int i=m*k; i<r*k; ++i) dst_mask[i]^=(1<<h);
	for (int k0=0; k0<k; ++k0) {
		dst[h][m*k+k0][k0]=0;
		for (int i=m*k+k0-1; i>=l*k; --i) {
			dst[h][i][k0]=inf;
			for (auto &[u,t] : g[i]) {
				if (u>m*k+k0) continue;
				dst[h][i][k0]=min(dst[h][i][k0],dst[h][u][k0]+t);
			}
		}
		for (int i=m*k+k0+1; i<r*k; ++i) {
			dst[h][i][k0]=inf;
			for (auto &[u,t] : rg[i]) {
				if (u<m*k+k0) continue;
				dst[h][i][k0]=min(dst[h][i][k0],dst[h][u][k0]+t);
			}
		}
	}
	if (l+1<r) {
		build_dst(h+1,l,m);
		build_dst(h+1,m,r);
	}
}

void solve() {
	cin >> k >> n >> m >> q;
	for (int i=0; i<m; ++i) {
		int a, b, t; cin >> a >> b >> t;
		g[a].push_back({b,t});
		rg[b].push_back({a,t});
	}
	build_dst(0,0,(n+k-1)/k);
	while(q--) {
		int a, b; cin >> a >> b;
		if (dst_mask[a]==dst_mask[b]) {
			cout << "-1\n";
			continue;
		}
		int h=__builtin_ctz(dst_mask[a]^dst_mask[b]);
		ll ans=inf;
		for (int i=0; i<k; ++i) ans=min(ans,dst[h][a][i]+dst[h][b][i]);
		cout << (ans<inf?ans:-1) << "\n";
	}
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
#ifdef disastah
	cout << "Output\n\n";
#endif
	int tt=1;
//	cin >> tt;
	while (tt--) {
		solve();
		cout << "\n";
	}
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 39224 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 3148 KB Output is correct
6 Correct 3 ms 3156 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 53 ms 39240 KB Output is correct
9 Correct 52 ms 39108 KB Output is correct
10 Correct 25 ms 36156 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 37332 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 5 ms 3280 KB Output is correct
8 Correct 5 ms 3276 KB Output is correct
9 Correct 53 ms 39268 KB Output is correct
10 Incorrect 123 ms 38364 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 3 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 3148 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 5 ms 3276 KB Output is correct
9 Correct 4 ms 3148 KB Output is correct
10 Correct 50 ms 39236 KB Output is correct
11 Correct 82 ms 37292 KB Output is correct
12 Correct 166 ms 38264 KB Output is correct
13 Correct 157 ms 38632 KB Output is correct
14 Correct 115 ms 37468 KB Output is correct
15 Correct 75 ms 21876 KB Output is correct
16 Correct 79 ms 21832 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 3 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 3148 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 5 ms 3276 KB Output is correct
9 Correct 4 ms 3148 KB Output is correct
10 Correct 50 ms 39236 KB Output is correct
11 Correct 82 ms 37292 KB Output is correct
12 Correct 166 ms 38264 KB Output is correct
13 Correct 157 ms 38632 KB Output is correct
14 Correct 115 ms 37468 KB Output is correct
15 Correct 75 ms 21876 KB Output is correct
16 Correct 79 ms 21832 KB Output is correct
17 Correct 87 ms 37200 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 4 ms 3148 KB Output is correct
24 Correct 4 ms 3148 KB Output is correct
25 Correct 5 ms 3148 KB Output is correct
26 Correct 5 ms 3148 KB Output is correct
27 Correct 58 ms 39204 KB Output is correct
28 Correct 135 ms 38304 KB Output is correct
29 Correct 173 ms 38776 KB Output is correct
30 Correct 118 ms 37524 KB Output is correct

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 39224 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 3148 KB Output is correct
6 Correct 3 ms 3156 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 53 ms 39240 KB Output is correct
9 Correct 52 ms 39108 KB Output is correct
10 Correct 25 ms 36156 KB Output is correct
11 Correct 105 ms 37332 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 5 ms 3280 KB Output is correct
18 Correct 5 ms 3276 KB Output is correct
19 Correct 53 ms 39268 KB Output is correct
20 Incorrect 123 ms 38364 KB Output isn't correct
21 Halted 0 ms 0 KB -