oj.uz

답안 #680176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680176 2023-01-10T06:30:34 Z minhcool Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 202168 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#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<ii> pq;
	mn_dist[b[0]][p[0]] = 0;
	pq.push_front({b[0], p[0]});
	while(!pq.empty()){
		int u = pq.front().fi, d = pq.front().se;
		int dist = mn_dist[u][d];
		pq.pop_front();
		//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({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({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({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 6 ms 8020 KB Output is correct
2 Correct 7 ms 8092 KB Output is correct
3 Correct 7 ms 8092 KB Output is correct
4 Correct 8 ms 8088 KB Output is correct
5 Correct 7 ms 8020 KB Output is correct
6 Correct 7 ms 7992 KB Output is correct
7 Correct 6 ms 8020 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8084 KB Output is correct
2 Correct 10 ms 8020 KB Output is correct
3 Correct 7 ms 8020 KB Output is correct
4 Correct 6 ms 8020 KB Output is correct
5 Correct 8 ms 8020 KB Output is correct
6 Correct 7 ms 8092 KB Output is correct
7 Correct 6 ms 8020 KB Output is correct
8 Correct 7 ms 8020 KB Output is correct
9 Correct 7 ms 8020 KB Output is correct
10 Correct 6 ms 8180 KB Output is correct
11 Correct 8 ms 8276 KB Output is correct
12 Correct 8 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 8 ms 8392 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8068 KB Output is correct
2 Correct 6 ms 8020 KB Output is correct
3 Correct 7 ms 8020 KB Output is correct
4 Correct 6 ms 8104 KB Output is correct
5 Correct 7 ms 8020 KB Output is correct
6 Correct 9 ms 8020 KB Output is correct
7 Correct 6 ms 8020 KB Output is correct
8 Correct 7 ms 8020 KB Output is correct
9 Correct 7 ms 8020 KB Output is correct
10 Correct 6 ms 8148 KB Output is correct
11 Correct 9 ms 8356 KB Output is correct
12 Correct 7 ms 8020 KB Output is correct
13 Correct 7 ms 8020 KB Output is correct
14 Correct 8 ms 8404 KB Output is correct
15 Correct 8 ms 8404 KB Output is correct
16 Correct 7 ms 8276 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 8220 KB Output is correct
20 Correct 7 ms 8224 KB Output is correct
21 Correct 7 ms 8232 KB Output is correct
22 Correct 7 ms 8344 KB Output is correct
23 Correct 9 ms 8276 KB Output is correct
24 Correct 10 ms 8616 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 11 ms 9044 KB Output is correct
29 Correct 20 ms 10452 KB Output is correct
30 Correct 11 ms 8856 KB Output is correct
31 Correct 14 ms 9684 KB Output is correct
32 Correct 13 ms 8856 KB Output is correct
33 Correct 20 ms 11860 KB Output is correct
34 Correct 20 ms 11968 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8044 KB Output is correct
2 Correct 7 ms 8004 KB Output is correct
3 Correct 7 ms 7988 KB Output is correct
4 Correct 6 ms 8020 KB Output is correct
5 Correct 6 ms 8020 KB Output is correct
6 Correct 8 ms 8020 KB Output is correct
7 Correct 8 ms 8036 KB Output is correct
8 Correct 6 ms 8020 KB Output is correct
9 Correct 6 ms 8092 KB Output is correct
10 Correct 9 ms 8276 KB Output is correct
11 Correct 10 ms 8384 KB Output is correct
12 Correct 7 ms 8020 KB Output is correct
13 Correct 7 ms 8028 KB Output is correct
14 Correct 8 ms 8404 KB Output is correct
15 Correct 9 ms 8404 KB Output is correct
16 Correct 10 ms 8276 KB Output is correct
17 Correct 10 ms 8736 KB Output is correct
18 Correct 8 ms 8324 KB Output is correct
19 Correct 10 ms 8224 KB Output is correct
20 Correct 7 ms 8228 KB Output is correct
21 Correct 7 ms 8228 KB Output is correct
22 Correct 7 ms 8348 KB Output is correct
23 Correct 8 ms 8336 KB Output is correct
24 Correct 11 ms 8588 KB Output is correct
25 Correct 9 ms 8532 KB Output is correct
26 Correct 9 ms 8344 KB Output is correct
27 Correct 8 ms 8356 KB Output is correct
28 Correct 11 ms 9064 KB Output is correct
29 Correct 14 ms 10488 KB Output is correct
30 Correct 9 ms 8916 KB Output is correct
31 Correct 11 ms 9684 KB Output is correct
32 Correct 11 ms 8896 KB Output is correct
33 Correct 25 ms 11980 KB Output is correct
34 Correct 23 ms 11860 KB Output is correct
35 Correct 46 ms 14444 KB Output is correct
36 Correct 12 ms 9044 KB Output is correct
37 Correct 49 ms 16332 KB Output is correct
38 Correct 54 ms 17072 KB Output is correct
39 Correct 56 ms 17084 KB Output is correct
40 Correct 53 ms 17064 KB Output is correct
41 Correct 60 ms 17076 KB Output is correct
42 Correct 12 ms 8824 KB Output is correct
43 Correct 12 ms 8744 KB Output is correct
44 Correct 11 ms 8660 KB Output is correct
45 Correct 95 ms 24164 KB Output is correct
46 Correct 77 ms 24088 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8020 KB Output is correct
2 Correct 7 ms 8036 KB Output is correct
3 Correct 8 ms 8020 KB Output is correct
4 Correct 6 ms 8020 KB Output is correct
5 Correct 6 ms 8088 KB Output is correct
6 Correct 7 ms 8080 KB Output is correct
7 Correct 7 ms 8020 KB Output is correct
8 Correct 6 ms 8020 KB Output is correct
9 Correct 6 ms 8020 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 8 ms 8276 KB Output is correct
12 Correct 7 ms 8020 KB Output is correct
13 Correct 8 ms 8276 KB Output is correct
14 Correct 8 ms 8356 KB Output is correct
15 Correct 8 ms 8320 KB Output is correct
16 Correct 7 ms 8220 KB Output is correct
17 Correct 10 ms 8788 KB Output is correct
18 Correct 9 ms 8356 KB Output is correct
19 Correct 10 ms 8276 KB Output is correct
20 Correct 7 ms 8148 KB Output is correct
21 Correct 7 ms 8220 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 8616 KB Output is correct
25 Correct 9 ms 8404 KB Output is correct
26 Correct 8 ms 8404 KB Output is correct
27 Correct 8 ms 8360 KB Output is correct
28 Correct 11 ms 9044 KB Output is correct
29 Correct 16 ms 10368 KB Output is correct
30 Correct 9 ms 8788 KB Output is correct
31 Correct 11 ms 9732 KB Output is correct
32 Correct 10 ms 8848 KB Output is correct
33 Correct 20 ms 11932 KB Output is correct
34 Correct 21 ms 11860 KB Output is correct
35 Correct 42 ms 14456 KB Output is correct
36 Correct 15 ms 9124 KB Output is correct
37 Correct 53 ms 16176 KB Output is correct
38 Correct 53 ms 16996 KB Output is correct
39 Correct 56 ms 17240 KB Output is correct
40 Correct 53 ms 17044 KB Output is correct
41 Correct 62 ms 17108 KB Output is correct
42 Correct 12 ms 8772 KB Output is correct
43 Correct 12 ms 8732 KB Output is correct
44 Correct 10 ms 8668 KB Output is correct
45 Correct 75 ms 24052 KB Output is correct
46 Correct 78 ms 24080 KB Output is correct
47 Correct 201 ms 37200 KB Output is correct
48 Correct 52 ms 17764 KB Output is correct
49 Correct 54 ms 14496 KB Output is correct
50 Correct 46 ms 13964 KB Output is correct
51 Correct 119 ms 21196 KB Output is correct
52 Correct 116 ms 22000 KB Output is correct
53 Correct 52 ms 13104 KB Output is correct
54 Correct 8 ms 8984 KB Output is correct
55 Correct 10 ms 9004 KB Output is correct
56 Correct 16 ms 10264 KB Output is correct
57 Correct 98 ms 19380 KB Output is correct
58 Correct 24 ms 10580 KB Output is correct
59 Correct 29 ms 11552 KB Output is correct
60 Correct 47 ms 12528 KB Output is correct
61 Correct 38 ms 12136 KB Output is correct
62 Correct 150 ms 28872 KB Output is correct
63 Correct 627 ms 112464 KB Output is correct
64 Correct 722 ms 115120 KB Output is correct
65 Execution timed out 1091 ms 202168 KB Time limit exceeded
66 Halted 0 ms 0 KB -