Submission #172421


Source Code Expand

Copy
//include
//------------------------------------------
#include <iostream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n)  FOR(i,0,n)

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//debug
//-------------------------------------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

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

  int r,c,d;
  int a[1000][1000];
  string temp;
  cin >> r >> c >> d;
  int result = 0;
  REP(i,r){
    REP(j,c){
      cin >> a[i][j];
    }
  }
  REP(i,r){
    REP(j,c){
      if( ( i+j ) % 2 != d % 2) continue;
      if( d < i+j ) continue;
      result = max(result,a[i][j]);
    }
  }
  cout << result << "\n";

  return 0;
}

Submission Info

Submission Time
Task B - 謎の人物X
User kikunantoka
Language C++ (G++ 4.6.4)
Score 100
Code Size 1497 Byte
Status AC
Exec Time 150 ms
Memory 4652 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 22 ms 920 KB
sample_02.txt AC 22 ms 808 KB
sample_03.txt AC 20 ms 804 KB
subtask1_01.txt AC 22 ms 920 KB
subtask1_02.txt AC 23 ms 860 KB
subtask1_03.txt AC 22 ms 1308 KB
subtask1_04.txt AC 23 ms 1300 KB
subtask1_05.txt AC 23 ms 844 KB
subtask1_06.txt AC 22 ms 1048 KB
subtask1_07.txt AC 23 ms 1192 KB
subtask1_08.txt AC 24 ms 1300 KB
subtask1_09.txt AC 23 ms 1304 KB
subtask1_10.txt AC 22 ms 1192 KB
subtask1_11.txt AC 22 ms 1308 KB
subtask1_12.txt AC 25 ms 1180 KB
subtask1_13.txt AC 22 ms 1304 KB
subtask1_14.txt AC 22 ms 1296 KB
subtask1_15.txt AC 24 ms 1300 KB
subtask2_01.txt AC 21 ms 924 KB
subtask2_02.txt AC 26 ms 4648 KB
subtask2_03.txt AC 61 ms 2608 KB
subtask2_04.txt AC 21 ms 916 KB
subtask2_05.txt AC 29 ms 1168 KB
subtask2_06.txt AC 43 ms 1760 KB
subtask2_07.txt AC 120 ms 4652 KB
subtask2_08.txt AC 146 ms 4648 KB
subtask2_09.txt AC 145 ms 4652 KB
subtask2_10.txt AC 142 ms 4652 KB
subtask2_11.txt AC 133 ms 4644 KB
subtask2_12.txt AC 147 ms 4652 KB
subtask2_13.txt AC 150 ms 4652 KB
subtask2_14.txt AC 148 ms 4636 KB
subtask2_15.txt AC 149 ms 4636 KB