結果

問題 No.2929 Miracle Branch
コンテスト
ユーザー AngrySadEight
提出日時 2024-10-12 16:03:28
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 301 ms / 2,000 ms
コード長 5,085 bytes
コンパイル時間 19,268 ms
コンパイル使用メモリ 263,932 KB
最終ジャッジ日時 2025-02-24 18:22:25
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll X;
    cin >> X;

    if (X == 1) {
        cout << 2 << endl;
        cout << 1 << " " << 2 << endl;
        cout << "b g" << endl;
        return 0;
    }
    vector<ll> divs(200002);
    ll len = 0;

    ll now_x = X;
    for (ll i = 2; i <= 200000; i++) {
        while (now_x % i == 0) {
            now_x /= i;
            divs[i]++;
        }
    }
    if (now_x != 1) {
        cout << -1 << endl;
        return 0;
    }
    ll all_b = 0;
    ll all_g = 0;
    for (ll i = 2; i <= 200000; i++) {
        if (divs[i] > 0) {
            if (i == 2) {
                ll div = divs[i] / 2;
                ll rem = divs[i] % 2;
                all_b += div;
                all_b += rem;
                all_g += (div * 4 + rem * 2);
            } else {
                all_b += divs[i];
                all_g += divs[i] * i;
            }
        }
    }
    debug_out(all_b, all_g);
    if (all_b + all_g > 200000) {
        cout << -1 << endl;
        return 0;
    }
    vector<pll> ans(0);
    vector<char> c(all_b + all_g, 'g');
    for (ll i = 0; i < all_b; i++) {
        c[i] = 'b';
    }
    for (ll i = 0; i < all_b - 1; i++) {
        ans.push_back(pll(i + 1, i + 2));
    }
    ll now_b = 1;
    ll now_g = all_b + 1;
    for (ll i = 2; i <= 200000; i++) {
        if (divs[i] > 0) {
            if (i == 2) {
                ll div = divs[i] / 2;
                ll rem = divs[i] % 2;
                for (ll j = 0; j < div; j++) {
                    for (ll k = 0; k < 4; k++) {
                        ans.push_back(pll(now_b, now_g));
                        now_g++;
                    }
                    now_b++;
                }
                for (ll j = 0; j < rem; j++) {
                    for (ll k = 0; k < 2; k++) {
                        ans.push_back(pll(now_b, now_g));
                        now_g++;
                    }
                    now_b++;
                }
            } else {
                for (ll j = 0; j < divs[i]; j++) {
                    for (ll k = 0; k < i; k++) {
                        ans.push_back(pll(now_b, now_g));
                        now_g++;
                    }
                    now_b++;
                }
            }
        }
    }
    cout << all_b + all_g << endl;
    for (ll i = 0; i < all_b + all_g - 1; i++) {
        cout << ans[i].first << " " << ans[i].second << endl;
    }
    for (ll i = 0; i < all_b + all_g; i++) {
        cout << c[i] << " ";
    }
    cout << endl;
}
0