結果

問題 No.2094 Symmetry
ユーザー a16784542a16784542
提出日時 2022-10-08 11:03:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 153 ms / 2,000 ms
コード長 4,005 bytes
コンパイル時間 4,793 ms
コンパイル使用メモリ 277,472 KB
実行使用メモリ 12,348 KB
最終ジャッジ日時 2024-06-22 11:09:48
合計ジャッジ時間 10,916 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 152 ms
12,336 KB
testcase_10 AC 151 ms
12,312 KB
testcase_11 AC 152 ms
12,296 KB
testcase_12 AC 151 ms
12,188 KB
testcase_13 AC 152 ms
12,296 KB
testcase_14 AC 153 ms
12,172 KB
testcase_15 AC 152 ms
12,164 KB
testcase_16 AC 151 ms
12,336 KB
testcase_17 AC 151 ms
12,292 KB
testcase_18 AC 151 ms
12,168 KB
testcase_19 AC 152 ms
12,224 KB
testcase_20 AC 151 ms
12,248 KB
testcase_21 AC 153 ms
12,296 KB
testcase_22 AC 151 ms
12,128 KB
testcase_23 AC 152 ms
12,292 KB
testcase_24 AC 151 ms
12,228 KB
testcase_25 AC 151 ms
12,348 KB
testcase_26 AC 152 ms
12,292 KB
testcase_27 AC 2 ms
6,940 KB
testcase_28 AC 131 ms
12,296 KB
testcase_29 AC 2 ms
6,944 KB
testcase_30 AC 139 ms
12,288 KB
testcase_31 AC 130 ms
12,296 KB
testcase_32 AC 138 ms
12,172 KB
testcase_33 AC 2 ms
6,940 KB
testcase_34 AC 100 ms
12,296 KB
testcase_35 AC 83 ms
12,168 KB
testcase_36 AC 78 ms
12,172 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__

struct Solver {
void solve() {
    int n,k;cin>>n>>k;
    n*=2;
    int b=0;
    rep(i,n){
        string s;cin>>s;
        b+=count(all(s),'#');
    }
    V<V<int>> c(n,V<int>(n));
    rep(i,n)rep(j,n)cin>>c[i][j];
    V<TP> x;
    rep(i,n){
        rep(j,n/2){
           x.emplace_back(c[i][j]+c[i][n-1-j],i,j); 
        }
    }
    sort(all(x),greater<>());
    x.emplace_back(0,0,0);
    auto f = [&](int t){
        V<int> res;
        rep(i,n)rep(j,n)res.emplace_back(c[i][j]);
        sort(all(res),greater<int>());
        return accumulate(res.begin(),res.begin()+t,0ll);
    };
    
    ll ans=f(b);
    if(b%2){cout<<ans<<endl;return ;}
    ll ans1=0;
    rep(i,b/2)ans1+=get<0>(x[i]);

    cout<<max(ans,ans1+k)<<endl;
    return ;
}};

signed main() {
    int ts = 1;
    // scanf("%lld",&ts);
    rep(ti,ts) {
        Solver solver;
        solver.solve();
    }
  return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;
template <class T> using V = vector<T>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}

const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+5;


#endif
0