Submission #3445370
Source Code Expand
#include <cmath> #include <iostream> #include <vector> #include <queue> #include <deque> #include <map> #include <set> #include <stack> #include <tuple> #include <bitset> #include <algorithm> #include <functional> #include <utility> #include <iomanip> #define int long long int #define rep(i, n) for(int i = 0; i < (n); ++i) using namespace std; typedef pair<int, int> P; const int INF = 1e15; const int MOD = 1e9+7; signed main(){ int h, w, a, b; cin >> h >> w >> a >> b; vector<vector<bool>> s(h, vector<bool>(w, false)); int stone = 0; rep(i, h){ rep(j, w){ char c; cin >> c; if(c == 'S'){ s[i][j] = true; stone++; } } } int hor, ver, hv; hor = ver = hv = 0; rep(i, h / 2){ rep(j, w / 2){ int x = 0, y = 0; if(s[i][j] && s[h-1-i][j]){ x++; } if(s[i][w-1-j] && s[h-1-i][w-1-j]){ x++; } if(s[i][j] && s[i][w-1-j]){ y++; } if(s[h-1-i][j] && s[h-1-i][w-1-j]){ y++; } if(x == 2){ hv++; x = y = 0; } ver += x; hor += y; } } int ans1, ans2; ans1 = ans2 = 0; if(hv * 4 + ver * 2 != stone){ ans1 += a; } ans1 += ver * a; if(hv * 4 != stone){ ans1 += b; } ans1 += hv * (max(a, b) + a + b); if(hv * 4 + hor * 2 != stone){ ans2 += b; } ans2 += hor * b; if(hv * 4 != stone){ ans2 += a; } ans2 += hv * (max(a, b) + a + b); cout << max(ans1, ans2) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 石 |
User | amanuko |
Language | C++14 (Clang 3.8.0) |
Score | 600 |
Code Size | 1860 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 888 KB |
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 | 13 ms | 888 KB |
02.txt | AC | 7 ms | 256 KB |
03.txt | AC | 7 ms | 256 KB |
04.txt | AC | 7 ms | 256 KB |
05.txt | AC | 7 ms | 256 KB |
06.txt | AC | 7 ms | 256 KB |
07.txt | AC | 6 ms | 256 KB |
08.txt | AC | 7 ms | 256 KB |
09.txt | AC | 6 ms | 256 KB |
10.txt | AC | 6 ms | 256 KB |
11.txt | AC | 7 ms | 256 KB |
12.txt | AC | 7 ms | 256 KB |
13.txt | AC | 7 ms | 256 KB |
14.txt | AC | 6 ms | 256 KB |
15.txt | AC | 7 ms | 256 KB |
16.txt | AC | 7 ms | 256 KB |
17.txt | AC | 6 ms | 256 KB |
18.txt | AC | 7 ms | 256 KB |
19.txt | AC | 7 ms | 256 KB |
20.txt | AC | 7 ms | 256 KB |
21.txt | AC | 7 ms | 256 KB |
22.txt | AC | 7 ms | 256 KB |
23.txt | AC | 6 ms | 256 KB |
24.txt | AC | 7 ms | 256 KB |
25.txt | AC | 3 ms | 256 KB |
26.txt | AC | 6 ms | 256 KB |
27.txt | AC | 6 ms | 256 KB |
28.txt | AC | 7 ms | 256 KB |
29.txt | AC | 6 ms | 256 KB |
30.txt | AC | 7 ms | 256 KB |
31.txt | AC | 4 ms | 256 KB |
32.txt | AC | 7 ms | 256 KB |
33.txt | AC | 5 ms | 256 KB |
34.txt | AC | 5 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 |