#709713 (C++17) No.1715 Dinner 2

提出ソース

結果

問題	No.1715 Dinner 2
ユーザー	mtsd
提出日時	2021-10-22 23:07:01
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	9,569 bytes
コンパイル時間	2,299 ms
コンパイル使用メモリ	211,556 KB
実行使用メモリ	11,596 KB
最終ジャッジ日時	2024-09-23 07:02:32
合計ジャッジ時間	4,531 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 11,244 KB
testcase_01	AC	6 ms 11,248 KB
testcase_02	AC	6 ms 11,316 KB
testcase_03	AC	4 ms 11,260 KB
testcase_04	AC	6 ms 11,472 KB
testcase_05	AC	7 ms 11,408 KB
testcase_06	AC	6 ms 11,556 KB
testcase_07	AC	7 ms 11,352 KB
testcase_08	AC	6 ms 11,388 KB
testcase_09	AC	6 ms 11,424 KB
testcase_10	AC	6 ms 11,412 KB
testcase_11	AC	95 ms 11,340 KB
testcase_12	AC	81 ms 11,304 KB
testcase_13	AC	71 ms 11,496 KB
testcase_14	AC	80 ms 11,308 KB
testcase_15	AC	78 ms 11,416 KB
testcase_16	AC	78 ms 11,508 KB
testcase_17	AC	54 ms 11,412 KB
testcase_18	AC	12 ms 11,268 KB
testcase_19	AC	12 ms 11,336 KB
testcase_20	AC	10 ms 11,328 KB
testcase_21	AC	11 ms 11,596 KB
testcase_22	AC	11 ms 11,512 KB
testcase_23	AC	13 ms 11,472 KB
testcase_24	AC	11 ms 11,376 KB
testcase_25	AC	18 ms 11,320 KB
testcase_26	AC	17 ms 11,388 KB
testcase_27	AC	17 ms 11,396 KB
testcase_28	AC	18 ms 11,396 KB
testcase_29	AC	18 ms 11,332 KB
testcase_30	AC	19 ms 11,288 KB
testcase_31	AC	19 ms 11,384 KB
testcase_32	AC	117 ms 11,428 KB
testcase_33	AC	117 ms 11,480 KB
testcase_34	AC	119 ms 11,452 KB
testcase_35	AC	119 ms 11,476 KB
testcase_36	AC	6 ms 11,468 KB
testcase_37	AC	6 ms 11,440 KB
testcase_38	WA	-

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#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())
#define SZ(c) (int)(c).size()
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
    os << "{";
    for (int i = 0; i<(int)vec.size(); i++) {
        os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U> pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "{";
    for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if(itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, 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;
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                                                                                                  \
    vector<type> name(size);                                                                                                                                   \
    IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                                                                                                   \
    vector<vector<type>> name(h, vector<type>(w));                                                                                                             \
    IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)                                                                                                                         \
    vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define INT(...)                                                                                                                                               \
    int __VA_ARGS__;                                                                                                                                           \
    IN(__VA_ARGS__)
#define LL(...)                                                                                                                                                \
    ll __VA_ARGS__;                                                                                                                                            \
    IN(__VA_ARGS__)
#define STR(...)                                                                                                                                               \
    string __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
#define CHR(...)                                                                                                                                               \
    char __VA_ARGS__;                                                                                                                                          \
    IN(__VA_ARGS__)
#define DBL(...)                                                                                                                                               \
    double __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
    for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
    scan(head);
    IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define dbg(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, typename T>
std::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
    array = val;
}
template<typename A, typename T>
std::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
    for (auto& a : array) {
        fill(a, val);
    }
}
template <class T> T ceil(T x, T y) {assert(y >= 1);return (x > 0 ? (x + y - 1) / y : x / y);}
template <class T> T floor(T x, T y) {assert(y >= 1);return (x > 0 ? x / y : (x + y - 1) / y);}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }


template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
    for(auto e : a) v.emplace_back(e);
    fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
    for(auto &&e : a) e = lb(v, e);
    renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
    vector<S> v;
    fold_in(v, head, args...);
    sort(all(v)), v.erase(unique(all(v)), v.end());
    renumber(v, head, args...);
}
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
ll dp[1010][1010];
int main(){
    INT(n,d);
    vec(ll,p,n);
    vec(ll,q,n);
    rep(i,n) cin >> p[i] >> q[i];
    ll ok = -SUM(p);
    ll ng = 0;
    while(ng-ok>1){
        ll mid = (ok+ng)/2;
        fill(dp,-(1LL<<60));
        rep(i,d+1){
            rep(j,n+1)dp[i][j] = -(1LL<<60);
        }
        dp[0][n] = 0;
        rep(i,d){
            pair<ll,int> mx = MP(-inf,-1);
            pair<ll,int>sec =MP(-inf,-1);
            rep(j,n+1){
                if(mx < MP(dp[i][j],j)){
                    chmax(sec,mx);
                    mx =  MP(dp[i][j],j);
                }    
            }
            dbg(mid,i,mx);
            rep(j,n){
                if(j!=mx.second){
                    if(mx.first -p[j]>=mid){
                        dp[i+1][j] = mx.first + q[j]-p[j];
                    }
                }else{
                    if(sec.first -p[j]>=mid){
                        dp[i+1][j] = sec.first + q[j]-p[j];
                    }
                }
            }
        }
        bool ff = 0;
        rep(j,n){
            if(dp[d][j]>=mid){
                ff = 1;
            }
        }
        if(ff){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    cout << ok << endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード