제출 #766410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766410		vito	Jakarta Skyscrapers (APIO15_skyscraper)	C++98	0 / 100	126 ms	262144 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll INF=1e18+5;
const int MAXN=2005;
const int MAXM=3e4+5;
#define F first
#define S second
vector<pair<int, int>> a(MAXM);
int n, m;
ll dp[MAXM][MAXN];
vector<vector<int>> wh(MAXN);
void dfs(int x, int y) { // x je koji covik a y je koja pozicija
	for(int i=y+a[x].S; i<n; i+=a[x].S) {
		dp[x][i]=min(dp[x][i], dp[x][y]+(i-y)/a[x].S);
		for(auto &z : wh[i]) {
			if(dp[z][i]>dp[x][y]+(i-y)/a[x].S) {
				dp[z][i]=dp[x][y]+(i-y)/a[x].S;
				dfs(z, i);
			}
		}
	}
	for(int i=y-a[x].S; i>=0; i-=a[x].S) {
		dp[x][i]=min(dp[x][i], dp[x][y]+(y-i)/a[x].S);
		for(auto &z : wh[i]) {
			if(dp[z][i]>dp[x][y]+(y-i)/a[x].S) {
				dp[z][i]=dp[x][y]+(y-i)/a[x].S;
				dfs(z, i);
			}
		}
	}
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	for(int i=0; i<MAXM; i++) {
		for(int j=0; j<MAXN; j++) {
			dp[i][j]=INF;
		}
	}
	cin >> n >> m;
	for(int i=0; i<m; i++) {
		cin >> a[i].F >> a[i].S; // pos (b), power
		wh[a[i].F].push_back(i);
	}
	dp[0][a[0].F]=0;
	dfs(0, a[0].F);
	ll rj=dp[1][a[1].F];
	if(rj==INF) {
		rj=-1;
	}
	cout << rj << '\n';
}

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