結果

問題 No.1818 6 Operations
ユーザー parenthesesparentheses
提出日時 2022-01-22 01:43:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 134 ms / 2,500 ms
コード長 5,084 bytes
コンパイル時間 1,956 ms
コンパイル使用メモリ 210,968 KB
実行使用メモリ 116,480 KB
最終ジャッジ日時 2024-11-26 10:07:26
合計ジャッジ時間 5,165 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,816 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 40 ms
36,992 KB
testcase_09 AC 82 ms
68,224 KB
testcase_10 AC 40 ms
37,504 KB
testcase_11 AC 36 ms
34,688 KB
testcase_12 AC 66 ms
54,656 KB
testcase_13 AC 47 ms
45,440 KB
testcase_14 AC 57 ms
51,712 KB
testcase_15 AC 68 ms
59,648 KB
testcase_16 AC 55 ms
49,920 KB
testcase_17 AC 79 ms
72,704 KB
testcase_18 AC 126 ms
100,864 KB
testcase_19 AC 108 ms
96,896 KB
testcase_20 AC 119 ms
102,400 KB
testcase_21 AC 125 ms
104,064 KB
testcase_22 AC 101 ms
89,856 KB
testcase_23 AC 131 ms
110,336 KB
testcase_24 AC 110 ms
92,672 KB
testcase_25 AC 130 ms
116,480 KB
testcase_26 AC 112 ms
94,464 KB
testcase_27 AC 117 ms
98,816 KB
testcase_28 AC 39 ms
37,120 KB
testcase_29 AC 36 ms
34,816 KB
testcase_30 AC 121 ms
100,608 KB
testcase_31 AC 121 ms
107,008 KB
testcase_32 AC 134 ms
111,872 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define OD(i) (((i) & 1) == 1)
#define EV(i) (((i) & 1) == 0)
#ifdef _LOCAL
    #define debug_bar cerr << "--------------------\n";
    #define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
    #define debug_pair(x) cerr << "l." << __LINE__ << " : " << #x << " = (" << x.first << "," << x.second << ")\n";
    template<class T> void debug_line(const vector<T>& ans, int l, int r, int L = 0) { cerr << "l." << L << " :"; for (int i = l; i < r; i++) { cerr << ' ' << ans[i]; } cerr << '\n'; }
#else
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(x)
    #define debug_pair(x)
    template<class T> void debug_line([[maybe_unused]] const vector<T>& ans, [[maybe_unused]] int l, [[maybe_unused]] int r, [[maybe_unused]] int L = 0) {}
#endif
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
ll llceil(ll a, ll b) { assert(b > 0); return (a + b - 1) / b; }
ll llpow(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = llpow(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digit_len(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll digit_sum(ll n) { assert(n >= 0); ll sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; }
ll digit_prod(ll n) { assert(n >= 0); if (n == 0) { return 0; } ll prod = 1; while (n > 0) { prod *= n % 10; n /= 10; } return prod; }
string toupper(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = toupper(T[i]); } return T; }
string tolower(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = tolower(T[i]); } return T; }
int a2i(const char& c) { assert(islower(c)); return (c - 'a'); }
int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); }
int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); }
char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); }
char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); }
char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
const ld EPS = 1e-10;
const ld PI  = acosl(-1.0);
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr int inf = (1 << 30) - 1;   // 1073741824 - 1
constexpr ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;


// Editorial AC

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N, M; input(N, M);
    VLL A(N); REP(i,N) input(A[i]);
    VLL B(M); REP(i,M) input(B[i]);

    VLL C, D;
    for (const auto& a : A) {
        C.push_back(0);
        REP(_,a) C.push_back(1);
    }
    for (const auto& b : B) {
        D.push_back(0);
        REP(_,b) D.push_back(1);
    }

    N = SZ(C);
    M = SZ(D);
    VVLL dp(N, VLL(M, INF));
    dp[0][0] = 0;
    REP(i,N) REP(j,M) {
        if (0 <= i-1) chmin(dp[i][j], dp[i-1][j] + 1);
        if (0 <= j-1) chmin(dp[i][j], dp[i][j-1] + 1);
        if (0 <= i-1 && 0 <= j-1) chmin(dp[i][j], dp[i-1][j-1] + (C[i] != D[j]));
    }

    ll ans = dp[N-1][M-1];
    print(ans);

    return 0;
}
0