結果
| 問題 | No.2519 Coins in Array |
| ユーザー |
 stoq
|
| 提出日時 | 2023-10-27 22:35:14 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 6,519 bytes |
| コンパイル時間 | 4,752 ms |
| コンパイル使用メモリ | 273,852 KB |
| 実行使用メモリ | 11,008 KB |
| 最終ジャッジ日時 | 2024-09-25 14:38:16 |
| 合計ジャッジ時間 | 13,798 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 17 ms
9,088 KB |
| testcase_01 | AC | 17 ms
9,088 KB |
| testcase_02 | RE | - |
| testcase_03 | AC | 18 ms
9,088 KB |
| testcase_04 | AC | 17 ms
9,088 KB |
| testcase_05 | AC | 17 ms
9,088 KB |
| testcase_06 | AC | 18 ms
9,088 KB |
| testcase_07 | AC | 18 ms
9,216 KB |
| testcase_08 | AC | 17 ms
9,088 KB |
| testcase_09 | AC | 17 ms
9,088 KB |
| testcase_10 | AC | 18 ms
9,216 KB |
| testcase_11 | AC | 17 ms
9,088 KB |
| testcase_12 | AC | 17 ms
9,088 KB |
| testcase_13 | AC | 17 ms
9,216 KB |
| testcase_14 | AC | 17 ms
9,216 KB |
| testcase_15 | RE | - |
| testcase_16 | AC | 19 ms
9,088 KB |
| testcase_17 | AC | 17 ms
9,216 KB |
| testcase_18 | AC | 17 ms
9,088 KB |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | AC | 18 ms
9,216 KB |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | AC | 39 ms
9,856 KB |
| testcase_33 | AC | 52 ms
10,368 KB |
| testcase_34 | RE | - |
| testcase_35 | AC | 48 ms
10,240 KB |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | AC | 40 ms
9,984 KB |
| testcase_39 | AC | 31 ms
9,600 KB |
| testcase_40 | RE | - |
ソースコード
#define MOD_TYPE 2
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
// #include <atcoder/lazysegtree>
// #include <atcoder/modint>
// #include <atcoder/segtree>
using namespace atcoder;
#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#pragma region Macros
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif
using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr ld EPS = 1e-10;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define RREP(i, m, n) for (ll i = n - 1; i >= m; i--)
#define rrep(i, n) RREP(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
struct io_init {
io_init() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20) << setiosflags(ios::fixed);
};
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline ll floor(ll a, ll b) {
if (b < 0) a *= -1, b *= -1;
if (a >= 0) return a / b;
return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
vector<T> val = v;
sort(all(val)), val.erase(unique(all(val)), val.end());
for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
is >> p.first >> p.second;
return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
os << p.first << " " << p.second;
return os;
}
ostream &operator<<(ostream &os, mint m) {
os << m.val();
return os;
}
ostream &operator<<(ostream &os, modint m) {
os << m.val();
return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
for (int i = 0; i < v.size(); i++) is >> v[i];
return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
for (int i = 0; i < v.size(); i++)
os << v[i] << (i + 1 == v.size() ? "" : " ");
return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
for (int i = 0; i < v.size(); i++) v[i]--;
}
random_device seed_gen;
mt19937_64 engine(seed_gen());
inline ll randInt(ll l, ll r) { return engine() % (r - l + 1) + l; }
struct BiCoef {
vector<mint> fact_, inv_, finv_;
BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
mint C(ll n, ll k) const noexcept {
if (n < k || n < 0 || k < 0) return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
mint Ch1(ll n, ll k) const noexcept {
if (n < 0 || k < 0) return 0;
mint res = 0;
for (int i = 0; i < n; i++)
res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
return res;
}
mint fact(ll n) const noexcept {
if (n < 0) return 0;
return fact_[n];
}
mint inv(ll n) const noexcept {
if (n < 0) return 0;
return inv_[n];
}
mint finv(ll n) const noexcept {
if (n < 0) return 0;
return finv_[n];
}
};
BiCoef bc(500010);
#pragma endregion
// -------------------------------
ll f(ll a, ll b) {
if (a == 1 or b == 1) return 0;
if (a == 0 or b == 0) return 0;
if (gcd(a, b) != 1) return 0;
return (a - 1) * (b - 1);
}
pair<ll, pii> p3(vector<ll> a) {
ll Min = LINF;
pii first;
if (chmin(Min, f(f(a[0], a[1]), a[2]))) first = {0, 1};
if (chmin(Min, f(f(a[0], a[2]), a[1]))) first = {0, 2};
if (chmin(Min, f(f(a[1], a[2]), a[0]))) first = {1, 2};
return {Min, first};
}
void solve() {
int n;
cin >> n;
vector<ll> a(n);
cin >> a;
for (int x = 1; x >= 0; x--) {
auto itr = find(all(a), x);
if (itr != a.end()) {
cout << 0 << "\n";
int k = itr - a.begin();
if (k == 0)
cout << k + 1 << " " << 2 << "\n";
else
cout << k + 1 << " " << 1 << "\n";
rep(i, n - 2) { cout << 1 << " " << n - i - 1 << "\n"; }
return;
}
}
if (n >= 4) {
assert(0);
cout << 0 << "\n";
cout << 1 << " " << 2 << "\n";
cout << 1 << " " << 2 << "\n";
cout << n - 2 << " " << n - 1 << "\n";
rep(i, n - 4) { cout << 1 << " " << n - 3 - i << "\n"; }
} else if (n == 2) {
cout << f(a[0], a[1]) << "\n";
cout << 1 << " " << 2 << "\n";
} else {
auto [Min, first] = p3(a);
auto [x, y] = first;
cout << Min << "\n";
cout << x + 1 << " " << y + 1 << "\n";
cout << 1 << " " << 2 << "\n";
}
}
int main() { solve(); }