oj.uz

Submission #233339

# Submission time Handle Problem Language Result Execution time Memory
233339 2020-05-20T09:16:38 Z kshitij_sodani Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 197 ms 110020 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int n,m;
int aa,bb;
const int ss=2;
vector<pair<pair<int,int>,int>> adj[30001][ss];//((index,power),dist)
int dist[30001][ss];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m;
	int st;
	int endd;
	memset(dist,-1,sizeof(dist));
	for(int j=0;j<m;j++){
		cin>>aa>>bb;
		if(j==0){
			st=aa;
		}
		if(j==1){
			endd=aa;
		}
		if(bb>=ss){
			for(int i=aa+bb;i<n;i+=bb){
				adj[aa][0].pb({{i,0},(i-aa)/bb});
			}
			for(int i=aa-bb;i>=0;i-=bb){
				adj[aa][0].pb({{i,0},(aa-i)/bb});
			}
		}
		else{
			adj[aa][0].pb({{aa,bb},0});
		//	adj[aa][bb].pb({{aa,0},0});
		}
	}
	/*for(int i=0;i<n;i++){
		for(int j=1;j<ss;j++){
			if(i+j<n){
				adj[i][j].pb({{i+j,j},1});
			}
			if(i-j>=0 and i-j<n){
				adj[i][j].pb({{i-j,j},1});
			}
			adj[i][j].pb({{i,0},0});

		}
	}*/
	priority_queue<pair<int,pair<int,int>>> ac;
	ac.push({0,{st,0}});
	dist[st][0]=0;
	while(ac.size()){
		pair<int,pair<int,int>> no=ac.top();
		ac.pop();
		no.a=-no.a;
		if(dist[no.b.a][no.b.b]<no.a){
			continue;
		}
	//	cout<<no.b.a<<","<<no.b.b<<","<<no.a<<endl;
		for(auto j:adj[no.b.a][no.b.b]){
			if(dist[j.a.a][j.a.b]==-1 or dist[j.a.a][j.a.b]>dist[no.b.a][no.b.b]+j.b){
				dist[j.a.a][j.a.b]=dist[no.b.a][no.b.b]+j.b;
				ac.push({-dist[j.a.a][j.a.b],{j.a}});
			}
		}
		if(no.b.b>0){
			if(no.b.a+no.b.b<n){
				if(dist[no.b.a+no.b.b][no.b.b]==-1 or dist[no.b.a+no.b.b][no.b.b]>dist[no.b.a][no.b.b]+1){
					dist[no.b.a+no.b.b][no.b.b]=dist[no.b.a][no.b.b]+1;
					ac.push({-dist[no.b.a+no.b.b][no.b.b],{no.b.a+no.b.b,no.b.b}});
				}
			}
			if(no.b.a-no.b.b>=0){
				if(dist[no.b.a-no.b.b][no.b.b]==-1 or dist[no.b.a-no.b.b][no.b.b]>dist[no.b.a][no.b.b]+1){
					dist[no.b.a-no.b.b][no.b.b]=dist[no.b.a][no.b.b]+1;
					ac.push({-dist[no.b.a-no.b.b][no.b.b],{no.b.a-no.b.b,no.b.b}});
				}
			}
			if(dist[no.b.a][0]==-1 or dist[no.b.a][0]>dist[no.b.a][no.b.b]){
				dist[no.b.a][0]=dist[no.b.a][no.b.b];
				ac.push({-dist[no.b.a][0],{no.b.a,0}});
			}
		}


	}
	cout<<dist[endd][0]<<endl;








	return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:56:13: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
  dist[st][0]=0;
  ~~~~~~~~~~~^~
skyscraper.cpp:92:20: warning: 'endd' may be used uninitialized in this function [-Wmaybe-uninitialized]
  cout<<dist[endd][0]<<endl;
                    ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1920 KB Output is correct
