Submission #3417257


Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <algorithm>
#include <set>
#include <string>
#include <queue>

#define rep(i, N) for(int (i) = 0; (i) < (N); (i) ++)
typedef long long ll;

using namespace std;
typedef pair<int, int> pii;

int main(){
    int H, W;
    cin >> H >> W;
    vector<int> cnts(26);

    rep(i, H){
        rep(j, W){
            char c;
            cin >> c;
            cnts[c - 'a'] ++;
        }
    }

    vector<int> modF(4);
    rep(i, cnts.size()){
        int index = cnts[i] % 4;
        modF[index] ++;
    }

    if(H % 2 == 0 && W % 2 == 0){
        if(modF[1] + modF[2] + modF[3] == 0){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
        return 0;
    }

    if(H % 2 == 1 && W % 2 == 1){
        if(modF[1] + modF[3] == 1 && modF[2] + modF[3] <= H / 2 + W / 2){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
        return 0;
    }

    if(W % 2 == 1){
        swap(H, W);
    }

    if(modF[1] + modF[3] == 0 && modF[2] <= W / 2){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }

    return 0;
}

Submission Info

Submission Time
Task C - Palindromic Matrix
User zakou
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1283 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 5
AC × 32
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 2 ms 256 KB
1_10.txt AC 2 ms 256 KB
1_11.txt AC 2 ms 256 KB
1_12.txt AC 2 ms 256 KB
1_13.txt AC 2 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