結果
| 問題 | No.5002 stick xor |
| ユーザー |
 __math
|
| 提出日時 | 2018-05-25 23:38:01 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 6,791 bytes |
| コンパイル時間 | 5,504 ms |
| 実行使用メモリ | 2,448 KB |
| スコア | 0 |
| 最終ジャッジ日時 | 2018-05-25 23:38:08 |
|
ジャッジサーバーID （参考情報） |
judge9 / |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | -- | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
ソースコード
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ' '); writer(y, ' '); writer(z, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }
template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
ll ret = 1;
ll p = a % mod;
while (n) {
if (n & 1) ret = ret * p % mod;
p = p * p % mod;
n >>= 1;
}
return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; }
struct Stage {
int n, k;
vector<int> l;
bool a[60][60];
};
struct Ans {
int a, b, c, d;
Ans() {};
Ans(int a, int b, int c, int d) : a(a), b(b), c(c), d(d) {}
};
int printScore(const Stage& st, bool a[60][60]) {
const int n = st.n;
int s = 0;
FOR(i, n) FOR(j, n) s += 1 - a[i][j];
fprintf(stderr, " score = %d\n", s);
return s;
}
vector<Ans> solve(const Stage& st) {
const int n = st.n;
vector<Pii> lmap;
FOR(i, st.k) lmap.emplace_back(st.l[i], i);
sort(lmap.rbegin(), lmap.rend());
bool ca[60][60];
memcpy(ca, st.a, sizeof(ca));
vector<Ans> ret(st.k);
for (auto &kv : lmap) {
const int l = kv.first;
Ans use; int add = -100;
FOR(i, n) FOR(j, n) {
if (i + l <= n) {
int cur = 0;
FOR(k, l) cur += ca[i+k][j];
if (add < cur) {
add = cur;
use = Ans(i, j, i + l - 1, j);
}
}
if (j + l <= n) {
int cur = 0;
FOR(k, l) cur += ca[i][j + k];
if (add < cur) {
add = cur;
use = Ans(i, j, i, j + l - 1);
}
}
}
for (int a = use.a; a <= use.c; a++) {
for (int b = use.b; b <= use.d; b++) {
ca[a][b] = !ca[a][b];
}
}
ret[kv.second] = use;
}
// int st1Score = printScore(st, ca);
FOR(_, ten(5)) {
int id = rand() % st.k;
auto cur = ret[id];
int curAdd = 0;
for (int a = cur.a; a <= cur.c; a++) {
for (int b = cur.b; b <= cur.d; b++) {
curAdd += ca[a][b] * 2 - 1;
ca[a][b] = !ca[a][b];
}
}
curAdd = -curAdd;
const int l = st.l[id];
Ans use; int add = -100;
FOR(i, n) FOR(j, n) {
if (i + l <= n) {
int csc = 0;
FOR(k, l) csc += ca[i + k][j] * 2 - 1;
if (add < csc) {
add = csc;
use = Ans(i, j, i + l - 1, j);
}
}
if (j + l <= n) {
int csc = 0;
FOR(k, l) csc += ca[i][j + k] * 2 - 1;
if (add < csc) {
add = csc;
use = Ans(i, j, i, j + l - 1);
}
}
}
if (curAdd < add) {
for (int a = use.a; a <= use.c; a++) {
for (int b = use.b; b <= use.d; b++) {
ca[a][b] = !ca[a][b];
}
}
// int nscore = printScore(st, ca);
// fprintf(stderr, " %d -> %d\n", st1Score, nscore);
// st1Score = nscore;
} else {
for (int a = cur.a; a <= cur.c; a++) {
for (int b = cur.b; b <= cur.d; b++) {
ca[a][b] = !ca[a][b];
}
}
}
}
int st2Score = printScore(st, ca);
return ret;
}
int main() {
Stage st;
while (cin >> st.n >> st.k) {
st.l.resize(st.k);
FOR(i, st.k) reader(st.l[i]);
FOR(i, st.n) {
string a; reader(a);
FOR(j, st.n) st.a[i][j] = (a[j] == '1');
}
auto ans = solve(st);
for (auto x : ans) {
writerLn(x.a + 1, x.b + 1, x.c + 1, x.d + 1);
}
}
return 0;
}