Good Bye 2016 C. New Year and Rating 模拟

C. New Year and Rating

链接：

http://codeforces.com/contest/750/problem/C

代码：

#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
const ll mod = 1000000007;
const int inf = 0x3f3f3f3f;
const double eps = 1e-7;
// head

int main() {
    int n;
    scanf("%d", &n);
    int from = -inf, to = inf;
    int delta = 0;
    rep(i, 1, n) {
        int d, cur;
        scanf("%d %d", &cur, &d);
        if (d == 1) from = max(from, 1900 - delta);
        else to = min(to, 1899 - delta);
        delta += cur;
    }
    if (from > to) return 0 * puts("Impossible");
    if (to == inf) return 0 * puts("Infinity");
    printf("%d
", to + delta);
    return 0;
}