結果
問題 | No.2261 Coffee |
ユーザー |
👑 ![]() |
提出日時 | 2023-04-07 22:11:24 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 837 ms / 2,000 ms |
コード長 | 3,832 bytes |
コンパイル時間 | 25,775 ms |
コンパイル使用メモリ | 358,860 KB |
最終ジャッジ日時 | 2025-02-12 01:32:16 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } ll my_pow(ll x, ll n, ll mod){ // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0){ ret = 1; } else if (n % 2 == 1){ ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else{ ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } int main(){ ll N; cin >> N; vl A(N); vl B(N); vl C(N); vl D(N); vl E(N); rep(i,N){ cin >> A[i] >> B[i] >> C[i] >> D[i] >> E[i]; } vvl vec(N, vl(5)); for (ll i = 0; i < N; i++){ vec[i][0] = A[i]; vec[i][1] = B[i]; vec[i][2] = C[i]; vec[i][3] = D[i]; vec[i][4] = E[i]; } vvpll count(32, vpll(0)); for (ll i = 0; i < 32; i++){ for (ll j = 0; j < N; j++){ ll now_val = 0; for (ll k = 0; k < 5; k++){ if ((i >> k) & 1){ now_val = now_val + vec[j][k]; } else{ now_val = now_val - vec[j][k]; } } count[i].push_back(pll(now_val, j)); } } vl ans(N, 0); for (ll i = 0; i < 32; i++){ sort(all(count[i])); } for (ll i = 0; i < 32; i++){ for (ll j = 0; j < N; j++){ ans[count[i][j].second] = max(ans[count[i][j].second], count[i][N - 1].first - count[i][j].first); ans[count[i][j].second] = max(ans[count[i][j].second], count[i][j].first - count[i][0].first); } } for (ll i = 0; i < N; i++){ cout << ans[i] << endl; } }