Submission #1336994

---

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>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#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;
typedef pair<ll,ll>pll;
#define int ll
signed main(){
    int n; cin>>n;
    vector<int>v;
    vector<pii>data;
    pii now=pii(0,0);
    int ans=0;
    rep(i,n){
        pii temp; cin>>temp.first>>temp.second;
        v.push_back(temp.first+temp.second);
        data.push_back(temp);
    }
    rep(i,v.size()){
        if(!i){ans=v[0];now=data[i];continue;}
        if(data[i].first>=now.first&&data[i].second>=now.second){
            ans=v[i];
            now=data[i];
            continue;
        }else{
            pii cal=data[i];
            int power;
            if(now.second<data[i].second&&now.first>data[i].first)
                power=now.first/data[i].first+(now.first%data[i].first ? 1:0);
            else if(now.first<data[i].first&&now.second>data[i].second)
                power=now.second/data[i].second+(now.second%data[i].second ? 1:0);
            else
                power=max(
                          now.first/data[i].first+(now.first%data[i].first ? 1:0),
                          now.second/data[i].second+(now.second%data[i].second ? 1:0)
                          );
           // cout<<power<<endl;
            now=pii(cal.first*power,cal.second*power);
        }
    }
    
    cout<<now.first+now.second<<endl;
}

Submission Info

Judge Result