#837960 (C++17) No.2198 Concon Substrings (COuNt-CONstruct Version)

提出ソース

結果

問題	No.2198 Concon Substrings (COuNt-CONstruct Version)
ユーザー	siganai
提出日時	2023-02-06 21:10:03
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	2 ms / 2,000 ms
コード長	5,893 bytes
コンパイル時間	2,795 ms
コンパイル使用メモリ	211,328 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-09-18 07:20:30
合計ジャッジ時間	8,789 ms
ジャッジサーバーID （参考情報）	judge13 / judge11

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	1 ms 4,376 KB
testcase_02	AC	2 ms 4,376 KB
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	1 ms 4,380 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	2 ms 4,380 KB
testcase_07	AC	2 ms 4,384 KB
testcase_08	AC	2 ms 4,380 KB
testcase_09	AC	1 ms 4,376 KB
testcase_10	AC	1 ms 4,376 KB
testcase_11	AC	2 ms 4,376 KB
testcase_12	AC	1 ms 4,380 KB
testcase_13	AC	1 ms 4,384 KB
testcase_14	AC	2 ms 4,380 KB
testcase_15	AC	2 ms 4,380 KB
testcase_16	AC	2 ms 4,380 KB
testcase_17	AC	1 ms 4,376 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	2 ms 4,376 KB
testcase_20	AC	1 ms 4,380 KB
testcase_21	AC	2 ms 4,380 KB
testcase_22	AC	2 ms 4,380 KB
testcase_23	AC	2 ms 4,380 KB
testcase_24	AC	2 ms 4,376 KB
testcase_25	AC	2 ms 4,380 KB
testcase_26	AC	2 ms 4,380 KB
testcase_27	AC	2 ms 4,380 KB
testcase_28	AC	2 ms 4,380 KB
testcase_29	AC	2 ms 4,380 KB
testcase_30	AC	2 ms 4,376 KB
testcase_31	AC	2 ms 4,380 KB
testcase_32	AC	2 ms 4,380 KB
testcase_33	AC	2 ms 4,376 KB
testcase_34	AC	1 ms 4,380 KB
testcase_35	AC	2 ms 4,380 KB
testcase_36	AC	1 ms 4,380 KB
testcase_37	AC	2 ms 4,380 KB
testcase_38	AC	1 ms 4,380 KB
testcase_39	AC	2 ms 4,380 KB
testcase_40	AC	2 ms 4,380 KB
testcase_41	AC	2 ms 4,380 KB
testcase_42	AC	2 ms 4,380 KB
testcase_43	AC	2 ms 4,376 KB
testcase_44	AC	1 ms 4,376 KB
testcase_45	AC	2 ms 4,376 KB
testcase_46	AC	1 ms 4,380 KB
testcase_47	AC	2 ms 4,380 KB
testcase_48	AC	1 ms 4,380 KB
testcase_49	AC	1 ms 4,380 KB
testcase_50	AC	2 ms 4,380 KB
testcase_51	AC	1 ms 4,376 KB
testcase_52	AC	2 ms 4,380 KB
testcase_53	AC	1 ms 4,380 KB
testcase_54	AC	1 ms 4,380 KB
testcase_55	AC	1 ms 4,380 KB
testcase_56	AC	2 ms 4,376 KB
testcase_57	AC	1 ms 4,376 KB
testcase_58	AC	1 ms 4,380 KB
testcase_59	AC	1 ms 4,376 KB
testcase_60	AC	2 ms 4,380 KB
testcase_61	AC	2 ms 4,380 KB
testcase_62	AC	2 ms 4,376 KB
testcase_63	AC	1 ms 4,380 KB
testcase_64	AC	2 ms 4,380 KB
testcase_65	AC	2 ms 4,380 KB
testcase_66	AC	2 ms 4,380 KB
testcase_67	AC	2 ms 4,376 KB
testcase_68	AC	1 ms 4,380 KB
testcase_69	AC	2 ms 4,380 KB
testcase_70	AC	2 ms 4,380 KB
testcase_71	AC	2 ms 4,384 KB
testcase_72	AC	2 ms 4,380 KB
testcase_73	AC	2 ms 4,376 KB
testcase_74	AC	2 ms 4,380 KB
testcase_75	AC	2 ms 4,376 KB
testcase_76	AC	2 ms 4,380 KB
testcase_77	AC	2 ms 4,384 KB
testcase_78	AC	2 ms 4,380 KB
testcase_79	AC	2 ms 4,384 KB
testcase_80	AC	2 ms 4,380 KB
testcase_81	AC	2 ms 4,380 KB
testcase_82	AC	2 ms 4,380 KB
testcase_83	AC	2 ms 4,380 KB
testcase_84	AC	2 ms 4,380 KB
testcase_85	AC	1 ms 4,380 KB
testcase_86	AC	1 ms 4,380 KB
testcase_87	AC	2 ms 4,384 KB
testcase_88	AC	2 ms 4,380 KB
testcase_89	AC	2 ms 4,380 KB
testcase_90	AC	2 ms 4,380 KB
testcase_91	AC	1 ms 4,380 KB
testcase_92	AC	2 ms 4,376 KB
testcase_93	AC	2 ms 4,380 KB
testcase_94	AC	1 ms 4,384 KB
testcase_95	AC	2 ms 4,376 KB
testcase_96	AC	2 ms 4,376 KB
testcase_97	AC	2 ms 4,380 KB
testcase_98	AC	2 ms 4,376 KB
testcase_99	AC	2 ms 4,376 KB
testcase_100	AC	2 ms 4,380 KB
testcase_101	AC	2 ms 4,380 KB
testcase_102	AC	2 ms 4,380 KB
testcase_103	AC	2 ms 4,380 KB
testcase_104	AC	2 ms 4,376 KB
testcase_105	AC	2 ms 4,380 KB
testcase_106	AC	2 ms 4,380 KB
testcase_107	AC	2 ms 4,380 KB

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

