제출 #342514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
342514		NhatMinh0208	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	783 ms	230688 KiB

skyscraper

/*
	Normie's Template v2.0
*/
 
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
vector<pii(int)> buc[5200001];
vector<pii(int)> lens;
vector<vector<int>> dis;
int dis_real[30001];
int jp[30001],jb[30001];
int n,m,i,j,k,t,t1,u,v,a,b;
int cur_len,cur_start,cur_pos;
vector<int> spawn[30001];
map<int,int> table[30001];
int main()
{
	fio;
	cin>>n>>m;
	for (i=1;i<=m;i++)
	{
		cin>>jb[i]>>jp[i];
		spawn[jb[i]].push_back(jp[i]);
		if (table[jb[i]%jp[i]][jp[i]])
		{
			if (i==1)
			{
			u=table[jb[i]%jp[i]][jp[i]]-1;
			v=jb[i]/jp[i];
			buc[0].push_back({u,v});
			dis[u][v]=0;
			}
		}
		else
		{
			lens.push_back({jb[i]%jp[i],jp[i]});
			dis.push_back({});
			for (j=jb[i]%jp[i];j<n;j+=jp[i]) dis[lens.size()-1].push_back(1e9);
			table[jb[i]%jp[i]][jp[i]]=lens.size();
			
			
			if (i==1)
			{
			u=table[jb[i]%jp[i]][jp[i]]-1;
			v=jb[i]/jp[i];
			buc[0].push_back({u,v});
			dis[u][v]=0;
			}
		}
	}
	for (i=0;i<n;i++) dis_real[i]=1e9;
	for (t=0;t<5200000;t++)
	{
		for (i=0;i<buc[t].size();i++)
		{
			cur_len=lens[buc[t][i].fi].se;
			cur_start=lens[buc[t][i].fi].fi;
			cur_pos=cur_start+cur_len*buc[t][i].se;
			if (dis_real[cur_pos]==1e9)
			{
				dis_real[cur_pos]=t;
				for (int g : spawn[cur_pos])
				{
					u=table[cur_pos%g][g]-1;
					if (dis[u][cur_pos/g]==1e9)
					{
						dis[u][cur_pos/g]=t;
						buc[t].push_back({u,cur_pos/g});
					}
				}
			}
		}
		for (i=0;i<buc[t].size();i++)
		{
			if ((buc[t][i].se-1>=0)and(dis[buc[t][i].fi][buc[t][i].se-1]==1e9))
			{
				dis[buc[t][i].fi][buc[t][i].se-1]=t+1;
				buc[t+1].push_back({buc[t][i].fi,buc[t][i].se-1});
			}
			if ((buc[t][i].se+1<dis[buc[t][i].fi].size())and(dis[buc[t][i].fi][buc[t][i].se+1]==1e9))
			{
				dis[buc[t][i].fi][buc[t][i].se+1]=t+1;
				buc[t+1].push_back({buc[t][i].fi,buc[t][i].se+1});
			}
		}
	}
	if (dis_real[jb[2]]==1e9) cout<<-1; else cout<<dis_real[jb[2]];
}

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp:20: warning: ignoring #pragma comment  [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/stack:200000000")
      | 
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:115:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |   for (i=0;i<buc[t].size();i++)
      |            ~^~~~~~~~~~~~~~
skyscraper.cpp:134:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |   for (i=0;i<buc[t].size();i++)
      |            ~^~~~~~~~~~~~~~
skyscraper.cpp:141:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |    if ((buc[t][i].se+1<dis[buc[t][i].fi].size())and(dis[buc[t][i].fi][buc[t][i].se+1]==1e9))

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