oj.uz

답안 #527461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527461 2022-02-17T12:51:16 Z Koosha_mv Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 426 ms 39096 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=60,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

# 결과 실행 시간 메모리 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 2 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 1428 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1612 KB Output is correct
10 Correct 2 ms 1728 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 1 ms 1712 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1732 KB Output is correct
15 Correct 3 ms 1740 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 1612 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 3 ms 1740 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 1 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 1740 KB Output is correct
16 Correct 1 ms 1868 KB Output is correct
17 Correct 4 ms 2632 KB Output is correct
18 Correct 4 ms 3524 KB Output is correct
19 Correct 4 ms 3652 KB Output is correct
20 Correct 5 ms 4032 KB Output is correct
21 Correct 2 ms 2064 KB Output is correct
22 Correct 4 ms 3524 KB Output is correct
23 Correct 5 ms 3524 KB Output is correct
24 Correct 6 ms 3860 KB Output is correct
25 Correct 5 ms 3944 KB Output is correct
26 Correct 6 ms 4036 KB Output is correct
27 Correct 6 ms 3908 KB Output is correct
28 Correct 8 ms 4032 KB Output is correct
29 Correct 14 ms 3952 KB Output is correct
30 Correct 8 ms 3936 KB Output is correct
31 Correct 10 ms 3908 KB Output is correct
32 Correct 10 ms 4004 KB Output is correct
33 Correct 22 ms 4016 KB Output is correct
34 Correct 21 ms 4088 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 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 1612 KB Output is correct
10 Correct 1 ms 1740 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 1 ms 1740 KB Output is correct
13 Correct 1 ms 1740 KB Output is correct
14 Correct 3 ms 1740 KB Output is correct
15 Correct 3 ms 1764 KB Output is correct
16 Correct 1 ms 1868 KB Output is correct
17 Correct 4 ms 2632 KB Output is correct
18 Correct 4 ms 3524 KB Output is correct
19 Correct 4 ms 3652 KB Output is correct
20 Correct 5 ms 4032 KB Output is correct
21 Correct 2 ms 2064 KB Output is correct
22 Correct 4 ms 3524 KB Output is correct
23 Correct 5 ms 3524 KB Output is correct
24 Correct 6 ms 3908 KB Output is correct
25 Correct 5 ms 4032 KB Output is correct
26 Correct 7 ms 4036 KB Output is correct
27 Correct 5 ms 3908 KB Output is correct
28 Correct 6 ms 4032 KB Output is correct
29 Correct 12 ms 3944 KB Output is correct
30 Correct 6 ms 3904 KB Output is correct
31 Correct 9 ms 4024 KB Output is correct
32 Correct 8 ms 3904 KB Output is correct
33 Correct 21 ms 4032 KB Output is correct
34 Correct 22 ms 4032 KB Output is correct
35 Correct 15 ms 3856 KB Output is correct
36 Correct 5 ms 3524 KB Output is correct
37 Correct 18 ms 4192 KB Output is correct
38 Correct 20 ms 4420 KB Output is correct
39 Correct 19 ms 4448 KB Output is correct
40 Correct 20 ms 4392 KB Output is correct
41 Correct 19 ms 4420 KB Output is correct
42 Correct 10 ms 4352 KB Output is correct
43 Correct 9 ms 4352 KB Output is correct
44 Correct 9 ms 4476 KB Output is correct
45 Correct 26 ms 4456 KB Output is correct
46 Correct 28 ms 4408 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 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 1840 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 1 ms 1740 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 3 ms 1740 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 6 ms 2584 KB Output is correct
18 Correct 4 ms 3524 KB Output is correct
19 Correct 4 ms 3636 KB Output is correct
20 Correct 7 ms 4052 KB Output is correct
21 Correct 2 ms 2064 KB Output is correct
22 Correct 4 ms 3524 KB Output is correct
23 Correct 4 ms 3524 KB Output is correct
24 Correct 5 ms 3908 KB Output is correct
25 Correct 7 ms 4032 KB Output is correct
26 Correct 5 ms 4000 KB Output is correct
27 Correct 5 ms 3908 KB Output is correct
28 Correct 8 ms 4004 KB Output is correct
29 Correct 14 ms 3904 KB Output is correct
30 Correct 7 ms 3904 KB Output is correct
31 Correct 9 ms 4020 KB Output is correct
32 Correct 10 ms 3904 KB Output is correct
33 Correct 21 ms 4032 KB Output is correct
34 Correct 22 ms 4052 KB Output is correct
35 Correct 14 ms 3908 KB Output is correct
36 Correct 5 ms 3564 KB Output is correct
37 Correct 20 ms 4288 KB Output is correct
38 Correct 19 ms 4452 KB Output is correct
39 Correct 20 ms 4420 KB Output is correct
40 Correct 21 ms 4420 KB Output is correct
41 Correct 19 ms 4420 KB Output is correct
42 Correct 9 ms 4340 KB Output is correct
43 Correct 8 ms 4352 KB Output is correct
44 Correct 10 ms 4464 KB Output is correct
45 Correct 26 ms 4416 KB Output is correct
46 Correct 26 ms 4424 KB Output is correct
47 Correct 85 ms 17296 KB Output is correct
48 Correct 44 ms 32300 KB Output is correct
49 Correct 48 ms 32764 KB Output is correct
50 Correct 50 ms 33240 KB Output is correct
51 Correct 109 ms 37976 KB Output is correct
52 Correct 104 ms 37924 KB Output is correct
53 Correct 71 ms 37632 KB Output is correct
54 Correct 61 ms 36848 KB Output is correct
55 Correct 60 ms 36796 KB Output is correct
56 Correct 68 ms 37980 KB Output is correct
57 Correct 150 ms 36904 KB Output is correct
58 Correct 68 ms 37308 KB Output is correct
59 Correct 74 ms 37304 KB Output is correct
60 Correct 96 ms 37296 KB Output is correct
61 Correct 75 ms 37300 KB Output is correct
62 Correct 104 ms 38152 KB Output is correct
63 Correct 101 ms 38396 KB Output is correct
64 Correct 128 ms 38468 KB Output is correct
65 Correct 121 ms 38872 KB Output is correct
66 Correct 426 ms 39096 KB Output is correct
67 Correct 422 ms 39036 KB Output is correct