#define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" #include #include #include using namespace std; //呪文 #define DUMPOUT cerr #define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"< pii; typedef pair pll; typedef pair pdd; typedef pair pss; template ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; } template ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}"; return ostr; } template ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; } template istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; } namespace aux { // print tuple template struct tp { static void print(ostream& os, const Ty& v) { os << get(v) << ", "; tp::print(os, v); } }; template struct tp { static void print(ostream& os, const Ty& value) { os << get(value); } }; } template ostream& operator<<(ostream& os, const tuple& t) { os << "{"; aux::tp, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; } template inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); } void dump_func() { DUMPOUT << endl; } template void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); } #define PI 3.14159265358979323846 #define EPS 1e-11 #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define all(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define fake false struct SXor128 { unsigned x, y, z, w; SXor128() { x = 123456789; y = 362436069; z = 521288629; w = 88675123; } SXor128(int _w) { x = 123456789; y = 362436069; z = 521288629; w = _w; } void setSeed() { x = 123456789; y = 362436069; z = 521288629; w = 88675123; } void setSeed(int _w) { x = 123456789; y = 362436069; z = 521288629; w = _w; } unsigned nextUInt() { unsigned t = (x ^ (x << 11)); x = y; y = z; z = w; return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8))); } // [0, mod) unsigned nextUInt(unsigned mod) { unsigned t = (x ^ (x << 11)); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); return w % mod; } // [l, r) unsigned nextUInt(unsigned l, unsigned r) { unsigned t = (x ^ (x << 11)); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); return w % (r - l) + l; } }; int N, K; vector L; SXor128 rnd; unsigned long long popcountll(unsigned long long x) { x = ((x & 0xaaaaaaaaaaaaaaaaUL) >> 1) + (x & 0x5555555555555555UL); x = ((x & 0xccccccccccccccccUL) >> 2) + (x & 0x3333333333333333UL); x = ((x & 0xf0f0f0f0f0f0f0f0UL) >> 4) + (x & 0x0f0f0f0f0f0f0f0fUL); x = ((x & 0xff00ff00ff00ff00UL) >> 8) + (x & 0x00ff00ff00ff00ffUL); x = ((x & 0xffff0000ffff0000UL) >> 16) + (x & 0x0000ffff0000ffffUL); x = ((x & 0xffffffff00000000UL) >> 32) + (x & 0x00000000ffffffffUL); return x; } struct State { vector board; int score; vector> op; State(vector init_board) : board(init_board), score(0) {} friend ostream& operator << (ostream& os, const State& s) { cout << "Score = " << s.score << endl; for (int i = 0; i < s.board.size(); i++) cout << s.board[i] << endl; return os; } void randomFlip(int index) { int length = L[index]; bool row = rnd.nextUInt() & 1; int sx, sy; if (row) { sy = rnd.nextUInt(N); sx = rnd.nextUInt(N - length + 1); } else { sy = rnd.nextUInt(N - length + 1); sx = rnd.nextUInt(N); } if (row) { ull mask = ((1LL << (sx + length)) - 1) ^ ((1LL << sx) - 1); score += L[index] - (popcountll(mask & board[sy]) << 1); board[sy] ^= mask; } else { ull mask = 1 << (sx - 1); for (int y = sy; y < sy + length; y++) { score += (board[y] & mask ? -1 : 1); board[y] ^= mask; } } if (row) op.push_back({ sy + 1, sx + 1, sy + 1, sx + length }); else op.push_back({ sy + 1, sx + 1, sy + length, sx + 1 }); } }; int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> N >> K; L.resize(K); cin >> L; vector input(N); cin >> input; vector init_board(N, 0); // あとで long long で for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) init_board[i] |= ll(input[i][j] - '0') << j; State init_state(init_board); State bestState = init_state; int loopcnt = 0; while ((double)clock() / CLOCKS_PER_SEC < 0.97) { loopcnt++; State state = init_state; for (int i = 0; i < K; i++) { state.randomFlip(i); } if (state.score > bestState.score) { //cout << state.score << endl; bestState = state; } } cout << loopcnt << endl; for (int i = 0; i < bestState.op.size(); i++) { cout << bestState.op[i][0] << " " << bestState.op[i][1] << " " << bestState.op[i][2] << " " << bestState.op[i][3] << endl; } return 0; }