CF1735D.Meta-set

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You like the card board game "Set". Each card contains kk features, each of which is equal to a value from the set {0,1,2}\{0, 1, 2\} . The deck contains all possible variants of cards, that is, there are 3k3^k different cards in total.

A feature for three cards is called good if it is the same for these cards or pairwise distinct. Three cards are called a set if all kk features are good for them.

For example, the cards (0,0,0)(0, 0, 0) , (0,2,1)(0, 2, 1) , and (0,1,2)(0, 1, 2) form a set, but the cards (0,2,2)(0, 2, 2) , (2,1,2)(2, 1, 2) , and (1,2,0)(1, 2, 0) do not, as, for example, the last feature is not good.

A group of five cards is called a meta-set, if there is strictly more than one set among them. How many meta-sets there are among given nn distinct cards?

输入格式

The first line of the input contains two integers nn and kk ( 1n1031 \le n \le 10^3 , 1k201 \le k \le 20 ) — the number of cards on a table and the number of card features. The description of the cards follows in the next nn lines.

Each line describing a card contains kk integers ci,1,ci,2,,ci,kc_{i, 1}, c_{i, 2}, \ldots, c_{i, k} ( 0ci,j20 \le c_{i, j} \le 2 ) — card features. It is guaranteed that all cards are distinct.

输出格式

Output one integer — the number of meta-sets.

输入输出样例

  • 输入#1

    8 4
    0 0 0 0
    0 0 0 1
    0 0 0 2
    0 0 1 0
    0 0 2 0
    0 1 0 0
    1 0 0 0
    2 2 0 0

    输出#1

    1
  • 输入#2

    7 4
    0 0 0 0
    0 0 0 1
    0 0 0 2
    0 0 1 0
    0 0 2 0
    0 1 0 0
    0 2 0 0

    输出#2

    3
  • 输入#3

    9 2
    0 0
    0 1
    0 2
    1 0
    1 1
    1 2
    2 0
    2 1
    2 2

    输出#3

    54
  • 输入#4

    20 4
    0 2 0 0
    0 2 2 2
    0 2 2 1
    0 2 0 1
    1 2 2 0
    1 2 1 0
    1 2 2 1
    1 2 0 1
    1 1 2 2
    1 1 0 2
    1 1 2 1
    1 1 1 1
    2 1 2 0
    2 1 1 2
    2 1 2 1
    2 1 1 1
    0 1 1 2
    0 0 1 0
    2 2 0 0
    2 0 0 2

    输出#4

    0

说明/提示

Let's draw the cards indicating the first four features. The first feature will indicate the number of objects on a card: 11 , 22 , 33 . The second one is the color: red, green, purple. The third is the shape: oval, diamond, squiggle. The fourth is filling: open, striped, solid.

You can see the first three tests below. For the first two tests, the meta-sets are highlighted.

In the first test, the only meta-set is the five cards (0000, 0001, 0002, 0010, 0020)(0000,\ 0001,\ 0002,\ 0010,\ 0020) . The sets in it are the triples (0000, 0001, 0002)(0000,\ 0001,\ 0002) and (0000, 0010, 0020)(0000,\ 0010,\ 0020) . Also, a set is the triple (0100, 1000, 2200)(0100,\ 1000,\ 2200) which does not belong to any meta-set.

In the second test, the following groups of five cards are meta-sets: (0000, 0001, 0002, 0010, 0020)(0000,\ 0001,\ 0002,\ 0010,\ 0020) , (0000, 0001, 0002, 0100, 0200)(0000,\ 0001,\ 0002,\ 0100,\ 0200) , (0000, 0010, 0020, 0100, 0200)(0000,\ 0010,\ 0020,\ 0100,\ 0200) .

In there third test, there are 5454 meta-sets.

首页