uva 6757 Cup of Cowards（中途相遇法，貌似）

view code#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define iform "%I64d"
const int N = (1<<20)+10;
const ll INF = 1LL<<60;
ll _, L;
ll Min[N<<4],pos[N<<4], x[N<<1], xcnt;
ll d[100], c[100], cnt;
ll damage, cost;
struct node
{
    ll v, c;
    bool operator < (const node &o) const{
        return v>o.v;
    }
}one[N], two[N];
bool cmp(const node& a, const node &b)
{
    return a.c<b.c;
}
void calc(node o[], int n, ll d[], ll c[], int &cnt)
{
      cnt = 0;
      for(int i=0; i<n; i++)
      {
          int k = cnt;
          for(int j=0; j<k; j++)
          {
              if(o[j].v>=L) continue;
              o[cnt].v = o[j].v+d[i];
              o[cnt].c = o[j].c+c[i];
              if(o[cnt].v>=L)
              {
                  if(o[cnt].c<cost) cost = o[cnt].c, damage=o[cnt].v, cnt++;
                  else if(o[cnt].c==cost && damage>o[cnt].v) damage = o[cnt].v,cnt++;
              }
              else cnt++;
          }
          o[cnt].v = d[i];
          o[cnt].c = c[i];
          if(o[cnt].v>=L)
          {
              if(o[cnt].c<cost) cost = o[cnt].c, damage=o[cnt].v, cnt++;
              else if(o[cnt].c==cost && damage>o[cnt].v) damage = o[cnt].v,cnt++;
          }
          else cnt++;
      }
}
int ocnt, tcnt;

void solve()
{
    scanf(iform, &L);
    ll num, dam, cos;
    cnt = 0;
    for(int i=1; i<=5; i++)
    {
        scanf(iform iform iform, &num, &dam, &cos);
        ll k = 1;
        while(num)
        {
            ll t = min(k, num);
            d[cnt] = dam*t;
            c[cnt] = cos*t;
            cnt++;
            num -= t;
            k *= 2;
        }
    }
    xcnt = 0;damage = -1, cost = INF;
    ll n =cnt/2, m = cnt-n;
    calc(one, n, d, c, ocnt);
    calc(two, m, d+n, c+n, tcnt);
    sort(one, one+ocnt, cmp);
    sort(two, two+tcnt);
    int i=0, j=0;
    while(j<tcnt && two[j].v>=L) j++;
    for(; i<ocnt&&j<tcnt; i++)
    {
        if(one[i].v>=L) continue;
        else
        {
            while(j<tcnt && one[i].v+two[j].v>=L)
            {
                ll sumc = one[i].c+two[j].c;
                ll sumv = one[i].v+two[j].v;
                if(sumc<cost) damage=sumv,cost=sumc;
                else if(sumc==cost) damage=sumv;
                j++;
            }
        }
    }
    if(damage==-1) puts("We are doomed!!");
    else cout<<cost<<""<<damage<<endl;
}
int main()
{
//    freopen("in.txt", "r", stdin);
    cin>>_;
    while(_--) solve();
    return 0;
}