結果
| 問題 | No.5002 stick xor |
| ユーザー |
|
| 提出日時 | 2018-03-16 21:35:33 |
| 言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 11,464 bytes |
| コンパイル時間 | 13,480 ms |
| 実行使用メモリ | 3,340 KB |
| スコア | 0 |
| 最終ジャッジ日時 | 2020-08-23 04:36:15 |
|
ジャッジサーバーID （参考情報） |
judge10 / judge10 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| 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 | - |
ソースコード
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#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(decltype(l) 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))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> 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);
inline ll rand_range(ll l, ll h) {
return uniform_int_distribution<ll>(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;
// ソートしてi番目の値は 元々idx[i]番目の値
// 元々i番目の値は ソートするとidxr[i]番目の値
template <typename ITER>
void sort_index(const ITER begin, const ITER end, vector<int> &idx, vector<int> &idxr) {
size_t n = end - begin;
idx.resize(n);
idxr.resize(n);
for (int i = 0; i < n; ++i) idx[i] = i;
sort(idx.begin(), idx.end(), [&begin](int l, int r) {return begin[l] < begin[r]; });
for (int i = 0; i < n; ++i) idxr[idx[i]] = i;
}
struct Stick {
int len; // 実効長さ
int idx1, idx2; // 元の棒のインデックス
int len1, len2; // 元の棒の長さ
Stick(int l1, int i1) :len(l1), idx1(i1), len1(l1) { }
Stick(int l, int i1, int i2, int l1, int l2) :len(l), idx1(i1), idx2(i2), len1(l1), len2(l2) {
if (len1 < len2) swap(len1, len2), swap(idx1, idx2);
}
inline bool single() const { return len == len1; }
};
int n, kei;
vector<int> len[55];
int aa[55][55];
vector<Stick> sticks;
int answers[2020][4];
int colsum[55][55], rowsum[55][55];
int main() {
scanner >> n >> kei;
repeat(i, kei) {
int l;
scanner >> l;
len[l].push_back(i);
}
repeat(y, n) {
string str;
scanner >> str;
repeat(x, n) {
aa[y][x] = str[x] == '1';
}
}
// step 1
for (int l = 50; 4 <= l; --l) {
while (!len[l].empty()) {
int i = len[l].back();
// 累積和
repeat(y, n) {
repeat(x, n) {
rowsum[y][x + 1] = rowsum[y][x] + aa[y][x];
}
}
repeat(x, n) {
repeat(y, n) {
colsum[x][y + 1] = colsum[x][y] + aa[y][x];
}
}
// 貪欲
array<int, 4> best_r = { 0,0,0,0 };
repeat(y, n) {
repeat(x, n) {
if (x + l <= n) {
maxset(best_r, array<int, 4>{rowsum[y][x + l] - rowsum[y][x], y, x, 0});
}
if (y + l <= n) {
maxset(best_r, array<int, 4>{colsum[x][y + l] - colsum[x][y], y, x, 1});
}
}
}
if (best_r[0]*100/l < 75) {
break;
}
if (best_r[3] == 0) {
answers[i][0] = best_r[1] + 1; answers[i][1] = best_r[2] + 1;
answers[i][2] = best_r[1] + 1; answers[i][3] = best_r[2] + l;
repeat(t, l)
aa[best_r[1]][best_r[2] + t] ^= 1;
}
else if (best_r[3] == 1) {
answers[i][0] = best_r[1] + 1; answers[i][1] = best_r[2] + 1;
answers[i][2] = best_r[1] + l; answers[i][3] = best_r[2] + 1;
repeat(t, l)
aa[best_r[1] + t][best_r[2]] ^= 1;
}
len[l].pop_back();
}
}
// step2
sticks.reserve(kei);
for (int l = 50; 9 <= l; --l) {
while (!len[l].empty()) {
int t = l - 1;
while (len[t].empty()) --t;
sticks.emplace_back(l - t, len[l].back(), len[t].back(), l, t);
len[l].pop_back();
len[t].pop_back();
}
}
for (int l = 1; l < 50; ++l) {
while (!len[l].empty()) {
sticks.emplace_back(l, len[l].back());
len[l].pop_back();
}
}
sort(ALL(sticks), [](const Stick& l, const Stick& r) {return l.len > r.len; });
// step3
for (const Stick& stick : sticks) {
// 累積和
repeat(y, n) {
repeat(x, n) {
rowsum[y][x + 1] = rowsum[y][x] + aa[y][x];
}
}
repeat(x, n) {
repeat(y, n) {
colsum[x][y + 1] = colsum[x][y] + aa[y][x];
}
}
// 貪欲
int l = stick.len;
array<int, 4> best_r = { 0,0,0,0 };
repeat(y, n) {
repeat(x, n) {
if (x + l <= n) {
maxset(best_r, array<int, 4>{rowsum[y][x + l] - rowsum[y][x], y, x, 0});
}
if (y + l <= n) {
maxset(best_r, array<int, 4>{colsum[x][y + l] - colsum[x][y], y, x, 1});
}
assert(best_r[0] < 1e3);
}
}
if (best_r[3] == 0) {
if (stick.single()) {
int i = stick.idx1;
answers[i][0] = best_r[1] + 1; answers[i][1] = best_r[2] + 1;
answers[i][2] = best_r[1] + 1; answers[i][3] = best_r[2] + l;
}
else {
if (best_r[2] - stick.len2 < 0) {
answers[stick.idx1][0] = best_r[1] + 1; answers[stick.idx1][1] = best_r[2] + 1;
answers[stick.idx1][2] = best_r[1] + 1; answers[stick.idx1][3] = best_r[2] + stick.len1;
answers[stick.idx2][0] = best_r[1] + 1; answers[stick.idx2][1] = best_r[2] + l + 1;
answers[stick.idx2][2] = best_r[1] + 1; answers[stick.idx2][3] = best_r[2] + stick.len1;
}
else {
answers[stick.idx1][0] = best_r[1] + 1; answers[stick.idx1][1] = best_r[2] - stick.len2 + 1;
answers[stick.idx1][2] = best_r[1] + 1; answers[stick.idx1][3] = best_r[2] + l;
answers[stick.idx2][0] = best_r[1] + 1; answers[stick.idx2][1] = best_r[2] - stick.len2 + 1;
answers[stick.idx2][2] = best_r[1] + 1; answers[stick.idx2][3] = best_r[2];
}
}
repeat(t, l)
aa[best_r[1]][best_r[2] + t] ^= 1;
}
else if (best_r[3] == 1) {
if (stick.single()) {
int i = stick.idx1;
answers[i][0] = best_r[1] + 1; answers[i][1] = best_r[2] + 1;
answers[i][2] = best_r[1] + l; answers[i][3] = best_r[2] + 1;
}
else {
if (best_r[1] - stick.len2 < 0) {
answers[stick.idx1][0] = best_r[1] + 1; answers[stick.idx1][1] = best_r[2] + 1;
answers[stick.idx1][2] = best_r[1] + stick.len1; answers[stick.idx1][3] = best_r[2] + 1;
answers[stick.idx2][0] = best_r[1] + l + 1; answers[stick.idx2][1] = best_r[2] + 1;
answers[stick.idx2][2] = best_r[1] + stick.len1; answers[stick.idx2][3] = best_r[2] + 1;
}
else {
answers[stick.idx1][0] = best_r[1] - stick.len2 + 1; answers[stick.idx1][1] = best_r[2] + 1;
answers[stick.idx1][2] = best_r[1] + l; answers[stick.idx1][3] = best_r[2] + 1;
answers[stick.idx2][0] = best_r[1] - stick.len2 + 1; answers[stick.idx2][1] = best_r[2] + 1;
answers[stick.idx2][2] = best_r[1]; answers[stick.idx2][3] = best_r[2] + 1;
}
}
repeat(t, l)
aa[best_r[1] + t][best_r[2]] ^= 1;
}
}
repeat(i, kei) {
printer
<< answers[i][0] << ' ' << answers[i][1] << ' '
<< answers[i][2] << ' ' << answers[i][3] << '\n';
}
// debugaa(aa, n, n);
return 0;
}