ソースコード

raw source code

#line 1 "main.cpp"
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>

#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;

#line 2 "library/math/factorize.hpp"
vector<pair<long long,int>> prime_factorization(long long n) {
    vector<pair<long long,int>> ret;
    int c = 0;
    while(n % 2 == 0) {
        c++;
        n >>= 1;
    }
    if(c) ret.emplace_back(2,c);
    for(long long i = 3; i * i <= n; i += 2) {
        c = 0;
        while(n % i == 0) {
            n /= i;
            c++;
        }
        if(c) ret.emplace_back(i,c);
    }
    if (n != 1) ret.emplace_back(n,1);
    return ret;
}
vector<long long> divisor(long long n) {
    vector<long long> ret;
    for(long long i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if(i * i != n) {ret.push_back(n / i);}
        }
    }
    sort(ret.begin(),ret.end());
    return ret;
}
#line 88 "main.cpp"
int main() {
    LL(m);
    ll ok = 0;
    ll ng = 20000;
    if(m == 0) {
        cout << "c" << '\n';
        return 0;
    }
    if(m == 1) {
        cout << "con\n";
        return 0;
    }
    while(ng - ok > 1) {
        ll mid = (ng + ok) / 2;
        if(mid * mid * mid + mid <= m) ok = mid;
        else ng = mid;
    }
    ll rem = m - ok * ok * ok;
    ll yx = rem % ok;
    ll yz = rem / ok;
    debug(ok,yx,yz,rem);
    auto ret = divisor(yx);
    ll x = 0,y = 0,z = 0;
    ll S = 1e18;
    if(yx) {
        for(auto &p1:ret) {
            ll p2 = yx / p1;
            ll p3 = yz - p1;
            if(p3 >= 0 && chmin(S,p1+p2+p3)) {
                x = p1;
                y = p2;
                z = p3;
            } 
        }
    }
    else {
        z = yz;
    }
    string ans;
    ans += 'c';
    rep(i,z) ans += 'o';
    rep(i,ok-1) ans += 'c';
    rep(i,ok) ans += 'o';
    rep(i,ok-x) ans += 'n';
    rep(i,y) ans += 'c';
    if(y) ans += 'o';
    rep(i,x) ans += 'n';
    cout << ans << '\n';

}

yukicoder

結果

テストケース

ソースコード