Submission #1693829
Source Code Expand
#include <cstdio> #include <cstdlib> #include <iostream> #include <algorithm> #include <cstring> #include <vector> #include <map> #include <cmath> #include <numeric> #define rep(i,n) for(int i = 0;i < (n);i++) #define repp(i,j, n) for(int i = (j);i < (n);i++) #define all(x) (x).begin(),(x).end() #define pb(x) push_back(x) #define mp(a,b) make_pair(a,b) #define INF 1e9 using namespace std; typedef long long int ll; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vl; typedef vector<pair<int, int> > vpi; typedef vector<pair<ll, ll> > vpl; int main(){ cin.tie(0); ios::sync_with_stdio(false); int h, w; cin >> h >> w; int alpha[26]={0}; rep(i, h){ string a; cin >> a; rep(j, w) alpha[(int)a[j]-'a']++; } int count = 0, odd = 0; rep(i, 26){ if(alpha[i] >= 4){ count++; } if(alpha[i]%2!=0) odd++; } if((h%2==0?h:h-1)*(w%2==0?w:w-1)/4 <= count && odd == ((h%2!=0&&w%2!=0)?1:0)){ cout << "Yes" << endl; }else{ cout << "No" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Palindromic Matrix |
User | oshiumi |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1092 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
1_10.txt | AC | 2 ms | 256 KB |
1_11.txt | AC | 1 ms | 256 KB |
1_12.txt | WA | 1 ms | 256 KB |
1_13.txt | AC | 1 ms | 256 KB |
1_14.txt | AC | 2 ms | 256 KB |
1_15.txt | WA | 1 ms | 256 KB |
1_16.txt | AC | 1 ms | 256 KB |
1_17.txt | AC | 1 ms | 256 KB |
1_18.txt | WA | 1 ms | 256 KB |
1_19.txt | AC | 1 ms | 256 KB |
1_20.txt | AC | 1 ms | 256 KB |
1_21.txt | WA | 1 ms | 256 KB |
1_22.txt | AC | 1 ms | 256 KB |
1_23.txt | AC | 1 ms | 256 KB |
1_24.txt | WA | 1 ms | 256 KB |
1_25.txt | AC | 1 ms | 256 KB |
1_26.txt | AC | 1 ms | 256 KB |