oj.uz

Submission #527455

# Submission time Handle Problem Language Result Execution time Memory
527455 2022-02-17T12:44:42 Z Koosha_mv Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 288 ms 32104 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define pii pair<int,pair<int,int>>

const int N=50000,S=40,inf=2e9;
 
int m,n,pos[N],p[N],dist[N][S],mark[N][S];
vector<int> vec[N];
priority_queue<pii,vector<pii>,greater<pii>> st;
 
main(){
	ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	cin>>n>>m;
	f(i,0,m){
		cin>>pos[i]>>p[i];
		vec[pos[i]].pb(p[i]);
	}
	f(i,0,n) f(j,0,S) dist[i][j]=inf;
	dist[pos[0]][0]=0;
	f(i,0,n) f(j,0,S) st.push({dist[i][j],{i,j}});
	while(st.size()){
		int x=st.top().S.F,p=st.top().S.S;
		st.pop();
		if(mark[x][p]) continue ;
		if(dist[x][p]==N) break;
		//cout<<endl;
		//eror(dist[2][0]);
		//cout<<x<<" "<<p<<" -> "<<dist[x][p]<<endl;
		mark[x][p]=1;
		if(p>0){
			//eror(x+p);
			//cout<<x+p<<" "<<dist[x][p]+1<<" "<<dist[x+p][0]<<endl;
			if(x+p<n && dist[x][p]+1<dist[x+p][0]){
				//eror(100);
				dist[x+p][0]=dist[x][p]+1;
				st.push({dist[x+p][0],{x+p,0}});
			}
			if(p<=x && dist[x][p]+1<dist[x-p][0]){
				dist[x-p][0]=dist[x][p]+1;
				st.push({dist[x-p][0],{x-p,0}});
			}
			
			if(x+p<n && dist[x][p]+1<dist[x+p][p]){
				dist[x+p][p]=dist[x][p]+1;
				st.push({dist[x+p][p],{x+p,p}});
			}
			if(p<=x && dist[x][p]+1<dist[x-p][p]){
				dist[x-p][p]=dist[x][p]+1;
				st.push({dist[x-p][p],{x-p,p}});
			}
			continue ;
		}
		for(auto u : vec[x]){
			if(u<S){
				if(dist[x][u]<=dist[x][p]) continue ;
				dist[x][u]=dist[x][p];
				st.push({dist[x][u],{x,u}});
			}
			else{
				for(int i=x%u;i<n;i+=u){
					if(dist[x][p]+abs(x-i)/u<dist[i][p]){
						dist[i][p]=dist[x][p]+abs(x-i)/u;
						st.push({dist[i][p],{i,p}});
					}
				}
			}
		}
	}
	cout<<(dist[pos[1]][0]==inf ? -1 : dist[pos[1]][0]);
}

Compilation message

