Submission #2827634


Source Code Expand

#include <iostream>
#include <iomanip>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <vector>
#include <cassert>
#include <fstream>
#include <algorithm>
#include <list>
#include <random>
#include <ctime>
#include <cmath>
#include <random>
#include <bitset>
#include <complex>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define mmin(a, b) a = min(a, (b))
#define mmax(a, b) a = max(a, (b))
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define ALL(a) a.begin(),a.end()
#define sqr(x) (x) * (x)
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define cint const int &
#define SZ(a) ((int)(a.size()))
#define watch(x) cout << (#x) << " = " << x << endl;

const double PI = 2 * acos(0.0);

template<class T>
void show(const vector<T> &a) {
    for (T x : a)
        cout << x << " ";
    cout << endl;
}

int n, m;
const int N = 12;

string mat[N + 1];

int pop_cnt(int mask);

void answer(bool ok);

const ll M = 1e9 + 9, x = 131;

ll MOD(ll a) {
    if (a >= 0) return a >= M ? a % M : a;
    if (a <= -M) a %= M;
    return a ? a + M : a;
}

ll pwx[N];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    pwx[0] = 1;
    for (int i = 1; i < N; ++i)
        pwx[i] = MOD(pwx[i - 1] * x);

    cin >> n >> m;
    fori (i, n)
        cin >> mat[i];

    for (int mask = 0; mask < (1 << n); ++mask) if (pop_cnt(mask) == (n >> 1)) {
            vector<string> a, b;
            fori (i, n) {
                if ((mask >> i) & 1) b.pb(mat[i]);
                else a.pb(mat[i]);
            }

            sort(ALL(b));
            do {
                vector<int> kek(m);
                vector<int> revkek(m);
                fori (i, m) {
                    ll cur = 0;
                    ll rev = 0;
                    int j = 0;
                    for (auto &&s : a) {
                        int c = s[i] - 'a' + 1;
                        cur = MOD(cur + c * pwx[j]);
                        rev = MOD(rev + c * pwx[n - 1 - j++]);
                    }

                    for (auto &&s : b) {
                        int c = s[i] - 'a' + 1;
                        cur = MOD(cur + c * pwx[j]);
                        rev = MOD(rev + c * pwx[n - 1 - j++]);
                    }
                    kek[i] = cur;
                    revkek[i] = rev;
                }
                sort(ALL(kek));
                sort(ALL(revkek));
                if (kek == revkek) answer(1);
            } while (next_permutation(ALL(b)));
        }
    answer(0);
}

void answer(bool ok) {
    cout << (ok ? "YES" : "NO");
    exit(0);
}

int pop_cnt(int mask) {
    int ret = 0;
    fori (i, n) ret += !((mask >> i) & 1);
    return ret;
}

Submission Info

Submission Time
Task E - Symmetric Grid
User lessmeaning
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3317 Byte
Status WA
Exec Time 904 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 3
AC × 59
WA × 4
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 100.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 4.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 5.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
100.txt AC 2 ms 256 KB
11.txt AC 29 ms 256 KB
12.txt AC 30 ms 256 KB
13.txt AC 13 ms 256 KB
14.txt AC 4 ms 256 KB
15.txt AC 30 ms 256 KB
16.txt AC 904 ms 256 KB
17.txt AC 398 ms 256 KB
18.txt AC 180 ms 256 KB
19.txt AC 375 ms 256 KB
2.txt AC 1 ms 256 KB
20.txt AC 206 ms 256 KB
21.txt AC 396 ms 256 KB
22.txt AC 786 ms 256 KB
23.txt WA 25 ms 256 KB
24.txt AC 4 ms 256 KB
25.txt AC 6 ms 256 KB
26.txt WA 3 ms 256 KB
27.txt AC 399 ms 256 KB
28.txt WA 56 ms 256 KB
29.txt AC 60 ms 256 KB
3.txt AC 1 ms 256 KB
30.txt AC 174 ms 256 KB
31.txt AC 158 ms 256 KB
32.txt AC 42 ms 256 KB
33.txt AC 402 ms 256 KB
34.txt AC 789 ms 256 KB
35.txt WA 43 ms 256 KB
36.txt AC 41 ms 256 KB
37.txt AC 4 ms 256 KB
38.txt AC 171 ms 256 KB
39.txt AC 26 ms 256 KB
4.txt AC 1 ms 256 KB
40.txt AC 858 ms 256 KB
41.txt AC 367 ms 256 KB
42.txt AC 570 ms 256 KB
43.txt AC 848 ms 256 KB
44.txt AC 3 ms 256 KB
45.txt AC 3 ms 256 KB
46.txt AC 2 ms 256 KB
47.txt AC 28 ms 256 KB
48.txt AC 407 ms 256 KB
49.txt AC 799 ms 256 KB
5.txt AC 1 ms 256 KB
50.txt AC 364 ms 256 KB
51.txt AC 102 ms 256 KB
52.txt AC 849 ms 256 KB
53.txt AC 869 ms 256 KB
54.txt AC 1 ms 256 KB
55.txt AC 1 ms 256 KB
56.txt AC 620 ms 256 KB
6.txt AC 1 ms 256 KB
7.txt AC 1 ms 256 KB
8.txt AC 1 ms 256 KB
9.txt AC 1 ms 256 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 218 ms 256 KB