CF Good Bye 2016 C New Year and Rating 模拟乱搞

新年第一天写篇题解压压惊...一年没搞ACM了

题意：L在2016年参加了n场codeforces比赛，告诉你这些比赛各自的divide和分数变动，问最后的rating最高是多少。

思路：从最后一场比赛开始模拟，当这场是div1时显然最后的最小值不小于1900与到这场比赛总变动值的和；当这场比赛是div2时显然最后的最大值不大于1899与到这场比赛总变动值的和。

//I have given up the treatment-_-||
#include <iostream>
#include <cstdio>
#include <ctime>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
using namespace std;
#define MAXN 9999
#define MAXSIZE 10
#define DLEN 4
typedef long long LL;
const int maxn = 200010;
const int maxm = 310;
const int mod = 1e9+7;
const int inf = 1e9+7;
const int dev = 100010;
const double eps = 1e-6;
const double EPS = eps;
const double pi = acos(-1.0);
int n,m;
int a[maxn];
int b[maxn];
int main()
{
    while(scanf("%d",&n)!=EOF){
        for(int i=1;i<=n;i++){
            scanf("%d%d",&a[i],&b[i]);
        }
        int mx = inf;
        int mi = -inf;
        int sum = 0;
        for(int i=n;i>=1;i--){
            sum+=a[i];
            if(b[i]==1){
                mi=max(mi,1900+sum);
            }
            else if(b[i]==2){
                mx=min(mx,1899+sum);
            }
            //printf("%d %d %d %d*\n",i,mi,mx,sum);
        }
        if(mi>mx){
            printf("Impossible\n");
        }
        else if(mx==inf){
            printf("Infinity\n");
        }
        else printf("%d\n",mx);
    }
    return 0;
}