Submission #172120


Source Code Expand

Copy
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cfloat>
#include <climits>
#include <cstdio>
#include <complex>
#include <cstdlib>
#include <functional>
#include <map>
#include <memory>
#include <iomanip>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <bitset>
#include <list>
#include <numeric>

#define INF 2147483647
#define INF_LL 9223372036854775807
#define MOD 1000000007

#define zeroFill(arr) memset(arr,0,sizeof(arr))
#define minusOneFill(arr) memset(arr,-1,sizeof(arr))
#define sizev(vec)  (int)vec.size()
#define sizea(array)  (sizeof(array)/sizeof((array)[0]))
#define sizes(string)  (int)string.length()
#define all(vec) (vec).begin(), (vec).end()

#define debug(var) cout<<#var" = "<<var<<", "
#define debugln(var) cout<<#var" = "<<var<<endl

using namespace std;

typedef vector<int> VI;
typedef vector<double> VD;
typedef vector<string> VS;
typedef long long LL;
typedef unsigned long long ULL;

int main() {
	int r, c, d;
	cin >> r >> c >> d;

	int ans = 0;
	int t;
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			cin >> t;
			if (i+j <= d && d%2 == (i+j)%2) {
				ans = max(ans, t);
			}
		}
	}

	std::cout << ans << std::endl;

	return 0;
}

Submission Info

Submission Time
Task B - 謎の人物X
User diginatu
Language C++ (G++ 4.6.4)
Score 100
Code Size 1385 Byte
Status AC
Exec Time 391 ms
Memory 928 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 21 ms 804 KB
sample_02.txt AC 20 ms 924 KB
sample_03.txt AC 20 ms 796 KB
subtask1_01.txt AC 20 ms 928 KB
subtask1_02.txt AC 20 ms 796 KB
subtask1_03.txt AC 21 ms 744 KB
subtask1_04.txt AC 24 ms 676 KB
subtask1_05.txt AC 21 ms 800 KB
subtask1_06.txt AC 22 ms 788 KB
subtask1_07.txt AC 24 ms 804 KB
subtask1_08.txt AC 24 ms 800 KB
subtask1_09.txt AC 24 ms 920 KB
subtask1_10.txt AC 25 ms 804 KB
subtask1_11.txt AC 24 ms 808 KB
subtask1_12.txt AC 24 ms 800 KB
subtask1_13.txt AC 24 ms 676 KB
subtask1_14.txt AC 25 ms 804 KB
subtask1_15.txt AC 25 ms 804 KB
subtask2_01.txt AC 21 ms 800 KB
subtask2_02.txt AC 22 ms 800 KB
subtask2_03.txt AC 137 ms 700 KB
subtask2_04.txt AC 23 ms 680 KB
subtask2_05.txt AC 35 ms 816 KB
subtask2_06.txt AC 80 ms 796 KB
subtask2_07.txt AC 283 ms 812 KB
subtask2_08.txt AC 382 ms 800 KB
subtask2_09.txt AC 368 ms 800 KB
subtask2_10.txt AC 388 ms 796 KB
subtask2_11.txt AC 331 ms 804 KB
subtask2_12.txt AC 368 ms 920 KB
subtask2_13.txt AC 379 ms 800 KB
subtask2_14.txt AC 389 ms 676 KB
subtask2_15.txt AC 391 ms 800 KB