Submission #1275746

#	Time	Username	Problem	Language	Result	Execution time	Memory
1275746		mhn_neek	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	36 / 100	1095 ms	1448 KiB

skyscraper

// IN THE NAME OF GOD
#include<bits/stdc++.h>
using namespace std;
typedef int lli;
typedef pair<lli,lli> pii;
typedef vector<lli> ve;
typedef vector<pii> vp;
const lli N = 3e4 + 100;
const lli INF = 1e9;
#define PB push_back
#define MP make_pair
#define fi first
#define se second
#define FOR(x,y) for(lli x = 0; x < y; x ++)
#define FORS(x,y) for(lli x = 1; x <= y; x ++)
#define all(x) x.begin(),x.end()
#define lb lower_bound
#define ub upper_bound
#define debug(x) cerr<<(#x)<<" "<<x<<endl
lli n,m;
lli B[N],P[N];
lli dis[N];
bool mark[N];
ve hehe[N];

int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>m;
	FOR(i,m){
		cin>>B[i]>>P[i];
		hehe[B[i]].PB(i);
	}
	FOR(i,m)
		dis[i] = INF;
	priority_queue<pii,vp,greater<pii>> pq;
	pq.push(MP(0,0));
	dis[0] = 0;
	while(pq.size()){
		lli v = pq.top().se;
		lli D = pq.top().fi;
		pq.pop();
		if(D != dis[v] || mark[v])continue;
		mark[v] = 1;
		for(lli i = B[v]%P[v]; i < n;i += P[v]){
			for(lli u : hehe[i]){
				lli fa = abs(B[u]-B[v]);
				if(v != u && fa%P[v] == 0){
					lli w = fa/P[v];	
					if(dis[u] > dis[v] + w){
						dis[u] = dis[v] + w;
						pq.push(MP(dis[u],u));
					}
					if(i != B[v])
					break;
				}
			}
		}

	}
	if(dis[1] == INF)dis[1] = -1;
	cout<<dis[1]<<endl;
}

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