Submission #1356745
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; int H,W; int C[105][105]; int Sum[105][105]; int main(){ cin>>H>>W; for(int i=0; i<H; i++){ for(int j=0; j<W; j++) scanf("%d",&C[i][j]); } for(int i=1; i<=H; i++){ for(int j=1; j<=W; j++){ if((i+j)%2) Sum[i][j]=Sum[i-1][j]+Sum[i][j-1]-Sum[i-1][j-1]-C[i-1][j-1]; else Sum[i][j]=Sum[i-1][j]+Sum[i][j-1]-Sum[i-1][j-1]+C[i-1][j-1]; } } int ans=0; for(int i=0; i<H; i++){ for(int j=0; j<W; j++){ for(int n=i+1; n<=H; n++){ for(int m=j+1; m<=W; m++){ if(Sum[n][m]-Sum[n][j]-Sum[i][m]+Sum[i][j]==0){ ans=max(ans,(n-i)*(m-j)); } } } } } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | momotaro1303 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 796 Byte |
Status | AC |
Exec Time | 52 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:15:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int j=0; j<W; j++) scanf("%d",&C[i][j]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask0_sample-05.txt |
All | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask0_sample-05.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, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample-01.txt | AC | 1 ms | 256 KB |
subtask0_sample-02.txt | AC | 1 ms | 256 KB |
subtask0_sample-03.txt | AC | 1 ms | 256 KB |
subtask0_sample-04.txt | AC | 1 ms | 256 KB |
subtask0_sample-05.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 | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 50 ms | 384 KB |
subtask1_10.txt | AC | 9 ms | 256 KB |
subtask1_11.txt | AC | 38 ms | 384 KB |
subtask1_12.txt | AC | 38 ms | 384 KB |
subtask1_13.txt | AC | 38 ms | 384 KB |
subtask1_14.txt | AC | 51 ms | 384 KB |
subtask1_15.txt | AC | 52 ms | 384 KB |
subtask1_16.txt | AC | 37 ms | 384 KB |
subtask1_17.txt | AC | 40 ms | 384 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 1 ms | 384 KB |
subtask1_20.txt | AC | 42 ms | 384 KB |