結果
| 問題 | No.2495 Three Sets |
| ユーザー |
 ゆにぽけ
|
| 提出日時 | 2023-10-07 11:05:30 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2,850 ms / 3,000 ms |
| コード長 | 5,195 bytes |
| コンパイル時間 | 1,495 ms |
| コンパイル使用メモリ | 132,140 KB |
| 最終ジャッジ日時 | 2025-02-17 06:05:46 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 18 |
ソースコード
#include<iostream>#include<vector>#include<algorithm>#include<cstring>#include<cassert>#include<cmath>#include<ctime>#include<iomanip>#include<numeric>#include<stack>#include<queue>#include<map>#include<unordered_map>#include<set>#include<unordered_set>#include<bitset>#include<random>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};using mint = modint<998244353>;//using mint = modint<1000000007>;template<class S>struct combination{vector<S> f,invf;combination(int N = 0) : f(1,1),invf(1,1){update(N);}void update(int N){if((int)f.size() > N) return;int pi = (int)f.size();N = max(N,pi*2);f.resize(N+1),invf.resize(N+1);for(int i = pi;i <= N;i++) f[i] = f[i-1]*i;invf[N] = S(1)/f[N];for(int i = N-1;i >= pi;i--) invf[i] = invf[i+1]*(i+1);}S factorial(int N){update(N);return f[N];}S invfactorial(int N){update(N);return invf[N];}S P(int N,int K){assert(0 <= K && K <= N);update(N);return f[N]*invf[N-K];}S C(int N,int K){assert(0 <= K && K <= N);update(N);return f[N]*invf[K]*invf[N-K];}S H(int N,int K){if(!N) return K == 0 ? 1:0;return C(N+K-1,K);}};#include<algorithm>#include<vector>#include<cassert>using namespace std;struct UnionFind{private:int n;vector<int> par,siz;public:UnionFind(int n) :n(n),par(n,-1),siz(n,1) {}int root(int u){assert(0 <= u && u < n);return (par[u] < 0 ? u:par[u] = root(par[u]));}bool same(int u,int v){assert(0 <= u && u < n && 0 <= v && v < n);return root(u) == root(v);}bool unite(int u,int v){assert(0 <= u && u < n && 0 <= v && v < n);u = root(u),v = root(v);if(u == v) return false;if(siz[u] < siz[v]) swap(u,v);siz[u] += siz[v];par[v] = u;return true;}int size(int u){assert(0 <= u && u < n);return siz[root(u)];}vector<vector<int>> components(){vector<vector<int>> ret(n);for(int u = 0;u < n;u++) ret[root(u)].push_back(u);ret.erase(remove_if(ret.begin(),ret.end(),[](vector<int> v) { return v.empty();}),ret.end());return ret;}};int N[3];vector<int> A[3];vector<long long> S[3];int memo[6001];void solve(){for(int i = 0;i < 3;i++) cin >> N[i];for(int i = 0;i < 3;i++){A[i].resize(N[i]);for(int j = 0;j < N[i];j++) cin >> A[i][j];sort(A[i].rbegin(),A[i].rend());S[i].resize(N[i]+1);for(int j = 0;j < N[i];j++) S[i][j+1] = S[i][j] + A[i][j];reverse(A[i].begin(),A[i].end());}long long ans = 0;int ai = 0;for(int a = -3000;a <= 3000;a++){while(ai < N[0] && A[0][ai] < a) ai++;int bi = 0;for(int b = -3000;b <= 3000;b++){if(a == -3000) while(bi < N[1] && A[1][bi] < b) bi++,memo[b+3000] = bi;else bi = memo[b+3000];int i = N[0]-ai,j = N[1]-bi;long long sum = S[0][i]*j;if(i == 0){int k = N[2];sum += S[1][j]*k;}else{auto cit = lower_bound(A[2].begin(),A[2].end(),-S[1][j]/i);int k = A[2].end()-cit;sum += S[1][j]*k + S[2][k]*i;}ans = max(ans,sum);}}cout << ans << endl;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int T = 1;//cin >> T;while(T--) solve();}