結果
問題 | No.2519 Coins in Array |
ユーザー |
|
提出日時 | 2023-10-27 22:13:58 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 105 ms / 2,000 ms |
コード長 | 5,551 bytes |
コンパイル時間 | 2,385 ms |
コンパイル使用メモリ | 200,740 KB |
最終ジャッジ日時 | 2025-02-17 15:10:15 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 37 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define per(i, n) for (int i = (n)-1; i >= 0; i--)#define rep2(i, l, r) for (int i = (l); i < (r); i++)#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)#define each(e, v) for (auto &e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;template <typename T>using maxheap = priority_queue<T>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}int pct(int x) { return __builtin_popcount(x); }int pct(ll x) { return __builtin_popcountll(x); }int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename T>void reorder(vector<T> &a, const vector<int> &ord) {int n = a.size();vector<T> b(n);for (int i = 0; i < n; i++) b[i] = a[ord[i]];swap(a, b);}template <typename T>T floor(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? x / y : (x - y + 1) / y);}template <typename T>T ceil(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? (x + y - 1) / y : x / y);}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);cerr << fixed << setprecision(15);}} io_setup;constexpr int inf = (1 << 30) - 1;constexpr ll INF = (1LL << 60) - 1;// constexpr int MOD = 1000000007;constexpr int MOD = 998244353;void solve() {int N;cin >> N;vector<int> a(N);rep(i, N) {cin >> a[i];// if (a[i] == 1) {// cout << 0 << '\n';// return;// }}auto get = [&](ll x, ll y) {ll g = gcd(x, y);if (g >= 2) return 0LL;if (x == 0 || y == 0) return 0LL;return (x - 1) * (y - 1);};auto ans = [&](int i, int j) { cout << i + 1 MM j + 1 << '\n'; };if (N >= 4) {vector<int> odd, even;rep(i, N) {(a[i] & 1 ? odd : even).eb(i); //}cout << 0 << '\n';if (sz(even) >= 2) {ans(even[0], even[1]);rep(i, N - 2) ans(N - 3 - i, N - 2 - i);} else if (sz(odd) >= 4) {ans(odd[2], odd[3]);ans(odd[0], odd[1]);rep(i, N - 3) ans(N - 4 - i, N - 3 - i);} else {assert(sz(odd) == 3 && sz(even) == 1);ans(odd[1], odd[2]);int p = even[0];rep2(i, 1, 3) {if (odd[i] < even[0]) p--;}ans(p, N - 2);ans(0, 1);}return;}if (N == 2) {cout << get(a[0], a[1]) << '\n';ans(0, 1);return;}if (N == 3) {ll mi = INF;int id = -1;rep(i, N) {int j = (i + 1) % 3, k = (i + 2) % 3;ll x = get(a[j], a[k]);ll y = get(a[i], x);if (chmin(mi, y)) id = i;}cout << mi << '\n';int i = id;int j = (i + 1) % 3, k = (i + 2) % 3;ans(j, k);ans(0, 1);return;}}int main() {int T = 1;// cin >> T;while (T--) solve();}