#PU963. USACO 2019 December Contest, Bronze — Problem 1. Cow Gymnastics
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 other cows and to assess their progress as they learn various gymnastic skills. In each of practice sessions (), Bessie ranks the cows according to their performance (). 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 and . The next lines will each contain the integers in some order, indicating the rankings of the cows (cows are identified by the numbers ). If appears before in one of these lines, that means cow did better than cow .
输出格式
(见题面原文)
数据范围
(见题面原文)
样例
样例 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