Submission #171681


Source Code Expand

Copy
#include <queue>
#include <map>
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <algorithm>
#include <bitset>
#include <sstream>
#include <string>
#include <cmath>
#include <stack>
#include <math.h>
#include <list>
#include <set>
#include <complex>
#include <string.h>

#define INF (1 << 29)
#define rep2(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define squere(x) ((x)*(x))
#define EPS 1e-20

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;


int dx[4] = {-1,0,1,0};
int dy[4] = {0,1,0,-1};

int main()
{
    int R,C,D;
    cin >> R >> C >> D;

    int res = -1;
    rep(i,R) rep(j,C){
        int a;
        cin >> a;
        if(i+j<=D&&(D-i-j)%2==0) {
            res = max(a,res);
        }
    }
    cout << res << endl;
    return 0;
}

Submission Info

Submission Time
Task B - 謎の人物X
User garasubo
Language C++ (G++ 4.6.4)
Score 100
Code Size 933 Byte
Status AC
Exec Time 411 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 788 KB
sample_02.txt AC 22 ms 796 KB
sample_03.txt AC 23 ms 856 KB
subtask1_01.txt AC 21 ms 796 KB
subtask1_02.txt AC 20 ms 792 KB
subtask1_03.txt AC 23 ms 864 KB
subtask1_04.txt AC 24 ms 812 KB
subtask1_05.txt AC 21 ms 796 KB
subtask1_06.txt AC 21 ms 788 KB
subtask1_07.txt AC 23 ms 792 KB
subtask1_08.txt AC 25 ms 840 KB
subtask1_09.txt AC 24 ms 716 KB
subtask1_10.txt AC 24 ms 796 KB
subtask1_11.txt AC 26 ms 792 KB
subtask1_12.txt AC 26 ms 792 KB
subtask1_13.txt AC 31 ms 788 KB
subtask1_14.txt AC 24 ms 796 KB
subtask1_15.txt AC 26 ms 800 KB
subtask2_01.txt AC 24 ms 796 KB
subtask2_02.txt AC 23 ms 804 KB
subtask2_03.txt AC 127 ms 796 KB
subtask2_04.txt AC 25 ms 796 KB
subtask2_05.txt AC 38 ms 740 KB
subtask2_06.txt AC 98 ms 792 KB
subtask2_07.txt AC 265 ms 796 KB
subtask2_08.txt AC 369 ms 788 KB
subtask2_09.txt AC 352 ms 928 KB
subtask2_10.txt AC 411 ms 800 KB
subtask2_11.txt AC 306 ms 804 KB
subtask2_12.txt AC 353 ms 788 KB
subtask2_13.txt AC 351 ms 792 KB
subtask2_14.txt AC 365 ms 788 KB
subtask2_15.txt AC 387 ms 840 KB