oj.uz

Submission #205522

# Submission time Handle Problem Language Result Execution time Memory
205522 2020-02-29T05:12:56 Z kshitij_sodani Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 381 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
#define endl "\n"
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	llo n,m;
	cin>>n>>m;
	llo b[m];
	llo p[m];
	//map<pair<llo,llo>,llo> aa;
	vector<pair<llo,llo>> adj[n];
	for(llo i=0;i<m;i++){
		cin>>b[i]>>p[i];
		llo jj=1;
		for(llo j=b[i]-p[i];j>=0;j=j-p[i]){
			adj[b[i]].pb(mp(j,jj));
			jj+=1;
		}
		jj=1;
		for(llo j=b[i]+p[i];j<n;j=j+p[i]){
			adj[b[i]].pb(mp(j,jj));
			jj+=1;
		}
	}


	llo dis[n];
	for(llo i=0;i<n;i++){
		dis[i]=-1;
	}
	dis[b[0]]=0;
	priority_queue<pair<llo,llo>> aaa;
	aaa.push(mp(0,b[0]));

	while(aaa.size()>0){
		pair<llo,llo> x=aaa.top();
		aaa.pop();
		for(llo j=0;j<(llo)adj[x.b].size();j++){
			pair<llo,llo> nn=adj[x.b][j];
			if(dis[nn.a]==-1 or dis[nn.a]>dis[x.b]+nn.b){
				dis[nn.a]=dis[x.b]+nn.b;
				aaa.push(mp(dis[nn.a],nn.a));
			}
		}
	}

	if(dis[b[1]]==-1){
		cout<<-1<<endl;
		return 0;
	}
	if(b[0]==b[1]){
		cout<<0<<endl;
		return 0;
	}

	cout<<dis[b[1]]<<endl;




	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 6 ms 632 KB Output is correct
12 Correct 11 ms 4588 KB Output is correct
13 Correct 13 ms 4592 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 380 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 11 ms 4588 KB Output is correct
13 Correct 11 ms 4592 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 31 ms 888 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 93 ms 64696 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 504 KB Output is correct
23 Correct 10 ms 508 KB Output is correct
24 Correct 39 ms 760 KB Output is correct
25 Correct 9 ms 632 KB Output is correct
26 Correct 117 ms 66464 KB Output is correct
27 Correct 112 ms 66328 KB Output is correct
28 Correct 6 ms 888 KB Output is correct
29 Correct 7 ms 1912 KB Output is correct
30 Correct 6 ms 888 KB Output is correct
31 Correct 6 ms 1272 KB Output is correct
32 Correct 6 ms 888 KB Output is correct
33 Correct 9 ms 3060 KB Output is correct
34 Correct 9 ms 3060 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 11 ms 4584 KB Output is correct
13 Correct 11 ms 4592 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 27 ms 888 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 94 ms 64760 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 504 KB Output is correct
23 Correct 11 ms 504 KB Output is correct
24 Correct 39 ms 764 KB Output is correct
25 Correct 9 ms 632 KB Output is correct
26 Correct 117 ms 66464 KB Output is correct
27 Correct 115 ms 66484 KB Output is correct
28 Correct 6 ms 888 KB Output is correct
29 Correct 7 ms 1912 KB Output is correct
30 Correct 6 ms 888 KB Output is correct
31 Correct 6 ms 1272 KB Output is correct
32 Correct 6 ms 888 KB Output is correct
33 Correct 9 ms 3060 KB Output is correct
34 Correct 9 ms 2932 KB Output is correct
35 Correct 172 ms 3920 KB Output is correct
36 Correct 36 ms 888 KB Output is correct
37 Correct 285 ms 7288 KB Output is correct
38 Correct 381 ms 6136 KB Output is correct
39 Correct 370 ms 6392 KB Output is correct
40 Correct 192 ms 6264 KB Output is correct
41 Correct 49 ms 6008 KB Output is correct
42 Runtime error 317 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 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 11 ms 4588 KB Output is correct
13 Correct 11 ms 4592 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 508 KB Output is correct
17 Correct 27 ms 888 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 94 ms 64632 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 504 KB Output is correct
23 Correct 10 ms 504 KB Output is correct
24 Correct 39 ms 760 KB Output is correct
25 Correct 9 ms 632 KB Output is correct
26 Correct 120 ms 66504 KB Output is correct
27 Correct 116 ms 66328 KB Output is correct
28 Correct 7 ms 888 KB Output is correct
29 Correct 7 ms 1912 KB Output is correct
30 Correct 7 ms 1016 KB Output is correct
31 Correct 6 ms 1272 KB Output is correct
32 Correct 6 ms 1016 KB Output is correct
33 Correct 10 ms 3064 KB Output is correct
34 Correct 9 ms 2932 KB Output is correct
35 Correct 173 ms 3876 KB Output is correct
36 Correct 35 ms 888 KB Output is correct
37 Correct 285 ms 7288 KB Output is correct
38 Correct 360 ms 6204 KB Output is correct
39 Correct 373 ms 6392 KB Output is correct
40 Correct 221 ms 6392 KB Output is correct
41 Correct 52 ms 6008 KB Output is correct
42 Runtime error 325 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -