結果

問題 No.949 飲酒プログラミングコンテスト
ユーザー ningenMeningenMe
提出日時 2019-12-13 00:59:56
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 564 ms / 2,500 ms
コード長 4,017 bytes
コンパイル時間 1,877 ms
コンパイル使用メモリ 179,176 KB
実行使用メモリ 109,056 KB
最終ジャッジ日時 2024-06-26 02:04:22
合計ジャッジ時間 9,011 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 3 ms
6,944 KB
testcase_08 AC 5 ms
6,940 KB
testcase_09 AC 3 ms
6,944 KB
testcase_10 AC 4 ms
6,940 KB
testcase_11 AC 320 ms
78,208 KB
testcase_12 AC 329 ms
79,488 KB
testcase_13 AC 286 ms
70,144 KB
testcase_14 AC 39 ms
12,928 KB
testcase_15 AC 180 ms
54,784 KB
testcase_16 AC 330 ms
99,200 KB
testcase_17 AC 66 ms
15,488 KB
testcase_18 AC 525 ms
104,192 KB
testcase_19 AC 247 ms
78,720 KB
testcase_20 AC 51 ms
18,688 KB
testcase_21 AC 19 ms
9,984 KB
testcase_22 AC 37 ms
16,768 KB
testcase_23 AC 6 ms
6,940 KB
testcase_24 AC 315 ms
58,368 KB
testcase_25 AC 462 ms
109,056 KB
testcase_26 AC 462 ms
109,056 KB
testcase_27 AC 367 ms
109,056 KB
testcase_28 AC 564 ms
109,056 KB
testcase_29 AC 359 ms
109,056 KB
testcase_30 AC 279 ms
109,056 KB
testcase_31 AC 254 ms
109,056 KB
testcase_32 AC 407 ms
109,056 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int N; cin >> N;
    vector<int> A(N+1),B(N+1),C(N+1,-1234567);
    for(int i = 0; i <= N; ++i) cin >> A[i];
    for(int i = 0; i <= N; ++i) cin >> B[i];
    for(int i = 0; i < N; ++i) cin >> C[i];
    sort(ALL(C));
    auto cost = multivector(N+1,N+1,0);
    for(int i = 0; i <= N; ++i) for(int j = 0; j <= N; ++j) cost[i][j] = A[i] + B[j];
    for(int i = 0; i <= N; ++i) for(int j = 0; j <= N; ++j) {
        int idx = upper_bound(ALL(C),cost[i][j]) - C.begin();
        idx--;
        cost[i][j] = idx;
    }
    auto dp = cost;
    dp[0][0] = N+1;
    for(int i = 0; i < N; ++i) for(int j = 0; j <= N; ++j){
        if(0<=i-1 && 0 <= j-1){
            chmin(dp[i][j],max(dp[i-1][j],dp[i][j-1])-1);
        }
        else if(0<=i-1){
            chmin(dp[i][j],dp[i-1][j]-1);
        }
        else if(0 <= j-1){
            chmin(dp[i][j],dp[i][j-1]-1);
        }
    }
    auto dp2 = multivector(N+1,N+1,0);
    for(int i = 0; i < N; ++i) for(int j = 0; j <= N; ++j){
        if(i+1<=N && dp[i][j]>dp[i+1][j]) chmax(dp2[i+1][j],dp2[i][j]+(dp[i+1][j]>0));
        if(j+1<=N && dp[i][j]>dp[i][j+1]) chmax(dp2[i][j+1],dp2[i][j]+(dp[i][j+1]>0));
    }
    int ans = 0;
    for(int i = 0; i <= N; ++i){
        chmax(ans,dp2[i][N-i]);
    }

    cout << ans << endl;
}
0