2 Correct 5 ms 1920 KB Output is correct
3 Correct 5 ms 2048 KB Output is correct
4 Correct 5 ms 1920 KB Output is correct
5 Correct 5 ms 2048 KB Output is correct
6 Correct 5 ms 2048 KB Output is correct
7 Correct 6 ms 2048 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2048 KB Output is correct
2 Correct 6 ms 1920 KB Output is correct
3 Correct 6 ms 1920 KB Output is correct
4 Correct 6 ms 2048 KB Output is correct
5 Correct 6 ms 1920 KB Output is correct
6 Correct 5 ms 1920 KB Output is correct
7 Correct 5 ms 1920 KB Output is correct
8 Correct 5 ms 1920 KB Output is correct
9 Correct 5 ms 1920 KB Output is correct
10 Correct 5 ms 2048 KB Output is correct
11 Correct 6 ms 2068 KB Output is correct
12 Correct 6 ms 2048 KB Output is correct
13 Correct 6 ms 2048 KB Output is correct
14 Correct 6 ms 2048 KB Output is correct
15 Correct 6 ms 2048 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2048 KB Output is correct
2 Correct 5 ms 1920 KB Output is correct
3 Correct 5 ms 1920 KB Output is correct
4 Correct 6 ms 2048 KB Output is correct
5 Correct 6 ms 1920 KB Output is correct
6 Correct 5 ms 1920 KB Output is correct
7 Correct 5 ms 1920 KB Output is correct
8 Correct 5 ms 1920 KB Output is correct
9 Correct 6 ms 2048 KB Output is correct
10 Correct 7 ms 2048 KB Output is correct
11 Correct 6 ms 2048 KB Output is correct
12 Correct 6 ms 2048 KB Output is correct
13 Correct 6 ms 2048 KB Output is correct
14 Correct 6 ms 2048 KB Output is correct
15 Correct 6 ms 2048 KB Output is correct
16 Correct 6 ms 2048 KB Output is correct
17 Correct 7 ms 2304 KB Output is correct
18 Correct 6 ms 2048 KB Output is correct
19 Correct 5 ms 2048 KB Output is correct
20 Correct 6 ms 2048 KB Output is correct
21 Correct 6 ms 2048 KB Output is correct
22 Correct 6 ms 2048 KB Output is correct
23 Correct 7 ms 2048 KB Output is correct
24 Correct 7 ms 2208 KB Output is correct
25 Correct 7 ms 2048 KB Output is correct
26 Correct 6 ms 2176 KB Output is correct
27 Correct 6 ms 2048 KB Output is correct
28 Correct 7 ms 2304 KB Output is correct
29 Correct 8 ms 3072 KB Output is correct
30 Correct 6 ms 2304 KB Output is correct
31 Correct 7 ms 2560 KB Output is correct
32 Correct 6 ms 2304 KB Output is correct
33 Correct 9 ms 3968 KB Output is correct
34 Correct 9 ms 3968 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1920 KB Output is correct
2 Correct 5 ms 1920 KB Output is correct
3 Correct 6 ms 2048 KB Output is correct
4 Correct 5 ms 1920 KB Output is correct
5 Correct 5 ms 1920 KB Output is correct
6 Correct 5 ms 1920 KB Output is correct
7 Correct 6 ms 1920 KB Output is correct
8 Correct 5 ms 1920 KB Output is correct
9 Correct 6 ms 2048 KB Output is correct
10 Correct 6 ms 2048 KB Output is correct
11 Correct 6 ms 2048 KB Output is correct
12 Correct 6 ms 2048 KB Output is correct
13 Correct 6 ms 2048 KB Output is correct
14 Correct 6 ms 2048 KB Output is correct
15 Correct 6 ms 2048 KB Output is correct
16 Correct 6 ms 2048 KB Output is correct
17 Correct 7 ms 2304 KB Output is correct
18 Correct 6 ms 2048 KB Output is correct
19 Correct 6 ms 2048 KB Output is correct
20 Correct 6 ms 2048 KB Output is correct
21 Correct 6 ms 2048 KB Output is correct
22 Correct 6 ms 2048 KB Output is correct
23 Correct 6 ms 2048 KB Output is correct
24 Correct 7 ms 2224 KB Output is correct
25 Correct 7 ms 2048 KB Output is correct
26 Correct 6 ms 2176 KB Output is correct
27 Correct 6 ms 2048 KB Output is correct
28 Correct 7 ms 2304 KB Output is correct
29 Correct 7 ms 3072 KB Output is correct
30 Correct 7 ms 2304 KB Output is correct
31 Correct 7 ms 2560 KB Output is correct
32 Correct 6 ms 2432 KB Output is correct
33 Correct 10 ms 3968 KB Output is correct
34 Correct 10 ms 3968 KB Output is correct
35 Correct 15 ms 4096 KB Output is correct
36 Correct 7 ms 2304 KB Output is correct
37 Correct 21 ms 6272 KB Output is correct
38 Correct 18 ms 5504 KB Output is correct
39 Correct 19 ms 5632 KB Output is correct
40 Correct 18 ms 5632 KB Output is correct
41 Correct 20 ms 5504 KB Output is correct
42 Correct 13 ms 2752 KB Output is correct
43 Correct 12 ms 2624 KB Output is correct
44 Correct 11 ms 2516 KB Output is correct
45 Correct 21 ms 9216 KB Output is correct
46 Correct 20 ms 9216 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1920 KB Output is correct
2 Correct 5 ms 1920 KB Output is correct
3 Correct 5 ms 1920 KB Output is correct
4 Correct 5 ms 2048 KB Output is correct
5 Correct 5 ms 1920 KB Output is correct
6 Correct 6 ms 2048 KB Output is correct
7 Correct 5 ms 1920 KB Output is correct
8 Correct 5 ms 1920 KB Output is correct
9 Correct 5 ms 1920 KB Output is correct
10 Correct 5 ms 2048 KB Output is correct
11 Correct 6 ms 2048 KB Output is correct
12 Correct 6 ms 2048 KB Output is correct
13 Correct 6 ms 2048 KB Output is correct
14 Correct 6 ms 2048 KB Output is correct
15 Correct 6 ms 2048 KB Output is correct
16 Correct 6 ms 2048 KB Output is correct
17 Correct 7 ms 2304 KB Output is correct
18 Correct 6 ms 2048 KB Output is correct
19 Correct 6 ms 2048 KB Output is correct
20 Correct 6 ms 2048 KB Output is correct
21 Correct 6 ms 2048 KB Output is correct
22 Correct 6 ms 2048 KB Output is correct
23 Correct 6 ms 2048 KB Output is correct
24 Correct 7 ms 2176 KB Output is correct
25 Correct 7 ms 2048 KB Output is correct
26 Correct 6 ms 2176 KB Output is correct
27 Correct 6 ms 2048 KB Output is correct
28 Correct 7 ms 2304 KB Output is correct
29 Correct 9 ms 3072 KB Output is correct
30 Correct 6 ms 2304 KB Output is correct
31 Correct 7 ms 2560 KB Output is correct
32 Correct 6 ms 2432 KB Output is correct
33 Correct 9 ms 3968 KB Output is correct
34 Correct 9 ms 3968 KB Output is correct
35 Correct 14 ms 4096 KB Output is correct
36 Correct 8 ms 2304 KB Output is correct
37 Correct 17 ms 6272 KB Output is correct
38 Correct 18 ms 5504 KB Output is correct
39 Correct 19 ms 5632 KB Output is correct
40 Correct 20 ms 5504 KB Output is correct
41 Correct 18 ms 5504 KB Output is correct
42 Correct 11 ms 2624 KB Output is correct
43 Correct 11 ms 2624 KB Output is correct
44 Correct 11 ms 2516 KB Output is correct
45 Correct 20 ms 9216 KB Output is correct
46 Correct 20 ms 9216 KB Output is correct
47 Correct 49 ms 17020 KB Output is correct
48 Correct 18 ms 5120 KB Output is correct
49 Correct 14 ms 4096 KB Output is correct
50 Correct 13 ms 4056 KB Output is correct
51 Correct 38 ms 7364 KB Output is correct
52 Correct 47 ms 7596 KB Output is correct
53 Correct 20 ms 2880 KB Output is correct
54 Correct 8 ms 2688 KB Output is correct
55 Correct 8 ms 2624 KB Output is correct
56 Correct 15 ms 2944 KB Output is correct
57 Correct 185 ms 89068 KB Output is correct
58 Correct 13 ms 3320 KB Output is correct
59 Correct 18 ms 4216 KB Output is correct
60 Correct 19 ms 5104 KB Output is correct
61 Correct 18 ms 3708 KB Output is correct
62 Correct 28 ms 8872 KB Output is correct
63 Correct 76 ms 37172 KB Output is correct
64 Correct 89 ms 50228 KB Output is correct
65 Correct 120 ms 59440 KB Output is correct
66 Correct 196 ms 106208 KB Output is correct
67 Correct 197 ms 110020 KB Output is correct