Submission #2559215
Source Code Expand
#include <cmath> #include <iostream> #include <vector> #include <queue> #include <map> #include <set> #include <algorithm> #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; cin >> h >> w; vector<int> a(26); rep(i, h){ rep(j, w){ char c; cin >> c; a[c-'a']++; } } int odd = 0; int twice = 0; rep(i, 26){ if(a[i] % 2 == 1){ odd++; } if(a[i] == 2 || a[i] == 3){ twice++; } } int twiceLimit = 0; if(h % 2 == 1){ twiceLimit += w / 2; } if(w % 2 == 1){ twiceLimit += h / 2; } if(odd > 1 || h * w % 2 == 1 && odd != 1 || twiceLimit < twice){ cout << "No" << endl; return 0; } cout << "Yes" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Palindromic Matrix |
User | amanuko |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 1068 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 888 KB |
Compile Error
./Main.cpp:53:34: warning: '&&' within '||' [-Wlogical-op-parentheses] if(odd > 1 || h * w % 2 == 1 && odd != 1 || twiceLimit < twice){ ~~ ~~~~~~~~~~~~~~~^~~~~~~~~~~ ./Main.cpp:53:34: note: place parentheses around the '&&' expression to silence this warning if(odd > 1 || h * w % 2 == 1 && odd != 1 || twiceLimit < twice){ ^ ( ) 1 warning generated.
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 | 12 ms | 888 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 | 2 ms | 256 KB |
1_10.txt | WA | 2 ms | 256 KB |
1_11.txt | AC | 2 ms | 256 KB |
1_12.txt | AC | 2 ms | 256 KB |
1_13.txt | WA | 2 ms | 256 KB |
1_14.txt | AC | 2 ms | 256 KB |
1_15.txt | AC | 2 ms | 256 KB |
1_16.txt | WA | 2 ms | 256 KB |
1_17.txt | AC | 2 ms | 256 KB |
1_18.txt | AC | 2 ms | 256 KB |
1_19.txt | WA | 2 ms | 256 KB |
1_20.txt | AC | 2 ms | 256 KB |
1_21.txt | AC | 1 ms | 256 KB |
1_22.txt | WA | 1 ms | 256 KB |
1_23.txt | AC | 1 ms | 256 KB |
1_24.txt | AC | 1 ms | 256 KB |
1_25.txt | WA | 1 ms | 256 KB |
1_26.txt | AC | 1 ms | 256 KB |