#874891 (C++17) No.2329 Nafmo、イカサマをする

提出ソース

結果

問題	No.2329 Nafmo、イカサマをする
ユーザー	tomo0608
提出日時	2023-05-28 15:21:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,161 bytes
コンパイル時間	2,618 ms
コンパイル使用メモリ	222,384 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-06-08 07:35:59
合計ジャッジ時間	3,786 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	WA	-
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	2 ms 5,376 KB
testcase_17	WA	-
testcase_18	AC	1 ms 5,376 KB
testcase_19	WA	-
testcase_20	AC	2 ms 5,376 KB
testcase_21	AC	2 ms 5,376 KB
testcase_22	AC	2 ms 5,376 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	AC	2 ms 5,376 KB
testcase_30	WA	-
testcase_31	WA	-
testcase_32	AC	2 ms 5,376 KB
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	AC	3 ms 5,376 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	AC	11 ms 5,376 KB
testcase_42	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

/**
*    author:  tomo0608
*    created: 01.05.2023 18:24:08
**/

#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <atcoder/modint>

namespace tomo0608 {
    typedef long long ll;
    typedef long double ld;
    template <class T> using V = std::vector<T>;
    template <class T> using VV = V<V<T>>;
    template <class T> using VVV = V<VV<T>>;
    typedef std::pair<int, int> pii;
    typedef std::pair<long long, long long> pll;
    template<class... T>void input(T&... a) { (std::cin >> ... >> a); };

#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define LL(...) long long __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; input(__VA_ARGS__)
    std::istream& operator>>(std::istream& is, atcoder::modint998244353& a) { long long v; is >> v; a = v; return is; }
    std::ostream& operator<<(std::ostream& os, const atcoder::modint998244353& a) { return os << a.val(); }
    std::istream& operator>>(std::istream& is, atcoder::modint1000000007& a) { long long v; is >> v; a = v; return is; }
    std::ostream& operator<<(std::ostream& os, const atcoder::modint1000000007& a) { return os << a.val(); }
    template<int m> std::istream& operator>>(std::istream& is, atcoder::static_modint<m>& a) { long long v; is >> v; a = v; return is; }
    template<int m> std::ostream& operator<<(std::ostream& os, const atcoder::static_modint<m>& a) { return os << a.val(); }
    template<int m> std::istream& operator>>(std::istream& is, atcoder::dynamic_modint<m>& a) { long long v; is >> v; a = v; return is; }
    template<int m> std::ostream& operator<<(std::ostream& os, const atcoder::dynamic_modint<m>& a) { return os << a.val(); }
    template<class T1, class T2> std::istream& operator>>(std::istream& is, std::pair<T1, T2>& p) { is >> p.first >> p.second; return is; }
    template<class T1, class T2> std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
    template<class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) { for (auto& e : v) is >> e; return is; }
    template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) { for (auto& e : v) os << e << ' '; return os; }
    template<typename T> std::ostream& operator << (std::ostream& os, std::set<T>& set_var) { os << "{"; for (auto itr = set_var.begin(); itr != set_var.end(); itr++) { os << *itr;++itr;if (itr != set_var.end()) os << ", ";itr--; }os << "}";return os; }
    template <typename T, typename U> std::ostream& operator<<(std::ostream& os, std::map<T, U>& map_var) { os << "{";for (auto itr = map_var.begin(); itr != map_var.end(); itr++) { os << *itr;itr++;if (itr != map_var.end()) os << ", ";itr--; }os << "}";return os; }

    void print() { std::cout << '\n'; }
    template<class T, class... Ts>void print(const T& a, const Ts&... b) { std::cout << a; (std::cout << ... << (std::cout << ' ', b)); std::cout << '\n'; }
    void drop() { std::cout << '\n';exit(0); }
    template<class T, class... Ts>void drop(const T& a, const Ts&... b) { std::cout << a; (std::cout << ... << (std::cout << ' ', b)); std::cout << '\n';exit(0); }
#ifdef __LOCAL
    void debug_out() { std::cerr << std::endl; }
    template < class Head, class... Tail> void debug_out(Head H, Tail... T) { std::cerr << ' ' << H; debug_out(T...); }
#define debug(...) std::cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) std::cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << std::endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif


#define rep1(a)          for(long long i = 0; i < a; i++)
#define rep2(i, a)       for(long long i = 0; i < a; i++)
#define rep3(i, a, b)    for(long long i = a; i < b; i++)
#define rep4(i, a, b, c) for(long long i = a; i < b; i += c)
#define drep1(a)          for(long long i = a-1; i >= 0; i--)
#define drep2(i, a)       for(long long i = a-1; i >= 0; i--)
#define drep3(i, a, b)    for(long long i = a-1; i >= b; i--)
#define drep4(i, a, b, c) for(long long i = a-1; i >= b; i -= c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define drep(...) overload4(__VA_ARGS__, drep4, drep3, drep2, drep1)(__VA_ARGS__)

} // namespace tomo0608

int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 };
int dy[8] = { 0, 1, 0, -1, 1, -1, -1, 1 };
#define endl '\n'


namespace tomo0608 {
#define all(x) x.begin(),x.end()
    template <class T = long long, class S> T SUM(const S& v) { return accumulate(all(v), T(0)); }
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
    template <typename T> void zip(std::vector<T>& x) { std::vector<T> y = x;UNIQUE(y);for (int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); } }
    template<class T> using priority_queue_rev = std::priority_queue<T, std::vector<T>, std::greater<T>>;
    template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return 1; } return 0; }
    template<class T> inline int count_between(std::vector<T>& a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
    int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
    int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
    int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
    int lowbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
    template <typename T>T mypow(T x, long long n) { T ret = 1;while (n > 0) { if (n & 1)(ret *= x);(x *= x);n >>= 1; }return ret; }
}

//typedef atcoder::modint1000000007 mint;
typedef atcoder::modint998244353 mint;
using namespace atcoder;
using namespace std;
using namespace tomo0608;
#include <atcoder/fenwicktree>

const ll inf = 1e18;
void solve() {
    LL(n, m, k);
    V<ll> a(n + 1);
    rep(i, n) {
        cin >> a[i + 1];
    }
    UNIQUE(a);
    n = a.size();
    V<ll> a_three;
    rep(i, n)rep(j, i, n)rep(k, j, n) {
        ll now = a[i] + a[j] + a[k];
        if (now > m)continue;
        a_three.emplace_back(now);
    }
    sort(all(a_three));
    UNIQUE(a_three);
    debug(a_three);
    ll ans = 0;
    for (ll x : a_three) {
        ll now = m - x;
        // now以下の最大
        // now+1以上の最小 - 1
        auto itr = upper_bound(all(a_three), now);
        if (itr == a_three.begin())break;
        itr--;
        chmax(ans, x + (*itr));
    }
    print(ans);
}

int main() {
    std::cin.tie(0);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::setprecision(20);
    int codeforces = 1;
    //cin >> codeforces;
    while (codeforces--) {
        solve();
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード