結果
問題 | No.1818 6 Operations |
ユーザー | heno239 |
提出日時 | 2022-01-21 21:35:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 66 ms / 2,500 ms |
コード長 | 4,636 bytes |
コンパイル時間 | 1,672 ms |
コンパイル使用メモリ | 150,996 KB |
実行使用メモリ | 71,040 KB |
最終ジャッジ日時 | 2024-05-04 12:08:40 |
合計ジャッジ時間 | 3,769 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
11,648 KB |
testcase_01 | AC | 6 ms
11,776 KB |
testcase_02 | AC | 6 ms
11,776 KB |
testcase_03 | AC | 6 ms
11,776 KB |
testcase_04 | AC | 7 ms
11,776 KB |
testcase_05 | AC | 7 ms
11,904 KB |
testcase_06 | AC | 7 ms
11,904 KB |
testcase_07 | AC | 7 ms
11,904 KB |
testcase_08 | AC | 25 ms
37,888 KB |
testcase_09 | AC | 38 ms
52,352 KB |
testcase_10 | AC | 23 ms
33,920 KB |
testcase_11 | AC | 28 ms
39,296 KB |
testcase_12 | AC | 50 ms
46,976 KB |
testcase_13 | AC | 28 ms
37,120 KB |
testcase_14 | AC | 35 ms
48,000 KB |
testcase_15 | AC | 54 ms
52,736 KB |
testcase_16 | AC | 32 ms
43,776 KB |
testcase_17 | AC | 46 ms
60,288 KB |
testcase_18 | AC | 60 ms
70,528 KB |
testcase_19 | AC | 57 ms
65,408 KB |
testcase_20 | AC | 65 ms
70,656 KB |
testcase_21 | AC | 63 ms
67,968 KB |
testcase_22 | AC | 56 ms
67,584 KB |
testcase_23 | AC | 63 ms
68,864 KB |
testcase_24 | AC | 56 ms
66,048 KB |
testcase_25 | AC | 66 ms
71,040 KB |
testcase_26 | AC | 54 ms
61,056 KB |
testcase_27 | AC | 57 ms
63,360 KB |
testcase_28 | AC | 33 ms
43,520 KB |
testcase_29 | AC | 32 ms
42,880 KB |
testcase_30 | AC | 58 ms
66,944 KB |
testcase_31 | AC | 60 ms
65,792 KB |
testcase_32 | AC | 63 ms
69,376 KB |
ソースコード
#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<unordered_set> #include<utility> #include<cassert> #include<complex> #include<numeric> #include<array> #include<chrono> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; typedef pair<int, int>P; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; template<typename T> void chmin(T& a, T b) { a = min(a, b); } template<typename T> void chmax(T& a, T b) { a = max(a, b); } template<typename T> void cinarray(vector<T>& v) { rep(i, v.size())cin >> v[i]; } template<typename T> void coutarray(vector<T>& v) { rep(i, v.size()) { if (i > 0)cout << " "; cout << v[i]; } cout << "\n"; } ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; if (x == 0)return 0; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { int n; modint() :n(0) { ; } modint(ll m) { if (m < 0 || mod <= m) { m %= mod; if (m < 0)m += mod; } n = m; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 20; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-8; const ld pi = acosl(-1.0); int dx[4] = { 1,0,-1,0 }; int dy[4] = { 0,1,0,-1 }; template<typename T> void addv(vector<T>& v,int loc, T val) { if (loc >= v.size())v.resize(loc + 1, 0); v[loc] += val; } //----------------------------------------- int dp[4005][4005]; void solve() { int n, m; cin >> n >> m; vector<int> a(n); vector<int> b(m); rep(i, n)cin >> a[i]; rep(i, m)cin >> b[i]; vector<int> va, vb; rep(i, n) { if (i > 0) { va.push_back(1); } rep(j, a[i])va.push_back(0); } rep(i, m) { if (i > 0) { vb.push_back(1); } rep(j, b[i])vb.push_back(0); } rep(i, va.size() + 1)rep(j, vb.size() + 1) { dp[i][j] = mod; } dp[0][0] = 0; rep(i, va.size() + 1)rep(j, vb.size() + 1) { //1 or 5 if (j < vb.size())chmin(dp[i][j + 1], dp[i][j] + 1); //2 or 3 if (i < va.size())chmin(dp[i + 1][j], dp[i][j] + 1); //4 or 6 or same if (i < va.size() && j < vb.size()) { int cost = 0; if (va[i] != vb[j])cost = 1; chmin(dp[i + 1][j + 1], dp[i][j] + cost); } } cout << dp[va.size()][vb.size()] << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); //init_f(); //init(); //while(true) //useexpr(); //int t; cin >> t; rep(i, t) solve(); return 0; }