oj.uz

답안 #1093573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093573 2024-09-27T04:03:25 Z vjudge1 Toll (BOI17_toll) C++17
100 / 100
 167 ms 77820 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll int
#define pll pair<long long, long long>
#define pb push_back
#define F first
#define S second  
#define all(x) (x).begin(), (x).end()
 
const ll N = 5e4 + 100;
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const ll block = 450;
ll k,n,m,q;
struct Matrix{
	vector<vector<ll>>d;
	ll n,m;
	void init(ll _n, ll _m){
		n = _n;
		m = _m;
		d.resize(n, vector<ll>(m));
	}
	ll col() const{
		return m;
	}
	ll row() const{
		return n;
	}
};
Matrix operator* (const Matrix &a, const Matrix &b){
	Matrix ans;
	ans.init(a.row(), b.col());
	for(int i = 0; i < a.row();i++){
		for(int j = 0; j < b.col();j++) ans.d[i][j] = inf;
	}
	for(int i = 0; i < a.row(); i++){
		for(int j = 0; j < b.col();j++){
			for(int k = 0; k < a.col();k++){
				ans.d[i][j] = min(ans.d[i][j], a.d[i][k] + b.d[k][j]);
			}
		}
	}
	return ans;
}
Matrix t[N];
Matrix st[N][17];
void to_thic_cau(){
	cin >> k >> n >> m >> q;
	ll lim = n / k;
	for(int i = 0; i <= lim;i++){
		t[i].init(k, k);
		for(int j = 0; j < k;j++){
			for(int x = 0; x < k;x++) t[i].d[j][x] = inf;
		}
	}
	for(int i = 1; i <= m;i++){
		ll u,v,w; cin >> u >> v >> w;
		t[v / k].d[u % k][v % k] = w;
	}
	for(int i = 0; i <= lim;i++) st[i][0] = t[i];
	for(int j = 1; j <= 16;j++){
		for(int i = 0; i + (1 << j) <= lim + 1;i++) st[i][j] = st[i][j-1] * st[i + (1 << (j - 1))][j-1]; 
	}
	while(q--){
		ll a,b; cin >> a >> b;
		if(a / k == b / k){
			if(a != b){
				cout << -1 << "\n";
			}
			else cout << 0 << '\n';
			continue;
		}
		ll l = a / k + 1, r = b / k;
		Matrix cur; 
		cur.init(1, k);
		for(int i = 0; i < k;i++) cur.d[0][i] = inf;
		cur.d[0][a % k] = 0;
		ll d = r - l + 1;
		for(int i = 16; i >= 0;i--){
			if(d & (1 << i)){
				assert(l <= lim);
				cur = cur * st[l][i];
				l += (1 << i);
			}
		}
		if(cur.d[0][b % k] >= 1e9){
			cout << -1 << "\n";
		}
		else cout << cur.d[0][b % k] << "\n";
	}
}   
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	ll tc = 1;
	//cin >> tc;
	while(tc--) to_thic_cau();
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 77820 KB Output is correct
2 Correct 14 ms 28588 KB Output is correct
3 Correct 14 ms 28604 KB Output is correct
4 Correct 12 ms 28696 KB Output is correct
5 Correct 17 ms 29276 KB Output is correct
6 Correct 14 ms 29272 KB Output is correct
7 Correct 15 ms 29276 KB Output is correct
8 Correct 133 ms 77640 KB Output is correct
9 Correct 125 ms 77640 KB Output is correct
10 Correct 118 ms 77704 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 74580 KB Output is correct
2 Correct 14 ms 28508 KB Output is correct
3 Correct 14 ms 28504 KB Output is correct
4 Correct 14 ms 28472 KB Output is correct
5 Correct 14 ms 28508 KB Output is correct
6 Correct 19 ms 28664 KB Output is correct
7 Correct 21 ms 29160 KB Output is correct
8 Correct 21 ms 29276 KB Output is correct
9 Correct 125 ms 77756 KB Output is correct
10 Correct 143 ms 68836 KB Output is correct
11 Correct 111 ms 74580 KB Output is correct
12 Correct 132 ms 68908 KB Output is correct
13 Correct 85 ms 50004 KB Output is correct
14 Correct 81 ms 51568 KB Output is correct
15 Correct 83 ms 50024 KB Output is correct
16 Correct 75 ms 49920 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 13 ms 28508 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 14 ms 28688 KB Output is correct
5 Correct 12 ms 28504 KB Output is correct
6 Correct 13 ms 29276 KB Output is correct
7 Correct 13 ms 29264 KB Output is correct
8 Correct 14 ms 29020 KB Output is correct
9 Correct 14 ms 29016 KB Output is correct
10 Correct 103 ms 77648 KB Output is correct
11 Correct 97 ms 74580 KB Output is correct
12 Correct 126 ms 68948 KB Output is correct
13 Correct 124 ms 68944 KB Output is correct
14 Correct 114 ms 68728 KB Output is correct
15 Correct 76 ms 50000 KB Output is correct
16 Correct 71 ms 49836 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 13 ms 28508 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 14 ms 28688 KB Output is correct
5 Correct 12 ms 28504 KB Output is correct
6 Correct 13 ms 29276 KB Output is correct
7 Correct 13 ms 29264 KB Output is correct
8 Correct 14 ms 29020 KB Output is correct
9 Correct 14 ms 29016 KB Output is correct
10 Correct 103 ms 77648 KB Output is correct
11 Correct 97 ms 74580 KB Output is correct
12 Correct 126 ms 68948 KB Output is correct
13 Correct 124 ms 68944 KB Output is correct
14 Correct 114 ms 68728 KB Output is correct
15 Correct 76 ms 50000 KB Output is correct
16 Correct 71 ms 49836 KB Output is correct
17 Correct 102 ms 74572 KB Output is correct
18 Correct 19 ms 28504 KB Output is correct
19 Correct 13 ms 28504 KB Output is correct
20 Correct 13 ms 28508 KB Output is correct
21 Correct 13 ms 28508 KB Output is correct
22 Correct 13 ms 28508 KB Output is correct
23 Correct 24 ms 29276 KB Output is correct
24 Correct 17 ms 29276 KB Output is correct
25 Correct 23 ms 28944 KB Output is correct
26 Correct 16 ms 29020 KB Output is correct
27 Correct 138 ms 77648 KB Output is correct
28 Correct 125 ms 68944 KB Output is correct
29 Correct 167 ms 68948 KB Output is correct
30 Correct 120 ms 68948 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 77820 KB Output is correct
2 Correct 14 ms 28588 KB Output is correct
3 Correct 14 ms 28604 KB Output is correct
4 Correct 12 ms 28696 KB Output is correct
5 Correct 17 ms 29276 KB Output is correct
6 Correct 14 ms 29272 KB Output is correct
7 Correct 15 ms 29276 KB Output is correct
8 Correct 133 ms 77640 KB Output is correct
9 Correct 125 ms 77640 KB Output is correct
10 Correct 118 ms 77704 KB Output is correct
11 Correct 120 ms 74580 KB Output is correct
12 Correct 14 ms 28508 KB Output is correct
13 Correct 14 ms 28504 KB Output is correct
14 Correct 14 ms 28472 KB Output is correct
15 Correct 14 ms 28508 KB Output is correct
16 Correct 19 ms 28664 KB Output is correct
17 Correct 21 ms 29160 KB Output is correct
18 Correct 21 ms 29276 KB Output is correct
19 Correct 125 ms 77756 KB Output is correct
20 Correct 143 ms 68836 KB Output is correct
21 Correct 111 ms 74580 KB Output is correct
22 Correct 132 ms 68908 KB Output is correct
23 Correct 85 ms 50004 KB Output is correct
24 Correct 81 ms 51568 KB Output is correct
25 Correct 83 ms 50024 KB Output is correct
26 Correct 75 ms 49920 KB Output is correct
27 Correct 12 ms 28508 KB Output is correct
28 Correct 13 ms 28508 KB Output is correct
29 Correct 15 ms 28508 KB Output is correct
30 Correct 14 ms 28688 KB Output is correct
31 Correct 12 ms 28504 KB Output is correct
32 Correct 13 ms 29276 KB Output is correct
33 Correct 13 ms 29264 KB Output is correct
34 Correct 14 ms 29020 KB Output is correct
35 Correct 14 ms 29016 KB Output is correct
36 Correct 103 ms 77648 KB Output is correct
37 Correct 97 ms 74580 KB Output is correct
38 Correct 126 ms 68948 KB Output is correct
39 Correct 124 ms 68944 KB Output is correct
40 Correct 114 ms 68728 KB Output is correct
41 Correct 76 ms 50000 KB Output is correct
42 Correct 71 ms 49836 KB Output is correct
43 Correct 102 ms 74572 KB Output is correct
44 Correct 19 ms 28504 KB Output is correct
45 Correct 13 ms 28504 KB Output is correct
46 Correct 13 ms 28508 KB Output is correct
47 Correct 13 ms 28508 KB Output is correct
48 Correct 13 ms 28508 KB Output is correct
49 Correct 24 ms 29276 KB Output is correct
50 Correct 17 ms 29276 KB Output is correct
51 Correct 23 ms 28944 KB Output is correct
52 Correct 16 ms 29020 KB Output is correct
53 Correct 138 ms 77648 KB Output is correct
54 Correct 125 ms 68944 KB Output is correct
55 Correct 167 ms 68948 KB Output is correct
56 Correct 120 ms 68948 KB Output is correct
57 Correct 155 ms 68820 KB Output is correct
58 Correct 117 ms 77652 KB Output is correct
59 Correct 113 ms 74580 KB Output is correct