Submission #1766621

---

Source Code Expand

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
using ll = long long;
//#define int ll
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
int gcd(int a, int b) {
    return b ? gcd(b, a % b) : a;
}
int lcm( int m, int n ){
    if ( ( 0 == m ) || ( 0 == n ) )
        return 0;
    return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}

int dp[4001][4001];

signed main(){
    int n; cin>>n;
    vector<int>c(n);
    pii comp; cin>>comp.first>>comp.second;
    vector<pii>val;
    rep(i,4001)rep(j,4001)dp[i][j]=INF;
    rep(i,n){
        pii temp; cin>>temp.first>>temp.second;
        val.push_back(temp);
        cin>>c[i];
    }
    rep(i,n){
        cmin(dp[val[i].first][val[i].second],c[i]);
        rep(j,4001){
            rep(k,4001){
                if(dp[j][k]==INF)continue;
                if(j==val[i].first&&k==val[i].second)continue;
                pii ni=pii(gcd(j,val[i].first),gcd(k,val[i].second));
                cmin(dp[ni.first][ni.second],dp[j][k]+c[i]);
            }
        }
    }
    int ans=INF;
    if(dp[comp.first][comp.second]==INF)return puts("-1")*0;
    cout<<(dp[comp.first][comp.second])<<endl;
}

Submission Info

Judge Result