Submission #1225196
Source Code Expand
#include<cstdio> #include <iostream> #include<algorithm> #include<string> #include<queue> #include<vector> #include<functional> #include<cmath> #include<map> #include<stack> #include<set> using namespace std; typedef long long ll; typedef pair<ll, ll> P; int R, C, D; int ans; int board[1001][1001]; int dx[] = { 0,1,0,-1 }, dy[] = {1,0,-1,0}; int check(int x, int y, int n) { if (n == D)return board[y][x]; for (int i = 0; i < 4; i++) { int ddx = dx[i] + x, ddy = dy[i] + y; if (ddx >= 0 && ddx < C && ddy >= 0 && ddy < R) { ans = max(ans,check(ddx,ddy,n+1)); } } return ans; } int main() { cin >> R >> C >> D; for (int i = 0; i < R; i++) { for (int j = 0; j < C; j++) { cin >> board[i][j]; } } D = min(R - 1 + C - 1,D); cout << check(0, 0, 0) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 謎の人物X |
User | jj |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 836 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 4224 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 60 | 0 / 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 | 1 ms | 256 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 | TLE | 2103 ms | 256 KB |
subtask1_03.txt | TLE | 2103 ms | 640 KB |
subtask1_04.txt | TLE | 2103 ms | 640 KB |
subtask1_05.txt | TLE | 2103 ms | 256 KB |
subtask1_06.txt | TLE | 2103 ms | 384 KB |
subtask1_07.txt | TLE | 2103 ms | 640 KB |
subtask1_08.txt | TLE | 2103 ms | 640 KB |
subtask1_09.txt | TLE | 2103 ms | 640 KB |
subtask1_10.txt | TLE | 2103 ms | 640 KB |
subtask1_11.txt | TLE | 2103 ms | 640 KB |
subtask1_12.txt | TLE | 2103 ms | 640 KB |
subtask1_13.txt | TLE | 2103 ms | 640 KB |
subtask1_14.txt | TLE | 2103 ms | 640 KB |
subtask1_15.txt | TLE | 2103 ms | 640 KB |
subtask2_01.txt | TLE | 2103 ms | 256 KB |
subtask2_02.txt | TLE | 2103 ms | 4224 KB |
subtask2_03.txt | TLE | 2103 ms | 2048 KB |
subtask2_04.txt | TLE | 2103 ms | 256 KB |
subtask2_05.txt | TLE | 2103 ms | 640 KB |
subtask2_06.txt | TLE | 2103 ms | 1280 KB |
subtask2_07.txt | TLE | 2103 ms | 4224 KB |
subtask2_08.txt | TLE | 2104 ms | 4096 KB |
subtask2_09.txt | TLE | 2103 ms | 4224 KB |
subtask2_10.txt | TLE | 2103 ms | 4224 KB |
subtask2_11.txt | TLE | 2104 ms | 4224 KB |
subtask2_12.txt | TLE | 2104 ms | 4096 KB |
subtask2_13.txt | TLE | 2103 ms | 4224 KB |
subtask2_14.txt | TLE | 2103 ms | 4224 KB |
subtask2_15.txt | TLE | 2104 ms | 4224 KB |