제출 #786112

#제출 시각아이디문제언어결과실행 시간메모리
786112christinelynnJakarta Skyscrapers (APIO15_skyscraper)C++17
0 / 100
1 ms212 KiB
#include<bits/stdc++.h> #define int long long using namespace std; const int INF=1e15; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int m, n; cin >> m >> n; vector<int> a(n), b(n), dp(n); for(int &p : dp) p=INF; for(int i=0; i<n; i++) cin >> a[i] >> b[i]; for(int KALI=0; KALI<n; KALI++) { for(int i=0; i<n; i++) { if(abs(a[i]-a[1])%b[i]==0) dp[i]=min(dp[i], abs(a[i]-a[1])/b[i]); for(int j=0; j<n; j++) { if(i==j) continue; if(abs(a[i]-a[j])%b[i]) continue; dp[i]=min(dp[i], dp[j]+abs(a[i]-a[j])/b[i]); } } } cout << dp[0] << '\n'; 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...