oj.uz

Submission #233340

# Submission time Handle Problem Language Result Execution time Memory
233340 2020-05-20T09:17:09 Z kshitij_sodani Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 407 ms 262148 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=1;
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:73:34: warning: array subscript is above array bounds [-Warray-bounds]
     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){
        ~~~~~~~~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:73:90: warning: array subscript is above array bounds [-Warray-bounds]
     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){
                                                                       ~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:74:53: warning: array subscript is above array bounds [-Warray-bounds]
      dist[no.b.a+no.b.b][no.b.b]=dist[no.b.a][no.b.b]+1;
                                  ~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:74:32: warning: array subscript is above array bounds [-Warray-bounds]
      dist[no.b.a+no.b.b][no.b.b]=dist[no.b.a][no.b.b]+1;
      ~~~~~~~~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:79:34: warning: array subscript is above array bounds [-Warray-bounds]
     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){
        ~~~~~~~~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:79:90: warning: array subscript is above array bounds [-Warray-bounds]
     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){
                                                                       ~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:80:53: warning: array subscript is above array bounds [-Warray-bounds]
      dist[no.b.a-no.b.b][no.b.b]=dist[no.b.a][no.b.b]+1;
                                  ~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:80:32: warning: array subscript is above array bounds [-Warray-bounds]
      dist[no.b.a-no.b.b][no.b.b]=dist[no.b.a][no.b.b]+1;
      ~~~~~~~~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:84:65: warning: array subscript is above array bounds [-Warray-bounds]
    if(dist[no.b.a][0]==-1 or dist[no.b.a][0]>dist[no.b.a][no.b.b]){
                                              ~~~~~~~~~~~~~~~~~~~^
skyscraper.cpp:85:40: warning: array subscript is above array bounds [-Warray-bounds]
     dist[no.b.a][0]=dist[no.b.a][no.b.b];
                     ~~~~~~~~~~~~~~~~~~~^
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 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 1152 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 6 ms 1280 KB Output is correct
12 Correct 11 ms 4344 KB Output is correct
13 Correct 10 ms 4348 KB Output is correct
14 Correct 6 ms 1280 KB Output is correct
15 Correct 5 ms 1280 KB Output is correct
16 Correct 5 ms 1280 KB Output is correct
17 Correct 6 ms 1536 KB Output is correct
18 Correct 6 ms 1280 KB Output is correct
19 Correct 5 ms 1280 KB Output is correct
20 Correct 82 ms 49400 KB Output is correct
21 Correct 5 ms 1152 KB Output is correct
22 Correct 5 ms 1280 KB Output is correct
23 Correct 6 ms 1280 KB Output is correct
24 Correct 7 ms 1408 KB Output is correct
25 Correct 7 ms 1408 KB Output is correct
26 Correct 94 ms 50736 KB Output is correct
27 Correct 92 ms 50708 KB Output is correct
28 Correct 7 ms 1536 KB Output is correct
29 Correct 8 ms 2432 KB Output is correct
30 Correct 6 ms 1664 KB Output is correct
31 Correct 7 ms 1792 KB Output is correct
32 Correct 6 ms 1664 KB Output is correct
33 Correct 9 ms 3200 KB Output is correct
34 Correct 9 ms 3328 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 1152 KB Output is correct
9 Correct 6 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 6 ms 1280 KB Output is correct
12 Correct 10 ms 4344 KB Output is correct
13 Correct 10 ms 4476 KB Output is correct
14 Correct 5 ms 1280 KB Output is correct
15 Correct 6 ms 1280 KB Output is correct
16 Correct 6 ms 1280 KB Output is correct
17 Correct 6 ms 1536 KB Output is correct
18 Correct 5 ms 1280 KB Output is correct
19 Correct 5 ms 1280 KB Output is correct
20 Correct 82 ms 49272 KB Output is correct
21 Correct 5 ms 1152 KB Output is correct
22 Correct 5 ms 1280 KB Output is correct
23 Correct 6 ms 1280 KB Output is correct
24 Correct 6 ms 1408 KB Output is correct
25 Correct 6 ms 1280 KB Output is correct
26 Correct 95 ms 50736 KB Output is correct
27 Correct 92 ms 50652 KB Output is correct
28 Correct 6 ms 1536 KB Output is correct
29 Correct 8 ms 2432 KB Output is correct
30 Correct 6 ms 1664 KB Output is correct
31 Correct 7 ms 1792 KB Output is correct
32 Correct 6 ms 1664 KB Output is correct
33 Correct 9 ms 3200 KB Output is correct
34 Correct 9 ms 3328 KB Output is correct
35 Correct 14 ms 3456 KB Output is correct
36 Correct 7 ms 1536 KB Output is correct
37 Correct 17 ms 6016 KB Output is correct
38 Correct 18 ms 4992 KB Output is correct
39 Correct 22 ms 5248 KB Output is correct
40 Correct 18 ms 5120 KB Output is correct
41 Correct 18 ms 4864 KB Output is correct
42 Runtime error 404 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 1152 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 6 ms 1152 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 10 ms 4344 KB Output is correct
13 Correct 10 ms 4348 KB Output is correct
14 Correct 5 ms 1280 KB Output is correct
15 Correct 5 ms 1280 KB Output is correct
16 Correct 5 ms 1200 KB Output is correct
17 Correct 6 ms 1536 KB Output is correct
18 Correct 5 ms 1280 KB Output is correct
19 Correct 5 ms 1280 KB Output is correct
20 Correct 85 ms 49272 KB Output is correct
21 Correct 5 ms 1152 KB Output is correct
22 Correct 5 ms 1280 KB Output is correct
23 Correct 6 ms 1280 KB Output is correct
24 Correct 7 ms 1408 KB Output is correct
25 Correct 6 ms 1280 KB Output is correct
26 Correct 97 ms 50736 KB Output is correct
27 Correct 95 ms 50680 KB Output is correct
28 Correct 6 ms 1536 KB Output is correct
29 Correct 8 ms 2432 KB Output is correct
30 Correct 6 ms 1664 KB Output is correct
31 Correct 7 ms 1792 KB Output is correct
32 Correct 7 ms 1664 KB Output is correct
33 Correct 9 ms 3200 KB Output is correct
34 Correct 9 ms 3328 KB Output is correct
35 Correct 14 ms 3456 KB Output is correct
36 Correct 7 ms 1536 KB Output is correct
37 Correct 17 ms 6016 KB Output is correct
38 Correct 18 ms 4992 KB Output is correct
39 Correct 19 ms 5248 KB Output is correct
40 Correct 22 ms 5120 KB Output is correct
41 Correct 19 ms 4864 KB Output is correct
42 Runtime error 407 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -