oj.uz

Submission #527460

# Submission time Handle Problem Language Result Execution time Memory
527460 2022-02-17T12:50:45 Z Koosha_mv Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 723 ms 63772 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=100,inf=1e9;
 
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;
		mark[x][p]=1;
		if(p>0){
			if(x+p<n && 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(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: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 2 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 2 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 3 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 3 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 2 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
8 Correct 2 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 2064 KB Output is correct
17 Correct 5 ms 3524 KB Output is correct
18 Correct 6 ms 5440 KB Output is correct
19 Correct 7 ms 5504 KB Output is correct
20 Correct 8 ms 5568 KB Output is correct
21 Correct 3 ms 2508 KB Output is correct
22 Correct 8 ms 5440 KB Output is correct
23 Correct 7 ms 5312 KB Output is correct
24 Correct 8 ms 5436 KB Output is correct
25 Correct 8 ms 5568 KB Output is correct
26 Correct 8 ms 5568 KB Output is correct
27 Correct 8 ms 5592 KB Output is correct
28 Correct 9 ms 5568 KB Output is correct
29 Correct 15 ms 5568 KB Output is correct
30 Correct 10 ms 5548 KB Output is correct
31 Correct 12 ms 5568 KB Output is correct
32 Correct 10 ms 5564 KB Output is correct
33 Correct 28 ms 5528 KB Output is correct
34 Correct 24 ms 5548 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 2 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 2 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 1920 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 2064 KB Output is correct
17 Correct 5 ms 3524 KB Output is correct
18 Correct 6 ms 5440 KB Output is correct
19 Correct 6 ms 5440 KB Output is correct
20 Correct 8 ms 5568 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 6 ms 5440 KB Output is correct
23 Correct 7 ms 5312 KB Output is correct
24 Correct 11 ms 5444 KB Output is correct
25 Correct 11 ms 5568 KB Output is correct
26 Correct 11 ms 5568 KB Output is correct
27 Correct 8 ms 5568 KB Output is correct
28 Correct 10 ms 5580 KB Output is correct
29 Correct 19 ms 5564 KB Output is correct
30 Correct 9 ms 5564 KB Output is correct
31 Correct 13 ms 5508 KB Output is correct
32 Correct 10 ms 5544 KB Output is correct
33 Correct 23 ms 5536 KB Output is correct
34 Correct 23 ms 5588 KB Output is correct
35 Correct 18 ms 5640 KB Output is correct
36 Correct 6 ms 3776 KB Output is correct
37 Correct 31 ms 5824 KB Output is correct
38 Correct 24 ms 6080 KB Output is correct
39 Correct 24 ms 5976 KB Output is correct
40 Correct 25 ms 6080 KB Output is correct
41 Correct 28 ms 6080 KB Output is correct
42 Correct 12 ms 6012 KB Output is correct
43 Correct 11 ms 6012 KB Output is correct
44 Correct 10 ms 6000 KB Output is correct
45 Correct 40 ms 6076 KB Output is correct
46 Correct 41 ms 6016 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 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
8 Correct 2 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 3 ms 1868 KB Output is correct
16 Correct 2 ms 2064 KB Output is correct
17 Correct 5 ms 3396 KB Output is correct
18 Correct 8 ms 5440 KB Output is correct
19 Correct 7 ms 5440 KB Output is correct
20 Correct 7 ms 5568 KB Output is correct
21 Correct 2 ms 2508 KB Output is correct
22 Correct 6 ms 5468 KB Output is correct
23 Correct 7 ms 5312 KB Output is correct
24 Correct 8 ms 5444 KB Output is correct
25 Correct 8 ms 5552 KB Output is correct
26 Correct 8 ms 5568 KB Output is correct
27 Correct 8 ms 5568 KB Output is correct
28 Correct 10 ms 5616 KB Output is correct
29 Correct 19 ms 5508 KB Output is correct
30 Correct 9 ms 5564 KB Output is correct
31 Correct 15 ms 5568 KB Output is correct
32 Correct 10 ms 5544 KB Output is correct
33 Correct 23 ms 5516 KB Output is correct
34 Correct 29 ms 5556 KB Output is correct
35 Correct 23 ms 5696 KB Output is correct
36 Correct 7 ms 3760 KB Output is correct
37 Correct 26 ms 5824 KB Output is correct
38 Correct 24 ms 6080 KB Output is correct
39 Correct 24 ms 6080 KB Output is correct
40 Correct 29 ms 5972 KB Output is correct
41 Correct 24 ms 5988 KB Output is correct
42 Correct 11 ms 6012 KB Output is correct
43 Correct 12 ms 6012 KB Output is correct
44 Correct 11 ms 6000 KB Output is correct
45 Correct 52 ms 6104 KB Output is correct
46 Correct 41 ms 6048 KB Output is correct
47 Correct 123 ms 31528 KB Output is correct
48 Correct 75 ms 60536 KB Output is correct
49 Correct 91 ms 61324 KB Output is correct
50 Correct 86 ms 62240 KB Output is correct
51 Correct 139 ms 63444 KB Output is correct
52 Correct 151 ms 63352 KB Output is correct
53 Correct 120 ms 63400 KB Output is correct
54 Correct 99 ms 62584 KB Output is correct
55 Correct 95 ms 62524 KB Output is correct
56 Correct 98 ms 63772 KB Output is correct
57 Correct 178 ms 62696 KB Output is correct
58 Correct 105 ms 63160 KB Output is correct
59 Correct 114 ms 63048 KB Output is correct
60 Correct 118 ms 63072 KB Output is correct
61 Correct 111 ms 63060 KB Output is correct
62 Correct 173 ms 63760 KB Output is correct
63 Correct 183 ms 63076 KB Output is correct
64 Correct 143 ms 62996 KB Output is correct
65 Correct 158 ms 63052 KB Output is correct
66 Correct 723 ms 62972 KB Output is correct
67 Correct 710 ms 63136 KB Output is correct