Guess a number! （二分答案）

最新推荐文章于 2020-12-17 22:42:59 发布

mrxs

最新推荐文章于 2020-12-17 22:42:59 发布

阅读量352

点赞数

分类专栏： ACM训练+实训+大学编程练习

本文链接：https://blog.csdn.net/feather2016/article/details/79168603

版权

ACM训练+实训+大学编程练习专栏收录该内容

362 篇文章 4 订阅

订阅专栏

A TV show called “Guess a number!” is gathering popularity. The whole Berland, the old and the young, are watching the show.

The rules are simple. The host thinks of an integer y and the participants guess it by asking questions to the host. There are four types of acceptable questions:

Is it true that y is strictly larger than number x?
Is it true that y is strictly smaller than number x?
Is it true that y is larger than or equal to number x?
Is it true that y is smaller than or equal to number x?
On each question the host answers truthfully, “yes” or “no”.

Given the sequence of questions and answers, find any integer value of y that meets the criteria of all answers. If there isn’t such value, print “Impossible”.

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 10000) — the number of questions (and answers). Next n lines each contain one question and one answer to it. The format of each line is like that: “sign x answer”, where the sign is:

“>” (for the first type queries),
“<” (for the second type queries),
“>=” (for the third type queries),
“<=” (for the fourth type queries).
All values of x are integer and meet the inequation - 109 ≤ x ≤ 109. The answer is an English letter “Y” (for “yes”) or “N” (for “no”).

Consequtive elements in lines are separated by a single space.

Output
Print any of such integers y, that the answers to all the queries are correct. The printed number y must meet the inequation - 2·109 ≤ y ≤ 2·109. If there are many answers, print any of them. If such value doesn’t exist, print word “Impossible” (without the quotes).

Example
Input
4

= 1 Y
< 3 N
<= -3 N
55 N
Output
17
Input
2
100 Y
< -100 Y
Output
Impossible

注意分情况讨论，要记住在里面判断是否符合条件。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <iostream>
#define Mod  20170825
#define maxn 12312111
#define INF 0x3f3f3f3f
using namespace std;
int main()
{
    long long int n;
    char a[12], b[12];
    long long int k;
    scanf("%lld", &n);
    long long int l = -INF;
    long long int r = INF;
    int flag = 1;
    while(n--)
    {
        scanf("%s %lld %s", a, &k, b);
        if(strcmp(a, ">")==0)
        {
            if(strcmp(b, "Y")==0)//>
            {
                if(r>=k+1&&flag==1)
                {
                    if(l<=k)
                        l = k+1;
                }
                else
                {
                    flag = 0;
                }
            }
            else //<=
            {
                if(l<=k&&flag==1)
                {
                    if(r>k)
                        r = k;
                }
                else
                    flag = 0;
            }
        }



        else if(strcmp(a, ">=")==0)
        {
            if(strcmp(b, "Y")==0)//>=
            {
                if(r>=k&&flag==1)
                {
                    if(l<k)
                        l = k;
                }
                else
                {
                    flag = 0;
                }
            }
            else//<
            {
                if(l<k&&flag==1)
                {
                    if(r>=k)
                        r = k - 1;
                }
                else
                    flag = 0;
            }
        }



        else if(strcmp(a, "<")==0)
        {
            if(strcmp(b, "Y")==0)//<
            {
                if(l<k&&flag==1)
                {
                    if(r>=k)
                        r = k - 1;
                }
                else
                    flag = 0;
            }
            else//>=
            {
               if(r>=k&&flag==1)
                {
                    if(l<k)
                        l = k;
                }
                else
                {
                    flag = 0;
                }
            }
        }




        else
        {
            if(strcmp(b, "Y")==0)//<=
            {
                 if(l<=k&&flag==1)
                {
                    if(r>k)
                        r = k;
                }
                else
                    flag = 0;
            }
            else//>
            {
                 if(r>=k+1&&flag==1)
                {
                    if(l<=k)
                        l = k+1;
                }
                else
                {
                    flag = 0;
                }
            }
        }
        //printf("%lld %lld %d\n", l, r, flag);
    }
    if(flag==1&&l<=r)
        printf("%lld\n", l);
    else
        printf("Impossible\n");
    return 0;
}