結果

問題 No.851 テストケース
ユーザー bayashi-cl
提出日時 2022-02-02 05:19:50
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 9,911 bytes
コンパイル時間 1,300 ms
コンパイル使用メモリ 111,620 KB
最終ジャッジ日時 2025-01-27 18:22:18
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
/home/bayashi/dev/byslib/core/stdlib.hpp:36:20: error: ‘int8_t’ in namespace ‘std’ does not name a type; did you mean ‘wint_t’?
/home/bayashi/dev/byslib/core/scanner.hpp:60:35: error: ‘function’ in namespace ‘std’ does not name a template type
/home/bayashi/dev/byslib/core/scanner.hpp:4:1: note: ‘std::function’ is defined in header ‘<functional>’; did you forget to ‘#include <functional>’?
/home/bayashi/dev/byslib/core/scanner.hpp:60:43: error: expected ‘>’ before ‘<’ token
/home/bayashi/dev/byslib/core/scanner.hpp:62:17: error: ‘T’ was not declared in this scope
/home/bayashi/dev/byslib/core/scanner.hpp:62:18: error: template argument 1 is invalid
/home/bayashi/dev/byslib/core/scanner.hpp:62:18: error: template argument 2 is invalid
/home/bayashi/dev/byslib/core/scanner.hpp: In member function ‘int bys::Scanner::readln(Lambda, char)’:
/home/bayashi/dev/byslib/core/scanner.hpp:68:21: error: ‘T’ was not declared in this scope
/home/bayashi/dev/byslib/core/scanner.hpp:68:22: error: template argument 1 is invalid
/home/bayashi/dev/byslib/core/scanner.hpp:68:22: error: template argument 2 is invalid
/home/bayashi/dev/byslib/core/scanner.hpp:69:49: error: request for member ‘emplace_back’ in ‘res’, which is of non-class type ‘int’
test.cpp: In member function ‘void bys::Solver::solve()’:
test.cpp:9:12: error: request for member ‘size’ in ‘as’, which is of non-class type ‘int’
test.cpp:10:16: error: invalid types ‘int[int]’ for array subscript
test.cpp:12:34: error: no matching function for call to ‘std::set<long long int>::set(<brace-enclosed initializer list>)’
In file included from /usr/include/c++/13/set:63,
                 from /home/bayashi/dev/byslib/core/stdlib.hpp:18:
