Submission #183618
Source Code Expand
#include<iostream> #include<cstdio> #include<cstdlib> #include<list> #include<queue> #include<deque> #include<vector> #include<string> #include<set> #include<map> #include<stack> #include<cstring> #include<cctype> #include<ctime> #include<algorithm> using namespace std; long long int ans=0; int h=0; int w=0; int c[101][101]; long long int maxt; int main(){ cin>>h>>w; for(int i=0;i<h;i++){ for(int j=0;j<w;j++){ cin>>c[i][j]; } } for(int i=0;i<h;i++){ for(int j=0;j<w;j++){ //切り出す位置 for(int o=i;o<h;o++){ for(int p=j;p<w;p++){ //ゴールする位置 int black=0; int white=0; /*検索*/ for(int s=h;s<=o;s++){ for(int k=j;k<=p;k++){ if(s%2==1&&k%2==1){ black+=c[s][k]; } if(s%2==1&&k%2==0){ white+=c[s][k]; } if(s%2==0&&s%2==1){ white+=c[s][k]; } if(s%2==0&&s%1==0){ black+=c[s][k]; } } } if(black==white){ long long int kari=0; kari=(o-i+1)*(p-j+1); if(maxt<kari){ maxt=kari; } } } } } } cout<<maxt<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | Kmcode |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 1197 Byte |
Status | WA |
Exec Time | 187 ms |
Memory | 964 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 59 ms | 800 KB |
subtask0_sample-02.txt | AC | 25 ms | 928 KB |
subtask0_sample-03.txt | WA | 55 ms | 796 KB |
subtask0_sample-04.txt | WA | 24 ms | 796 KB |
subtask0_sample-05.txt | WA | 22 ms | 920 KB |
subtask1_01.txt | WA | 23 ms | 836 KB |
subtask1_02.txt | WA | 25 ms | 892 KB |
subtask1_03.txt | WA | 23 ms | 852 KB |
subtask1_04.txt | WA | 22 ms | 920 KB |
subtask1_05.txt | WA | 21 ms | 920 KB |
subtask1_06.txt | WA | 26 ms | 800 KB |
subtask1_07.txt | WA | 22 ms | 916 KB |
subtask1_08.txt | WA | 20 ms | 920 KB |
subtask1_09.txt | WA | 122 ms | 884 KB |
subtask1_10.txt | WA | 43 ms | 788 KB |
subtask1_11.txt | WA | 119 ms | 960 KB |
subtask1_12.txt | WA | 187 ms | 800 KB |
subtask1_13.txt | WA | 117 ms | 792 KB |
subtask1_14.txt | WA | 117 ms | 960 KB |
subtask1_15.txt | WA | 132 ms | 796 KB |
subtask1_16.txt | WA | 113 ms | 732 KB |
subtask1_17.txt | WA | 99 ms | 948 KB |
subtask1_18.txt | WA | 71 ms | 792 KB |
subtask1_19.txt | WA | 35 ms | 784 KB |
subtask1_20.txt | AC | 118 ms | 964 KB |