제출 #205583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
205583		kshitij_sodani	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	22 / 100	1111 ms	235632 KiB

skyscraper

#include <iostream>
#include <bits/stdc++.h>
 
using namespace std;
//typedef int64_t int;
#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);
	int n,m;
	cin>>n>>m;
	int b[m];
	int p[m];
	//map<pair<int,int>,int> aa;
	vector<pair<int,int>> adj[n][m+1];
	vector<int> vv[n];
	for(int i=0;i<m;i++){
		cin>>b[i]>>p[i];

		for(int j=b[i]-p[i];j>=0;j=j-p[i]){
			adj[j+p[i]][i].pb(mp(j,i));
			adj[j+p[i]][i].pb(mp(j,m));
		}
		for(int j=b[i]+p[i];j<n;j=j+p[i]){
			adj[j-p[i]][i].pb(mp(j,i));
			adj[j-p[i]][i].pb(mp(j,m));
		}
		adj[b[i]][m].pb(mp(b[i],i));
	}



	int dis[n][m+1];
	memset(dis,-1,sizeof(dis));
	dis[b[0]][m]=0;
	dis[b[0]][0]=0;
	deque<pair<int,int>> aaa;
	aaa.push_back(mp(b[0],0));
	aaa.push_back(mp(b[0],m));
	while(!aaa.empty()){
		pair<int,int>


		 x=aaa.front();
		aaa.pop_front();
		int co=1;
		if(x.b==m){
			co=0;
		}
		for(auto nn:adj[x.a][x.b]){
			if(dis[nn.a][nn.b]==-1){
				dis[nn.a][nn.b]=dis[x.a][x.b]+co;
				if(co==0){
					aaa.push_front(nn);
				}
				else{
					aaa.push_back(nn);
				}
			}
		}
	}
	if(b[0]==b[1]){
		cout<<0<<endl;
		return 0;
	}

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




	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43