oj.uz

답안 #680174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680174 2023-01-10T06:25:29 Z minhcool Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 202224 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
//gp_hash_table<int, int> table;
 
using namespace std; 
 
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define eb emplace_back
 
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e4 + 5, MAXN = 1e7 + 5;
 
const long long oo = 1e9 + 7, mod = 1e9 + 7;
 
int n, m, b[N], p[N];
 
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {
    int operator()(int x) const { return x ^ RANDOM; }
};
 
gp_hash_table<int, int, chash> mn_dist[N];
vector<int> vc[N];
 
vector<int> at[N];
 
set<ii> se;
 
bool ck[N];
 
//unordered_map<int, vector<int>> avail[N];
 
void dijik(){
	//priority_queue<iii, vector<iii>, greater<iii>> pq;
	deque<iii> pq;
	mn_dist[b[0]][p[0]] = 0;
	pq.push_front({0, {b[0], p[0]}});
	while(!pq.empty()){
		int u = pq.front().se.fi, d = pq.front().se.se;
		int dist = pq.front().fi;
		pq.pop_front();
		if(dist != mn_dist[u][d]) continue;
		//cout << u << " " << d << " " << mn_dist[u][d] << "\n";
		if(!ck[u]){
			ck[u] = 1;
			for(auto it : at[u]){
				if(mn_dist[u][it] > dist){
				    mn_dist[u][it] = dist;
				    pq.push_front({mn_dist[u][it], {u, it}});
				}
			}
		}
		if(d <= u && mn_dist[u - d][d] > mn_dist[u][d] + 1){
			mn_dist[u - d][d] = mn_dist[u][d] + 1;
			pq.push_back({mn_dist[u - d][d], {u - d, d}});
		}
		if((d + u) < n && mn_dist[u + d][d] > mn_dist[u][d] + 1){
			mn_dist[u + d][d] = mn_dist[u][d] + 1;
			pq.push_back({mn_dist[u + d][d], {u + d, d}});
		}
	}
}
 
