SRM 606 D2 L2：EllysNumberGuessing

最新推荐文章于 2014-02-17 00:03:59 发布

xuzhezhaozhao

最新推荐文章于 2014-02-17 00:03:59 发布

阅读量818

点赞数

分类专栏： TopCoder

本文链接：https://blog.csdn.net/xzz_hust/article/details/18883663

版权

TopCoder 专栏收录该内容

112 篇文章 0 订阅

订阅专栏

题目：http://community.topcoder.com/stat?c=problem_statement&pm=12975

代码：

#include <algorithm>
#include <iostream>
#include <sstream>

#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>

using namespace std;


/*************** Program Begin **********************/
const int MAX = 1000000000;
class EllysNumberGuessing {
public:
    int getNumber(vector <int> guesses, vector <int> answers) {
        int res = 0;
	set <int> st;
	set <int> st2;

	int N = guesses.size();
	int t1 = guesses[0] - answers[0];
	int t2 = guesses[0] + answers[0];
	if (t1 > 0) {
		st.insert(t1);
	}
	if (t2 <= MAX) {
		st.insert(t2);
	}
	if (st.size() == 0) {
		return -2;
	}
	set <int>::iterator it;
	for (int i = 1; i < N; i++) {
		int t1 = guesses[i] - answers[i];
		int t2 = guesses[i] + answers[i];
		bool notLie = false;
		if (t1 > 0) {
			it = st.find(t1);
			if (it != st.end()) {
				st2.insert(t1);
				notLie = true;
			}
		}
		if (t2 <= MAX) {
			it = st.find(t2);
			if (it != st.end()) {
				st2.insert(t2);
				notLie = true;
			}
		}
		st = st2;
		st2.clear();
		if (!notLie) {
			return -2;
		}
	}
	if (st.size() > 1) {
		return -1;
	}
	res = ( *st.begin() );
        return res;
    }

};

/************** Program End ************************/