답안 #486985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486985 2021-11-13T17:23:11 Z model_code Set (COCI21_set) C++17
110 / 110
136 ms 11752 KB
#include<bits/stdc++.h>

using namespace std;

typedef long long llint;
typedef pair <int, int> pi;

const int MAXN = 600005;

int n, k;
int cnt[MAXN];

struct Z_adjoin_w {
    llint x, y;

    Z_adjoin_w () {
        x = y = 0;
    }

    Z_adjoin_w (llint _x, llint _y) {
        x = _x; y = _y;
    }
} P[MAXN];

const Z_adjoin_w w = Z_adjoin_w(0, 1);
const Z_adjoin_w w2 = Z_adjoin_w(-1, -1);

Z_adjoin_w add (Z_adjoin_w a, Z_adjoin_w b) {
    return Z_adjoin_w(a.x + b.x, a.y + b.y);
}

Z_adjoin_w div_by_3 (Z_adjoin_w a) {
    return Z_adjoin_w(a.x / 3, a.y / 3);
}

Z_adjoin_w mul (Z_adjoin_w a, Z_adjoin_w b) {
    return Z_adjoin_w(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x - a.y * b.y);
}

void modified_FWHT (bool invert) {
    int siz = 1;
    for (int i = 0; i < k; i++) siz *= 3;

    for (int len = 1; len < siz; len *= 3) {
        for (int i = 0; i < siz; i += 3 * len) {
            for (int j = 0; j < len; j++) {
                Z_adjoin_w a = P[i + j + len * 0];
                Z_adjoin_w b = P[i + j + len * 1];
                Z_adjoin_w c = P[i + j + len * 2];
                if (invert == 0) {
                    P[i + j + len * 0] = add(a, add(b, c));
                    P[i + j + len * 1] = add(a, add(mul(b, w), mul(c, w2)));
                    P[i + j + len * 2] = add(a, add(mul(b, w2), mul(c, w)));
                } else {
                    P[i + j + len * 0] = div_by_3(add(a, add(b, c)));
                    P[i + j + len * 1] = div_by_3(add(a, add(mul(b, w2), mul(c, w))));
                    P[i + j + len * 2] = div_by_3(add(a, add(mul(b, w), mul(c, w2))));
                }
            }
        }
    }
}

void calc () {
    int siz = 1;
    for (int i = 0; i < k; i++) siz *= 3;

    modified_FWHT(0);
    for (int i = 0; i < siz; i++) {
        P[i] = mul(P[i], P[i]);
    }
    modified_FWHT(1);

    llint sol = 0;
    for (int i = 0; i < siz; i++) {
        int val = i, comp = 0, pot = 1;
        for (int j = 0; j < k; j++) {
            comp += (3 - val % 3) % 3 * pot;
            val /= 3;
            pot *= 3;
        }
        sol += cnt[i] * (P[comp].x - 1);
    }
    cout << sol / 6;
}

int main () {
    //ios_base::sync_with_stdio(false);
    //cin.tie(0);
    scanf("%d%d", &n, &k);
    getchar();
    for (int i = 0; i < n; i++) {

        int val = 0;
        for (int j = 0; j < k; j++) {
            char c = getchar();
            val = val * 3 + c - '1';
        }
        getchar();

        P[val] = Z_adjoin_w(1, 0);
        cnt[val]++;
    }
    calc();
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:90:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     scanf("%d%d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 4 ms 9688 KB Output is correct
3 Correct 4 ms 9676 KB Output is correct
4 Correct 4 ms 9676 KB Output is correct
5 Correct 4 ms 9668 KB Output is correct
6 Correct 4 ms 9676 KB Output is correct
7 Correct 4 ms 9676 KB Output is correct
8 Correct 4 ms 9676 KB Output is correct
9 Correct 4 ms 9676 KB Output is correct
10 Correct 4 ms 9676 KB Output is correct
11 Correct 4 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 4 ms 9676 KB Output is correct
14 Correct 4 ms 9684 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 4 ms 9688 KB Output is correct
3 Correct 4 ms 9676 KB Output is correct
4 Correct 4 ms 9676 KB Output is correct
5 Correct 4 ms 9668 KB Output is correct
6 Correct 4 ms 9676 KB Output is correct
7 Correct 4 ms 9676 KB Output is correct
8 Correct 4 ms 9676 KB Output is correct
9 Correct 4 ms 9676 KB Output is correct
10 Correct 4 ms 9676 KB Output is correct
11 Correct 4 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 4 ms 9676 KB Output is correct
14 Correct 4 ms 9684 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 4 ms 9676 KB Output is correct
17 Correct 4 ms 9676 KB Output is correct
18 Correct 4 ms 9676 KB Output is correct
19 Correct 4 ms 9676 KB Output is correct
20 Correct 4 ms 9676 KB Output is correct
21 Correct 4 ms 9624 KB Output is correct
22 Correct 4 ms 9676 KB Output is correct
23 Correct 5 ms 9676 KB Output is correct
24 Correct 4 ms 9676 KB Output is correct
25 Correct 5 ms 9676 KB Output is correct
26 Correct 5 ms 9676 KB Output is correct
27 Correct 5 ms 9620 KB Output is correct
28 Correct 4 ms 9660 KB Output is correct
29 Correct 5 ms 9676 KB Output is correct
30 Correct 5 ms 9676 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 4 ms 9688 KB Output is correct
3 Correct 4 ms 9676 KB Output is correct
4 Correct 4 ms 9676 KB Output is correct
5 Correct 4 ms 9668 KB Output is correct
6 Correct 4 ms 9676 KB Output is correct
7 Correct 4 ms 9676 KB Output is correct
8 Correct 4 ms 9676 KB Output is correct
9 Correct 4 ms 9676 KB Output is correct
10 Correct 4 ms 9676 KB Output is correct
11 Correct 4 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 4 ms 9676 KB Output is correct
14 Correct 4 ms 9684 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 4 ms 9676 KB Output is correct
17 Correct 4 ms 9676 KB Output is correct
18 Correct 4 ms 9676 KB Output is correct
19 Correct 4 ms 9676 KB Output is correct
20 Correct 4 ms 9676 KB Output is correct
21 Correct 4 ms 9624 KB Output is correct
22 Correct 4 ms 9676 KB Output is correct
23 Correct 5 ms 9676 KB Output is correct
24 Correct 4 ms 9676 KB Output is correct
25 Correct 5 ms 9676 KB Output is correct
26 Correct 5 ms 9676 KB Output is correct
27 Correct 5 ms 9620 KB Output is correct
28 Correct 4 ms 9660 KB Output is correct
29 Correct 5 ms 9676 KB Output is correct
30 Correct 5 ms 9676 KB Output is correct
31 Correct 71 ms 9676 KB Output is correct
32 Correct 68 ms 9684 KB Output is correct
33 Correct 63 ms 9684 KB Output is correct
34 Correct 136 ms 11744 KB Output is correct
35 Correct 4 ms 9676 KB Output is correct
36 Correct 4 ms 9676 KB Output is correct
37 Correct 4 ms 9676 KB Output is correct
38 Correct 122 ms 11752 KB Output is correct
39 Correct 84 ms 11724 KB Output is correct
40 Correct 122 ms 11740 KB Output is correct
41 Correct 71 ms 11724 KB Output is correct
42 Correct 117 ms 11744 KB Output is correct
43 Correct 5 ms 9676 KB Output is correct
44 Correct 5 ms 9676 KB Output is correct
45 Correct 4 ms 9676 KB Output is correct