Submission #1028709

#TimeUsernameProblemLanguageResultExecution timeMemory
1028709vjudge1Jakarta Skyscrapers (APIO15_skyscraper)C++17
10 / 100
151 ms440 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
	int n,m;
	cin>>n>>m;
	int b[m],p[m],dp[m];
	for (int i=0;i<m;i++)
		cin>>b[i]>>p[i],dp[i]=1e9;
	dp[1]=0;
	for (int ct=0;ct<m;ct++)
	{
		int dp1[n];
		for (int i=0;i<m;i++)
		{
			dp1[i]=dp[i];
			for (int j=0;j<m;j++)
			{
				if ((b[i]-b[j])%p[i]==0)
					dp1[i]=min(dp1[i],dp[j]+abs(b[i]-b[j])/p[i]);
			}
		}
		for (int i=0;i<m;i++)
			dp[i]=dp1[i];
	}
	if (dp[0]==1e9)
		dp[0]=-1;
	cout<<dp[0]<<endl;
	
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...