Submission #6420959

---

Source Code Expand

unittest
{

assert( q"INPUT
3 2
| |-|
|-| |
o   
INPUT".split( '\n' ).parse.expand.solve == 3 );

assert( q"INPUT
10 2
| |-| |-| |-| |-| |
|-| |-| |-| |-| |-|
            o      
INPUT".split( '\n' ).parse.expand.solve == 9 );

assert( q"INPUT
1 5
|
|
|
|
|
o
INPUT".split( '\n' ).parse.expand.solve == 1 );

assert( q"INPUT
4 2
| | | |
| | | |
      o
INPUT".split( '\n' ).parse.expand.solve == 4 );

assert( q"INPUT
9 8
| | | | | | | | |
|-| | |-| | |-| |
| | |-| | |-| | |
| |-| | | | | |-|
| | | |-| | | |-|
| | |-| |-| | | |
|-| | |-| | |-| |
| | | | | |-| | |
            o    
INPUT".split( '\n' ).parse.expand.solve == 3 );

}



import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.typecons;

void main()
{
	stdin.byLineCopy.parse.expand.solve.writeln;
}

auto parse( Range )( Range input )
if( isInputRange!Range && is( ElementType!Range == string ) )
{
	auto nl = input.front.split.to!( long[] );
	auto xss = new dchar[][]( nl[ 1 ], nl[ 0 ] * 2 - 1 );
	foreach( ref xs; xss )
	{
		input.popFront;
		xs = input.front.to!( dchar[] );
	}
	input.popFront;
	auto ys = input.front.to!( dchar[] );
	return tuple( xss, ys );
}

auto solve( dchar[][] xss, dchar[] ys )
{
	auto i = ( ys.length - ys.find( 'o' ).length ).signed;
	foreach_reverse( xs; xss )
	{
		if(      0 < i - 2         && xs[ i - 1 ] == '-' ) i -= 2;
		else if( i + 2 < xs.length && xs[ i + 1 ] == '-' ) i += 2;
	}
	return i / 2 + 1;
}

Submission Info

Judge Result