Submission #678348

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
678348	2023-01-05T13:54:28 Z	hello_there_123	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	1000 ms	33280 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*0-1){
					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	1236 KB	Output is correct
11	Correct	25 ms	3256 KB	Output is correct
12	Correct	55 ms	33104 KB	Output is correct
13	Correct	52 ms	33220 KB	Output is correct
14	Correct	23 ms	2560 KB	Output is correct
15	Correct	23 ms	2604 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	1236 KB	Output is correct
11	Correct	24 ms	3268 KB	Output is correct
12	Correct	56 ms	33084 KB	Output is correct
13	Correct	53 ms	33280 KB	Output is correct
14	Correct	25 ms	2608 KB	Output is correct
15	Correct	23 ms	2556 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	19 ms	1764 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	55 ms	33228 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	1236 KB	Output is correct
24	Correct	19 ms	1372 KB	Output is correct
25	Correct	21 ms	1364 KB	Output is correct
26	Correct	52 ms	30192 KB	Output is correct
27	Correct	56 ms	31052 KB	Output is correct
28	Correct	21 ms	1392 KB	Output is correct
29	Correct	5 ms	1364 KB	Output is correct
30	Correct	1 ms	1108 KB	Output is correct
31	Correct	3 ms	1236 KB	Output is correct
32	Correct	3 ms	1236 KB	Output is correct
33	Correct	23 ms	2532 KB	Output is correct
34	Correct	24 ms	2532 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	1236 KB	Output is correct
11	Correct	25 ms	3240 KB	Output is correct
12	Correct	60 ms	33052 KB	Output is correct
13	Correct	54 ms	33196 KB	Output is correct
14	Correct	25 ms	2616 KB	Output is correct
15	Correct	23 ms	2660 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	19 ms	1744 KB	Output is correct
18	Correct	2 ms	1108 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	56 ms	33200 KB	Output is correct
21	Correct	1 ms	1108 KB	Output is correct
22	Correct	1 ms	1108 KB	Output is correct
23	Correct	7 ms	1236 KB	Output is correct
24	Correct	23 ms	1364 KB	Output is correct
25	Correct	23 ms	1300 KB	Output is correct
26	Correct	53 ms	30232 KB	Output is correct
27	Correct	54 ms	31092 KB	Output is correct
28	Correct	21 ms	1380 KB	Output is correct
29	Correct	6 ms	1364 KB	Output is correct
30	Correct	1 ms	1108 KB	Output is correct
31	Correct	3 ms	1252 KB	Output is correct
32	Correct	2 ms	1236 KB	Output is correct
33	Correct	26 ms	2584 KB	Output is correct
34	Correct	30 ms	2540 KB	Output is correct
35	Execution timed out	1085 ms	12088 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	2 ms	1236 KB	Output is correct
11	Correct	25 ms	3276 KB	Output is correct
12	Correct	66 ms	33120 KB	Output is correct
13	Correct	55 ms	33228 KB	Output is correct
14	Correct	28 ms	2572 KB	Output is correct
15	Correct	24 ms	2572 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	19 ms	1748 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	62 ms	33248 KB	Output is correct
21	Correct	1 ms	1108 KB	Output is correct
22	Correct	1 ms	1108 KB	Output is correct
23	Correct	6 ms	1236 KB	Output is correct
24	Correct	21 ms	1348 KB	Output is correct
25	Correct	24 ms	1304 KB	Output is correct
26	Correct	60 ms	30300 KB	Output is correct
27	Correct	60 ms	31112 KB	Output is correct
28	Correct	23 ms	1492 KB	Output is correct
29	Correct	6 ms	1364 KB	Output is correct
30	Correct	1 ms	1108 KB	Output is correct
31	Correct	3 ms	1236 KB	Output is correct
32	Correct	2 ms	1236 KB	Output is correct
33	Correct	29 ms	2564 KB	Output is correct
34	Correct	27 ms	2644 KB	Output is correct
35	Execution timed out	1090 ms	11572 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Submission #678348

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