結果
| 問題 | No.5002 stick xor |
| ユーザー |
|
| 提出日時 | 2018-04-29 16:32:19 |
| 言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 9,779 bytes |
| コンパイル時間 | 12,455 ms |
| 実行使用メモリ | 3,512 KB |
| スコア | 0 |
| 最終ジャッジ日時 | 2020-08-23 04:36:56 |
|
ジャッジサーバーID （参考情報） |
judge7 / judge6 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | TLE | - |
| testcase_02 | TLE | - |
| testcase_03 | TLE | - |
| testcase_04 | TLE | - |
| testcase_05 | TLE | - |
| testcase_06 | TLE | - |
| testcase_07 | TLE | - |
| testcase_08 | TLE | - |
| testcase_09 | TLE | - |
| testcase_10 | TLE | - |
| testcase_11 | TLE | - |
| testcase_12 | TLE | - |
| testcase_13 | TLE | - |
| testcase_14 | TLE | - |
| testcase_15 | TLE | - |
| testcase_16 | TLE | - |
| testcase_17 | TLE | - |
| testcase_18 | TLE | - |
| testcase_19 | TLE | - |
| testcase_20 | TLE | - |
| testcase_21 | TLE | - |
| testcase_22 | TLE | - |
| testcase_23 | TLE | - |
| testcase_24 | TLE | - |
| testcase_25 | TLE | - |
| testcase_26 | TLE | - |
| testcase_27 | TLE | - |
| testcase_28 | TLE | - |
| testcase_29 | TLE | - |
| testcase_30 | TLE | - |
| testcase_31 | TLE | - |
コンパイルメッセージ
main.cpp:157:32: warning: array index 50 is past the end of the array (which contains 50 elements) [-Warray-bounds]
int my_A[N][N]; copy(A[0], A[N], my_A[0]);
^ ~
main.cpp:114:1: note: array 'A' declared here
int L[K], A[N][N];
^
main.cpp:169:26: warning: array index 50 is past the end of the array (which contains 50 elements) [-Warray-bounds]
fill(sum[0], sum[N], 0);
^ ~
main.cpp:161:13: note: array 'sum' declared here
int sum[N][N + 1];
^
main.cpp:183:26: warning: array index 50 is past the end of the array (which contains 50 elements) [-Warray-bounds]
fill(sum[0], sum[N], 0);
^ ~
main.cpp:161:13: note: array 'sum' declared here
int sum[N][N + 1];
^
3 warnings generated.
ソースコード
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define debug(v) {printf("L%d %s > ",__LINE__,#v);cout<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_const<decltype(l)>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream &o, const Vec& p) { o << '['; for (auto& e : p) o << e << ','; o << ']'; return o; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }
#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
public:
template<typename T> void input_integer(T& var) {
var = 0; T sign = 1;
int cc = getchar_unlocked();
for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
if (cc == '-') sign = -1;
for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
var = (var << 3) + (var << 1) + cc - '0';
var = var * sign;
}
inline int c() { return getchar_unlocked(); }
inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
inline MaiScanner& operator>>(string& var) {
int cc = getchar_unlocked();
for (; !isvisiblechar(cc); cc = getchar_unlocked());
for (; isvisiblechar(cc); cc = getchar_unlocked())
var.push_back(cc);
return *this;
}
template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
public:
template<typename T>
void output_integer(T var) {
if (var == 0) { putchar_unlocked('0'); return; }
if (var < 0)
putchar_unlocked('-'),
var = -var;
char stack[32]; int stack_p = 0;
while (var)
stack[stack_p++] = '0' + (var % 10),
var /= 10;
while (stack_p)
putchar_unlocked(stack[--stack_p]);
}
inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
inline MaiPrinter& operator<<(const string& str) {
const char* p = str.c_str();
const char* l = p + str.size();
while (p < l) putchar_unlocked(*p++);
return *this;
}
template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
};
}
MaiScanner scanner;
MaiPrinter printer;
#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
// Rectangle
struct Rect {
int top, left, bottom, right;
Rect(int t = 0, int l = 0, int b = 0, int r = 0) :top(t), left(l), bottom(b), right(r) { }
inline int area() { return (right - left + 1)*(bottom - top + 1); }
inline bool operator==(Rect r) const { return top == r.top&&left == r.left&&bottom == r.bottom&&right == r.right; }
inline bool operator<(Rect r) const { return make_tuple(top, left, bottom, right) < make_tuple(r.top, r.left, r.bottom, r.right); }
};
// 問題文と入力
const int N = 50, K = 500;
int L[K], A[N][N];
const int Lmax = 25;
// 長さiの長方形のインデックス
// L[j]=iであるようなjの集合が格納される．
vector<int> idxsL[Lmax + 1];
//
vector<Rect> result[Lmax + 1];
inline void apply(int f[N][N], Rect r) {
iterate(y, r.top, r.bottom + 1)
iterate(x, r.left, r.right + 1)
f[y][x] ^= 1;
}
//
void input() {
int n, k;
scanner >> n >> k;
assert(n == N && k == K);
scanner.in(L, L + K);
repeat(i, N) {
string str; scanner >> str;
repeat(j, N) A[i][j] = str[j] == '1';
}
// - - - - -
repeat(i, K)
idxsL[L[i]].push_back(i);
}
//
int solve() {
int my_A[N][N]; copy(A[0], A[N], my_A[0]);
diterate(l, Lmax, 4) {
repeat(_, idxsL[l].size()) {
int sum[N][N + 1];
int best_score = -1;
Rect best_rect;
decltype(randdev()) best_seed;
// 水平方向に置く場合を全探索
// 累積和
fill(sum[0], sum[N], 0);
repeat(y, N) repeat(x, N)
sum[y][x + 1] = sum[y][x] + my_A[y][x];
// 探索
repeat(y, N) repeat(x, N + 1 - l) {
int score = sum[y][x + l] - sum[y][x] + (my_A[y][x] * my_A[y][x + l - 1]) * 5;
if (best_score < score || (best_score == score && randdev() & 1))
best_score = score,
best_rect = Rect(y, x, y, x + l - 1);
}
// 垂直方向に置く場合を全探索
// 累積和
fill(sum[0], sum[N], 0);
repeat(x, N) repeat(y, N)
sum[x][y + 1] = sum[x][y] + my_A[y][x];
// 探索
repeat(x, N) repeat(y, N + 1 - l) {
int score = sum[x][y + l] - sum[x][y] + (my_A[y][x] * my_A[y + l - 1][x]) * 5;
if (best_score < score || (best_score == score && best_seed < randdev()))
best_score = score,
best_rect = Rect(y, x, y + l - 1, x),
best_seed = randdev();
}
result[l].push_back(best_rect);
apply(my_A, best_rect);
}
}
diterate(l, 4, 0) {
repeat(_, idxsL[l].size()) {
int best_score = -1;
Rect best_rect;
// 水平方向に置く場合を全探索
// 探索
repeat(y, N) repeat(x, N + 1 - l) {
int score = 0;
repeat(i, l) score += my_A[y][x + i];
if (best_score < score || (best_score == score && randdev() & 1))
best_score = score,
best_rect = Rect(y, x, y, x + l - 1);
}
// 垂直方向に置く場合を全探索
// 探索
repeat(x, N) repeat(y, N + 1 - l) {
int score = 0;
repeat(i, l) score += my_A[y + i][x];
if (best_score < score || (best_score == score && randdev() & 1))
best_score = score,
best_rect = Rect(y, x, y + l - 1, x);
}
result[l].push_back(best_rect);
apply(my_A, best_rect);
}
}
{
int score = 0;
repeat(i, N) repeat(j, N) score += my_A[i][j];
return score;
}
}
//
void output() {
vector<Rect> answer(K);
iterate(l, 1, Lmax + 1) repeat(i, idxsL[l].size()) {
answer[idxsL[l][i]] = result[l][i];
}
for (Rect r : answer)
printf("%d %d %d %d\n", r.top + 1, r.left + 1, r.bottom + 1, r.right + 1);
}
//
int main() {
auto beginTime = TIME;
//
input();
// 無理矢理な焼きなまし化
//
int best_score = 1e9;
vector<Rect> best_result[Lmax + 1];
while (MILLISEC(TIME - beginTime) < 960) {
int score = solve();
if (best_score > score) {
best_score = score;
iterate(l, 1, Lmax + 1)
best_result[l].swap(result[l]),
result[l].clear();
}
}
//
iterate(l, 1, Lmax + 1)
best_result[l].swap(result[l]);
output();
return 0;
}