oj.uz

Submission #527459

# Submission time Handle Problem Language Result Execution time Memory
527459 2022-02-17T12:49:36 Z Koosha_mv Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 363 ms 62472 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 int ll
#define pii pair<int,pair<int,int>>

const int N=50000,S=42,inf=1e15;
 
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]==inf) 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]) assert(0);
				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:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | 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 2 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 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 2 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1868 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1880 KB Output is correct
15 Correct 2 ms 1868 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 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1868 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct
16 Correct 2 ms 2060 KB Output is correct
17 Correct 5 ms 2856 KB Output is correct
18 Correct 4 ms 5316 KB Output is correct
19 Correct 5 ms 5312 KB Output is correct
20 Correct 6 ms 5440 KB Output is correct
21 Correct 2 ms 2504 KB Output is correct
22 Correct 4 ms 5312 KB Output is correct
23 Correct 6 ms 5184 KB Output is correct
24 Correct 7 ms 5440 KB Output is correct
25 Correct 7 ms 5472 KB Output is correct
26 Correct 6 ms 5452 KB Output is correct
27 Correct 8 ms 5452 KB Output is correct
28 Correct 8 ms 5440 KB Output is correct
29 Correct 14 ms 5312 KB Output is correct
30 Correct 8 ms 5312 KB Output is correct
31 Correct 10 ms 5316 KB Output is correct
32 Correct 7 ms 5400 KB Output is correct
33 Correct 18 ms 5444 KB Output is correct
34 Correct 18 ms 5440 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1488 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 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 2 ms 1804 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1868 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1868 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct
16 Correct 2 ms 2060 KB Output is correct
17 Correct 4 ms 2884 KB Output is correct
18 Correct 5 ms 5316 KB Output is correct
19 Correct 5 ms 5348 KB Output is correct
20 Correct 8 ms 5440 KB Output is correct
21 Correct 3 ms 2504 KB Output is correct
22 Correct 4 ms 5312 KB Output is correct
23 Correct 5 ms 5184 KB Output is correct
24 Correct 7 ms 5312 KB Output is correct
25 Correct 7 ms 5440 KB Output is correct
26 Correct 7 ms 5452 KB Output is correct
27 Correct 6 ms 5452 KB Output is correct
28 Correct 7 ms 5440 KB Output is correct
29 Correct 14 ms 5312 KB Output is correct
30 Correct 8 ms 5312 KB Output is correct
31 Correct 11 ms 5316 KB Output is correct
32 Correct 7 ms 5312 KB Output is correct
33 Correct 18 ms 5444 KB Output is correct
34 Correct 20 ms 5440 KB Output is correct
35 Correct 14 ms 4804 KB Output is correct
36 Correct 6 ms 3652 KB Output is correct
37 Correct 19 ms 5944 KB Output is correct
38 Correct 19 ms 6184 KB Output is correct
39 Correct 22 ms 6220 KB Output is correct
40 Correct 19 ms 6212 KB Output is correct
41 Correct 19 ms 6204 KB Output is correct
42 Correct 9 ms 6084 KB Output is correct
43 Correct 11 ms 6000 KB Output is correct
44 Correct 12 ms 6092 KB Output is correct
45 Correct 23 ms 6184 KB Output is correct
46 Correct 23 ms 6172 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 2 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 1612 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 1 ms 1804 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 2 ms 1868 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct
16 Correct 2 ms 2060 KB Output is correct
17 Correct 4 ms 2884 KB Output is correct
18 Correct 5 ms 5316 KB Output is correct
19 Correct 5 ms 5312 KB Output is correct
20 Correct 6 ms 5440 KB Output is correct
21 Correct 2 ms 2504 KB Output is correct
22 Correct 6 ms 5312 KB Output is correct
23 Correct 6 ms 5184 KB Output is correct
24 Correct 6 ms 5440 KB Output is correct
25 Correct 6 ms 5440 KB Output is correct
26 Correct 6 ms 5452 KB Output is correct
27 Correct 6 ms 5452 KB Output is correct
28 Correct 7 ms 5440 KB Output is correct
29 Correct 13 ms 5312 KB Output is correct
30 Correct 7 ms 5312 KB Output is correct
31 Correct 10 ms 5316 KB Output is correct
32 Correct 6 ms 5312 KB Output is correct
33 Correct 18 ms 5380 KB Output is correct
34 Correct 18 ms 5440 KB Output is correct
35 Correct 14 ms 4736 KB Output is correct
36 Correct 6 ms 3652 KB Output is correct
37 Correct 19 ms 5976 KB Output is correct
38 Correct 23 ms 6208 KB Output is correct
39 Correct 20 ms 6208 KB Output is correct
40 Correct 20 ms 6244 KB Output is correct
41 Correct 22 ms 6216 KB Output is correct
42 Correct 10 ms 6084 KB Output is correct
43 Correct 10 ms 6108 KB Output is correct
44 Correct 10 ms 6124 KB Output is correct
45 Correct 22 ms 6212 KB Output is correct
46 Correct 23 ms 6212 KB Output is correct
47 Correct 127 ms 31824 KB Output is correct
48 Correct 50 ms 34752 KB Output is correct
49 Correct 61 ms 60076 KB Output is correct
50 Correct 59 ms 60704 KB Output is correct
51 Correct 118 ms 61840 KB Output is correct
52 Correct 120 ms 61820 KB Output is correct
53 Correct 90 ms 61776 KB Output is correct
54 Correct 72 ms 60692 KB Output is correct
55 Correct 73 ms 60664 KB Output is correct
56 Correct 82 ms 62076 KB Output is correct
57 Correct 189 ms 60768 KB Output is correct
58 Correct 83 ms 61368 KB Output is correct
59 Correct 87 ms 61696 KB Output is correct
60 Correct 90 ms 61612 KB Output is correct
61 Correct 86 ms 61696 KB Output is correct
62 Correct 112 ms 62472 KB Output is correct
63 Correct 120 ms 61844 KB Output is correct
64 Correct 135 ms 61856 KB Output is correct
65 Correct 135 ms 61844 KB Output is correct
66 Correct 363 ms 61760 KB Output is correct
67 Correct 346 ms 61852 KB Output is correct