Submission #171820


Source Code Expand

Copy
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
#include<limits.h>
 
using namespace std;
 
typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair
#define rep(i,a) for(int i = 0;i < (a); i++)
 
template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int main(){
    int r,c,d;
    cin >> r >> c >> d;
    int field[r][c];
    int zero = -2;
    int ans = -1;
    int dummy;
    memset(field,-1,sizeof(field));

    rep(i,r){
        rep(j,c){
            if(i==0 && j==0){
                cin >> zero;
                continue;
            }
            if(i+j>d){
                cin >> dummy;
                continue;
            }
            if(d%2==0 && ((i+j)%2!=0)){
                cin >> dummy;
                continue;
            }
            if(d%2==1 && ((i+j)%2!=1)){
                cin >> dummy;
                continue;
            }
            int temp;
            cin >> temp;
            ans = max(ans,temp);
        }
    }
    if(d%2==0)
        ans = max(ans,zero);
    cout << ans << endl;

    

}

Submission Info

Submission Time
Task B - 謎の人物X
User N11001001
Language C++ (G++ 4.6.4)
Score 100
Code Size 1602 Byte
Status AC
Exec Time 375 ms
Memory 4764 KB

Compile Error

./Main.cpp: In function ‘int in()’:
./Main.cpp:31:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 692 KB
sample_02.txt AC 21 ms 788 KB
sample_03.txt AC 21 ms 796 KB
subtask1_01.txt AC 21 ms 796 KB
subtask1_02.txt AC 21 ms 920 KB
subtask1_03.txt AC 22 ms 916 KB
subtask1_04.txt AC 25 ms 796 KB
subtask1_05.txt AC 21 ms 912 KB
subtask1_06.txt AC 22 ms 800 KB
subtask1_07.txt AC 25 ms 812 KB
subtask1_08.txt AC 26 ms 792 KB
subtask1_09.txt AC 25 ms 808 KB
subtask1_10.txt AC 24 ms 808 KB
subtask1_11.txt AC 24 ms 916 KB
subtask1_12.txt AC 24 ms 920 KB
subtask1_13.txt AC 26 ms 808 KB
subtask1_14.txt AC 24 ms 920 KB
subtask1_15.txt AC 26 ms 860 KB
subtask2_01.txt AC 22 ms 796 KB
subtask2_02.txt AC 21 ms 796 KB
subtask2_03.txt AC 127 ms 1960 KB
subtask2_04.txt AC 22 ms 920 KB
subtask2_05.txt AC 35 ms 1052 KB
subtask2_06.txt AC 78 ms 1432 KB
subtask2_07.txt AC 276 ms 4632 KB
subtask2_08.txt AC 375 ms 4640 KB
subtask2_09.txt AC 359 ms 4652 KB
subtask2_10.txt AC 371 ms 4632 KB
subtask2_11.txt AC 309 ms 4636 KB
subtask2_12.txt AC 365 ms 4644 KB
subtask2_13.txt AC 369 ms 4756 KB
subtask2_14.txt AC 367 ms 4760 KB
subtask2_15.txt AC 365 ms 4764 KB