Submission #678350

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
678350	2023-01-05T13:54:59 Z	hello_there_123	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	1000 ms	2660 KB

skyscraper

#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> >v[30005];
 
	priority_queue<pair<int,int>,vector<pair<int,int> >, greater<pair<int,int> >  >pq;
main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
	int N,M;
	cin>>N>>M;
	
	bool occ[N+3];
	memset(occ,0,sizeof(occ));
	vector<pair<int,int> >hi;
	for(int i=0;i<M;i++){
		int a,b;
		cin>>a>>b;
		occ[a] = 1;
		hi.push_back(make_pair(a,b));
	}
	
	pq.push(make_pair(0,0));
	int dist[40005];
	for(int i=0;i<35004;i++) dist[i] = 1e9;
	dist[0] = 0;
	while(!pq.empty()){
		int dis = pq.top().first;
		int no = pq.top().second;
		pq.pop();
		if(dist[no]<dis)continue;
		if(v[no].empty()){
			for(int i=0;i<M;i++){
				if(abs(hi[i].first-hi[no].first)%hi[no].second!=0) continue;
				int lol = dis+abs(hi[i].first-hi[no].first)/hi[no].second;
				if(dist[i]>lol){
					v[no].push_back(make_pair(i,lol-dis));
				}
			}
		}
		for(pair<int,int>p:v[no]){
			if(dis+p.second<dist[p.first]){
				dist[p.first] = dis+p.second;
				pq.push(make_pair(dis+p.second,p.first));
			}
		}
	}
	if(dist[1] == 1e9) cout<<"-1";
	else cout<<dist[1];
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1108 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	1 ms	1108 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	1 ms	1108 KB	Output is correct
9	Correct	1 ms	1108 KB	Output is correct
10	Correct	2 ms	1108 KB	Output is correct
11	Correct	22 ms	1272 KB	Output is correct
12	Correct	20 ms	1248 KB	Output is correct
13	Correct	21 ms	1252 KB	Output is correct
14	Correct	23 ms	1236 KB	Output is correct
15	Correct	24 ms	1332 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1108 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	1 ms	1108 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	1 ms	1108 KB	Output is correct
9	Correct	1 ms	1108 KB	Output is correct
10	Correct	2 ms	1108 KB	Output is correct
11	Correct	22 ms	1268 KB	Output is correct
12	Correct	21 ms	1236 KB	Output is correct
13	Correct	24 ms	1236 KB	Output is correct
14	Correct	24 ms	1236 KB	Output is correct
15	Correct	22 ms	1236 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	17 ms	1264 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	25 ms	1244 KB	Output is correct
21	Correct	1 ms	1108 KB	Output is correct
22	Correct	1 ms	1108 KB	Output is correct
23	Correct	5 ms	1108 KB	Output is correct
24	Correct	19 ms	1236 KB	Output is correct
25	Correct	20 ms	1236 KB	Output is correct
26	Correct	21 ms	1252 KB	Output is correct
27	Correct	20 ms	1236 KB	Output is correct
28	Correct	22 ms	1220 KB	Output is correct
29	Correct	4 ms	1108 KB	Output is correct
30	Correct	1 ms	1108 KB	Output is correct
31	Correct	3 ms	1108 KB	Output is correct
32	Correct	2 ms	1108 KB	Output is correct
33	Correct	25 ms	1356 KB	Output is correct
34	Correct	21 ms	1332 KB	Output is correct

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1108 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	1 ms	1108 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	1 ms	1108 KB	Output is correct
9	Correct	1 ms	1108 KB	Output is correct
10	Correct	2 ms	1108 KB	Output is correct
11	Correct	22 ms	1236 KB	Output is correct
12	Correct	21 ms	1236 KB	Output is correct
13	Correct	20 ms	1236 KB	Output is correct
14	Correct	22 ms	1340 KB	Output is correct
15	Correct	21 ms	1328 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	19 ms	1272 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	25 ms	1256 KB	Output is correct
21	Correct	1 ms	1108 KB	Output is correct
22	Correct	1 ms	1108 KB	Output is correct
23	Correct	5 ms	1108 KB	Output is correct
24	Correct	18 ms	1236 KB	Output is correct
25	Correct	20 ms	1292 KB	Output is correct
26	Correct	22 ms	1248 KB	Output is correct
27	Correct	20 ms	1256 KB	Output is correct
28	Correct	21 ms	1220 KB	Output is correct
29	Correct	4 ms	1108 KB	Output is correct
30	Correct	1 ms	1108 KB	Output is correct
31	Correct	3 ms	1108 KB	Output is correct
32	Correct	2 ms	1224 KB	Output is correct
33	Correct	23 ms	1236 KB	Output is correct
34	Correct	23 ms	1336 KB	Output is correct
35	Execution timed out	1082 ms	2584 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1108 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	1 ms	1108 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	1 ms	1108 KB	Output is correct
9	Correct	1 ms	1108 KB	Output is correct
10	Correct	3 ms	1108 KB	Output is correct
11	Correct	23 ms	1236 KB	Output is correct
12	Correct	20 ms	1236 KB	Output is correct
13	Correct	22 ms	1236 KB	Output is correct
14	Correct	23 ms	1336 KB	Output is correct
15	Correct	21 ms	1236 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	17 ms	1272 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	25 ms	1236 KB	Output is correct
21	Correct	1 ms	1108 KB	Output is correct
22	Correct	1 ms	1108 KB	Output is correct
23	Correct	5 ms	1108 KB	Output is correct
24	Correct	18 ms	1260 KB	Output is correct
25	Correct	22 ms	1292 KB	Output is correct
26	Correct	23 ms	1236 KB	Output is correct
27	Correct	23 ms	1236 KB	Output is correct
28	Correct	21 ms	1108 KB	Output is correct
29	Correct	4 ms	1108 KB	Output is correct
30	Correct	1 ms	1108 KB	Output is correct
31	Correct	3 ms	1108 KB	Output is correct
32	Correct	2 ms	1108 KB	Output is correct
33	Correct	22 ms	1328 KB	Output is correct
34	Correct	21 ms	1236 KB	Output is correct
35	Execution timed out	1087 ms	2660 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Submission #678350

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
0 / 21.0

Subtask #5
0 / 43.0