結果
| 問題 | No.2835 Take and Flip |
| ユーザー |
 ともき
|
| 提出日時 | 2024-08-09 22:17:50 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 41 ms / 2,000 ms |
| コード長 | 10,501 bytes |
| コンパイル時間 | 1,999 ms |
| コンパイル使用メモリ | 193,348 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-08-09 22:17:53 |
| 合計ジャッジ時間 | 3,700 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 22 |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <complex>#include <functional>#include <iomanip>#include <iostream>#include <list>#include <map>#include <numeric>#include <queue>#include <set>#include <sstream>#include <stack>#include <string>#include <utility>#include <valarray>#include <vector>#include <optional>#include <cassert>#include <cctype>#include <cstdio>#include <cstdlib>#include <cstring>#include <chrono>#include <random>#include <thread>#include <unordered_map>#include <unordered_set>using namespace std;#define all(c) c.begin(), c.end()#define rep(i, n) for (int i = 0; i < static_cast<int>(n); i++)#define repv(a, v) for (auto& a : v)#define debug(x) #x << "=" << (x)#ifdef DEBUG#define _dump0() std::cerr << "(L:" << __LINE__ << ")" << std::endl#define _dump1(a1) std::cerr << debug(a1) << " (L:" << __LINE__ << ")" << std::endl#define _dump2(a1, a2) std::cerr << debug(a1) << " " << debug(a2) << " (L:" << __LINE__ << ")" << std::endl#define _dump3(a1, a2, a3) std::cerr << debug(a1) << " " << debug(a2) << " " << debug(a3) << " (L:" << __LINE__ << ")" << std::endl#define _dump4(a1, a2, a3, a4) std::cerr << debug(a1) << " " << debug(a2) << " " << debug(a3) << " " << debug(a4) << " (L:" << __LINE__ << ")" <<std::endl#define _dump5(a1, a2, a3, a4, a5) std::cerr << debug(a1) << " " << debug(a2) << " " << debug(a3) << " " << debug(a4) << " " << debug(a5) << " (L:"<< __LINE__ << ")" << std::endl#define _dump_overload(e5, e4, e3, e2, e1, COUNT, ...) _dump ## COUNT#define dump(...) _dump_overload(__VA_ARGS__ __VA_OPT__(,) 5, 4, 3, 2, 1, 0)(__VA_ARGS__)#else#define dump(...)#endiftemplate <typename T>ostream& operator<<(ostream& os, const vector<T>& v){os << "{";for (auto it = v.begin(); it != v.end(); ++it) {if (it != v.begin())os << ",";os << *it;}return os << "}";}template <typename A, typename B>ostream& operator<<(ostream& os, const pair<A, B>& v){return os << "{" << v.first << ", " << v.second << "}";}template <typename K, typename V>ostream& operator<<(ostream& os, const map<K, V>& v){os << "{";for (auto it = v.begin(); it != v.end(); ++it) {if (it != v.begin())os << ",";os << *it;}return os << "}";}template <typename K, typename V>ostream& operator<<(ostream& os, const set<V>& v){os << "{";for (auto it = v.begin(); it != v.end(); ++it) {if (it != v.begin())os << ",";os << *it;}return os << "}";}template<typename T>T binary_method(std::function<bool(T)> pred, T ok, T fail){static_assert(std::is_integral_v<T> || std::is_floating_point_v<T>);assert(pred(ok) == true);assert(pred(fail) == false);T EPS;if constexpr (std::is_integral_v<T>) EPS = 1;else if (std::is_floating_point_v<T>) EPS = 1e-9;while (abs(ok - fail) > EPS) {T mid = std::midpoint(ok, fail);if (pred(mid)) ok = mid;else fail = mid;}return ok;}template <typename T>vector<T> input_vector(size_t n){vector<T> x(n);for (size_t i = 0; i < n; i++)cin >> x[i];return x;}template<typename T>void chmax(T& a, const T& b) {if (a < b) a = b;}template<typename T>void chmin(T& a, const T& b) {if (a > b) a = b;}template <uint_fast64_t MOD>struct mod_int {mod_int() noexcept: m_value(0){}constexpr mod_int(uint_fast64_t x) noexcept // NOLINT: m_value((x + MOD) % MOD){}constexpr mod_int(long long x) noexcept // NOLINT: m_value((x + MOD) % MOD){}constexpr mod_int(int x) noexcept // NOLINT: m_value((x + MOD) % MOD){}constexpr mod_int operator+(const mod_int rhs) const noexcept{return mod_int(m_value) += rhs;}constexpr mod_int operator-(const mod_int rhs) const noexcept{return mod_int(m_value) -= rhs;}constexpr mod_int operator*(const mod_int rhs) const noexcept{return mod_int(m_value) *= rhs;}constexpr mod_int operator/(const mod_int rhs) const noexcept{return mod_int(m_value) /= rhs;}constexpr mod_int& operator+=(const mod_int rhs) noexcept{m_value += rhs.m_value;if (m_value >= MOD)m_value %= MOD;return *this;}constexpr mod_int operator-=(const mod_int rhs) noexcept{if (m_value < rhs.m_value)m_value += MOD;m_value -= rhs.m_value;return *this;}constexpr mod_int operator*=(const mod_int rhs) noexcept{m_value = m_value * rhs.m_value % MOD;return *this;}constexpr mod_int operator/=(mod_int rhs) noexcept{uint_fast64_t exp = MOD - 2;while (exp > 0) {if (exp % 2 == 1)*this *= rhs;rhs *= rhs;exp /= 2;}return *this;}mod_int inv() const noexcept{return mod_int(1) /= *this;}[[nodiscard]] uint_fast64_t value() const{return m_value;}private:uint_fast64_t m_value;};template <uint_fast64_t MOD>ostream& operator<<(ostream& os, const mod_int<MOD>& v){return os << v.value();}template <uint_fast64_t MOD>istream& operator>>(istream& is, mod_int<MOD>& v){return is >> v.value();}// ---------------------------------------------------------------------------using point = complex<double>;using ll = long long;using vi = vector<int>;using vvi = vector<vector<int>>;using vll = vector<ll>;using vvll = vector<vector<ll>>;constexpr ll MOD = 1000000007;using md = mod_int<MOD>;int my_main([[maybe_unused]] int argc, [[maybe_unused]] char** argv){int n; cin >> n;vll a = input_vector<ll>(n);sort(all(a));ll ret = accumulate(all(a), 0ll);cout << ret << endl;return 0;}// ----------------------------------------------------------------------------// Test driver#ifdef DEBUG#define MAY_RUN_TEST_CASE#endif#ifdef MAY_RUN_TEST_CASE#include <fstream>#if __has_include(<unistd.h>)// Mac, Linux#include <unistd.h>#elif __has_include(<io.h>)// Windows#include <io.h>#pragma warning(disable : 4996)#define dup _dup#define dup2 _dup2#define fileno _fileno#else// Other?#error "unistd.h or io.h not found"#endifbool test_file_exists(const std::string& str){std::ifstream fs(str);return fs.is_open();}void output_with_header(const std::string& filename, const std::string& header) {std::ifstream f(filename);// Clear is needed if the file is empty.std::cout << "----- " << header << " -----" << std::endl;std::cout << f.rdbuf() << std::endl;std::cout.clear();std::cout << "-----------------" << std::endl;}#ifdef _WIN32__declspec(dllexport)#endifint execute_main_with_dummy_stdio(const std::string& stdin_file_name, const std::string& expected_file_name, const std::string& stdout_file_name,const std::string& stderr_file_name){if (!test_file_exists(stdin_file_name)) {std::cerr << stdin_file_name << " not found" << std::endl;return 3;}if (!test_file_exists(expected_file_name)) {std::cerr << expected_file_name << " not found" << std::endl;return 3;}int original_stdin = dup(fileno(stdin));int original_stdout = dup(fileno(stdout));int original_stderr = dup(fileno(stderr));freopen(stdin_file_name.c_str(), "r", stdin);freopen(stdout_file_name.c_str(), "w", stdout);freopen(stderr_file_name.c_str(), "w", stderr);// FIXME:int argc = 1;char argv[][10] = { "main" };int ret = my_main(argc, (char**) argv);fflush(stdout);fflush(stderr);dup2(original_stderr, fileno(stderr));dup2(original_stdout, fileno(stdout));dup2(original_stdin, fileno(stdin));if (ret != 0) { // NOLINTstd::cerr << "main returns " << ret << std::endl;return ret;}std::ifstream inp(stdin_file_name);std::ifstream out(stdout_file_name);std::ifstream err(stderr_file_name);std::ifstream exp(expected_file_name);std::string output_str, expected_str;{std::stringstream output_ss;output_ss << out.rdbuf();output_str = output_ss.str();std::stringstream expected_ss;expected_ss << exp.rdbuf();expected_str = expected_ss.str();}// Most of contest sites removes the tailing spaces.const bool IGNORE_TRAILING_SPACE = true;if (IGNORE_TRAILING_SPACE) {output_str.erase(output_str.find_last_not_of(" \n\r\t") + 1);expected_str.erase(expected_str.find_last_not_of(" \n\r\t") + 1);}{std::stringstream output_ss(output_str);std::stringstream expected_ss(expected_str);std::string output_line, expected_line;while (std::getline(output_ss, output_line) && std::getline(expected_ss, expected_line)) {// Remove trailing spacesif (IGNORE_TRAILING_SPACE) {output_line.erase(output_line.find_last_not_of(" \n\r\t") + 1);expected_line.erase(expected_line.find_last_not_of(" \n\r\t") + 1);}if (output_line != expected_line)return 1;}// Check if both endsif (!output_ss.eof() || !expected_ss.eof())return 1;}return 0;}#endifint main(int argc, char** argv){ios::sync_with_stdio(false);cin.tie(nullptr);#ifndef MAY_RUN_TEST_CASEreturn my_main(argc, argv);#elseif (argc == 1) {return my_main(argc, argv);} else if (argc == 2) {char* stdin_file = argv[1];freopen(stdin_file, "r", stdin);return my_main(argc, argv);} else if (argc == 5) {std::string stdin_file = argv[1];std::string expected_file = argv[2];std::string stdout_file = argv[3];std::string stderr_file = argv[4];const auto ret = execute_main_with_dummy_stdio(stdin_file, expected_file, stdout_file, stderr_file);output_with_header(stdin_file, "input");output_with_header(stdout_file, "output");output_with_header(expected_file, "expected");output_with_header(stderr_file, "stderr");return ret;}return 1;#endif}