제출 #882401

#제출 시각아이디문제언어결과실행 시간메모리
882401vjudge1Jakarta Skyscrapers (APIO15_skyscraper)C++17
10 / 100
1070 ms31692 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int inf = 1e18 + 7; void solve(){ int n,m; cin >> n >> m; pair < int , int > doge[m]; for(int i = 0;i<m;i++){ cin >> doge[i].first >> doge[i].second; } int dp[m][m]; for(int i = 0;i<m;i++){ for(int j = 0;j<m;j++){ int len = abs(doge[i].first - doge[j].first); if(len % doge[i].second == 0)dp[i][j] = len / doge[i].second; else dp[i][j] = inf; } } for(int j = 0;j<m;j++){ for(int i = 0;i<m;i++){ for(int k = 0;k<m;k++){ if(dp[i][j] != inf and dp[j][k] != inf){ dp[i][k] = min(dp[i][k] , dp[i][j] + dp[j][k]); } } } } cout << (dp[0][1] == inf ? -1 : dp[0][1]) << endl; } signed main(){ ios_base::sync_with_stdio(0);cin.tie(0); int testcase = 1;//cin >> testcase; while(testcase--)solve(); }
#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...