Survival（ZOJ 2297状压dp)

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <complex>
#include <cassert>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
#define lson l,m,rt<<1
#define pi acos(-1.0)
#define rson m+1,r,rt<<11
#define All 1,N,1
#define read freopen("in.txt", "r", stdin)
#define N 1<<20
const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;
const int INF= 0x7ffffff;
const int mod =  1000000007;
int dp[N],c[N],r[N],n;
int solve(){
    n=n-1;
    int cas=(1<<n);
   for(int i=0;i<cas;++i)
        dp[i]=-INF;
   dp[0]=100;
   for(int i=0;i<cas;++i)
    for(int j=0;j<n;++j)
        if(!(i&(1<<j))&&dp[i]>=c[j]){
            int t=dp[i]-c[j]+r[j];
            if(t>100)t=100;
            if(dp[i|(1<<j)]<t)
            dp[i|(1<<j)]=t;
        }
    if(dp[cas-1]>=c[n])
    printf("clear!!!\n");
    else printf("try again\n");
}
int main()
{
    while(~scanf("%d",&n)){
        for(int i=0;i<n-1;++i)
            scanf("%d%d",&c[i],&r[i]);
        scanf("%d",&c[n-1]);
        solve();
    }
return 0;
}