2016 GDUT Individual Contest2_A题_codeforces 416A(双指针)

最新推荐文章于 2023-02-20 19:41:01 发布

ize

最新推荐文章于 2023-02-20 19:41:01 发布

阅读量324

点赞数

分类专栏： acm 文章标签： acm cf水题双指针

本文链接：https://blog.csdn.net/u011389977/article/details/50557434

版权

acm 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

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 test(s) 
      
 
         input 
        
4
>= 1 Y
< 3 N
<= -3 N
> 55 N
 
         output 
        
17
 
         input 
        
2
> 100 Y
< -100 Y
 
         output 
        
Impossible

题意：猜数字游戏，每次可以有4种询问，  是否 >= ,是否 <= ,是否 > ,是否< ,然后给出肯定或否定的回答 最后输出一个在该范围里的数字。
思路：类似以二分查找，用x和y来表示上界和下界，最后如果上界比下届还大，则不成立，否则，输出x（一定成立）。但要注意，每次更新时要注意，x只能往大的方向更新，y只能往小的方向更新。否则会出错。
代码：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>

using namespace std;

const int INF = 0x7fffffff;

int main()
{

    int n;
    __int64 x = -2*1e9, y = 2*1e9;
    cin >> n;
    for(int i = 0; i < n; ++i)
    {
        string fu;
        __int64 cmp;
        string yesno;
        cin >> fu >> cmp >> yesno;
        if(fu.size() == 1)
        {
            if(fu[0] == '>' && yesno[0] == 'Y')
            {
                x = max(x, cmp+1);
            }
            else if(fu[0] == '>' && yesno[0] == 'N')
            {
                y = min(y,cmp);
            }
            else if(fu[0] == '<' && yesno[0] == 'Y')
            {
                y = min(y,cmp-1);
            }
            else if(fu[0] == '<' && yesno[0] == 'N')
            {
                x = max(x, cmp);
            }
        }
        else
        {
            if(fu[0] == '>' && yesno[0] == 'Y')
            {

                x = max(x, cmp);
            }
            else if(fu[0] == '>' && yesno[0] == 'N')
            {
                y = min(y,cmp-1);
            }
            else if(fu[0] == '<' && yesno[0] == 'Y')
            {
                y = min(y, cmp);
            }
            else if(fu[0] == '<' && yesno[0] == 'N')
            {
                x = max(x, cmp+1);
            }
        }
        //cout << x << " " << y << endl;
    }
        if(x > y)
            cout << "Impossible" << endl;
        else
            cout << x << endl;
    return 0;
}