oj.uz

Submission #527446

# Submission time Handle Problem Language Result Execution time Memory
527446 2022-02-17T12:31:18 Z Koosha_mv Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 162376 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

const int N=50000,S=80;

int m,n,pos[N],p[N],dist[N][S];
vector<int> vec[N];
set<pair<int,pair<int,int>>> 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]=N;
	dist[pos[0]][0]=0;
	f(i,0,n) f(j,0,S) st.insert({dist[i][j],{i,j}});
	while(st.size()){
		int x=(*st.begin()).S.F,p=(*st.begin()).S.S;
		if(dist[x][p]==N) break;
		//cout<<endl;
		//eror(dist[2][0]);
		//cout<<x<<" "<<p<<" -> "<<dist[x][p]<<endl;
		st.erase(*st.begin());
		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);
				st.erase({dist[x+p][0],{x+p,0}});
				dist[x+p][0]=dist[x][p]+1;
				st.insert({dist[x+p][0],{x+p,0}});
			}
			if(p<=x && dist[x][p]+1<dist[x-p][0]){
				st.erase({dist[x-p][0],{x-p,0}});
				dist[x-p][0]=dist[x][p]+1;
				st.insert({dist[x-p][0],{x-p,0}});
			}
			
			if(x+p<n && dist[x][p]+1<dist[x+p][p]){
				st.erase({dist[x+p][p],{x+p,p}});
				dist[x+p][p]=dist[x][p]+1;
				st.insert({dist[x+p][p],{x+p,p}});
			}
			if(p<=x && dist[x][p]+1<dist[x-p][p]){
				st.erase({dist[x-p][p],{x-p,p}});
				dist[x-p][p]=dist[x][p]+1;
				st.insert({dist[x-p][p],{x-p,p}});
			}
			continue ;
		}
		for(auto u : vec[x]){
			if(u<S){
				if(dist[x][u]<=dist[x][p]) continue ;
				st.erase({dist[x][u],{x,u}});
				dist[x][u]=dist[x][p];
				st.insert({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]){
						st.erase({dist[i][p],{i,p}});
						dist[i][p]=dist[x][p]+abs(x-i)/u;
						st.insert({dist[i][p],{i,p}});
					}
				}
			}
		}
	}
	cout<<(dist[pos[1]][0]==N ? -1 : dist[pos[1]][0]);
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1500 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 1496 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 1500 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 2 ms 1496 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 2 ms 1612 KB Output is correct
9 Correct 3 ms 1740 KB Output is correct
10 Correct 3 ms 1996 KB Output is correct
11 Correct 5 ms 1992 KB Output is correct
12 Correct 4 ms 1996 KB Output is correct
13 Correct 3 ms 1996 KB Output is correct
14 Correct 5 ms 1996 KB Output is correct
15 Correct 4 ms 2000 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1488 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1488 KB Output is correct
4 Correct 1 ms 1500 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1616 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 3 ms 2008 KB Output is correct
11 Correct 4 ms 1996 KB Output is correct
12 Correct 3 ms 1996 KB Output is correct
13 Correct 3 ms 1996 KB Output is correct
14 Correct 5 ms 1996 KB Output is correct
15 Correct 5 ms 2020 KB Output is correct
16 Correct 4 ms 2536 KB Output is correct
17 Correct 20 ms 5500 KB Output is correct
18 Correct 35 ms 10820 KB Output is correct
19 Correct 39 ms 12044 KB Output is correct
20 Correct 42 ms 12120 KB Output is correct
21 Correct 7 ms 3532 KB Output is correct
22 Correct 35 ms 10964 KB Output is correct
23 Correct 35 ms 10040 KB Output is correct
24 Correct 51 ms 11588 KB Output is correct
25 Correct 48 ms 12200 KB Output is correct
26 Correct 49 ms 12160 KB Output is correct
27 Correct 47 ms 12164 KB Output is correct
28 Correct 55 ms 12288 KB Output is correct
29 Correct 77 ms 12088 KB Output is correct
30 Correct 63 ms 12096 KB Output is correct
31 Correct 62 ms 12092 KB Output is correct
32 Correct 61 ms 12136 KB Output is correct
33 Correct 92 ms 12100 KB Output is correct
34 Correct 98 ms 12172 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 1492 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 2 ms 1612 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 3 ms 1996 KB Output is correct
11 Correct 5 ms 1996 KB Output is correct
12 Correct 3 ms 1996 KB Output is correct
13 Correct 3 ms 1996 KB Output is correct
14 Correct 5 ms 1996 KB Output is correct
15 Correct 7 ms 2020 KB Output is correct
16 Correct 5 ms 2508 KB Output is correct
17 Correct 22 ms 5448 KB Output is correct
18 Correct 33 ms 10800 KB Output is correct
19 Correct 40 ms 12068 KB Output is correct
20 Correct 40 ms 12224 KB Output is correct
21 Correct 8 ms 3516 KB Output is correct
22 Correct 34 ms 10944 KB Output is correct
23 Correct 35 ms 9932 KB Output is correct
24 Correct 47 ms 11672 KB Output is correct
25 Correct 45 ms 12100 KB Output is correct
26 Correct 49 ms 12216 KB Output is correct
27 Correct 47 ms 12168 KB Output is correct
28 Correct 52 ms 12112 KB Output is correct
29 Correct 78 ms 12056 KB Output is correct
30 Correct 51 ms 12124 KB Output is correct
31 Correct 61 ms 12052 KB Output is correct
32 Correct 58 ms 12096 KB Output is correct
33 Correct 104 ms 12168 KB Output is correct
34 Correct 110 ms 12156 KB Output is correct
35 Correct 61 ms 9732 KB Output is correct
36 Correct 28 ms 7404 KB Output is correct
37 Correct 98 ms 12228 KB Output is correct
38 Correct 97 ms 12780 KB Output is correct
39 Correct 103 ms 12864 KB Output is correct
40 Correct 98 ms 12744 KB Output is correct
41 Correct 100 ms 12804 KB Output is correct
42 Correct 53 ms 12664 KB Output is correct
43 Correct 51 ms 12684 KB Output is correct
44 Correct 47 ms 12740 KB Output is correct
45 Correct 117 ms 12748 KB Output is correct
46 Correct 111 ms 12644 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 1500 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 2 ms 1748 KB Output is correct
10 Correct 3 ms 1996 KB Output is correct
11 Correct 4 ms 1996 KB Output is correct
12 Correct 3 ms 1996 KB Output is correct
13 Correct 3 ms 2012 KB Output is correct
14 Correct 6 ms 2124 KB Output is correct
15 Correct 5 ms 1996 KB Output is correct
16 Correct 4 ms 2520 KB Output is correct
17 Correct 19 ms 5480 KB Output is correct
18 Correct 33 ms 10708 KB Output is correct
19 Correct 39 ms 12116 KB Output is correct
20 Correct 41 ms 12228 KB Output is correct
21 Correct 8 ms 3532 KB Output is correct
22 Correct 36 ms 10924 KB Output is correct
23 Correct 35 ms 10028 KB Output is correct
24 Correct 48 ms 11620 KB Output is correct
25 Correct 48 ms 12108 KB Output is correct
26 Correct 48 ms 12176 KB Output is correct
27 Correct 46 ms 12172 KB Output is correct
28 Correct 48 ms 12228 KB Output is correct
29 Correct 73 ms 12048 KB Output is correct
30 Correct 50 ms 12096 KB Output is correct
31 Correct 60 ms 12100 KB Output is correct
32 Correct 58 ms 12124 KB Output is correct
33 Correct 92 ms 12100 KB Output is correct
34 Correct 92 ms 12152 KB Output is correct
35 Correct 59 ms 9668 KB Output is correct
36 Correct 26 ms 7372 KB Output is correct
37 Correct 99 ms 12260 KB Output is correct
38 Correct 107 ms 12768 KB Output is correct
39 Correct 95 ms 12828 KB Output is correct
40 Correct 99 ms 12824 KB Output is correct
41 Correct 99 ms 12828 KB Output is correct
42 Correct 52 ms 12612 KB Output is correct
43 Correct 50 ms 12612 KB Output is correct
44 Correct 51 ms 12640 KB Output is correct
45 Correct 123 ms 12740 KB Output is correct
46 Correct 110 ms 12752 KB Output is correct
47 Correct 785 ms 68032 KB Output is correct
48 Correct 537 ms 125944 KB Output is correct
49 Correct 585 ms 137368 KB Output is correct
50 Correct 649 ms 150688 KB Output is correct
51 Correct 987 ms 162376 KB Output is correct
52 Execution timed out 1086 ms 162376 KB Time limit exceeded
53 Halted 0 ms 0 KB -