結果
問題 | No.2094 Symmetry |
ユーザー | stoq |
提出日時 | 2022-10-07 21:39:40 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 71 ms / 2,000 ms |
コード長 | 4,192 bytes |
コンパイル時間 | 2,382 ms |
コンパイル使用メモリ | 210,908 KB |
実行使用メモリ | 9,392 KB |
最終ジャッジ日時 | 2023-09-03 00:55:30 |
合計ジャッジ時間 | 6,167 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 70 ms
9,228 KB |
testcase_10 | AC | 70 ms
9,220 KB |
testcase_11 | AC | 71 ms
9,216 KB |
testcase_12 | AC | 70 ms
9,296 KB |
testcase_13 | AC | 70 ms
9,236 KB |
testcase_14 | AC | 69 ms
9,392 KB |
testcase_15 | AC | 70 ms
9,292 KB |
testcase_16 | AC | 70 ms
9,292 KB |
testcase_17 | AC | 70 ms
9,296 KB |
testcase_18 | AC | 70 ms
9,236 KB |
testcase_19 | AC | 71 ms
9,276 KB |
testcase_20 | AC | 70 ms
9,224 KB |
testcase_21 | AC | 70 ms
9,296 KB |
testcase_22 | AC | 69 ms
9,316 KB |
testcase_23 | AC | 70 ms
9,240 KB |
testcase_24 | AC | 70 ms
9,296 KB |
testcase_25 | AC | 70 ms
9,280 KB |
testcase_26 | AC | 70 ms
9,272 KB |
testcase_27 | AC | 1 ms
4,380 KB |
testcase_28 | AC | 43 ms
9,228 KB |
testcase_29 | AC | 2 ms
4,380 KB |
testcase_30 | AC | 45 ms
9,232 KB |
testcase_31 | AC | 44 ms
9,248 KB |
testcase_32 | AC | 46 ms
9,232 KB |
testcase_33 | AC | 1 ms
4,376 KB |
testcase_34 | AC | 36 ms
9,240 KB |
testcase_35 | AC | 32 ms
9,296 KB |
testcase_36 | AC | 36 ms
9,312 KB |
ソースコード
#define MOD_TYPE 2 #include <bits/stdc++.h> using namespace std; #if 0 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif #if 0 #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tag_and_trait.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <ext/rope> using namespace __gnu_pbds; using namespace __gnu_cxx; template <typename T> using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #endif #if 0 #include <boost/multiprecision/cpp_dec_float.hpp> #include <boost/multiprecision/cpp_int.hpp> using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif #pragma region Macros using ll = long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using pld = pair<ld, ld>; template <typename T> using smaller_queue = priority_queue<T, vector<T>, greater<T>>; constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; const double PI = acos(-1.0); constexpr double EPS = 1e-11; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; #define UNIQUE(v) v.erase(unique(all(v)), v.end()) struct io_init { io_init() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll floor(ll a, ll b) { if (b < 0) a *= -1, b *= -1; if (a >= 0) return a / b; return -((-a + b - 1) / b); } inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); } template <typename A, size_t N, typename T> inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template <typename T> vector<T> compress(vector<T> &v) { vector<T> val = v; sort(all(val)), val.erase(unique(all(val)), val.end()); for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin(); return val; } template <typename T, typename U> constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept { is >> p.first >> p.second; return is; } template <typename T, typename U> constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept { os << p.first << " " << p.second; return os; } template <typename T> constexpr istream &operator>>(istream &is, vector<T> &v) noexcept { for (int i = 0; i < v.size(); i++) is >> v[i]; return is; } template <typename T> constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept { for (int i = 0; i < v.size(); i++) os << v[i] << (i + 1 == v.size() ? "" : " "); return os; } template <typename T> constexpr void operator--(vector<T> &v, int) noexcept { for (int i = 0; i < v.size(); i++) v[i]--; } random_device seed_gen; mt19937_64 engine(seed_gen()); #pragma endregion // -------------------------------------- void solve() { ll n, k; cin >> n >> k; vector<string> s(n * 2); cin >> s; vector c(n * 2, vector<ll>(n * 2)); rep(i, n * 2) rep(j, n * 2) cin >> c[i][j]; // 貪欲 vector<ll> sc1, sc2; rep(i, n * 2) rep(j, n * 2) sc1.push_back(c[i][j]); rep(i, n * 2) rep(j, n) sc2.push_back(c[i][j] + c[i][n * 2 - j - 1]); sort(all(sc1)); sort(all(sc2)); reverse(all(sc1)); reverse(all(sc2)); int cnt = 0; rep(i, n * 2) rep(j, n * 2) { cnt += s[i][j] == '#'; } ll ans = accumulate(sc1.begin(), sc1.begin() + cnt, 0LL); if (cnt % 2 == 0) chmax(ans, accumulate(sc2.begin(), sc2.begin() + cnt / 2, 0LL) + k); cout << ans << "\n"; } int main() { solve(); }