結果
問題 | No.2094 Symmetry |
ユーザー |
![]() |
提出日時 | 2022-10-07 22:38:49 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 164 ms / 2,000 ms |
コード長 | 2,529 bytes |
コンパイル時間 | 4,485 ms |
コンパイル使用メモリ | 260,000 KB |
最終ジャッジ日時 | 2025-02-07 23:41:17 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#include <math.h> #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; #define print(n) cout << (n) << endl #define fprint(n) cout << setprecision(16) << (n) << endl #define ceil_div(a, b) (((a) - 1) / (b) + 1) #define rep(i, l, n) for (int i = (l); i < (n); i++) #define itrep(itr, st) for (auto itr = st.begin(); itr != st.end(); itr++) #define ite(i, a) for (auto& i : a) #define all(x) x.begin(), x.end() #define lb(A, x) (lower_bound(all(A), x) - A.begin()) #define ub(A, x) (upper_bound(all(A), x) - A.begin()) using str = string; using ll = long long; using u32 = unsigned int; using u64 = unsigned long long; using Pair = pair<int, int>; using mint = modint1000000007; using Mint = modint998244353; template <class T> using V = vector<T>; template <class T> using VV = V<V<T> >; template <class T> using PQ = priority_queue<T, V<T>, greater<T> >; template <class T> using PQR = priority_queue<T>; template <class T> using BIT = fenwick_tree<T>; const ll INF = 4611686018427387903; const int inf = 2147483647; const ll mod = 1000000007; const ll MOD = 998244353; template <class T> inline V<T> getList(int n) { V<T> res(n); rep(i, 0, n) { cin >> res[i]; }return res; } template <class T> inline VV<T> getGrid(int m, int n) { VV<T> res(m, V<T>(n)); rep(i, 0, m) { res[i] = getList<T>(n); }return res; } template <class T> inline void prints(V<T>& vec) { if (vec.size() == 0)return; cout << vec[0]; rep(i, 1, vec.size()) { cout << ' ' << vec[i]; } cout << '\n'; } inline V<int> dtois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - '0'); } return vec; } inline V<int> atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'a'); } return vec; } inline V<int> Atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'A'); } return vec; } int main(void) { ll N, K; cin >> N >> K; ll N2 = N << 1; V<str> s = getList<str>(N2); VV<ll> c = getGrid<ll>(N2, N2); ll black = 0; V<ll> score = {}; rep(i, 0, N2) { rep(j, 0, N2) { score.push_back(c[i][j]); black += (s[i][j] == '#'); } } sort(all(score)); //シンメトリーを狙わない ll ans = 0; rep(i, 0, black) { ans += score[N2 * N2 - i - 1]; } if (black & 1) { print(ans); return 0; } //シンメトリーを狙う ll ans2 = K; score = {}; rep(i, 0, N2) { rep(j, 0, N) { score.push_back(c[i][j] + c[i][N2 - j - 1]); } } sort(all(score)); rep(i, 0, black >> 1) { ans2 += score[N2 * N - i - 1]; } ans = max(ans, ans2); print(ans); return 0; }