Submission #171409


Source Code Expand

Copy
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int h, w, d;
    cin >> h >> w >> d;

    vector<vector<int> > a(h, vector<int>(w));
    for(int i=0; i<h; ++i){
        for(int j=0; j<w; ++j){
            cin >> a[i][j];
        }
    }

    int ret = 0;
    for(int y=0; y<h; ++y){
        for(int x=0; x<w; ++x){
            if(d % 2 == (y + x) % 2 && x + y <= d)
                ret = max(ret, a[y][x]);
        }
    }
    cout << ret << endl;

    return 0;
}

Submission Info

Submission Time
Task B - 謎の人物X
User mamekin
Language C++ (G++ 4.6.4)
Score 100
Code Size 843 Byte
Status AC
Exec Time 384 ms
Memory 4772 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 932 KB
sample_02.txt AC 23 ms 808 KB
sample_03.txt AC 241 ms 924 KB
subtask1_01.txt AC 26 ms 924 KB
subtask1_02.txt AC 22 ms 804 KB
subtask1_03.txt AC 21 ms 924 KB
subtask1_04.txt AC 23 ms 796 KB
subtask1_05.txt AC 22 ms 804 KB
subtask1_06.txt AC 23 ms 796 KB
subtask1_07.txt AC 25 ms 920 KB
subtask1_08.txt AC 25 ms 924 KB
subtask1_09.txt AC 25 ms 920 KB
subtask1_10.txt AC 26 ms 808 KB
subtask1_11.txt AC 25 ms 800 KB
subtask1_12.txt AC 25 ms 932 KB
subtask1_13.txt AC 26 ms 928 KB
subtask1_14.txt AC 26 ms 924 KB
subtask1_15.txt AC 26 ms 932 KB
subtask2_01.txt AC 22 ms 924 KB
subtask2_02.txt AC 23 ms 916 KB
subtask2_03.txt AC 133 ms 1956 KB
subtask2_04.txt AC 24 ms 928 KB
subtask2_05.txt AC 35 ms 1052 KB
subtask2_06.txt AC 77 ms 1564 KB
subtask2_07.txt AC 276 ms 4640 KB
subtask2_08.txt AC 370 ms 4644 KB
subtask2_09.txt AC 369 ms 4724 KB
subtask2_10.txt AC 370 ms 4760 KB
subtask2_11.txt AC 318 ms 4760 KB
subtask2_12.txt AC 370 ms 4700 KB
subtask2_13.txt AC 384 ms 4648 KB
subtask2_14.txt AC 376 ms 4772 KB
subtask2_15.txt AC 367 ms 4640 KB