Submission #1634973
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define VSORT(v) sort(v.begin(), v.end())
#define DVSORT(v) sort(v.begin(), v.end(),greater<int>())
#define SORT(v, n) sort(v, v+n)
#define DSORT(v,n) sort(v, v+n,greater<int>())
#define vi vector<int>
#define pb push_back
#define P pair<int,int>
template <class T> void chmin(T&a,const T&b) { a = min(a,b); }
template <class T> void chmax(T&a,const T&b) { a = max(a,b); }
void print(){cout<<endl;}
template <class Head, class... Tail>
void print(Head&& h,Tail&&... t){
if(sizeof...(t)==0)
cout<<h;
else
cout<<h<<' ';
print(move(t)...);
}
const double EPS =1e-9;
const long INF =2147483647;//32bit 2*1e+9
const long MOD =1e+9+7;
#define PI 3.14159265258979
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
string city[1000];
map<string,int> old;
int main(void){
int H,W,N,numbers[1000][1000],maxs=0;
cin>>H>>W>>N;
REP(i,H)
REP(j,W)
cin>>numbers[i][j];
REP(i,H){
REP(j,W){
if(i+j<=N){
if((N%2 && (i+j)%2)||(N%2==0 && (i+j)%2==0))
chmax(maxs,numbers[i][j]);
}
}
}
print(maxs);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 謎の人物X |
User |
stnae678 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1406 Byte |
Status |
AC |
Exec Time |
265 ms |
Memory |
4096 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
60 / 60 |
40 / 40 |
Status |
|
|
|
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 |
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_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 |
2 ms |
2304 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
subtask1_01.txt |
AC |
1 ms |
256 KB |
subtask1_02.txt |
AC |
1 ms |
256 KB |
subtask1_03.txt |
AC |
1 ms |
640 KB |
subtask1_04.txt |
AC |
4 ms |
640 KB |
subtask1_05.txt |
AC |
1 ms |
256 KB |
subtask1_06.txt |
AC |
2 ms |
384 KB |
subtask1_07.txt |
AC |
3 ms |
640 KB |
subtask1_08.txt |
AC |
3 ms |
640 KB |
subtask1_09.txt |
AC |
4 ms |
640 KB |
subtask1_10.txt |
AC |
4 ms |
640 KB |
subtask1_11.txt |
AC |
4 ms |
2688 KB |
subtask1_12.txt |
AC |
4 ms |
640 KB |
subtask1_13.txt |
AC |
4 ms |
640 KB |
subtask1_14.txt |
AC |
4 ms |
640 KB |
subtask1_15.txt |
AC |
4 ms |
640 KB |
subtask2_01.txt |
AC |
2 ms |
256 KB |
subtask2_02.txt |
AC |
3 ms |
4096 KB |
subtask2_03.txt |
AC |
82 ms |
3072 KB |
subtask2_04.txt |
AC |
3 ms |
256 KB |
subtask2_05.txt |
AC |
13 ms |
640 KB |
subtask2_06.txt |
AC |
44 ms |
2304 KB |
subtask2_07.txt |
AC |
178 ms |
4096 KB |
subtask2_08.txt |
AC |
265 ms |
4096 KB |
subtask2_09.txt |
AC |
254 ms |
4096 KB |
subtask2_10.txt |
AC |
257 ms |
4096 KB |
subtask2_11.txt |
AC |
212 ms |
4096 KB |
subtask2_12.txt |
AC |
259 ms |
4096 KB |
subtask2_13.txt |
AC |
261 ms |
4096 KB |
subtask2_14.txt |
AC |
260 ms |
4096 KB |
subtask2_15.txt |
AC |
261 ms |
4096 KB |