Submission #1935878
Source Code Expand
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> typedef long long ll; using namespace std; #define MAX_H 200 int main(){ int h,w; ll a,b; string s[MAX_H]; scanf("%d%d%lld%lld",&h,&w,&a,&b); for(int i=0;i<h;++i) cin>>s[i]; ll ans=a+b; bool f=true,g=true; ll k1=0,k2=0; for(int i=0;i<h/2;++i) for(int j=0;j<w/2;++j){ char c[4]; c[0]=s[i][j],c[1]=s[i][w-1-j],c[2]=s[h-1-i][j],c[3]=s[h-1-i][w-1-j]; int cnt=0; for(int k=0;k<4;++k) if(c[k]=='S') ++cnt; if(cnt==4) ans+=a+b+max(a,b); else if(cnt==3){ ++k1; ++k2; f=false; g=false; }else if(cnt==2){ if((c[0]=='S'&&c[1]=='S')||(c[2]=='S'&&c[3]=='S')){ ++k2; f=false; }else if((c[0]=='S'&&c[2]=='S')||(c[1]=='S'&&c[3]=='S')){ ++k1; g=false; }else{ f=false; g=false; } }else if(cnt==1){ f=false; g=false; } } if(f) ans-=a; if(g) ans-=b; printf("%lld\n",max(ans+k1*a,ans+k2*b)); }
Submission Info
Submission Time | |
---|---|
Task | D - 石 |
User | neander |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 954 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%lld%lld",&h,&w,&a,&b); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 3 ms | 256 KB |
02.txt | AC | 3 ms | 256 KB |
03.txt | AC | 3 ms | 256 KB |
04.txt | AC | 3 ms | 256 KB |
05.txt | AC | 3 ms | 256 KB |
06.txt | AC | 3 ms | 256 KB |
07.txt | AC | 3 ms | 256 KB |
08.txt | AC | 3 ms | 256 KB |
09.txt | AC | 3 ms | 256 KB |
10.txt | AC | 3 ms | 256 KB |
11.txt | AC | 3 ms | 256 KB |
12.txt | AC | 3 ms | 256 KB |
13.txt | AC | 3 ms | 256 KB |
14.txt | AC | 3 ms | 256 KB |
15.txt | AC | 3 ms | 256 KB |
16.txt | AC | 3 ms | 256 KB |
17.txt | AC | 3 ms | 256 KB |
18.txt | AC | 3 ms | 256 KB |
19.txt | AC | 3 ms | 256 KB |
20.txt | AC | 3 ms | 256 KB |
21.txt | AC | 3 ms | 256 KB |
22.txt | AC | 3 ms | 256 KB |
23.txt | AC | 3 ms | 256 KB |
24.txt | AC | 3 ms | 256 KB |
25.txt | AC | 2 ms | 256 KB |
26.txt | AC | 2 ms | 256 KB |
27.txt | AC | 3 ms | 256 KB |
28.txt | AC | 3 ms | 256 KB |
29.txt | AC | 3 ms | 256 KB |
30.txt | AC | 3 ms | 256 KB |
31.txt | AC | 2 ms | 256 KB |
32.txt | AC | 3 ms | 256 KB |
33.txt | AC | 2 ms | 256 KB |
34.txt | AC | 2 ms | 256 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |