Submission #171594


Source Code Expand

Copy
#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>

using namespace std; using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VS = vector<string>;
using SS = stringstream;
using PII = pair<int,int>;
using VPII = vector< pair<int,int> >;
template < typename T = int > using VT = vector<T>;
template < typename T = int > using VVT = VT< VT<T> >;
template < typename T = int > using LIM = numeric_limits<T>;

template < typename T > inline T fromString( const string &s ){ T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); };

#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) (c).begin(), (c).end()
#define AALL( a, t ) (t*)a, (t*)a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) (c).begin(), (c).begin() + p, (c).end()

#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )

#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int h, w, d;
	cin >> h >> w >> d;

	VVI board( h, VI( w ) );
	FOR( row, board )
	{
		FOR( a, row )
		{
			cin >> a;
		}
	}

	int res = 0;
	REP( i, 0, h )
	{
		REP( j, 0, w )
		{
			if ( ( i + j ) % 2 == d % 2 && i + j <= d )
			{
				res = max( res, board[i][j] );
			}
		}
	}

	cout << res << endl;

	return 0;
}

Submission Info

Submission Time
Task B - 謎の人物X
User torus711
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1929 Byte
Status AC
Exec Time 145 ms
Memory 4776 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 60 / 60 40 / 40
Status
AC × 3
AC × 18
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 24 ms 920 KB
sample_02.txt AC 22 ms 800 KB
sample_03.txt AC 21 ms 932 KB
subtask1_01.txt AC 22 ms 928 KB
subtask1_02.txt AC 23 ms 804 KB
subtask1_03.txt AC 21 ms 796 KB
subtask1_04.txt AC 22 ms 800 KB
subtask1_05.txt AC 21 ms 924 KB
subtask1_06.txt AC 79 ms 932 KB
subtask1_07.txt AC 23 ms 928 KB
subtask1_08.txt AC 23 ms 800 KB
subtask1_09.txt AC 23 ms 804 KB
subtask1_10.txt AC 23 ms 796 KB
subtask1_11.txt AC 24 ms 804 KB
subtask1_12.txt AC 23 ms 804 KB
subtask1_13.txt AC 22 ms 932 KB
subtask1_14.txt AC 23 ms 860 KB
subtask1_15.txt AC 23 ms 928 KB
subtask2_01.txt AC 21 ms 804 KB
subtask2_02.txt AC 21 ms 924 KB
subtask2_03.txt AC 60 ms 1956 KB
subtask2_04.txt AC 23 ms 760 KB
subtask2_05.txt AC 27 ms 1048 KB
subtask2_06.txt AC 43 ms 1448 KB
subtask2_07.txt AC 118 ms 4772 KB
subtask2_08.txt AC 145 ms 4656 KB
subtask2_09.txt AC 139 ms 4776 KB
subtask2_10.txt AC 140 ms 4768 KB
subtask2_11.txt AC 128 ms 4652 KB
subtask2_12.txt AC 142 ms 4776 KB
subtask2_13.txt AC 141 ms 4776 KB
subtask2_14.txt AC 141 ms 4764 KB
subtask2_15.txt AC 140 ms 4772 KB