Submission #228919

# Submission time Handle Problem Language Result Execution time Memory
228919 2020-05-03T05:49:23 Z alishahali1382 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
1000 ms 186608 KB
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int SQ=180, MAXN=180*30000;

int n, m, k, u, v, x, y, t, a, b, ans;
int B[MAXN], P[MAXN];
int dist[MAXN];
bool mark[MAXN];
vector<pii> G[MAXN];
priority_queue<pii, vector<pii>, greater<pii>> pq;

inline void addedge(int v1, int j1, int v2, int j2, int w){
	G[v1*SQ+j1].pb({v2*SQ+j2, w});
}

inline void upd(int v, int d){
	if (dist[v]>d) pq.push({dist[v]=d, v});
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	memset(dist, 63, sizeof(dist));
	cin>>n>>m;
	/*
	for (int i=0; i<n; i++) for (int j=1; j<SQ; j++){
		if (i>=j) addedge(i, j, i-j, j, 1);
		if (i+j<n) addedge(i, j, i+j, j, 1);
		addedge(i, j, i, 0, 0);
	}*/
	for (int i=0; i<m; i++){
		cin>>B[i]>>P[i];
		if (P[i]<SQ) G[B[i]*SQ].pb({B[i]*SQ+P[i], 0});
		else{
			for (int j=1; B[i]-j*P[i]>=0; j++) addedge(B[i], 0, B[i]-P[i]*j, 0, j);
			for (int j=1; B[i]+j*P[i]<n; j++) addedge(B[i], 0, B[i]+P[i]*j, 0, j);
		}
	}
	
	pq.push({dist[B[0]*SQ]=0, B[0]*SQ});
	while (pq.size()){
		int v=pq.top().second;
		pq.pop();
		if (mark[v]) continue ;
		mark[v]=1;
		for (pii p:G[v]) upd(p.first, dist[v]+p.second);
		
		int i=v/SQ, j=v%SQ;
		if (i>=j) upd((i-j)*SQ+j, dist[v]+1);
		if (i+j<n) upd((i+j)*SQ+j, dist[v]+1);
		upd(i*SQ, dist[v]+0);
		
	}
	
	ans=dist[SQ*B[1]];
	if (ans>=inf) ans=-1;
	cout<<ans<<'\n';
	
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 83 ms 148344 KB Output is correct
2 Correct 88 ms 148344 KB Output is correct
3 Correct 82 ms 148344 KB Output is correct
4 Correct 88 ms 148344 KB Output is correct
5 Correct 85 ms 148344 KB Output is correct
6 Correct 90 ms 148344 KB Output is correct
7 Correct 87 ms 148344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 96 ms 148344 KB Output is correct
2 Correct 94 ms 148344 KB Output is correct
3 Correct 83 ms 148344 KB Output is correct
4 Correct 93 ms 148344 KB Output is correct
5 Correct 89 ms 148344 KB Output is correct
6 Correct 86 ms 148472 KB Output is correct
7 Correct 83 ms 148344 KB Output is correct
8 Correct 82 ms 148252 KB Output is correct
9 Correct 85 ms 148344 KB Output is correct
10 Correct 89 ms 148392 KB Output is correct
11 Correct 93 ms 148344 KB Output is correct
12 Correct 87 ms 148344 KB Output is correct
13 Correct 87 ms 148528 KB Output is correct
14 Correct 86 ms 148472 KB Output is correct
15 Correct 89 ms 148372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 89 ms 148344 KB Output is correct
2 Correct 86 ms 148348 KB Output is correct
3 Correct 86 ms 148344 KB Output is correct
4 Correct 84 ms 148348 KB Output is correct
5 Correct 83 ms 148344 KB Output is correct
6 Correct 95 ms 148344 KB Output is correct
7 Correct 84 ms 148344 KB Output is correct
8 Correct 87 ms 148344 KB Output is correct
9 Correct 83 ms 148348 KB Output is correct
10 Correct 88 ms 148344 KB Output is correct
11 Correct 84 ms 148344 KB Output is correct
12 Correct 86 ms 148356 KB Output is correct
13 Correct 88 ms 148344 KB Output is correct
14 Correct 84 ms 148344 KB Output is correct
15 Correct 85 ms 148472 KB Output is correct
16 Correct 83 ms 148344 KB Output is correct
17 Correct 86 ms 148472 KB Output is correct
18 Correct 91 ms 148472 KB Output is correct
19 Correct 84 ms 148344 KB Output is correct
20 Correct 84 ms 148728 KB Output is correct
21 Correct 87 ms 148344 KB Output is correct
22 Correct 84 ms 148344 KB Output is correct
23 Correct 88 ms 148600 KB Output is correct
24 Correct 85 ms 148728 KB Output is correct
25 Correct 87 ms 148728 KB Output is correct
26 Correct 91 ms 148728 KB Output is correct
27 Correct 84 ms 148728 KB Output is correct
28 Correct 89 ms 148728 KB Output is correct
29 Correct 96 ms 148856 KB Output is correct
30 Correct 95 ms 148600 KB Output is correct
31 Correct 97 ms 148728 KB Output is correct
32 Correct 86 ms 148728 KB Output is correct
33 Correct 98 ms 148728 KB Output is correct
34 Correct 98 ms 148728 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 85 ms 148344 KB Output is correct
2 Correct 83 ms 148348 KB Output is correct
3 Correct 84 ms 148344 KB Output is correct
4 Correct 87 ms 148344 KB Output is correct
5 Correct 84 ms 148344 KB Output is correct
6 Correct 82 ms 148344 KB Output is correct
7 Correct 84 ms 148472 KB Output is correct
8 Correct 86 ms 148344 KB Output is correct
9 Correct 84 ms 148360 KB Output is correct
10 Correct 85 ms 148472 KB Output is correct
11 Correct 83 ms 148344 KB Output is correct
12 Correct 83 ms 148344 KB Output is correct
13 Correct 85 ms 148472 KB Output is correct
14 Correct 83 ms 148344 KB Output is correct
15 Correct 85 ms 148344 KB Output is correct
16 Correct 85 ms 148476 KB Output is correct
17 Correct 87 ms 148472 KB Output is correct
18 Correct 91 ms 148344 KB Output is correct
19 Correct 86 ms 148344 KB Output is correct
20 Correct 85 ms 148728 KB Output is correct
21 Correct 87 ms 148344 KB Output is correct
22 Correct 91 ms 148344 KB Output is correct
23 Correct 84 ms 148600 KB Output is correct
24 Correct 85 ms 148732 KB Output is correct
25 Correct 82 ms 148728 KB Output is correct
26 Correct 104 ms 148728 KB Output is correct
27 Correct 83 ms 148728 KB Output is correct
28 Correct 87 ms 148728 KB Output is correct
29 Correct 94 ms 148744 KB Output is correct
30 Correct 86 ms 148600 KB Output is correct
31 Correct 89 ms 148712 KB Output is correct
32 Correct 89 ms 148848 KB Output is correct
33 Correct 100 ms 148728 KB Output is correct
34 Correct 99 ms 148728 KB Output is correct
35 Correct 100 ms 149368 KB Output is correct
36 Correct 87 ms 148600 KB Output is correct
37 Correct 106 ms 149752 KB Output is correct
38 Correct 109 ms 149952 KB Output is correct
39 Correct 110 ms 149880 KB Output is correct
40 Correct 111 ms 150100 KB Output is correct
41 Correct 111 ms 149964 KB Output is correct
42 Correct 90 ms 149496 KB Output is correct
43 Correct 90 ms 149496 KB Output is correct
44 Correct 87 ms 149532 KB Output is correct
45 Correct 143 ms 151360 KB Output is correct
46 Correct 141 ms 151176 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 84 ms 148344 KB Output is correct
2 Correct 85 ms 148344 KB Output is correct
3 Correct 83 ms 148472 KB Output is correct
4 Correct 84 ms 148472 KB Output is correct
5 Correct 84 ms 148344 KB Output is correct
6 Correct 83 ms 148344 KB Output is correct
7 Correct 83 ms 148344 KB Output is correct
8 Correct 85 ms 148272 KB Output is correct
9 Correct 85 ms 148300 KB Output is correct
10 Correct 84 ms 148344 KB Output is correct
11 Correct 83 ms 148344 KB Output is correct
12 Correct 83 ms 148344 KB Output is correct
13 Correct 83 ms 148344 KB Output is correct
14 Correct 83 ms 148472 KB Output is correct
15 Correct 82 ms 148472 KB Output is correct
16 Correct 85 ms 148344 KB Output is correct
17 Correct 85 ms 148472 KB Output is correct
18 Correct 84 ms 148344 KB Output is correct
19 Correct 84 ms 148344 KB Output is correct
20 Correct 86 ms 148728 KB Output is correct
21 Correct 85 ms 148344 KB Output is correct
22 Correct 83 ms 148344 KB Output is correct
23 Correct 84 ms 148728 KB Output is correct
24 Correct 85 ms 148856 KB Output is correct
25 Correct 87 ms 148728 KB Output is correct
26 Correct 85 ms 148728 KB Output is correct
27 Correct 87 ms 148728 KB Output is correct
28 Correct 87 ms 148728 KB Output is correct
29 Correct 90 ms 148728 KB Output is correct
30 Correct 86 ms 148672 KB Output is correct
31 Correct 87 ms 148728 KB Output is correct
32 Correct 85 ms 148728 KB Output is correct
33 Correct 100 ms 148728 KB Output is correct
34 Correct 97 ms 148728 KB Output is correct
35 Correct 101 ms 149556 KB Output is correct
36 Correct 88 ms 148600 KB Output is correct
37 Correct 110 ms 149752 KB Output is correct
38 Correct 112 ms 150136 KB Output is correct
39 Correct 119 ms 149880 KB Output is correct
40 Correct 107 ms 149880 KB Output is correct
41 Correct 107 ms 149880 KB Output is correct
42 Correct 89 ms 149496 KB Output is correct
43 Correct 87 ms 149496 KB Output is correct
44 Correct 88 ms 149532 KB Output is correct
45 Correct 146 ms 151156 KB Output is correct
46 Correct 150 ms 151176 KB Output is correct
47 Correct 208 ms 154868 KB Output is correct
48 Correct 96 ms 149880 KB Output is correct
49 Correct 103 ms 149628 KB Output is correct
50 Correct 97 ms 149380 KB Output is correct
51 Correct 154 ms 156204 KB Output is correct
52 Correct 155 ms 156152 KB Output is correct
53 Correct 103 ms 154360 KB Output is correct
54 Correct 91 ms 153592 KB Output is correct
55 Correct 92 ms 153592 KB Output is correct
56 Correct 105 ms 155020 KB Output is correct
57 Correct 210 ms 153660 KB Output is correct
58 Correct 99 ms 154232 KB Output is correct
59 Correct 109 ms 154488 KB Output is correct
60 Correct 116 ms 154748 KB Output is correct
61 Correct 107 ms 154612 KB Output is correct
62 Correct 146 ms 156536 KB Output is correct
63 Correct 178 ms 178288 KB Output is correct
64 Correct 189 ms 186608 KB Output is correct
65 Correct 493 ms 184812 KB Output is correct
66 Execution timed out 1053 ms 178540 KB Time limit exceeded
67 Halted 0 ms 0 KB -