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

• 問題: No.451 575
• ユーザー: xuzijian629
• 提出日時: 2018-11-06 12:08:26
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 115 ms / 2,000 ms
• コード長: 2,784 bytes
• コンパイル時間: 1,298 ms
• コンパイル使用メモリ: 201,380 KB
• 実行使用メモリ: 8,160 KB
• 最終ジャッジ日時: 2026-06-07 03:02:13
• 合計ジャッジ時間: 5,960 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_0

ファイルパターン	結果
sample	AC * 4
other	AC * 29

コンパイルメッセージ

In file included from main.cpp:20:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ccomplex:51:4: warning: #warning "<ccomplex> is deprecated in C++17, use <complex> instead" [-Wcpp]
   51 | #  warning "<ccomplex> is deprecated in C++17, use <complex> instead"
      |    ^~~~~~~
In file included from main.cpp:23:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/cstdbool:50:6: warning: #warning "<cstdbool> is deprecated in C++17, remove the #include" [-Wcpp]
   50 | #    warning "<cstdbool> is deprecated in C++17, remove the #include"
      |      ^~~~~~~
In file included from main.cpp:25:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ctgmath:50:6: warning: #warning "<ctgmath> is deprecated in C++17, use <complex> or <cmath> instead" [-Wcpp]
   50 | #    warning "<ctgmath> is deprecated in C++17, use <complex> or <cmath> instead"
      |      ^~~~~~~

ソースコード

#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
using i128 = __int128_t;

i128 get() {
    i64 a;
    cin >> a;
    return a;
}

void put(i128 a) {
    i64 b = i64(a);
    cout << b << endl;
}

int main() {
    int n;
    cin >> n;
    vector<i128> as;
    for (int i = 0; i < n; i++) {
        i128 a = get();
        as.push_back(a);
    }
    
    vector<i128> tmp;
    tmp.push_back(0);
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            tmp.push_back(as[i] - tmp.back());
        } else {
            tmp.push_back(tmp.back() - as[i]);
        }
    }
    
    i128 mi = 1e30, t;
    for (int i = 0; i < n + 1; i++) {
        if (tmp[i] < mi) {
            mi = tmp[i];
            t = i % 4;
        }
    }
    
    i128 d = -mi + 1;
    for (int i = 0; i < n + 1; i++) {
        if (i % 4 == 0 || i % 4 == 3) {
            tmp[i] += d;
        } else {
            tmp[i] -= d;
        }
    }
    
    for (int i = 0; i < n + 1; i++) {
        if (tmp[i] <= 0 || tmp[i] > i128(1e9) * i128(1e9)) {
            cout << -1 << endl;
            return 0;
        }
    }
    
    cout << n + 1 << endl;
    for (int i = 0; i < n + 1; i++) {
        put(tmp[i]);
    }
}