/usr/include/c++/13/bits/stl_set.h:273:9: note: candidate: ‘template<class _InputIterator> std::set<_Key, _Compare, _Alloc>::set(_InputIterator, _InputIterator, const allocator_type&) [with _Key = long long in

ソースコード

diff #
プレゼンテーションモードにする

#line 2 "/home/bayashi/dev/byslib/core/stdlib.hpp"
#ifndef LOCAL
#define NDEBUG
#endif
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
namespace bys {
using std::array, std::vector, std::string, std::set, std::map, std::pair;
using std::cin, std::cout, std::endl;
using std::min, std::max, std::sort, std::reverse, std::abs, std::pow;
// alias
using ll = long long int;
using ld = long double;
using Pa = pair<int, int>;
using Pall = pair<ll, ll>;
using ibool = std::int8_t;
template <class T>
using uset = std::unordered_set<T>;
template <class S, class T>
using umap = std::unordered_map<S, T>;
} // namespace bys
#line 3 "/home/bayashi/dev/byslib/core/const.hpp"
namespace bys {
constexpr int MOD = 998244353;
constexpr int MOD7 = 1000000007;
constexpr int INF = std::numeric_limits<int>::max() / 2;
constexpr ll LINF = std::numeric_limits<ll>::max() / 2;
} // namespace bys
#line 4 "/home/bayashi/dev/byslib/core/types.hpp"
#include <utility>
namespace bys {
template <class, class = void>
struct has_lshift_to_ostream : std::false_type {};
template <class T>
struct has_lshift_to_ostream<T, std::void_t<decltype(std::declval<std::ostream&>() << std::declval<T&>())>> : std::true_type {};
template <class, class = void>
struct has_rshift_from_istream : std::false_type {};
template <class T>
struct has_rshift_from_istream<T, std::void_t<decltype(std::declval<std::istream&>() >> std::declval<T&>())>> : std::true_type {};
template <class T, class = void>
struct has_tuple_interface : std::false_type {};
template <class T>
struct has_tuple_interface<T, std::void_t<decltype(std::tuple_size<T>())>> : std::true_type {};
template <class, class = void>
struct has_iterator : std::false_type {};
template <class T>
struct has_iterator<T, std::void_t<typename T::iterator>> : std::true_type {};
struct Int1 {};
} // namespace bys
#line 4 "/home/bayashi/dev/byslib/core/printer.hpp"
namespace bys {
struct Printer {
Printer(std::ostream& os_) : os(os_) {}
~Printer() { os << std::flush; }
template <class T>
void cat(T&& v) {
if constexpr (has_lshift_to_ostream<std::decay_t<T>>::value) {
os << v;
} else if constexpr (has_iterator<std::decay_t<T>>::value) {
string sep2;
if constexpr (has_iterator<std::decay_t<typename std::decay_t<T>::value_type>>::value) {
sep2 = _end;
} else {
sep2 = _sep;
}
for (auto &&itr = std::begin(v), end = std::end(v); itr != end; ++itr) {
cat(*itr);
if (std::next(itr) != end) cat(sep2);
}
} else if constexpr (has_tuple_interface<std::decay_t<T>>::value) {
print_tuple(std::forward<T>(v), std::make_index_sequence<std::tuple_size_v<std::decay_t<T>>>());
} else {
static_assert([] { return false; }(), "type error");
}
}
void print() { cat(_end); }
template <class T>
void print(T&& top) {
cat(std::forward<T>(top));
cat(_end);
}
template <class T, class... Ts>
void print(T&& top, Ts&&... args) {
cat(std::forward<T>(top));
cat(_sep);
print(std::forward<Ts>(args)...);
}
template <class... Ts>
void operator()(Ts&&... args) {
print(std::forward<Ts>(args)...);
}
void flush() { os << std::flush; }
template <class... Ts>
void send(Ts&&... args) {
print(std::forward<Ts>(args)...);
flush();
}
Printer set(string sep_ = " ", string end_ = "\n") {
_sep = sep_;
_end = end_;
return *this;
}
void lf() { cat(_end); }
private:
std::ostream& os;
std::string _sep = " ", _end = "\n";
template <std::size_t I, class T>
inline void print_tuple_element(T&& elem) {
if constexpr (I != 0) cat(_sep);
cat(std::forward<T>(elem));
}
template <class Tp, std::size_t... I>
inline void print_tuple(Tp&& tp, std::index_sequence<I...>) {
(print_tuple_element<I>(std::forward<decltype(std::get<I>(tp))>(std::get<I>(tp))), ...);
}
};
} // namespace bys
#line 4 "/home/bayashi/dev/byslib/core/scanner.hpp"
namespace bys {
struct Scanner {
Scanner(std::istream& is_) : is(is_){};
template <class... Ts>
void scan(Ts&... args) {
(is >> ... >> args);
}
template <class T, class... Us>
decltype(auto) read() {
if constexpr (sizeof...(Us) == 0) {
if constexpr (has_rshift_from_istream<T>::value) {
T res;
is >> res;
return res;
} else if constexpr (has_tuple_interface<T>::value) {
auto res = read_tuple<T>(std::make_index_sequence<std::tuple_size_v<T>>());
return res;
} else if constexpr (std::is_same_v<T, Int1>) {
int res;
is >> res;
--res;
return res;
} else if constexpr (has_iterator<T>::value) {
//! TODO: split
static_assert([] { return false; }(), "NotImplementedError");
} else {
static_assert([] { return false; }(), "TypeError");
}
} else {
return std::tuple{read<T>(), read<Us>()...};
}
}
template <class T, std::size_t N, typename R = std::conditional_t<std::is_same_v<T, Int1>, int, T>>
std::array<R, N> read() {
std::array<R, N> res;
for (auto&& e : res) e = read<T>();
return res;
}
template <class T, typename R = std::conditional_t<std::is_same_v<T, Int1>, int, T>>
vector<R> readvec(int n) {
vector<R> res(n);
for (auto&& e : res) e = read<T>();
return res;
}
template <class T, typename R = std::conditional_t<std::is_same_v<T, Int1>, int, T>>
vector<vector<R>> readvec(int n, int m) {
vector<vector<R>> res(n);
for (auto&& e : res) e = readvec<T>(m);
return res;
}
template <class Lambda = std::function<int(std::string)>,
typename T = std::invoke_result_t<std::decay_t<Lambda>, std::string>>
std::vector<T> readln(
Lambda f = [](string x) { return std::stoi(x); }, char sep = ' ') {
std::ws(is);
std::string elem;
std::getline(is, elem);
std::stringstream ss{elem};
std::vector<T> res;
while (std::getline(ss, elem, sep)) res.emplace_back(f(elem));
return res;
}
private:
std::istream& is;
template <class Tp, std::size_t... I>
inline decltype(auto) read_tuple(std::index_sequence<I...>) {
return Tp{read<typename std::tuple_element_t<I, Tp>>()...};
}
};
} // namespace bys
#line 5 "/home/bayashi/dev/byslib/core/io.hpp"
namespace bys {
__attribute__((constructor)) void setup_io() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout << std::fixed << std::setprecision(11);
std::cerr << std::fixed << std::setprecision(11);
std::cerr << std::boolalpha;
}
Printer print(std::cout), debug(std::cerr);
Scanner scanner(std::cin);
} // namespace bys
#line 2 "/home/bayashi/dev/byslib/core/macro.hpp"
// clang-format off
#ifdef LOCAL
//! @brief
#define DEBUG(...) { std::cerr << "[debug] line" << std::setw(4) << __LINE__ << ": "; debug(__VA_ARGS__); }
#else
#define DEBUG(...)
#endif
//! @brief printreturn
#define EXIT(...) { print(__VA_ARGS__); return; }
#define CONCAT_IMPL(a, b) a##b
#define CONCAT(a, b) CONCAT_IMPL(a, b)
//! @brief [[maybe_unused]]
#define UV [[maybe_unused]] auto CONCAT(unused_val_, __LINE__)
// clang-format on
#line 2 "/home/bayashi/dev/byslib/core/solver.hpp"
namespace bys {
struct Solver {
int IT = 1;
Solver() {}
void solve();
void solve(int rep) {
for (; IT <= rep; ++IT) solve();
}
};
} // namespace bys
#line 2 "/home/bayashi/dev/byslib/utility/change.hpp"
namespace bys {
template <class T>
inline bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, const T& b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
} // namespace bys
#line 2 "/home/bayashi/dev/byslib/utility/range.hpp"
namespace bys {
//! @brief pythonrange
template <typename T>
struct Range {
Range(T start, T stop, T step = 1) : it(start), stop(stop), step(step), dir(step >= 0 ? 1 : -1) {}
Range(T stop) : it(0), stop(stop), step(1), dir(1) {}
Range<T> begin() const { return *this; }
T end() const { return stop; }
bool operator!=(const T val) const { return (val - it) * dir > 0; }
void operator++() { it += step; }
const T& operator*() const { return it; }
private:
T it;
const T stop, step;
const int dir;
friend Range reversed(const Range& r) {
auto new_start = (r.stop - r.dir - r.it) / r.step * r.step + r.it;
return {new_start, r.it - r.dir, -r.step};
}
};
} // namespace bys
#line 4 "test.cpp"
namespace bys {
void Solver::solve() {
scanner.read<int>();
auto as = scanner.readln([](const string& s) { return std::stoll(s); });
if (as.size() != 1) EXIT("\"assert\"");
auto a = as[0];
auto [b, c] = scanner.read<ll, 2>();
set<ll> s{a + b, a + c, b + c};
print(*std::next(s.rbegin()));
}
} // namespace bys
int main() {
bys::Solver solver;
solver.solve(/* bys::scanner.read<int>() */);
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0