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

• 問題: No.2929 Miracle Branch
• ユーザー: Magentor
• 提出日時: 2024-10-12 15:50:10
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 292 ms / 2,000 ms
• コード長: 3,580 bytes
• コンパイル時間: 5,807 ms
• コンパイル使用メモリ: 318,408 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-10-12 15:50:52
• 合計ジャッジ時間: 15,813 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,820 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	3 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	2 ms; 5,248 KB
testcase_17	AC	2 ms; 5,248 KB
testcase_18	AC	4 ms; 5,248 KB
testcase_19	AC	5 ms; 5,248 KB
testcase_20	AC	7 ms; 5,248 KB
testcase_21	AC	13 ms; 5,248 KB
testcase_22	AC	2 ms; 5,248 KB
testcase_23	AC	24 ms; 5,248 KB
testcase_24	AC	84 ms; 5,248 KB
testcase_25	AC	11 ms; 5,248 KB
testcase_26	AC	2 ms; 5,248 KB
testcase_27	AC	3 ms; 5,248 KB
testcase_28	AC	5 ms; 5,248 KB
testcase_29	AC	6 ms; 5,248 KB
testcase_30	AC	5 ms; 5,248 KB
testcase_31	AC	5 ms; 5,248 KB
testcase_32	AC	5 ms; 5,248 KB
testcase_33	AC	4 ms; 5,248 KB
testcase_34	AC	280 ms; 5,248 KB
testcase_35	AC	282 ms; 5,248 KB
testcase_36	AC	3 ms; 5,248 KB
testcase_37	AC	291 ms; 5,248 KB
testcase_38	AC	276 ms; 6,816 KB
testcase_39	AC	280 ms; 6,816 KB
testcase_40	AC	292 ms; 5,248 KB
testcase_41	AC	286 ms; 5,248 KB
testcase_42	AC	279 ms; 5,248 KB
testcase_43	AC	271 ms; 5,248 KB
testcase_44	AC	270 ms; 5,248 KB
testcase_45	AC	2 ms; 5,248 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, m ,n) for (int i = (m); i < (long long)(n); i++)
#define REP(i, n) for (long long i = 1; i < (long long)(n); i++)
typedef long long ll;
#define updiv(N,X) (N + X - 1) / X
#define l(n) n.begin(),n.end()
#define YesNo(Q) Q==1?cout<<"Yes":cout<<"No"
using P = pair<int, int>;
using mint = modint;
const int MOD = 998244353LL;
const ll INF = 999999999999LL;
vector<long long> fact, fact_inv, inv;
/*  init_nCk :二項係数のための前処理
    計算量:O(n)
*/
template <typename T>
void input(vector<T> &v){
 rep(i,v.size()){cin>>v[i];}
  return;
}
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
    }
}
/*  nCk :MODでの二項係数を求める(前処理 int_nCk が必要)
    計算量:O(1)
*/
long long nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

ll POW(ll a,ll n){
  long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a;
        a = a * a;
        n >>= 1;
    }
    return res;
}
pair<vector<pair<long long, long long> >,bool> pf(long long N) {
    vector<pair<long long, long long> > res;
    for (long long a = 2; a * a <= min(N,300000LL*300000LL); ++a) {
        if (N % a != 0) continue;
        long long ex = 0; // 指数

        // 割れる限り割り続ける
        while (N % a == 0) {
            ++ex;
            N /= a;
        }

        // その結果を push
        res.push_back({a, ex});
    }
     
    // 最後に残った数について
    if (N != 1) res.push_back({N, 1});
    bool dff = (bool)(N==1);
    return pair(res,dff);
}
int main() {
ll x;cin>>x;



	if(x==1){
		cout << 2 << endl;
		cout << 1 << " "<<2<< endl;
		cout << "b g" << endl;
	}
	else{
		auto u = pf(x).first;
		//if(!pf(x).second){cout<<-1<<endl;return 0;}
		ll ret = 0;
		ll cnt = 0;
		rep(i,u.size()){
		if(u[i].first==2){
			cnt += updiv(u[i].second,2);
			ret += u[i].first*u[i].second;
		}
		else{ret += u[i].first*u[i].second;cnt += u[i].second;}
		}
		ret += cnt;
		//cout<<ret<<endl;
		if(200000<ret){cout<<-1<<endl;}
		else{
			cout << ret << endl;
			vector<char> ans;
			rep(i,cnt){ans.push_back('b');}
			rep(i,ret-cnt){ans.push_back('g');}
			vector<ll> bf;
			rep(i,u.size()){
				if(u[i].first==2){
					rep(j,u[i].second/2){
						bf.push_back(4);
					}
					if(u[i].second%2==1){bf.push_back(2);}
				}
				else{
				rep(j,u[i].second){
					bf.push_back(u[i].first);
				}}
			}
			ll uts = cnt;
			rep(i,bf.size()){
			rep(j,bf[i]){
				cout << i+1 << " " << cnt+1 << endl;
				cnt++;
			}	
			}
			rep(i,bf.size()-1){
				cout << i+1 << " " << i+2 << endl;
			}
			rep(i,ans.size()){cout<<ans[i]<<" ";}
			
		}
	}

}