oj.uz

Submission #527457

# Submission time Handle Problem Language Result Execution time Memory
527457 2022-02-17T12:45:59 Z Koosha_mv Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 345 ms 62100 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]==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: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 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 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 3 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 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 3 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 7 ms 2884 KB Output is correct
18 Correct 13 ms 5316 KB Output is correct
19 Correct 15 ms 5312 KB Output is correct
20 Correct 15 ms 5440 KB Output is correct
21 Correct 4 ms 2504 KB Output is correct
22 Correct 14 ms 5312 KB Output is correct
23 Correct 17 ms 5312 KB Output is correct
24 Correct 15 ms 5312 KB Output is correct
25 Correct 15 ms 5440 KB Output is correct
26 Correct 15 ms 5452 KB Output is correct
27 Correct 15 ms 5364 KB Output is correct
28 Correct 16 ms 5424 KB Output is correct
29 Correct 28 ms 5312 KB Output is correct
30 Correct 17 ms 5312 KB Output is correct
31 Correct 19 ms 5316 KB Output is correct
32 Correct 16 ms 5312 KB Output is correct
33 Correct 28 ms 5444 KB Output is correct
34 Correct 27 ms 5440 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 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 3 ms 2060 KB Output is correct
17 Correct 8 ms 2884 KB Output is correct
18 Correct 12 ms 5316 KB Output is correct
19 Correct 15 ms 5312 KB Output is correct
20 Correct 15 ms 5440 KB Output is correct
21 Correct 4 ms 2504 KB Output is correct
22 Correct 13 ms 5312 KB Output is correct
23 Correct 14 ms 5440 KB Output is correct
24 Correct 15 ms 5312 KB Output is correct
25 Correct 16 ms 5440 KB Output is correct
26 Correct 17 ms 5452 KB Output is correct
27 Correct 17 ms 5452 KB Output is correct
28 Correct 17 ms 5440 KB Output is correct
29 Correct 22 ms 5292 KB Output is correct
30 Correct 17 ms 5312 KB Output is correct
31 Correct 19 ms 5316 KB Output is correct
32 Correct 16 ms 5312 KB Output is correct
33 Correct 28 ms 5444 KB Output is correct
34 Correct 27 ms 5456 KB Output is correct
35 Correct 21 ms 4804 KB Output is correct
36 Correct 10 ms 3652 KB Output is correct
37 Correct 27 ms 5956 KB Output is correct
38 Correct 29 ms 6208 KB Output is correct
39 Correct 30 ms 6240 KB Output is correct
40 Correct 29 ms 6212 KB Output is correct
41 Correct 29 ms 6280 KB Output is correct
42 Correct 19 ms 6028 KB Output is correct
43 Correct 18 ms 6096 KB Output is correct
44 Correct 18 ms 6160 KB Output is correct
45 Correct 32 ms 6212 KB Output is correct
46 Correct 31 ms 6212 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 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 3 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 8 ms 2884 KB Output is correct
18 Correct 13 ms 5316 KB Output is correct
19 Correct 14 ms 5312 KB Output is correct
20 Correct 15 ms 5440 KB Output is correct
21 Correct 4 ms 2504 KB Output is correct
22 Correct 13 ms 5312 KB Output is correct
23 Correct 18 ms 5356 KB Output is correct
24 Correct 16 ms 5312 KB Output is correct
25 Correct 16 ms 5440 KB Output is correct
26 Correct 15 ms 5452 KB Output is correct
27 Correct 16 ms 5452 KB Output is correct
28 Correct 16 ms 5388 KB Output is correct
29 Correct 24 ms 5308 KB Output is correct
30 Correct 17 ms 5312 KB Output is correct
31 Correct 19 ms 5304 KB Output is correct
32 Correct 16 ms 5312 KB Output is correct
33 Correct 28 ms 5380 KB Output is correct
34 Correct 26 ms 5440 KB Output is correct
35 Correct 20 ms 4804 KB Output is correct
36 Correct 11 ms 3652 KB Output is correct
37 Correct 27 ms 5956 KB Output is correct
38 Correct 34 ms 6208 KB Output is correct
39 Correct 29 ms 6208 KB Output is correct
40 Correct 28 ms 6212 KB Output is correct
41 Correct 29 ms 6212 KB Output is correct
42 Correct 19 ms 6076 KB Output is correct
43 Correct 18 ms 6084 KB Output is correct
44 Correct 19 ms 6092 KB Output is correct
45 Correct 31 ms 6212 KB Output is correct
46 Correct 31 ms 6212 KB Output is correct
47 Correct 167 ms 31748 KB Output is correct
48 Correct 189 ms 40616 KB Output is correct
49 Correct 220 ms 60012 KB Output is correct
50 Correct 224 ms 60640 KB Output is correct
51 Correct 299 ms 61876 KB Output is correct
52 Correct 296 ms 61836 KB Output is correct
53 Correct 260 ms 61816 KB Output is correct
54 Correct 233 ms 60664 KB Output is correct
55 Correct 237 ms 60740 KB Output is correct
56 Correct 243 ms 62100 KB Output is correct
57 Correct 345 ms 60792 KB Output is correct
58 Incorrect 80 ms 61472 KB Output isn't correct
59 Halted 0 ms 0 KB -