結果

問題 No.2519 Coins in Array
ユーザー MMRZMMRZ
提出日時 2023-10-27 22:49:52
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,558 bytes
コンパイル時間 3,304 ms
コンパイル使用メモリ 263,448 KB
実行使用メモリ 43,064 KB
最終ジャッジ日時 2023-10-27 22:50:15
合計ジャッジ時間 18,743 ms
ジャッジサーバーID
（参考情報） 		judge10 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
7,912 KB
testcase_01 AC 5 ms
7,912 KB
testcase_02 AC 5 ms
7,912 KB
testcase_03 AC 6 ms
7,912 KB
testcase_04 WA -
testcase_05 AC 5 ms
7,912 KB
testcase_06 AC 5 ms
7,912 KB
testcase_07 AC 5 ms
7,912 KB
testcase_08 AC 5 ms
7,912 KB
testcase_09 AC 5 ms
7,912 KB
testcase_10 AC 5 ms
7,912 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 4 ms
7,912 KB
testcase_15 AC 4 ms
7,912 KB
testcase_16 WA -
testcase_17 AC 5 ms
7,912 KB
testcase_18 AC 5 ms
7,912 KB
testcase_19 AC 5 ms
7,912 KB
testcase_20 AC 5 ms
7,912 KB
testcase_21 AC 5 ms
7,912 KB
testcase_22 AC 5 ms
7,912 KB
testcase_23 AC 1,343 ms
43,064 KB
testcase_24 AC 909 ms
12,084 KB
testcase_25 AC 5 ms
7,912 KB
testcase_26 AC 5 ms
7,912 KB
testcase_27 AC 1,326 ms
26,152 KB
testcase_28 AC 1,292 ms
26,124 KB
testcase_29 AC 1,299 ms
26,248 KB
testcase_30 AC 985 ms
23,528 KB
testcase_31 AC 169 ms
11,608 KB
testcase_32 AC 517 ms
17,184 KB
testcase_33 AC 744 ms
20,492 KB
testcase_34 AC 357 ms
14,784 KB
testcase_35 AC 681 ms
19,716 KB
testcase_36 AC 283 ms
13,528 KB
testcase_37 AC 128 ms
10,816 KB
testcase_38 AC 562 ms
17,872 KB
testcase_39 AC 326 ms
14,280 KB
testcase_40 AC 275 ms
11,404 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
template<class T> bool is_sqare(T a) { if(floor(sqrt(a)) * floor(sqrt(a)) == a){ return true; }return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(all((wpwpw)));(wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((int)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
#ifdef LOCAL
#  include "_debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

struct INIT{
    INIT(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(0);
        cout << fixed << setprecision(20);
    }
}INIT;

void solve(){
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n)cin >> a[i];
    
    vector<vector<int>> div(200000 + 1);
    rep(i, n){
        int sq = sqrt(a[i]);
        reps(j, sq){
            if(a[i] % j)continue;
            div[j].push_back(i);
            if(a[i] / j != j)div[a[i] / j].push_back(i);
        }
    }

    reps(i, 200000){
        if(i == 1)continue;
        if(len(div[i]) >= 2){
            cout << 0 << endl;
            int l = div[i][0], r = div[i][1];
            cout << l + 1 << " " << r + 1 << endl;
            rep(j, n - 2){
                cout << "1 " << n - 1 - j << endl;
            }
            return;
        }
    }
    ll minl_ = hinf<ll>();
    rep(i, n)chmin(minl_, a[i]);

    if(minl_ == 2){
        if(n >= 3){
            cout << 0 << endl;
            int idx = -1;
            rep(i, n)if(a[i] == 2)idx = i;
            int l = (idx + 1) % n, r = (idx + 2) % n;
            cout << l + 1 << " " << r + 1 << endl;
            vector<ll> a2;
            rep(i, n){
                if(i == l)continue;
                if(i == r)continue;
                a2.push_back(a[i]);
            }
            int idx2 = 0;
            while(a2[idx2] != 2)idx2++;
            cout << idx2 + 1 << " " << n - 1 << endl;
            rep(j, n - 3){
                cout << "1 " << n - 2 - j << endl;
            }
            return;
        }
    }else{
        if(n >= 4){
            cout << 0 << endl;
            cout << "1 2" << endl;
            cout << "1 2" << endl;
            rep(j, n - 3){
                cout << "1 " << n - 2 - j << endl;
            }
            return;
        }
    }
    vector<pair<int, int>> ans(n - 1);
    rep(i, n - 1){
        ll minl = hinf<ll>();
        ll mini = -1;
        rep(j, len(a)){
            if(chmin(minl, a[j]))mini = j;
        }
        ll minl2 = hinf<ll>();
        ll mini2 = -1;
        rep(j, len(a)){
            if(j == mini)continue;
            if(chmin(minl2, a[j]))mini2 = j;
        }
        ans[i] = {mini, mini2};
        vector<ll> a2;
        rep(j, len(a)){
            if(j == mini)continue;
            if(j == mini2)continue;
            a2.push_back(a[j]);
        }
        a2.push_back((minl - 1) * (minl2 - 1));
        a = a2;
    }
    cout << a[0] << endl;
    rep(i, n - 1){
        cout << ans[i].first + 1 << " " << ans[i].second + 1 << endl;
    }
}

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