結果

問題 No.3407 Birds-of-Paradise' Christmas Live
コンテスト
ユーザー noya2
提出日時 2025-12-14 00:53:30
言語 C++23
(gcc 15.2.0 + boost 1.89.0)
結果
AC  
実行時間 139 ms / 2,000 ms
コード長 9,355 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 3,418 ms
コンパイル使用メモリ 297,832 KB
実行使用メモリ 21,648 KB
最終ジャッジ日時 2025-12-14 00:53:37
合計ジャッジ時間 6,871 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp"

#line 5 "/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp"

namespace noya2{

template<typename T>
struct compress {
    std::vector<T> raws;
    compress () {}
    compress (const vector<T> &_raws) : raws(_raws){ build(); }
    void build(){
        std::sort(raws.begin(), raws.end());
        raws.erase(std::unique(raws.begin(), raws.end()), raws.end());
    }
    int id(const T &raw){ return lb(raw); }
    T raw(const int &id){ return raws[id]; }
    void add(const T &raw){ raws.emplace_back(raw); }
    void reserve(size_t sz){ raws.reserve(sz); }
    size_t size(){ return raws.size(); }
    int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }
    int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }
    bool contains(const T &raw){
        int jd = lb(raw);
        if (jd < (int)size()) return raws[jd] == raw;
        return false;
    }
    int contains_id(const T &raw){
        int jd = lb(raw);
        if (jd < (int)size() && raws[jd] == raw) return jd;
        return -1;
    }
};

} // namespace noya2
#line 4 "c.cpp"

// 0:22~

ll calc(vector<pii> rle){
    int n = rle.size();
    assert(n >= 1);
    rep(i,n){
        assert(rle[i].first != 0);
    }
    rep(i,n-1){
        assert(rle[i].first != rle[i+1].first);
    }
    if (n == 1){
        ll len = rle[0].second;
        return len*len;
    }
    if (rle[0].first == 3){
        rle[1].second += rle[0].second;
        rle.erase(rle.begin());
        return calc(rle);
    }
    if (rle[n-1].first == 3){
        rle[n-2].second += rle[n-1].second;
        rle.pop_back();
        return calc(rle);
    }
    assert(n % 2 != 0);
    rep(i,n){
        if (i % 2 == 0){
            assert(rle[i].first == 1 || rle[i].first == 2);
        }
        else {
            assert(rle[i].first == 3);
        }
    }
    {
        vector<pii> nrle;
        for (int l = 0, r = 0; l < n; l = r){
            if (rle[r].first == 3){
                nrle.emplace_back(rle[r]);
                r++;
                continue;
            }
            assert(r % 2 == 0);
            while (r < n && rle[r].first == rle[l].first) r += 2;
            r--;
            int len = 0;
            repp(i,l,r){
                len += rle[i].second;
            }
            nrle.emplace_back(rle[l].first,len);
        }
        swap(rle,nrle);
        n = rle.size();
    }
    assert(n % 2 != 0);
    rep(i,n){
        if (i % 2 == 0){
            assert(rle[i].first == 1 || rle[i].first == 2);
            if (i-2 >= 0){
                assert(rle[i].first != rle[i-2].first);
            }
        }
        else {
            assert(rle[i].first == 3);
        }
    }
    vector<ll> dp(n+1);
    vector<int> xs(n+1);
    rep(i,n){
        xs[i+1] = xs[i] + rle[i].second;
        rep(t,2+i%2){
            int j = i-t;
            if (j < 0) continue;
            ll len = xs[i+1] - xs[j];
            chmax(dp[i+1],dp[j]+len*len);
        }
    }
    return dp[n];
}

void solve(){
    vector<pii> rle;
    {
        int n; in(n);
        vector<int> a(n); in(a);
        int m; in(m);
        vector<int> b(m); in(b);
        compress<int> cp;
        cp.add(0);
        {
            int sum = 0;
            rep(i,n){
                sum += a[i];
                cp.add(sum);
            }
        }
        {
            int sum = 0;
            rep(j,m){
                sum += b[j];
                cp.add(sum);
            }
        }
        cp.build();
        int sz = cp.size();
        vector<int> ts(sz-1);
        {
            int l = 0;
            rep(i,n){
                int r = l + a[i];
                if (i % 2 == 0){
                    int il = cp.id(l);
                    int ir = cp.id(r);
                    repp(pos,il,ir){
                        ts[pos] += 1;
                    }
                }
                l = r;
            }
        }
        {
            int l = 0;
            rep(j,m){
                int r = l + b[j];
                if (j % 2 == 0){
                    int il = cp.id(l);
                    int ir = cp.id(r);
                    repp(pos,il,ir){
                        ts[pos] += 2;
                    }
                }
                l = r;
            }
        }
        for (int l = 0, r = 0; l < sz-1; l = r){
            while (r < sz-1 && ts[l] == ts[r]) r++;
            int len = cp.raw(r) - cp.raw(l);
            rle.emplace_back(ts[l],len);
        }
    }
    int n = rle.size();
    ll ans = 0;
    for (int l = 0, r = 0; l < n; l = r){
        if (rle[r].first == 0){
            r++;
            continue;
        }
        while (r < n){
            if (rle[r].first == 0) break;
            if (r > l && rle[r-1].first + rle[r].first == 3) break;
            r++;
        }
        vector<pii> nrle(rle.begin()+l,rle.begin()+r);
        ans += calc(nrle);
    }
    out(ans);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0