void process(){
	cin >> n >> m;
	int cnt = 0;
	for(int i = 0; i < m; i++){
		cin >> b[i] >> p[i];
		at[b[i]].pb(p[i]);
		if(se.find({b[i] % p[i], p[i]}) == se.end()){
			se.insert({b[i] % p[i], p[i]});
			for(int j = b[i] % p[i]; j < n; j += p[i]){
				cnt++;
			    vc[j].pb(p[i]);
			}
		}
	}
	for(int i = 0; i < n; i++){
		for(auto it : vc[i]) mn_dist[i][it] = oo;
	}
	dijik();
	int ans = mn_dist[b[1]][p[1]];
	cout << (ans == oo ? -1 : ans);
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	process();
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8020 KB Output is correct
2 Correct 7 ms 8020 KB Output is correct
3 Correct 7 ms 8020 KB Output is correct
4 Correct 9 ms 8020 KB Output is correct
5 Correct 6 ms 8020 KB Output is correct
6 Correct 7 ms 8020 KB Output is correct
7 Correct 8 ms 8092 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8068 KB Output is correct
2 Correct 6 ms 8020 KB Output is correct
3 Correct 8 ms 8020 KB Output is correct
4 Correct 6 ms 8084 KB Output is correct
5 Correct 6 ms 8020 KB Output is correct
6 Correct 7 ms 8096 KB Output is correct
7 Correct 7 ms 8056 KB Output is correct
8 Correct 6 ms 8092 KB Output is correct
9 Correct 6 ms 8020 KB Output is correct
10 Correct 7 ms 8092 KB Output is correct
11 Correct 8 ms 8276 KB Output is correct
12 Correct 6 ms 8028 KB Output is correct
13 Correct 7 ms 8020 KB Output is correct
14 Correct 8 ms 8404 KB Output is correct
15 Correct 9 ms 8404 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8088 KB Output is correct
2 Correct 7 ms 8020 KB Output is correct
3 Correct 7 ms 8020 KB Output is correct
4 Correct 7 ms 8020 KB Output is correct
5 Correct 8 ms 8020 KB Output is correct
6 Correct 6 ms 8020 KB Output is correct
7 Correct 6 ms 8020 KB Output is correct
8 Correct 6 ms 8084 KB Output is correct
9 Correct 6 ms 8020 KB Output is correct
10 Correct 9 ms 8148 KB Output is correct
11 Correct 8 ms 8360 KB Output is correct
12 Correct 7 ms 8100 KB Output is correct
13 Correct 7 ms 8096 KB Output is correct
14 Correct 9 ms 8404 KB Output is correct
15 Correct 10 ms 8404 KB Output is correct
16 Correct 8 ms 8228 KB Output is correct
17 Correct 10 ms 8788 KB Output is correct
18 Correct 8 ms 8356 KB Output is correct
19 Correct 9 ms 8276 KB Output is correct
20 Correct 7 ms 8136 KB Output is correct
21 Correct 7 ms 8276 KB Output is correct
22 Correct 8 ms 8276 KB Output is correct
23 Correct 8 ms 8276 KB Output is correct
24 Correct 10 ms 8636 KB Output is correct
25 Correct 11 ms 8484 KB Output is correct
26 Correct 9 ms 8316 KB Output is correct
27 Correct 10 ms 8368 KB Output is correct
28 Correct 12 ms 8956 KB Output is correct
29 Correct 15 ms 10400 KB Output is correct
30 Correct 10 ms 8788 KB Output is correct
31 Correct 17 ms 9736 KB Output is correct
32 Correct 10 ms 8908 KB Output is correct
33 Correct 22 ms 11976 KB Output is correct
34 Correct 21 ms 11856 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8020 KB Output is correct
2 Correct 6 ms 8020 KB Output is correct
3 Correct 8 ms 7996 KB Output is correct
4 Correct 7 ms 8040 KB Output is correct
5 Correct 6 ms 8084 KB Output is correct
6 Correct 8 ms 8020 KB Output is correct
7 Correct 8 ms 8096 KB Output is correct
8 Correct 8 ms 8088 KB Output is correct
9 Correct 7 ms 8020 KB Output is correct
10 Correct 8 ms 8104 KB Output is correct
11 Correct 8 ms 8404 KB Output is correct
12 Correct 8 ms 8104 KB Output is correct
13 Correct 7 ms 8020 KB Output is correct
14 Correct 9 ms 8404 KB Output is correct
15 Correct 9 ms 8356 KB Output is correct
16 Correct 8 ms 8220 KB Output is correct
17 Correct 10 ms 8788 KB Output is correct
18 Correct 8 ms 8276 KB Output is correct
19 Correct 7 ms 8252 KB Output is correct
20 Correct 7 ms 8232 KB Output is correct
21 Correct 7 ms 8204 KB Output is correct
22 Correct 7 ms 8348 KB Output is correct
23 Correct 9 ms 8392 KB Output is correct
24 Correct 11 ms 8672 KB Output is correct
25 Correct 9 ms 8532 KB Output is correct
26 Correct 10 ms 8276 KB Output is correct
27 Correct 8 ms 8360 KB Output is correct
28 Correct 12 ms 8996 KB Output is correct
29 Correct 15 ms 10452 KB Output is correct
30 Correct 9 ms 8788 KB Output is correct
31 Correct 12 ms 9700 KB Output is correct
32 Correct 12 ms 8916 KB Output is correct
33 Correct 23 ms 11920 KB Output is correct
34 Correct 23 ms 11960 KB Output is correct
35 Correct 52 ms 14644 KB Output is correct
36 Correct 12 ms 9044 KB Output is correct
37 Correct 73 ms 16368 KB Output is correct
38 Correct 92 ms 17228 KB Output is correct
39 Correct 65 ms 17336 KB Output is correct
40 Correct 80 ms 17228 KB Output is correct
41 Correct 61 ms 17252 KB Output is correct
42 Correct 14 ms 8916 KB Output is correct
43 Correct 16 ms 8856 KB Output is correct
44 Correct 10 ms 8788 KB Output is correct
45 Correct 91 ms 24276 KB Output is correct
46 Correct 88 ms 24392 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8084 KB Output is correct
2 Correct 6 ms 8020 KB Output is correct
3 Correct 6 ms 8020 KB Output is correct
4 Correct 6 ms 8020 KB Output is correct
5 Correct 6 ms 8016 KB Output is correct
6 Correct 6 ms 8020 KB Output is correct
7 Correct 6 ms 8020 KB Output is correct
8 Correct 6 ms 8020 KB Output is correct
9 Correct 7 ms 8020 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 9 ms 8276 KB Output is correct
12 Correct 7 ms 8148 KB Output is correct
13 Correct 7 ms 8052 KB Output is correct
14 Correct 8 ms 8364 KB Output is correct
15 Correct 10 ms 8348 KB Output is correct
16 Correct 7 ms 8224 KB Output is correct
17 Correct 10 ms 8812 KB Output is correct
18 Correct 8 ms 8356 KB Output is correct
19 Correct 7 ms 8276 KB Output is correct
20 Correct 7 ms 8140 KB Output is correct
21 Correct 7 ms 8148 KB Output is correct
22 Correct 7 ms 8344 KB Output is correct
23 Correct 8 ms 8380 KB Output is correct
24 Correct 10 ms 8660 KB Output is correct
25 Correct 9 ms 8532 KB Output is correct
26 Correct 8 ms 8276 KB Output is correct
27 Correct 8 ms 8276 KB Output is correct
28 Correct 13 ms 8996 KB Output is correct
29 Correct 20 ms 10452 KB Output is correct
30 Correct 10 ms 8760 KB Output is correct
31 Correct 11 ms 9740 KB Output is correct
32 Correct 10 ms 8928 KB Output is correct
33 Correct 22 ms 11976 KB Output is correct
34 Correct 24 ms 11912 KB Output is correct
35 Correct 41 ms 14636 KB Output is correct
36 Correct 13 ms 9160 KB Output is correct
37 Correct 51 ms 16340 KB Output is correct
38 Correct 58 ms 17260 KB Output is correct
39 Correct 61 ms 17332 KB Output is correct
40 Correct 61 ms 17228 KB Output is correct
41 Correct 57 ms 17272 KB Output is correct
42 Correct 13 ms 8908 KB Output is correct
43 Correct 13 ms 8872 KB Output is correct
44 Correct 11 ms 8736 KB Output is correct
45 Correct 83 ms 24392 KB Output is correct
46 Correct 85 ms 24352 KB Output is correct
47 Correct 232 ms 37460 KB Output is correct
48 Correct 56 ms 17912 KB Output is correct
49 Correct 42 ms 14504 KB Output is correct
50 Correct 39 ms 14040 KB Output is correct
51 Correct 123 ms 21408 KB Output is correct
52 Correct 135 ms 22244 KB Output is correct
53 Correct 50 ms 13140 KB Output is correct
54 Correct 9 ms 9044 KB Output is correct
55 Correct 12 ms 9044 KB Output is correct
56 Correct 18 ms 10356 KB Output is correct
57 Correct 91 ms 19392 KB Output is correct
58 Correct 20 ms 10580 KB Output is correct
59 Correct 29 ms 11584 KB Output is correct
60 Correct 43 ms 12540 KB Output is correct
61 Correct 36 ms 12244 KB Output is correct
62 Correct 159 ms 29068 KB Output is correct
63 Correct 680 ms 112716 KB Output is correct
64 Correct 733 ms 115256 KB Output is correct
65 Execution timed out 1085 ms 202224 KB Time limit exceeded
66 Halted 0 ms 0 KB -