#PU963. USACO 2019 December Contest, Bronze — Problem 1. Cow Gymnastics

    ID: 1267 传统题 文件IO:gymnastics 2000ms 256MiB 尝试: 0 已通过: 0 难度: 普及 上传者: 标签>USACO赛事:dec19来源:usaco.orgscoring:equal_test_cases

USACO 2019 December Contest, Bronze — Problem 1. Cow Gymnastics

USACO 2019 December Contest, Bronze — Problem 1. Cow Gymnastics

题目描述

In order to improve their physical fitness, the cows have taken up gymnastics! Farmer John designates his favorite cow Bessie to coach the NN other cows and to assess their progress as they learn various gymnastic skills. In each of KK practice sessions (1≤K≤101 \leq K \leq 10), Bessie ranks the NN cows according to their performance (1≤N≤201 \leq N \leq 20). Afterward, she is curious about the consistency in these rankings. A pair of two distinct cows is consistent if one cow did better than the other one in every practice session. Help Bessie compute the total number of consistent pairs.

输入格式

The first line of the input file contains two positive integers KK and NN. The next KK lines will each contain the integers 1…N1 \ldots N in some order, indicating the rankings of the cows (cows are identified by the numbers 1…N1 \ldots N). If AA appears before BB in one of these lines, that means cow AA did better than cow BB.

输出格式

(见题面原文)

数据范围

(见题面原文)

样例

样例 1

3 4
4 1 2 3
4 1 3 2
4 2 1 3
4
The consistent pairs of cows are $(1,4)$, $(2,4)$, $(3,4)$, and $(1,3)$.
Problem credits: Nick Wu