結果
問題 | No.914 Omiyage |
ユーザー |
![]() |
提出日時 | 2019-10-25 21:30:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,940 bytes |
コンパイル時間 | 2,477 ms |
コンパイル使用メモリ | 201,520 KB |
最終ジャッジ日時 | 2025-01-08 01:04:20 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>#define loop(n) for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); ngtkana_is_genius++)#define rep(i, begin, end) for(int i = int(begin); i < int(end); i++)#define all(v) v.begin(), v.end()#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)using lint = long long;auto mt = std::mt19937_64(std::random_device{}());auto cmn = [](auto& a, auto b){if (a > b) {a = b; return true;} return false;};auto cmx = [](auto& a, auto b){if (a < b) {a = b; return true;} return false;};void debug_impl() { std::cerr << std::endl; }template <typename Head, typename... Tail>void debug_impl(Head head, Tail... tail){std::cerr << " " << head;debug_impl(tail...);}#ifndef STOPIT#define debug(...)\std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\debug_impl(__VA_ARGS__);\std::cerr << std::noboolalpha;#else#define debug 0;#endiftemplate < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>std::istream& operator>> (std::istream& is, Container& v){ for (auto & x : v) { is >> x; } return is; }template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >std::ostream& operator<< (std::ostream& os, Container const& v) {os << "{";for (auto it = v.begin(); it != v.end(); it++){os << (it != v.begin() ? "," : "") << *it;}return os << "}";}template <typename T>auto make_vector_impl(size_t sz, T t) {return std::vector<T>(sz, t);}template <size_t N, typename T, typename U, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>auto make_vector(size_t sz, U u) {return make_vector_impl(sz, T(u));}template <size_t N, typename T, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>auto make_vector(size_t sz) {return std::vector<T>(sz);}template <size_t N, typename T, typename... Args, std::enable_if_t<N != 1, std::nullptr_t> = nullptr>auto make_vector(size_t a, Args... args) {return make_vector_impl(a, make_vector<N - 1, T>(args...));}template <typename T, typename Size_t>auto& at(T& t, Size_t i) {return t.at(i);}template <typename T, typename Size_t, typename... Args>auto& at(T& t, Size_t i, Args... args) {return at(t.at(i), args...);}int main() {std::cin.tie(0); std::cin.sync_with_stdio(false);int n, m, k;std::cin >> n >> m >> k;auto a = make_vector< 2, int > (n, m);std::cin >> a;std::vector< int > dp(k + 1, false);dp.at(k) = true;for (auto v : a) {std::vector< int > new_dp(k + 1, false);for (auto x : v) {rep(i, 0, k + 1 - x) {new_dp.at(i) |= dp.at(i + x);}}std::swap(dp, new_dp);// debug(dp);}auto ret = -1;for (auto i = k; i >= 0; i--) {if (dp.at(i)) ret = i;}std::cout << ret << std::endl;return 0;}