codeforces Guess a number!

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

徐诚武

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

阅读量418

点赞数

分类专栏： codeforce

本文链接：https://blog.csdn.net/wilver/article/details/50180953

版权

codeforce 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

Description
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).

Sample Input
Input
4

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

题意：输入n种不等判断，Y是正确，N是错误，要求你随机输出一个符合要求的数；

其实就是找一个上限和一个下线就可以了；

#include <iostream>
#include <cstdio>
#include <string.h>
#define N 1e9
using namespace std;

int main()
{
    int n;
    while(cin>>n)
    {
        long long max=2*N;
        long long min=-2*N;
        for(int k=0; k<n; k++)
        {
            char a[3];
            scanf("%s",a);
            long long s;
            cin>>s;
            char b;
            cin>>b;
            if((strcmp(a,">")==0&&b=='Y')||(strcmp(a,"<=")==0&&b=='N'))
            {
                if(min<=s)
                min=s+1;
            }
            if(strcmp(a,">=")==0&&b=='Y'||(strcmp(a,"<")==0&&b=='N'))
            {
                if(min<s)
                min=s;
            }
            if(strcmp(a,"<")==0&&b=='Y'||(strcmp(a,">=")==0&&b=='N'))
            {
                if(max>=s)
                max=s-1;
            }
            if(strcmp(a,"<=")==0&&b=='Y'||(strcmp(a,">")==0&&b=='N'))
            {
                if(max>s)
                max=s;
            }
        }
        if(max<min)
        cout<<"Impossible"<<endl;
        else
        cout<<min<<endl;
    }
    return 0;
}