結果
問題 | No.451 575 |
ユーザー |
![]() |
提出日時 | 2019-06-21 01:56:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 29 ms / 2,000 ms |
コード長 | 2,510 bytes |
コンパイル時間 | 1,811 ms |
コンパイル使用メモリ | 197,548 KB |
最終ジャッジ日時 | 2025-01-07 05:05:12 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 29 |
ソースコード
#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();}