oj.uz

답안 #695337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
695337 2023-02-05T03:09:42 Z daoquanglinh2007 Toll (BOI17_toll) C++17
100 / 100
 217 ms 40336 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair <int, int>
#define mp make_pair

const int NM = 50000;
const ll INF = 1e18;

struct matrix{
	int M, N;
	ll grid[5][5];
	void init(int x, int y, ll val){
		M = x, N = y;
		for (int i = 0; i < M; i++)
			for (int j = 0; j < N; j++)
				grid[i][j] = val;
	}
	matrix operator * (matrix b){
		matrix a = *this;
		matrix c;
		c.init(a.M, b.N, +INF);
		for (int i = 0; i < c.M; i++)
			for (int j = 0; j < c.N; j++)
				for (int k = 0; k < a.N; k++)
					c.grid[i][j] = min(c.grid[i][j], a.grid[i][k]+b.grid[k][j]);
		return c;
	}
};

int K, N, M, O, nLayer;
map <pii, ll> d;
matrix A[NM+5];
matrix st[4*NM+5];

ll dist(int a, int b){
	if (a == b) return 0;
	if (d.count(mp(a, b)) == 0) return +INF;
	return d[mp(a, b)];
}

matrix iden(int k){
	matrix a;
	a.init(k, k, +INF);
	for (int i = 0; i < k; i++)
		a.grid[i][i] = 0;
	return a;
}

void build(int id, int l, int r){
	st[id].init(K, K, 0);
	if (l == r){
		st[id] = A[l];
		return;
	}
	int mid = (l+r)>>1;
	build(id<<1, l, mid);
	build(id<<1|1, mid+1, r);
	st[id] = st[id<<1]*st[id<<1|1];
}

matrix get(int id, int l, int r, int u, int v){
	if (u > v || v < l || u > r) return iden(K);
	if (l >= u && r <= v) return st[id];
	int mid = (l+r)>>1;
	return get(id<<1, l, mid, u, v)*get(id<<1|1, mid+1, r, u, v);
}

void solveQuery(int a, int b){
	int l = a/K, r = b/K;
	if (l >= r){
		cout << "-1\n";
		return;
	}
	matrix C; C.init(1, K, +INF);
	for (int i = 0; i < K; i++)
		C.grid[0][i] = dist(a, (l+1)*K+i);
	C = C*get(1, 0, nLayer-2, l+1, r-1);
	ll ans = C.grid[0][b%K];
	if (ans >= +INF) ans = -1;
	cout << ans << "\n";
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> K >> N >> M >> O;
	nLayer = N/K+(N%K > 0);
	for (int i = 0; i <= nLayer-2; i++)
		A[i].init(K, K, +INF);
	while (M--){
		int a, b; ll t;
		cin >> a >> b >> t;
		d[mp(a, b)] = t;
		A[a/K].grid[a%K][b%K] = t;
	}
	build(1, 0, nLayer-2);
	while (O--){
		int a, b;
		cin >> a >> b;
		solveQuery(a, b);
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 40336 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 67 ms 40248 KB Output is correct
9 Correct 67 ms 40104 KB Output is correct
10 Correct 32 ms 37160 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 24720 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 11 ms 980 KB Output is correct
8 Correct 9 ms 724 KB Output is correct
9 Correct 80 ms 40228 KB Output is correct
10 Correct 142 ms 20108 KB Output is correct
11 Correct 90 ms 25020 KB Output is correct
12 Correct 79 ms 16260 KB Output is correct
13 Correct 123 ms 14172 KB Output is correct
14 Correct 76 ms 14660 KB Output is correct
15 Correct 67 ms 9612 KB Output is correct
16 Correct 66 ms 9664 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 50 ms 40260 KB Output is correct
11 Correct 82 ms 24804 KB Output is correct
12 Correct 103 ms 19896 KB Output is correct
13 Correct 115 ms 20856 KB Output is correct
14 Correct 112 ms 18516 KB Output is correct
15 Correct 50 ms 9464 KB Output is correct
16 Correct 51 ms 9484 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 50 ms 40260 KB Output is correct
11 Correct 82 ms 24804 KB Output is correct
12 Correct 103 ms 19896 KB Output is correct
13 Correct 115 ms 20856 KB Output is correct
14 Correct 112 ms 18516 KB Output is correct
15 Correct 50 ms 9464 KB Output is correct
16 Correct 51 ms 9484 KB Output is correct
17 Correct 82 ms 24760 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 6 ms 980 KB Output is correct
24 Correct 6 ms 724 KB Output is correct
25 Correct 11 ms 740 KB Output is correct
26 Correct 8 ms 704 KB Output is correct
27 Correct 59 ms 40272 KB Output is correct
28 Correct 106 ms 19884 KB Output is correct
29 Correct 138 ms 20968 KB Output is correct
30 Correct 92 ms 18528 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 40336 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 67 ms 40248 KB Output is correct
9 Correct 67 ms 40104 KB Output is correct
10 Correct 32 ms 37160 KB Output is correct
11 Correct 87 ms 24720 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 11 ms 980 KB Output is correct
18 Correct 9 ms 724 KB Output is correct
19 Correct 80 ms 40228 KB Output is correct
20 Correct 142 ms 20108 KB Output is correct
21 Correct 90 ms 25020 KB Output is correct
22 Correct 79 ms 16260 KB Output is correct
23 Correct 123 ms 14172 KB Output is correct
24 Correct 76 ms 14660 KB Output is correct
25 Correct 67 ms 9612 KB Output is correct
26 Correct 66 ms 9664 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 1 ms 724 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 50 ms 40260 KB Output is correct
37 Correct 82 ms 24804 KB Output is correct
38 Correct 103 ms 19896 KB Output is correct
39 Correct 115 ms 20856 KB Output is correct
40 Correct 112 ms 18516 KB Output is correct
41 Correct 50 ms 9464 KB Output is correct
42 Correct 51 ms 9484 KB Output is correct
43 Correct 82 ms 24760 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 6 ms 980 KB Output is correct
50 Correct 6 ms 724 KB Output is correct
51 Correct 11 ms 740 KB Output is correct
52 Correct 8 ms 704 KB Output is correct
53 Correct 59 ms 40272 KB Output is correct
54 Correct 106 ms 19884 KB Output is correct
55 Correct 138 ms 20968 KB Output is correct
56 Correct 92 ms 18528 KB Output is correct
57 Correct 217 ms 22020 KB Output is correct
58 Correct 72 ms 40252 KB Output is correct
59 Correct 105 ms 25224 KB Output is correct