skyscraper.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 2 ms 1612 KB Output is correct
12 Correct 2 ms 1612 KB Output is correct
13 Correct 2 ms 1612 KB Output is correct
14 Correct 2 ms 1612 KB Output is correct
15 Correct 2 ms 1612 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 2 ms 1844 KB Output is correct
12 Correct 2 ms 1612 KB Output is correct
13 Correct 2 ms 1612 KB Output is correct
14 Correct 2 ms 1716 KB Output is correct
15 Correct 2 ms 1612 KB Output is correct
16 Correct 2 ms 1740 KB Output is correct
17 Correct 7 ms 2248 KB Output is correct
18 Correct 11 ms 3396 KB Output is correct
19 Correct 12 ms 3524 KB Output is correct
20 Correct 13 ms 3524 KB Output is correct
21 Correct 4 ms 1936 KB Output is correct
22 Correct 11 ms 3396 KB Output is correct
23 Correct 11 ms 2884 KB Output is correct
24 Correct 13 ms 3528 KB Output is correct
25 Correct 13 ms 3524 KB Output is correct
26 Correct 13 ms 3528 KB Output is correct
27 Correct 13 ms 3528 KB Output is correct
28 Correct 14 ms 3524 KB Output is correct
29 Correct 20 ms 3524 KB Output is correct
30 Correct 14 ms 3396 KB Output is correct
31 Correct 15 ms 3400 KB Output is correct
32 Correct 13 ms 3524 KB Output is correct
33 Correct 22 ms 3524 KB Output is correct
34 Correct 23 ms 3528 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1512 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 2 ms 1612 KB Output is correct
12 Correct 1 ms 1612 KB Output is correct
13 Correct 2 ms 1612 KB Output is correct
14 Correct 2 ms 1612 KB Output is correct
15 Correct 2 ms 1612 KB Output is correct
16 Correct 2 ms 1740 KB Output is correct
17 Correct 6 ms 2248 KB Output is correct
18 Correct 10 ms 3396 KB Output is correct
19 Correct 13 ms 3524 KB Output is correct
20 Correct 12 ms 3524 KB Output is correct
21 Correct 3 ms 1936 KB Output is correct
22 Correct 11 ms 3396 KB Output is correct
23 Correct 10 ms 2932 KB Output is correct
24 Correct 13 ms 3528 KB Output is correct
25 Correct 13 ms 3524 KB Output is correct
26 Correct 13 ms 3528 KB Output is correct
27 Correct 13 ms 3528 KB Output is correct
28 Correct 14 ms 3524 KB Output is correct
29 Correct 22 ms 3396 KB Output is correct
30 Correct 14 ms 3396 KB Output is correct
31 Correct 16 ms 3400 KB Output is correct
32 Correct 13 ms 3396 KB Output is correct
33 Correct 24 ms 3524 KB Output is correct
34 Correct 23 ms 3528 KB Output is correct
35 Correct 18 ms 3140 KB Output is correct
36 Correct 9 ms 2632 KB Output is correct
37 Correct 23 ms 3780 KB Output is correct
38 Correct 25 ms 3868 KB Output is correct
39 Correct 25 ms 3912 KB Output is correct
40 Correct 25 ms 3912 KB Output is correct
41 Correct 24 ms 3912 KB Output is correct
42 Correct 17 ms 3844 KB Output is correct
43 Correct 16 ms 3844 KB Output is correct
44 Correct 16 ms 3956 KB Output is correct
45 Correct 31 ms 3908 KB Output is correct
46 Correct 28 ms 3844 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1480 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 2 ms 1612 KB Output is correct
12 Correct 2 ms 1612 KB Output is correct
13 Correct 2 ms 1612 KB Output is correct
14 Correct 2 ms 1612 KB Output is correct
15 Correct 3 ms 1612 KB Output is correct
16 Correct 2 ms 1740 KB Output is correct
17 Correct 7 ms 2248 KB Output is correct
18 Correct 14 ms 3396 KB Output is correct
19 Correct 12 ms 3524 KB Output is correct
20 Correct 12 ms 3524 KB Output is correct
21 Correct 3 ms 1936 KB Output is correct
22 Correct 12 ms 3396 KB Output is correct
23 Correct 10 ms 2884 KB Output is correct
24 Correct 12 ms 3528 KB Output is correct
25 Correct 13 ms 3524 KB Output is correct
26 Correct 13 ms 3528 KB Output is correct
27 Correct 13 ms 3528 KB Output is correct
28 Correct 14 ms 3524 KB Output is correct
29 Correct 21 ms 3528 KB Output is correct
30 Correct 15 ms 3396 KB Output is correct
31 Correct 15 ms 3400 KB Output is correct
32 Correct 13 ms 3396 KB Output is correct
33 Correct 23 ms 3524 KB Output is correct
34 Correct 23 ms 3492 KB Output is correct
35 Correct 21 ms 3140 KB Output is correct
36 Correct 9 ms 2632 KB Output is correct
37 Correct 27 ms 3780 KB Output is correct
38 Correct 26 ms 3912 KB Output is correct
39 Correct 26 ms 3912 KB Output is correct
40 Correct 25 ms 3912 KB Output is correct
41 Correct 25 ms 3852 KB Output is correct
42 Correct 16 ms 3844 KB Output is correct
43 Correct 16 ms 3916 KB Output is correct
44 Correct 16 ms 3956 KB Output is correct
45 Correct 28 ms 3908 KB Output is correct
46 Correct 28 ms 3920 KB Output is correct
47 Correct 128 ms 12088 KB Output is correct
48 Correct 161 ms 20440 KB Output is correct
49 Correct 160 ms 22028 KB Output is correct
50 Correct 190 ms 31084 KB Output is correct
51 Correct 235 ms 31732 KB Output is correct
52 Correct 252 ms 31772 KB Output is correct
53 Correct 216 ms 31772 KB Output is correct
54 Correct 191 ms 30900 KB Output is correct
55 Correct 193 ms 30892 KB Output is correct
56 Correct 205 ms 32104 KB Output is correct
57 Correct 288 ms 31028 KB Output is correct
58 Incorrect 54 ms 31348 KB Output isn't correct
59 Halted 0 ms 0 KB -