#471262 (C++17) No.1036 Make One With GCD 2

提出ソース

結果

問題	No.1036 Make One With GCD 2
ユーザー	Ogtsn99
提出日時	2020-04-26 13:11:43
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	544 ms / 2,000 ms
コード長	5,285 bytes
コンパイル時間	2,431 ms
コンパイル使用メモリ	212,508 KB
実行使用メモリ	89,196 KB
最終ジャッジ日時	2024-04-28 10:59:26
合計ジャッジ時間	16,931 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	518 ms 89,172 KB
testcase_01	AC	351 ms 89,080 KB
testcase_02	AC	316 ms 89,080 KB
testcase_03	AC	99 ms 33,280 KB
testcase_04	AC	173 ms 59,080 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	157 ms 38,144 KB
testcase_08	AC	122 ms 31,488 KB
testcase_09	AC	350 ms 87,156 KB
testcase_10	AC	357 ms 81,364 KB
testcase_11	AC	358 ms 88,880 KB
testcase_12	AC	364 ms 82,068 KB
testcase_13	AC	437 ms 85,116 KB
testcase_14	AC	432 ms 86,072 KB
testcase_15	AC	403 ms 80,844 KB
testcase_16	AC	410 ms 81,176 KB
testcase_17	AC	420 ms 83,812 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	3 ms 6,940 KB
testcase_20	AC	4 ms 6,944 KB
testcase_21	AC	4 ms 6,940 KB
testcase_22	AC	400 ms 79,716 KB
testcase_23	AC	325 ms 59,456 KB
testcase_24	AC	411 ms 83,020 KB
testcase_25	AC	383 ms 75,920 KB
testcase_26	AC	425 ms 78,416 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	2 ms 6,944 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	2 ms 6,940 KB
testcase_34	AC	2 ms 6,944 KB
testcase_35	AC	1 ms 6,940 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	2 ms 6,944 KB
testcase_38	AC	294 ms 89,160 KB
testcase_39	AC	501 ms 89,040 KB
testcase_40	AC	321 ms 59,508 KB
testcase_41	AC	508 ms 89,164 KB
testcase_42	AC	498 ms 89,184 KB
testcase_43	AC	527 ms 89,112 KB
testcase_44	AC	544 ms 89,196 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key) 
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI=3.14159265358979323846;
template <typename T> 
int getIndexOfLowerBound(vector <T> &v, T x){
    return lower_bound(v.begin(),v.end(),x)-v.begin();
}
template <typename T> 
int getIndexOfUpperBound(vector <T> &v, T x){
    return upper_bound(v.begin(),v.end(),x)-v.begin();
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
    Real a, b; is >> a >> b; p = Point(a, b); return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &p_var) {
    is >> p_var.first >> p_var.second;
    return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &df) {
    for(int i=0;i<df.size();i++)for(int j=0;j<df[i].size();j++)
    is >> df[i][j];
    return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    DUMPOUT<<'{';
    os << pair_var.first;
    DUMPOUT<<',';
    os << " "<< pair_var.second;
    DUMPOUT<<'}';
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    DUMPOUT<<'[';
    for (int i = 0; i < vec.size(); i++) 
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    DUMPOUT<<']';
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
  for (auto& vec : df) os<<vec;
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    DUMPOUT << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) DUMPOUT << ", ";
        itr--;
    }
    DUMPOUT << "}";
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    DUMPOUT << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) DUMPOUT << ", ";
        itr--;
    }
    DUMPOUT << "}";
    return os;
}
void print() {cout << endl;}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(tail) != 0) cout << " ";
  print(forward<Tail>(tail)...);
}
void dump_func() {DUMPOUT << '#'<<endl;}
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
template <typename T>
struct SparseTable{
    vector <vector<T>> table;
    vector <T> lookup;    
    int sz;
    SparseTable(vector <T> &v){
        sz = v.size();
        int b = 0;
        while((1 << b) <= v.size()) ++b;
        table.resize(b, vector <T>(sz, INF)), lookup.resize(sz+1);
        table[0] = v;
        for(int i=1;i<b;++i){
            int tmp = sz - (1<<(i-1));
            rep(j, tmp) table[i][j] = gcd(table[i-1][j], table[i-1][j+(1<<(i-1))]);
        }
        int lsz = lookup.size();
        for(int i=2;i<lsz;++i) lookup[i] = lookup[i >> 1] + 1;
    }
    T get(int l, int r){
        r = min(r, sz), l = max(0LL, l);
        int b = lookup[r - l];
        return gcd(table[b][l], table[b][r - (1 << b)]);
    }
};
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
    int n; cin>>n;
    vector <int> a(n);
    cin>>a;
    SparseTable <int> sp(a);
    int ans = 0;
    rep(i, n){
        int l = i, r = n+1;
        while (abs(l-r) > 1) {
            int mid = l + (r - l) / 2;
            if(sp.get(i, mid)==1) r = mid;
            else l = mid; 
        }
        ans += n-l;
    }
    print(ans);
}

yukicoder

結果

テストケース

ソースコード