結果
| 問題 | No.1818 6 Operations |
| ユーザー |
 riano
|
| 提出日時 | 2021-12-28 15:02:19 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 135 ms / 2,500 ms |
| コード長 | 4,119 bytes |
| コンパイル時間 | 1,669 ms |
| コンパイル使用メモリ | 173,048 KB |
| 実行使用メモリ | 116,480 KB |
| 最終ジャッジ日時 | 2024-10-02 07:34:48 |
| 合計ジャッジ時間 | 5,036 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define ll long long#define rep(i,n) for(int i=0;i<n;i++)#define rrep(i,n) for(int i=n-1;i>=0;i--)#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)#define vll(n,i) vector<long long>(n,i)#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))#define all(v) v.begin(),v.end()#define chmin(k,m) k = min(k,m)#define chmax(k,m) k = max(k,m)#define Pr pair<ll,ll>#define Tp tuple<ll,ll,ll>#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)using Graph = vector<vector<int>>;const ll mod = 998244353;template<uint64_t mod>struct modint{uint64_t val;constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}constexpr modint operator-() const noexcept{return modint(*this)=mod-val;}constexpr modint operator+(const modint rhs) const noexcept{return modint(*this)+=rhs;}constexpr modint operator-(const modint rhs) const noexcept{return modint(*this)-=rhs;}constexpr modint operator*(const modint rhs) const noexcept{return modint(*this)*=rhs;}constexpr modint operator/(const modint rhs) const noexcept{return modint(*this)/=rhs;}constexpr modint &operator+=(const modint rhs) noexcept{val+=rhs.val;val-=((val>=mod)?mod:0);return (*this);}constexpr modint &operator-=(const modint rhs) noexcept{val+=((val<rhs.val)?mod:0);val-=rhs.val;return (*this);}constexpr modint &operator*=(const modint rhs) noexcept{val=val*rhs.val%mod;return (*this);}constexpr modint &operator/=(modint rhs) noexcept{uint64_t ex=mod-2;modint now=1;while(ex){now*=((ex&1)?rhs:1);rhs*=rhs,ex>>=1;}return (*this)*=now;}modint & operator++(){val++;if (val == mod) val = 0;return *this;}modint operator++(int){modint<mod> res = *this;++*this;return res;}constexpr bool operator==(const modint rhs) noexcept{return val==rhs.val;}constexpr bool operator!=(const modint rhs) noexcept{return val!=rhs.val;}friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{return os<<(x.val);}friend constexpr istream &operator>>(istream& is,modint& x) noexcept{uint64_t t;is>>t,x=t;return is;}};typedef modint<mod> mint;mint pw(long long a,long long b,long long m = mod){if(a%m==0) return mint(0);if(b==0) return mint(1);else if(b%2==0){long long x = pw(a,b/2,m).val;return mint(x*x);}else{long long x = pw(a,b-1,m).val;return mint(a*x);}}mint modinv(long long a, long long m = mod) {long long b = m, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;return mint(u);}#define vm(n,i) vector<mint>(n,i)#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))int main() {riano_; ll ans = 0;ll N,M; cin >> N >> M;ll a[N],b[M];rep(i,N) cin >> a[i];rep(i,M) cin >> b[i];auto av = vll(4002,0);auto bv = vll(4002,0);rep(i,N-1){a[i+1] += a[i]+1;}rep(i,N) av[a[i]]++;rep(i,M-1){b[i+1] += b[i]+1;}rep(i,M) bv[b[i]]++;auto dp = v2ll(a[N-1]+2,b[M-1]+2,2e18);dp[0][0] = 0;rep(i,a[N-1]+1){rep(j,b[M-1]+1){chmin(dp[i+1][j+1],dp[i][j]+abs(av[i]-bv[j]));chmin(dp[i+1][j],dp[i][j]+1);chmin(dp[i][j+1],dp[i][j]+1);}}ans = dp[a[N-1]][b[M-1]];cout << ans << endl;}