Submission #1617339
Source Code Expand
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } //--------------------------------------------------------------------------------------------------- /*--------------------------------------------------------------------------------------------------- ∧_∧ ∧_∧ (´<_` ) Welcome to My Coding Space! ( ´_ゝ`) / ⌒i / \ | | / / ̄ ̄ ̄ ̄/ | __(__ニつ/ _/ .| .|____ \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ int H, W; string A[101]; #define NO "No" #define YES "Yes" //-------------------------------------------------------------------------------------------------- string solve() { map<char, int> cnt; rep(y, 0, H) rep(x, 0, W) cnt[A[y][x]]++; if (H % 2 == 0 && W % 2 == 0) { fore(p, cnt) if (p.second % 4) return NO; return YES; } if (H % 2 && W % 2) { map<int, int> c; fore(p, cnt) c[p.second % 4]++; if (c[3]) return NO; if (c[1] != 1) return NO; if (c[2] > (H - 1) / 2 + (W - 1) / 2) return NO; return YES; } if (W % 2) swap(H, W); map<int, int> c; fore(p, cnt) c[p.second % 4]++; if (c[1] || c[3]) return NO; if (c[2] > W / 2) return NO; return YES; } //-------------------------------------------------------------------------------------------------- void _main() { cin >> H >> W; rep(y, 0, H) cin >> A[y]; cout << solve() << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Palindromic Matrix |
User | hamayanhamayan |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1946 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
0_04.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 1 ms | 256 KB |
1_10.txt | AC | 1 ms | 256 KB |
1_11.txt | AC | 1 ms | 256 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 1 ms | 256 KB |
1_14.txt | AC | 2 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 1 ms | 256 KB |
1_17.txt | AC | 1 ms | 256 KB |
1_18.txt | AC | 1 ms | 256 KB |
1_19.txt | AC | 1 ms | 256 KB |
1_20.txt | AC | 1 ms | 256 KB |
1_21.txt | AC | 1 ms | 256 KB |
1_22.txt | AC | 1 ms | 256 KB |
1_23.txt | AC | 1 ms | 256 KB |
1_24.txt | AC | 1 ms | 256 KB |
1_25.txt | AC | 1 ms | 256 KB |
1_26.txt | AC | 1 ms | 256 KB |