Submission #3157410


Source Code Expand

Copy
void main() {
	alias Cont = Tuple!(int, "sx", int, "sy", int, "gx", int, "gy");
	auto ip = readAs!(int[]), H = ip[0], W = ip[1];
	auto a = readMatrix!int(H, W);
	ulong cnt;
	Cont[] conts;

	auto dx = [1,0,-1,0], dy = [0,1,0,-1];
	foreach(i; 0..H) {
		foreach(j; 0..W) {
			foreach(k; 0..4) {
				auto ry = i + dy[k], rx = j + dx[k];
				if(0 <= ry && ry < H && 0 <= rx && rx < W &&
					a[i][j]%2 != 0) {
					a[ry][rx]++;
					a[i][j]--;
					cnt++;
					conts ~= Cont(i+1, j+1, ry+1, rx+1);
					continue;
				}
			}
		}
	}
	cnt.writeln;
	conts.each!(i => writefln("%d %d %d %d", i.sx, i.sy, i.gx, i.gy));
}

// ===================================

import std.stdio;
import std.string;
import std.functional;
import std.conv;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
import std.bigint;
import std.numeric;
import std.conv;
import std.typecons;
import std.uni;
import std.ascii;
import std.bitmanip;
import core.bitop;

T readAs(T)() if (isBasicType!T) {
	return readln.chomp.to!T;
}
T readAs(T)() if (isArray!T) {
	return readln.split.to!T;
}

T[][] readMatrix(T)(uint height, uint width) if (!isSomeChar!T) {
	auto res = new T[][](height, width);
	foreach(i; 0..height) {
		res[i] = readAs!(T[]);
	}
	return res;
}

T[][] readMatrix(T)(uint height, uint width) if (isSomeChar!T) {
	auto res = new T[][](height, width);
	foreach(i; 0..height) {
		auto s = rs;
		foreach(j; 0..width) res[i][j] = s[j].to!T;
	}
	return res;
}

int ri() {
	return readAs!int;
}

double rd() {
	return readAs!double;
}

string rs() {
	return readln.chomp;
}

Submission Info

Submission Time
Task D - Make Them Even
User private_yusuke
Language D (DMD64 v2.070.1)
Score 400
Code Size 1676 Byte
Status AC
Exec Time 135 ms
Memory 12796 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 29
AC × 3
Set Name Test Cases
All hand_1, hand_2, hand_3, hand_4, hand_5, hand_6, max_1, max_10, max_2, max_3, max_4, max_5, max_6, max_7, max_8, max_9, random_1, random_10, random_2, random_3, random_4, random_5, random_6, random_7, random_8, random_9, sample_01, sample_02, sample_03
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
hand_1 AC 1 ms 256 KB
hand_2 AC 1 ms 256 KB
hand_3 AC 1 ms 332 KB
hand_4 AC 2 ms 380 KB
hand_5 AC 134 ms 12796 KB
hand_6 AC 28 ms 11004 KB
max_1 AC 135 ms 12284 KB
max_10 AC 135 ms 12796 KB
max_2 AC 134 ms 12284 KB
max_3 AC 134 ms 11004 KB
max_4 AC 135 ms 11900 KB
max_5 AC 135 ms 11772 KB
max_6 AC 135 ms 11644 KB
max_7 AC 135 ms 12540 KB
max_8 AC 135 ms 12412 KB
max_9 AC 134 ms 11772 KB
random_1 AC 2 ms 380 KB
random_10 AC 19 ms 2044 KB
random_2 AC 29 ms 2044 KB
random_3 AC 43 ms 6524 KB
random_4 AC 14 ms 2172 KB
random_5 AC 23 ms 2044 KB
random_6 AC 55 ms 8956 KB
random_7 AC 42 ms 2684 KB
random_8 AC 50 ms 6268 KB
random_9 AC 77 ms 10876 KB
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB