oj.uz

답안 #1115806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115806 2024-11-21T01:35:20 Z vjudge1 Toll (BOI17_toll) C++17
100 / 100
 204 ms 45056 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair

const int NM = 50000, INF = 1e18;

struct matrix{
	int M, N, grid[5][5];
	void init(int x, int y, int 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, int> d;
matrix A[NM+5];
matrix st[4*NM+5];

int Layer(int a){
	return a/K;
}

int 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)/2;
	build(2*id, l, mid);
	build(2*id+1, mid+1, r);
	st[id] = st[2*id]*st[2*id+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)/2;
	return get(2*id, l, mid, u, v)*get(2*id+1, mid+1, r, u, v);
}

void solveQuery(int a, int b){
	if (Layer(a) >= Layer(b)){
		cout << "-1\n";
		return;
	}
	int l = Layer(a), r = Layer(b);
	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);
	int ans = C.grid[0][b%K];
	if (ans >= +INF) ans = -1;
	cout << ans << "\n";
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> K >> N >> M >> O;
	nLayer = N/K+1;
	for (int i = 0; i < nLayer; i++)
		A[i].init(K, K, +INF);
	while (M--){
		int a, b, t;
		cin >> a >> b >> t;
		d[mp(a, b)] = t;
		int k = Layer(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 57 ms 45056 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 2 ms 2384 KB Output is correct
5 Correct 3 ms 4860 KB Output is correct
6 Correct 4 ms 4688 KB Output is correct
7 Correct 3 ms 4688 KB Output is correct
8 Correct 53 ms 45032 KB Output is correct
9 Correct 53 ms 44676 KB Output is correct
10 Correct 21 ms 41136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 30668 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 2 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 8 ms 4688 KB Output is correct
8 Correct 9 ms 4984 KB Output is correct
9 Correct 48 ms 44880 KB Output is correct
10 Correct 96 ms 31920 KB Output is correct
11 Correct 76 ms 31092 KB Output is correct
12 Correct 74 ms 27136 KB Output is correct
13 Correct 101 ms 20552 KB Output is correct
14 Correct 55 ms 20032 KB Output is correct
15 Correct 46 ms 14736 KB Output is correct
16 Correct 53 ms 14552 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 4576 KB Output is correct
7 Correct 2 ms 4856 KB Output is correct
8 Correct 4 ms 2896 KB Output is correct
9 Correct 2 ms 2896 KB Output is correct
10 Correct 32 ms 44872 KB Output is correct
11 Correct 52 ms 30516 KB Output is correct
12 Correct 86 ms 31560 KB Output is correct
13 Correct 104 ms 32840 KB Output is correct
14 Correct 94 ms 29844 KB Output is correct
15 Correct 47 ms 14488 KB Output is correct
16 Correct 36 ms 14728 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 4576 KB Output is correct
7 Correct 2 ms 4856 KB Output is correct
8 Correct 4 ms 2896 KB Output is correct
9 Correct 2 ms 2896 KB Output is correct
10 Correct 32 ms 44872 KB Output is correct
11 Correct 52 ms 30516 KB Output is correct
12 Correct 86 ms 31560 KB Output is correct
13 Correct 104 ms 32840 KB Output is correct
14 Correct 94 ms 29844 KB Output is correct
15 Correct 47 ms 14488 KB Output is correct
16 Correct 36 ms 14728 KB Output is correct
17 Correct 72 ms 30536 KB Output is correct
18 Correct 1 ms 2640 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 4 ms 4788 KB Output is correct
24 Correct 5 ms 4692 KB Output is correct
25 Correct 10 ms 2976 KB Output is correct
26 Correct 7 ms 2896 KB Output is correct
27 Correct 44 ms 44964 KB Output is correct
28 Correct 155 ms 31648 KB Output is correct
29 Correct 138 ms 32848 KB Output is correct
30 Correct 74 ms 30024 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 45056 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 2 ms 2384 KB Output is correct
5 Correct 3 ms 4860 KB Output is correct
6 Correct 4 ms 4688 KB Output is correct
7 Correct 3 ms 4688 KB Output is correct
8 Correct 53 ms 45032 KB Output is correct
9 Correct 53 ms 44676 KB Output is correct
10 Correct 21 ms 41136 KB Output is correct
11 Correct 73 ms 30668 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 2 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 8 ms 4688 KB Output is correct
18 Correct 9 ms 4984 KB Output is correct
19 Correct 48 ms 44880 KB Output is correct
20 Correct 96 ms 31920 KB Output is correct
21 Correct 76 ms 31092 KB Output is correct
22 Correct 74 ms 27136 KB Output is correct
23 Correct 101 ms 20552 KB Output is correct
24 Correct 55 ms 20032 KB Output is correct
25 Correct 46 ms 14736 KB Output is correct
26 Correct 53 ms 14552 KB Output is correct
27 Correct 1 ms 2384 KB Output is correct
28 Correct 1 ms 2512 KB Output is correct
29 Correct 1 ms 2384 KB Output is correct
30 Correct 1 ms 2384 KB Output is correct
31 Correct 1 ms 2384 KB Output is correct
32 Correct 1 ms 4576 KB Output is correct
33 Correct 2 ms 4856 KB Output is correct
34 Correct 4 ms 2896 KB Output is correct
35 Correct 2 ms 2896 KB Output is correct
36 Correct 32 ms 44872 KB Output is correct
37 Correct 52 ms 30516 KB Output is correct
38 Correct 86 ms 31560 KB Output is correct
39 Correct 104 ms 32840 KB Output is correct
40 Correct 94 ms 29844 KB Output is correct
41 Correct 47 ms 14488 KB Output is correct
42 Correct 36 ms 14728 KB Output is correct
43 Correct 72 ms 30536 KB Output is correct
44 Correct 1 ms 2640 KB Output is correct
45 Correct 1 ms 2384 KB Output is correct
46 Correct 1 ms 2384 KB Output is correct
47 Correct 1 ms 2384 KB Output is correct
48 Correct 1 ms 2384 KB Output is correct
49 Correct 4 ms 4788 KB Output is correct
50 Correct 5 ms 4692 KB Output is correct
51 Correct 10 ms 2976 KB Output is correct
52 Correct 7 ms 2896 KB Output is correct
53 Correct 44 ms 44964 KB Output is correct
54 Correct 155 ms 31648 KB Output is correct
55 Correct 138 ms 32848 KB Output is correct
56 Correct 74 ms 30024 KB Output is correct
57 Correct 204 ms 28596 KB Output is correct
58 Correct 55 ms 44968 KB Output is correct
59 Correct 79 ms 31232 KB Output is correct