Submission #972122

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
972122	2024-04-30T06:31:46 Z	batsukh2006	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	1000 ms	1188 KB

skyscraper

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
using namespace std;
#define MOD 1000000007
//#define int long long
#define ss second
#define ff first
#define endl '\n'
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n,m; cin>>n>>m;
    vector<int> b(m+1),p(m+1);
    for(int i=1; i<=m; i++) cin>>b[i]>>p[i];
    queue<int> q;
    q.push(2);
    vector<bool> vis(m+1);
    vector<int> dp(m+1,1e9);
    dp[2]=0;
    vis[2]=1;
    while(!q.empty()){
    	vector<int> tmp(m+1,1e9);
    	vector<pair<int,int> > v;
    	int need=q.size();
    	while(need--){
    		int c=q.front();
    		q.pop();
    		v.push_back({dp[c],c});
    		q.push(c);
    	}
    	sort(v.begin(),v.end());
    	for(int i=0; i<v.size(); i++){
    		for(int j=i-1; j>=0; j--){
    			if(abs(b[v[i].ss]-b[v[j].ss])%p[v[i].ss]==0){
    				dp[v[i].ss]=min(dp[v[i].ss],abs(b[v[i].ss]-b[v[j].ss])/p[v[i].ss]+dp[v[j].ss]);
    			}
    		}
    	}
    	while(!q.empty()){
    		int c=q.front();
    		q.pop();
    		for(int i=1; i<=m; i++){
    			if(abs(b[i]-b[c])%p[i]==0){
    				tmp[i]=min(tmp[i],abs(b[i]-b[c])/p[i]+dp[c]);
    			}
    		}
    	}
    	for(int i=1; i<=m; i++){
    		if(tmp[i]<dp[i]){
				q.push(i);
				dp[i]=tmp[i];
			}
    	}
    }
    if(dp[1]==1e9) cout<<-1;
    else cout<<dp[1];
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:55:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |      for(int i=0; i<v.size(); i++){
      |                   ~^~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	600 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	344 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	26 ms	528 KB	Output is correct
12	Correct	27 ms	348 KB	Output is correct
13	Correct	27 ms	532 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	21 ms	524 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	26 ms	348 KB	Output is correct
12	Correct	27 ms	348 KB	Output is correct
13	Correct	28 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	22 ms	344 KB	Output is correct
16	Correct	5 ms	348 KB	Output is correct
17	Correct	22 ms	516 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	34 ms	528 KB	Output is correct
21	Correct	2 ms	604 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	3 ms	348 KB	Output is correct
24	Correct	20 ms	348 KB	Output is correct
25	Correct	7 ms	348 KB	Output is correct
26	Correct	74 ms	348 KB	Output is correct
27	Correct	26 ms	528 KB	Output is correct
28	Correct	12 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	17 ms	344 KB	Output is correct

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	600 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	26 ms	736 KB	Output is correct
12	Correct	27 ms	344 KB	Output is correct
13	Correct	27 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	22 ms	348 KB	Output is correct
16	Correct	5 ms	348 KB	Output is correct
17	Correct	22 ms	384 KB	Output is correct
18	Correct	3 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	34 ms	348 KB	Output is correct
21	Correct	2 ms	344 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	3 ms	348 KB	Output is correct
24	Correct	20 ms	344 KB	Output is correct
25	Correct	7 ms	348 KB	Output is correct
26	Correct	74 ms	500 KB	Output is correct
27	Correct	26 ms	344 KB	Output is correct
28	Correct	12 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	17 ms	348 KB	Output is correct
35	Execution timed out	1091 ms	1172 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	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	26 ms	348 KB	Output is correct
12	Correct	27 ms	500 KB	Output is correct
13	Correct	28 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	22 ms	600 KB	Output is correct
16	Correct	5 ms	348 KB	Output is correct
17	Correct	22 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	34 ms	348 KB	Output is correct
21	Correct	2 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	3 ms	348 KB	Output is correct
24	Correct	19 ms	500 KB	Output is correct
25	Correct	7 ms	348 KB	Output is correct
26	Correct	74 ms	348 KB	Output is correct
27	Correct	26 ms	344 KB	Output is correct
28	Correct	12 ms	344 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	17 ms	512 KB	Output is correct
35	Execution timed out	1083 ms	1188 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Submission #972122

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