結果
| 問題 | No.861 ケーキカット |
| ユーザー |
 jell
|
| 提出日時 | 2019-08-17 20:40:38 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,410 bytes |
| コンパイル時間 | 1,427 ms |
| コンパイル使用メモリ | 121,532 KB |
| 実行使用メモリ | 265,784 KB |
| 最終ジャッジ日時 | 2024-09-25 04:26:31 |
| 合計ジャッジ時間 | 15,753 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 538 ms
265,784 KB |
| testcase_01 | AC | 535 ms
265,628 KB |
| testcase_02 | AC | 542 ms
265,460 KB |
| testcase_03 | AC | 540 ms
265,476 KB |
| testcase_04 | AC | 540 ms
265,584 KB |
| testcase_05 | AC | 540 ms
265,628 KB |
| testcase_06 | AC | 541 ms
265,460 KB |
| testcase_07 | AC | 547 ms
265,604 KB |
| testcase_08 | AC | 529 ms
265,480 KB |
| testcase_09 | AC | 545 ms
265,560 KB |
| testcase_10 | AC | 543 ms
265,488 KB |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
ソースコード
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#if !defined(LOCAL) && !defined(DEBUG)
#pragma GCC optimize("Ofast")
#endif
#include <cassert>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <complex>
#include <iomanip>
#include <bitset>
#include <random>
#define iostream_untie true
#define stdout_precision 10
#define stderr_precision 10
#define itrep(i,v) for(auto i = begin(v); i != end(v); ++i)
#define ritrep(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define rep(i,n) for(int_fast64_t i = 0; i < (int_fast64_t)(n); ++i)
#define rrep(i,n) for(int_fast64_t i = (int_fast64_t)(n) - 1; i >= 0; --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcountll
using namespace std;
using i64 = int_fast64_t;
using pii = pair<int, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> constexpr T inf = numeric_limits<T>::max() / (T)2 - (T)1234567;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double Pi = 3.1415926535897932384626433832;
constexpr long double Golden = 1.61803398874989484820;
namespace setup {
struct setupper {
setupper() {
if(iostream_untie) {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
// std::cout.tie(nullptr);
// std::cerr.tie(nullptr);
}
std::cout << std::fixed << std::setprecision(stdout_precision);
std::cerr << std::fixed << std::setprecision(stderr_precision);
#ifdef LOCAL
if(!freopen("stderr.txt","wt",stderr)) {
freopen("CON","wt",stderr);
std::cerr << "Failed to open the stderr file\n";
}
if(!freopen("stdout.txt","wt",stdout)) {
freopen("CON","wt",stdout);
std::cerr << "Failed to open the stdout file\n";
}
// auto print_atexit = []() {
// std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n";
// std::cerr << "------------\n";
// };
// atexit((void(*)())print_atexit);
#endif
}
} __setupper;
}
namespace std {
template <class RAitr> void rsort(RAitr __first, RAitr __last) {
sort(__first, __last, greater<>());
}
template <class T> void hash_combine(size_t &seed, T const &key) {
seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
template <class T, class U> struct hash<pair<T,U>> {
size_t operator()(pair<T,U> const &pr) const
{
size_t seed = 0;
hash_combine(seed,pr.first);
hash_combine(seed,pr.second);
return seed;
}
};
template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1>
struct hashval_calc {
static void apply(size_t& seed, tuple_t const& t) {
hashval_calc<tuple_t, index - 1>::apply(seed, t);
hash_combine(seed,get<index>(t));
}
};
template <class tuple_t>
struct hashval_calc<tuple_t, 0> {
static void apply(size_t& seed, tuple_t const& t) {
hash_combine(seed,get<0>(t));
}
};
template <class ...T> struct hash<tuple<T...>> {
size_t operator()(tuple<T...> const& t) const
{
size_t seed = 0;
hashval_calc<tuple<T...>>::apply(seed,t);
return seed;
}
};
}
template <class T, class U> istream &operator>> (istream &s, pair<T,U> &p) { return s >> p.first >> p.second; }
template <class T, class U> ostream &operator<< (ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; }
template <class T> istream &operator>> (istream &s, vector<T> &v) { for(T &e : v) { s >> e; } return s; }
template <class T> ostream &operator<< (ostream &s, const vector<T> &v) {
for(size_t i = 0; i < v.size(); ++i) { s << (i ? " " : "") << v[i]; } return s;
}
template <class tuple_t, size_t index>
struct tupleos {
static ostream &apply(ostream &s, const tuple_t &t) {
tupleos<tuple_t,index - 1>::apply(s,t);
return s << " " << get<index>(t);
}
};
template <class tuple_t>
struct tupleos<tuple_t, 0> {
static ostream &apply(ostream &s, const tuple_t &t) {
return s << get<0>(t);
}
};
template <class ...T> ostream &operator<< (ostream &s, const tuple<T...> &t) {
return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(s,t);
}
template <> ostream &operator<< (ostream &s, const tuple<> &t) { return s; }
#ifdef DEBUG
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ", dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)
template <class P> void read(P __first, P __second) {
for(P i = __first; i != __second; ++i) cin >> *i;
}
namespace updater {
template <class T> static void add(T &x, const T &y) { x += y; }
template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; }
template <class T> static void mul(T &x, const T &y) { x *= y; }
template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); }
template <class T> static bool chmax(T &x, const T &y) { return x < y ? x = y, true : false; }
template <class T> static bool chmin(T &x, const T &y) { return x > y ? x = y, true : false; }
};
using updater::add;
using updater::mul;
using updater::chmax;
using updater::chmin;
template <class T> constexpr T minf(const T &x, const T &y) { return min(x,y); }
template <class T> constexpr T maxf(const T &x, const T &y) { return max(x,y); }
constexpr bool odd(int_fast64_t n) { return n & 1; }
constexpr bool even(int_fast64_t n) { return (int)odd(n) ^ 1; }
constexpr bool bit(int_fast64_t n, int e) { return (n >> e) & 1; }
constexpr int_fast64_t mask(int_fast64_t n, int e) { return n & ((1 << e) - 1); }
constexpr int_fast64_t ilog(int_fast64_t x, int_fast64_t b = 2) { return x ? 1 + ilog(x / b, b) : -1; }
constexpr int_fast64_t gcd(int_fast64_t x, int_fast64_t y) { return x = max(x, -x), y = max(y, -y) ? gcd(y, x % y) : x; }
constexpr int_fast64_t lcm(int_fast64_t x, int_fast64_t y) { return x ? x / gcd(x, y) * y : 0; }
int_fast64_t binry(int_fast64_t ok, int_fast64_t ng, const function<bool(int_fast64_t)> &fn) {
while (abs(ok - ng) > 1) {
int_fast64_t mid = (ok + ng) / 2;
(fn(mid) ? ok : ng) = mid;
}
return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array, (T*)(array + N), val); }
template <class T> vector<int> cmprs(const vector<T> &v) {
vector<T> tmp = v; vector<int> ret;
sort(begin(tmp),end(tmp));
tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
for(T i : v) ret.emplace_back(lower_bound(begin(tmp),end(tmp),i) - begin(tmp));
return ret;
}
template <class T> vector<int> cmprs(const T *__first, const T *__last) {
return cmprs(vector<T>(__first, __last));
}
void for_subset(int_fast64_t s, const function<void(int_fast64_t)> &fn) {
int_fast64_t tmp = s;
do { fn(tmp); } while((--tmp &= s) != s);
}
/* The main code follows. */
signed main() {
void solve();
void input();
int t = 1;
// cin >> t;
while(t--) {
input();
solve();
}
}
i64 c[5][5];
void input() {
for(int i=0; i<5; ++i) {
read(c[i],c[i]+5);
}
}
i64 _rec[1<<25];
i64 ans=inf<i64>;
i64 all;
void solve() {
void rec(int s);
memset(_rec,-1,sizeof(_rec));
for(int i=0; i<5; ++i) {
for(int j=0; j<5; ++j) {
all+=c[i][j];
}
}
rec(1);
write(ans);
}
void rec(int s) {
if(~_rec[s]) return;
_rec[s]=0;
for(int i=0; i<25; ++i) {
if(s>>i&1) {
_rec[s]+=c[i/5][i%5];
}
}
ans=min(ans,abs(all-_rec[s]*2));
for(int i=0; i<25; ++i) {
if(s>>i&1) {
int x=i/5;
int y=i%5;
for(int k=0; k<4; ++k) {
int xx=x+dx[k];
int yy=y+dy[k];
if(xx>=0 and yy>=0 and xx<5 and yy<5) {
int z=xx*5+yy;
rec(1<<z|s);
}
}
}
}
}