Submission #2559752

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const ll INF = (1ll << 60);
typedef pair<ll,ll> pii;
typedef vector<pii> vpii;
using namespace std;

int main(){
  ll K; cin>>K;
  vi A(K); REP(i,K) cin>>A[i];
  vpii v(K);
  if(A[K-1]!=2){
    cout<<-1<<endl;
    return 0;
  }
  v[K-1]=make_pair(2,3);
  for(ll i=K-2;i>=0;i--){
    ll a=v[i+1].first,b=v[i+1].second,c=A[i];
    ll d,e;
    if(a%c==0) d=a;
    else d=a-a%c+c;
    e=b-b%c;
    if(d>e){
      cout<<-1<<endl;
      return 0;
    }
    v[i]=make_pair(d,e+c-1);
  }
  
  cout<<v[0].first<<' '<<v[0].second<<endl;
}

Submission Info

Judge Result