#1017813 (C++23) No.2929 Miracle Branch

提出ソース

結果

問題	No.2929 Miracle Branch
ユーザー	ponjuice
提出日時	2024-10-12 15:30:00
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	290 ms / 2,000 ms
コード長	6,306 bytes
コンパイル時間	6,059 ms
コンパイル使用メモリ	318,872 KB
実行使用メモリ	6,824 KB
最終ジャッジ日時	2024-10-12 15:30:18
合計ジャッジ時間	15,621 ms
ジャッジサーバーID （参考情報）	judge2 / judge

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	12 ms 6,820 KB
testcase_02	AC	12 ms 6,816 KB
testcase_03	AC	12 ms 6,816 KB
testcase_04	AC	11 ms 6,816 KB
testcase_05	AC	12 ms 6,820 KB
testcase_06	AC	12 ms 6,816 KB
testcase_07	AC	12 ms 6,820 KB
testcase_08	AC	12 ms 6,816 KB
testcase_09	AC	12 ms 6,816 KB
testcase_10	AC	12 ms 6,820 KB
testcase_11	AC	12 ms 6,816 KB
testcase_12	AC	12 ms 6,816 KB
testcase_13	AC	12 ms 6,816 KB
testcase_14	AC	12 ms 6,816 KB
testcase_15	AC	13 ms 6,820 KB
testcase_16	AC	11 ms 6,816 KB
testcase_17	AC	13 ms 6,816 KB
testcase_18	AC	14 ms 6,820 KB
testcase_19	AC	15 ms 6,816 KB
testcase_20	AC	17 ms 6,816 KB
testcase_21	AC	24 ms 6,820 KB
testcase_22	AC	12 ms 6,816 KB
testcase_23	AC	32 ms 6,816 KB
testcase_24	AC	85 ms 6,816 KB
testcase_25	AC	20 ms 6,816 KB
testcase_26	AC	13 ms 6,820 KB
testcase_27	AC	15 ms 6,816 KB
testcase_28	AC	12 ms 6,816 KB
testcase_29	AC	13 ms 6,816 KB
testcase_30	AC	12 ms 6,816 KB
testcase_31	AC	11 ms 6,820 KB
testcase_32	AC	13 ms 6,816 KB
testcase_33	AC	265 ms 6,816 KB
testcase_34	AC	286 ms 6,824 KB
testcase_35	AC	271 ms 6,820 KB
testcase_36	AC	268 ms 6,816 KB
testcase_37	AC	287 ms 6,816 KB
testcase_38	AC	257 ms 6,820 KB
testcase_39	AC	271 ms 6,820 KB
testcase_40	AC	266 ms 6,820 KB
testcase_41	AC	260 ms 6,816 KB
testcase_42	AC	290 ms 6,820 KB
testcase_43	AC	256 ms 6,816 KB
testcase_44	AC	266 ms 6,820 KB
testcase_45	AC	262 ms 6,820 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

//高速化 
struct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;
//#define endl '\n' //インタラクティブ問題の時は消す

//型
using ll = long long;
using ld = long double;
using mint = modint998244353;//1000000007;
template<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;
using vi = vc<int>;  using vvi = vvc<int>;  using vvvi = vvvc<int>;
using vl = vc<ll>;   using vvl = vvc<ll>;   using vvvl = vvvc<ll>;
using pi = pair<int, int>;  using pl = pair<ll, ll>;
using ull = unsigned ll;
template<class T>using priq = priority_queue<T>;
template<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;

// for文
#define overload4(a, b, c, d, e, ...) e
#define rep1(n)             for(ll i = 0; i < n; i++)
#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, step) for(ll i = a; i < b; i+= step)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define per1(n)             for(ll i = n-1; i >= 0; i--)
#define per2(i, n)          for(ll i = n-1; i >= 0; i--)
#define per3(i, a, b)       for(ll i = b-1; i >= a; i--)
#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)
#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)
#define fore1(a)       for(auto&& i : a)	
#define fore2(i,a)     for(auto&& i : a)
#define fore3(x,y,a)   for(auto&& [x, y] : a)
#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)
#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)

//関数
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define si(x) (ll)(x).size()
template<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}
template<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}
template<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}
template<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}
template<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}
template<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}
template<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}

//入出力(operator)
template<int T>istream&operator>>(istream&is,static_modint<T>&a){ll v;is>>v;a=v;return is;}
istream&operator>>(istream&is,modint&a){ll v;cin>>v;a=v;return is;}
template<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}
template<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}

template<int T>ostream&operator<<(ostream&os,static_modint<T>a){return os<<a.val();}
ostream&operator<<(ostream&os,modint a){return os<<a.val();}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<" "<<a.b;}
template<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<" "<<y<<"\n";}return os;}
template<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<" "<<y<<"\n";}return os;}
template<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<" ";return os;}
template<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<"\n";return os;}

//入出力(関数)
vi readvi(ll n){vi a(n);cin>>a;return a;}
vl readvl(ll n){vl a(n);cin>>a;return a;}
vvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].emplace_back(b);if(bidirected)g[b].emplace_back(a);}return g;}
vvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].emplace_back(b,c);if(bidirected)g[b].emplace_back(a,c);}return g;}
vvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}
vvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}

inline void yes(){cout << "Yes\n";}
inline void no(){cout << "No\n";}
inline void yesno(bool y = true){if(y)yes();else no();}
inline void print(){cout<<endl;}
template<class T>inline void print(T a){cout<<a<<endl;}
template<class T,class... Ts>inline void print(T a,Ts ...b){cout<<a;(cout<<...<<(cout<<' ',b));cout<<endl;}

//定数
constexpr ll mod = 998244353;
constexpr ll minf=-(1<<29);
constexpr ll inf=(1<<29);
constexpr ll MINF=-(1LL<<60);
constexpr ll INF=(1LL<<60);
constexpr ld EPS = 1e-8;
const ld PI = acosl(-1);
#define equals(a, b) (abs((a) - (b)) < EPS)
const int dx[4] ={-1, 0, 1, 0};
const int dy[4] ={ 0, 1, 0,-1};
const int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};
const int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};

void solve();
int main() {
	int t = 1;
    // cin >>t;
    while(t--)solve();
}

void solve(){
    ll n;
    cin >> n;
    if(n == 1){
        print("2");
        print("1 2");
        print("g b");
        return;
    }

    vc<array<ll,2>> p;
    for(ll i = 2; i < 1000000; i++){
        ll cnt = 0;
        while(n % i == 0){
            n /= i;
            cnt++;
        }
        if(cnt) p.push_back({i,cnt});
    }
    if(n != 1){
        print(-1);
        return;
    }

    reverse(all(p));
    if(p.back()[0] == 2){
        ll cnt = p.back()[1];
        p.pop_back();
        if(cnt & 1) p.push_back({2,1});
        p.push_back({4, cnt/2});
    }

    n = 0;
    ll m = 0;
    rep(i, p.size()){
        n += p[i][1] * (p[i][0] + 1);
        m += p[i][1];
    }
    if(n > 2 * 100'000) {
        print(-1);
    }

    cout << n << endl;
    rep(i, m - 1){
        cout << i + 1 << " " << i + 2 << endl;
    }
    ll nw = 1;
    ll ind = m + 1;
    rep(i, p.size()){
        rep(j, p[i][1]){
            rep(k, p[i][0]){
                cout << nw << " " << ind << endl;
                ind++;
            }
            nw++;
        }
    }
    rep(i,n){
        if(i < m) cout << 'b' << " ";
        else cout << 'g' << " ";
    }
    cout << endl;
}

yukicoder

結果

テストケース

ソースコード