結果

問題 No.1036 Make One With GCD 2
ユーザー Imperi_Night
提出日時 2020-04-24 22:07:13
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 322 ms / 2,000 ms
コード長 4,442 bytes
コンパイル時間 2,038 ms
コンパイル使用メモリ 139,112 KB
最終ジャッジ日時 2025-01-09 23:51:43
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <cassert>
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <memory>
#include <utility>
#include <limits>
#include <list>
/* template start */
#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
void debug_out(){std::cerr<<std::endl;}
template<typename Head,typename... Tail>
void debug_out(Head h,Tail... t){
std::cerr<<" "<<h;
if(sizeof...(t)>0)std::cout<<" :";
debug_out(t...);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
long long pow_mod(long long a, long long b, long long mod=-1) {
if(b==0)return 1;
if ((a == 0)||(mod!=-1&&(a+mod)%mod==0))return 0;
long long x = 1;
while (b > 0) {
if (b & 1)x = (mod!=-1)?(x * a) % mod:x*a;
a = (mod!=-1)?(a * a) % mod:a*a;
b >>= 1;
}
return x;
}
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
/* template end */
//SWAG
template<typename T>
class SWAG{
private:
using F=std::function<T(T,T)>;
F fn;
std::stack<T> front,back;
std::vector<T> front_fold,back_fold;
T id;
public:
SWAG(T id_,F fn_):id(id_),fn(fn_),front_fold(1,id_),back_fold(1,id_){}
void push(T val){
back.push(val);
back_fold.push_back(fn(back_fold.back(),val));
}
void pop(){
if(front.empty()){
assert(front_fold.size()==1);
while(!back.empty()){
T temp=back.top();
back.pop();
back_fold.pop_back();
front.push(temp);
front_fold.push_back(fn(temp,front_fold.back()));
}
}
assert(!front.empty());
front.pop();
front_fold.pop_back();
}
T fold_all(){
return fn(front_fold.back(),back_fold.back());
}
};
using ll = long long;
using P=std::pair<long long,long long>;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll n;
std::cin>>n;
std::vector<ll> a(n);
rep(i,0,n)std::cin>>a[i];
a.push_back(1);
SWAG<ll> swag(0ll,[](ll a,ll b){return std::gcd(a,b);});
swag.push(a[0]);
ll right=0;
ll ans=0;
rep(i,0,n){
while(swag.fold_all()!=1){
right++;
swag.push(a[right]);
}
ans+=n-right;
if(right==i){
right++;
swag.push(a[right]);
}
swag.pop();
}
std::cout<<ans<<"\n";
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0