import std.stdio, std.array, std.string, std.conv, std.algorithm; import std.typecons, std.range, std.random, std.math, std.container; import std.numeric, std.bigint, core.bitop, std.bitmanip, std.datetime; immutable int N = 60; immutable int K = 500; void main() { auto start_time = Clock.currTime(); readln.split; auto X = readln.split.map!(to!int).array; auto A = N.iota.map!(_ => readln.chomp.map!(a => a == '1').array).array; int[][] ops = new int[][](K); int[] search(int x) { int best_score = -100; int[] best_op = [-1, -1, -1, -1]; foreach (i; 0..N) { foreach (j; 0..N-X[x]+1) { int score = 0; foreach (k; j..j+X[x]) { score += A[i][k] ? 1 : -1; } if (score > best_score) { best_score = score; best_op = [i, j, i, j+X[x]-1]; } } } foreach (j; 0..N) { foreach (i; 0..N-X[x]+1) { int score = 0; foreach (k; i..i+X[x]) { score += A[k][j] ? 1 : -1; } if (score > best_score) { best_score = score; best_op = [i, j, i+X[x]-1, j]; } } } return best_op; } auto hoge = K.iota.array; //hoge.randomShuffle; //hoge.sort!((a, b) => X[a] > X[b]); foreach (x; hoge) { ops[x] = search(x); foreach (i; ops[x][0]..ops[x][2]+1) foreach (j; ops[x][1]..ops[x][3]+1) A[i][j] ^= 1; } while ((Clock.currTime - start_time).total!"msecs" < dur!"msecs"(980).total!"msecs") { int x = uniform(0, K); foreach (i; ops[x][0]..ops[x][2]+1) foreach (j; ops[x][1]..ops[x][3]+1) A[i][j] ^= 1; ops[x] = search(x); foreach (i; ops[x][0]..ops[x][2]+1) foreach (j; ops[x][1]..ops[x][3]+1) A[i][j] ^= 1; } foreach (op; ops) op.map!(a => (a+1).to!string).join(" ").writeln; }