Submission #172426


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int MaxTako(vector<vector<int> > table,int d){
  vector<int> ablepos;
  for(int i=0;i<table.size();i++){
    for(int j=0;j<table[0].size();j++){
      if(i+j>d) continue;
      if(d%2){
        if(i%2==j%2) continue; 
      }else{
        if(i%2!=j%2) continue;
      }
      ablepos.push_back(table[i][j]);
    }
  }
  return *max_element(ablepos.begin(),ablepos.end());
}
int main(){
  int row,col,d;
  cin>>row>>col>>d;
  vector<vector<int> > table(row,vector<int>(col));
  for(int i=0;i<row;i++){
    for(int j=0;j<col;j++){
      cin>>table[i][j];
    }
  }

  cout<<MaxTako(table,d)<<endl;

}

Submission Info

Submission Time
Task B - 謎の人物X
User terakun
Language C++ (G++ 4.6.4)
Score 100
Code Size 711 Byte
Status AC
Exec Time 447 ms
Memory 10784 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 792 KB
sample_02.txt AC 21 ms 796 KB
sample_03.txt AC 21 ms 924 KB
subtask1_01.txt AC 22 ms 920 KB
subtask1_02.txt AC 21 ms 920 KB
subtask1_03.txt AC 23 ms 852 KB
subtask1_04.txt AC 24 ms 924 KB
subtask1_05.txt AC 19 ms 916 KB
subtask1_06.txt AC 21 ms 904 KB
subtask1_07.txt AC 25 ms 920 KB
subtask1_08.txt AC 24 ms 920 KB
subtask1_09.txt AC 26 ms 992 KB
subtask1_10.txt AC 26 ms 976 KB
subtask1_11.txt AC 25 ms 936 KB
subtask1_12.txt AC 25 ms 936 KB
subtask1_13.txt AC 25 ms 940 KB
subtask1_14.txt AC 24 ms 804 KB
subtask1_15.txt AC 23 ms 1048 KB
subtask2_01.txt AC 21 ms 796 KB
subtask2_02.txt AC 22 ms 920 KB
subtask2_03.txt AC 137 ms 4472 KB
subtask2_04.txt AC 22 ms 916 KB
subtask2_05.txt AC 34 ms 1192 KB
subtask2_06.txt AC 92 ms 2856 KB
subtask2_07.txt AC 287 ms 9760 KB
subtask2_08.txt AC 378 ms 8616 KB
subtask2_09.txt AC 376 ms 9752 KB
subtask2_10.txt AC 377 ms 10772 KB
subtask2_11.txt AC 319 ms 9256 KB
subtask2_12.txt AC 411 ms 8576 KB
subtask2_13.txt AC 389 ms 10784 KB
subtask2_14.txt AC 386 ms 10776 KB
subtask2_15.txt AC 447 ms 10780 KB