結果

問題 No.2495 Three Sets
ユーザー umimel
提出日時 2023-10-06 23:00:53
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 410 ms / 3,000 ms
コード長 5,373 bytes
コンパイル時間 1,542 ms
コンパイル使用メモリ 173,080 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-26 16:53:09
合計ジャッジ時間 8,790 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60;
const int IINF = (1 << 30) - 1;
template<typename T> struct Edge{
    int to; T w;
    Edge(int to_, T w_=1){
        to = to_;
        w=w_;
    }
};
template<typename T> using Tree = vector<vector<Edge<T>>>;
template<typename T> using Graph = vector<vector<Edge<T>>>;
/* 容量&重み付きエッジ for Dinic */
template<typename T> struct REdge{
    int to;
    T cap;
    T cost;
    int rev;
    REdge(int to_, T cap_, T cost_=1){
        to = to_;
        cap = cap_;
        cost = cost_;
    }
    
    REdge(int to_, T cap_, T cost_, int rev_){
        to = to_;
        cap = cap_;
        cost = cost_;
        rev = rev_;
    }
};
/* 残余グラフ for Dinic */
template<typename T> using RGraph = vector<vector<REdge<T>>>;
struct UnionFind{
    vector<ll> parent;
    vector<ll> sizes;
    
    UnionFind(ll N) : parent(N), sizes(N, 1){
        rep(i, N) parent[i] = i;
    }
    
    ll root(ll x){
        if (parent[x] == x) return x;
        return parent[x] = root(parent[x]);
    }
 
    void unite(ll x, ll y){
        ll rx = root(x);
        ll ry = root(y);
        if (rx == ry) return;
        if (sizes[rx] < sizes[ry]) swap(rx, ry);
        sizes[rx] += sizes[ry];
        parent[ry] = rx;
    }
 
    bool same(ll x, ll y){
        ll rx = root(x);
        ll ry = root(y);
        return rx == ry;
    }
 
    ll size(ll x){
        return sizes[root(x)];
    }
};
template<long long mod>
class modint{
    long long x;
public:
    modint(long long x=0) : x((x%mod+mod)%mod) {}
    modint operator-() const { 
      return modint(-x);
    }
    bool operator==(const modint& a){
        if(x == a) return true;
        else return false;
    }
    bool operator==(long long a){
        if(x == a) return true;
        else return false;
    }
    bool operator!=(const modint& a){
        if(x != a) return true;
        else return false;
    }
    bool operator!=(long long a){
        if(x != a) return true;
        else return false;
    }
    modint& operator+=(const modint& a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    modint& operator-=(const modint& a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    modint& operator*=(const  modint& a) {
        (x *= a.x) %= mod;
        return *this;
    }
    modint operator+(const modint& a) const {
        modint res(*this);
        return res+=a;
    }
    modint operator-(const modint& a) const {
        modint res(*this);
        return res-=a;
    }
    modint operator*(const modint& a) const {
        modint res(*this);
        return res*=a;
    }
    modint pow(long long t) const {
        if (!t) return 1;
        modint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime mod
    modint inv() const {
        return pow(mod-2);
    }
    modint& operator/=(const modint& a) {
        return (*this) *= a.inv();
    }
    modint operator/(const modint& a) const {
        modint res(*this);
        return res/=a;
    }
    friend std::istream& operator>>(std::istream& is, modint& m) noexcept {
        is >> m.x;
        m.x %= mod;
        if (m.x < 0) m.x += mod;
        return is;
    }
    friend ostream& operator<<(ostream& os, const modint& m){
        os << m.x;
        return os;
    }
};
using mint = modint<MOD998244353>;
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll NA, NB, NC; cin >> NA >> NB >> NC;
    vector<ll> A(NA), B(NB), C(NC);
    rep(i, NA) cin >> A[i];
    rep(j, NB) cin >> B[j];
    rep(k, NC) cin >> C[k];
    vector<ll> cntA(6001, 0), cntB(6001, 0), cntC(6001, 0);
    rep(i, NA) cntA[A[i]+3000]++;
    rep(j, NB) cntB[B[j]+3000]++;
    rep(k, NC) cntC[C[k]+3000]++;
    vector<ll> nsumA(6002, 0), csumA(6002, 0);
    for(ll i=6000; i>=0; i--) nsumA[i] = nsumA[i+1] + cntA[i]*(i-3000);
    for(ll i=6000; i>=0; i--) csumA[i] = csumA[i+1] + cntA[i];
    vector<ll> nsumB(6002, 0), csumB(6002, 0);
    for(ll j=6000; j>=0; j--) nsumB[j] = nsumB[j+1] + cntB[j]*(j-3000);
    for(ll j=6000; j>=0; j--) csumB[j] = csumB[j+1] + cntB[j];
    vector<ll> nsumC(6002, 0), csumC(6002, 0);
    for(ll k=6000; k>=0; k--) nsumC[k] = nsumC[k+1] + cntC[k]*(k-3000);
    for(ll k=6000; k>=0; k--) csumC[k] = csumC[k+1] + cntC[k];
    ll ans = -LINF;
    for(ll i=6000; i>=0; i--) for(ll j=6000; j>=0; j--){
        if(csumA[i]==0){ // NCまで取れる
            ans = max(ans, nsumA[i]*csumB[j]+nsumB[j]*NC+nsumC[0]*csumA[i]);
        }else{
            ll k;
            if(nsumB[j]<0){
                k = min(3000 + ((abs(nsumB[j])+csumA[i]-1)/csumA[i]), 6001LL);
            }else{
                k = max(3000 - (nsumB[j]/csumA[i]), 0LL);
            }
            ans = max(ans, nsumA[i]*csumB[j]+nsumB[j]*csumC[k]+nsumC[k]*csumA[i]);
        }
    }
    
    cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0