結果

問題 No.949 飲酒プログラミングコンテスト
ユーザー hitonanodehitonanode
提出日時 2019-12-12 00:17:13
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 94 ms / 2,500 ms
コード長 4,182 bytes
コンパイル時間 1,757 ms
コンパイル使用メモリ 175,408 KB
実行使用メモリ 38,656 KB
最終ジャッジ日時 2024-06-24 08:09:13
合計ジャッジ時間 3,598 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 3 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 3 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 50 ms
28,288 KB
testcase_12 AC 50 ms
28,672 KB
testcase_13 AC 42 ms
25,600 KB
testcase_14 AC 9 ms
6,940 KB
testcase_15 AC 29 ms
20,480 KB
testcase_16 AC 51 ms
35,328 KB
testcase_17 AC 13 ms
7,424 KB
testcase_18 AC 94 ms
36,992 KB
testcase_19 AC 43 ms
28,544 KB
testcase_20 AC 10 ms
8,448 KB
testcase_21 AC 6 ms
6,944 KB
testcase_22 AC 9 ms
7,808 KB
testcase_23 AC 3 ms
6,944 KB
testcase_24 AC 58 ms
21,504 KB
testcase_25 AC 70 ms
38,528 KB
testcase_26 AC 68 ms
38,528 KB
testcase_27 AC 58 ms
38,528 KB
testcase_28 AC 83 ms
38,656 KB
testcase_29 AC 58 ms
38,528 KB
testcase_30 AC 59 ms
38,400 KB
testcase_31 AC 60 ms
38,400 KB
testcase_32 AC 58 ms
38,656 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/



int main()
{
    int N;
    cin >> N;
    vector<int> A(N + 1), B(N + 1), D(N);
    cin >> A >> B >> D;
    reverse(ALL(A));
    reverse(ALL(B));
    sort(ALL(D));
    vector<vector<int>> dp(N + 2, vector<int>(N + 2));

    REP(i, N + 1) REP(j, N + 1)
    {
        int solved = dp[i][j];
        mmax(dp[i + 1][j], solved);
        mmax(dp[i][j + 1], solved);
        mmax(dp[i + 1][j + 1], solved);
        if (solved < N)
        {
            int nx = D[solved];
            if (A[i] + B[j] >= nx)
            {
                mmax(dp[i + 1][j], solved + 1);
                mmax(dp[i][j + 1], solved + 1);
            }
        }
    }
    cout << dp[N + 1][N + 1] << endl;
}
0