Submission #172380


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[100][100]={0};
  string temp;
  cin >> r >> c >> d;
  int result = 0;
  REP(i,r){
    REP(j,c){
      cin >> a[i][j];
    }
  }
  int flg[100][100] = {0};
  if(d%2==1){
    for(int i=1;i<=d;i=i+2){
      int ii=i+1,jj=-1;
      do {
        ii--;
        jj++;
        flg[ii][jj] = 1;
      }while(ii!=0);
    }
  }
  else {
    for(int i=0;i<d;i=i+2){
      int ii=i+1,jj=-1;
      if(ii == 0){
        flg[0][0]=1;
      }
      else {
        do{
          ii--;
          jj++;
          flg[ii][jj] = 1;
        }
        while(ii!=0);
      }
    }
  }
  REP(i,r){
    REP(j,c){
      if(flg[i][j]==1){
        result = max(result,a[i][j]);
      }
    }
  }
  cout << result << "\n";

  return 0;
}

Submission Info

Submission Time
Task A - 経過日数
User kikunantoka
Language C++ (G++ 4.6.4)
Score 0
Code Size 1920 Byte
Status WA
Exec Time 263 ms
Memory 1148 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 1
RE × 3
WA × 5
RE × 19
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt
All subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.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, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt RE 261 ms 1048 KB
subtask0_sample02.txt WA 25 ms 1040 KB
subtask0_sample03.txt RE 251 ms 1044 KB
subtask0_sample04.txt RE 252 ms 1056 KB
subtask1_01.txt RE 246 ms 1040 KB
subtask1_02.txt RE 252 ms 1040 KB
subtask1_03.txt RE 243 ms 1140 KB
subtask1_04.txt RE 258 ms 1048 KB
subtask1_05.txt RE 254 ms 992 KB
subtask1_06.txt RE 250 ms 1036 KB
subtask1_07.txt WA 26 ms 1048 KB
subtask1_08.txt RE 248 ms 956 KB
subtask1_09.txt RE 246 ms 1044 KB
subtask1_10.txt RE 263 ms 1036 KB
subtask1_11.txt RE 260 ms 1044 KB
subtask1_12.txt RE 256 ms 1044 KB
subtask1_13.txt WA 25 ms 1040 KB
subtask1_14.txt RE 245 ms 1044 KB
subtask1_15.txt RE 251 ms 1056 KB
subtask1_16.txt WA 22 ms 928 KB
subtask1_17.txt RE 251 ms 1036 KB
subtask1_18.txt RE 243 ms 1040 KB
subtask1_19.txt RE 243 ms 1148 KB
subtask1_20.txt WA 24 ms 1044 KB