#353167 (C++17) No.451 575

• 問題: No.451 575
• ユーザー: penguinshunya
• 提出日時: 2019-06-21 01:56:04
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 28 ms / 2,000 ms
• コード長: 2,510 bytes
• コンパイル時間: 2,191 ms
• コンパイル使用メモリ: 203,656 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-02 10:44:04
• 合計ジャッジ時間: 5,696 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	4 ms; 5,376 KB
testcase_07	AC	19 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	3 ms; 5,376 KB
testcase_10	AC	9 ms; 5,376 KB
testcase_11	AC	22 ms; 5,376 KB
testcase_12	AC	28 ms; 5,376 KB
testcase_13	AC	27 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	5 ms; 5,376 KB
testcase_17	AC	20 ms; 5,376 KB
testcase_18	AC	19 ms; 5,376 KB
testcase_19	AC	13 ms; 5,376 KB
testcase_20	AC	3 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	28 ms; 5,376 KB
testcase_24	AC	13 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	4 ms; 5,376 KB
testcase_30	AC	19 ms; 5,376 KB
testcase_31	AC	2 ms; 5,376 KB
testcase_32	AC	6 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }

void solve() {
  int N; cin >> N;
  vi64 b(N); cin >> b;
  vi64 a(N + 1);
  auto print = [&]() {
    cout << N + 1 << '\n';
    rep(i, N + 1) cout << a[i] << '\n';
    exit(0);
  };
  {
    a[0] = 1;
    rep(j, N) {
      if (j % 2 == 0) a[j + 1] = b[j] - a[j];
      else a[j + 1] = a[j] - b[j];
    }
  }
  i64 d = *min_element(all(a));
  if (d > 0) print();
  {
    a[0] = 2 - d;
    rep(j, N) {
      if (j % 2 == 0) a[j + 1] = b[j] - a[j];
      else a[j + 1] = a[j] - b[j];
    }
  }
  if (*min_element(all(a)) <= 0) {
    cout << -1 << '\n';
    return;
  }
  print();
}