CF60A.Where Are My Flakes?
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
One morning the Cereal Guy found out that all his cereal flakes were gone. He found a note instead of them. It turned out that his smart roommate hid the flakes in one of n boxes. The boxes stand in one row, they are numbered from 1 to n from the left to the right. The roommate left hints like "Hidden to the left of the i -th box" ("To the left of i "), "Hidden to the right of the i -th box" ("To the right of i "). Such hints mean that there are no flakes in the i -th box as well. The Cereal Guy wants to know the minimal number of boxes he necessarily needs to check to find the flakes considering all the hints. Or he wants to find out that the hints are contradictory and the roommate lied to him, that is, no box has the flakes.
输入格式
The first line contains two integers n and m ( 1<=n<=1000,0<=m<=1000 ) which represent the number of boxes and the number of hints correspondingly. Next m lines contain hints like "To the left of i " and "To the right of i ", where i is integer ( 1<=i<=n ). The hints may coincide.
输出格式
The answer should contain exactly one integer — the number of boxes that should necessarily be checked or "-1" if the hints are contradictory.
输入输出样例
输入#1
2 1 To the left of 2
输出#1
1
输入#2
3 2 To the right of 1 To the right of 2
输出#2
1
输入#3
3 1 To the left of 3
输出#3
2
输入#4
3 2 To the left of 2 To the right of 1
输出#4
-1