2012网赛天津赛区 2012tianjin regional online contest

b题 平衡树 或multiset.hdu Problem 4279

#include <cstdio>
#include <set>
#include <algorithm>

using namespace std;
const int maxn=100000+123;

///int ax[maxn], ay[maxn], bx[maxn], by[maxn];
multiset<int, greater<int> > card;

struct Node{
    int x, y;
}a[maxn], b[maxn];

bool cmp(Node a, Node b)
{
    return (a.x<b.x || (a.x==b.x && a.y<b.y));
}

bool cmp1(int a, int b)
{
    return a>b;
}
int main()
{
    int cas; scanf("%d", &cas);
    while(cas--)
    {
        int n; scanf("%d", &n);
        for (int i=0; i<n; ++i)
            scanf("%d%d", &a[i].x, &a[i].y);
            ///scanf("%d%d", ax+i, ay+i);
        for (int i=0; i<n; ++i)
            scanf("%d%d", &b[i].x, &b[i].y);
            ///scanf("%d%d", bx+i, by+i);
        sort(a, a+n, cmp); sort(b, b+n, cmp);
        int cnt=0;
        card.clear();
        for (int i=0, k=0; i<n; ++i)
        {
            while (a[i].x>=b[k].x && k<n)
            {
                card.insert(b[k].y); k++;
            }
            multiset<int, greater<int> > :: iterator it=card.lower_bound(a[i].y);
            ///multiset<int, greater<int> > :: iterator it=lower_bound(card.begin(), card.end(), a[i].y, cmp1 );
            /// 下面的这个用法会tle应该是常数太大的原因。 上面的1500ms过。 
            if(it!=card.end())
            {
                
                ///it=max_element(card.begin(), --it);
                ///printf("%d %d %d\n", *it, a[i].x, a[i].y);
                card.erase(it);
                cnt++;
            }
        }
        printf("%d\n", cnt);
    }
    return 0;
}
/*
2
3
1 10
1 10
1 20
1 20
1 20
1 20
2
2 2
3 1
1 3
2 2

*/

d题hdu Problem 4281

两种解法都超暴力， 样例本地跑了456ms, 交上去竟然312ms过了！

状态背包+mtsp问题

两种方法都很暴力 时间复杂度都有个O(2^n*tot)其中tot是一个教练能处理的状态的总个数， 还好没有让tot接近2^n的数据。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

const int inf=0x3f3f3f3f;
const double eps=10e-9;
int X[22], Y[22], C[22];
int N, M;
int sta[1<<16], tot;
int dp[1<<16];

int fst()
{
    int limit=1<<N;
    tot=0;
    memset (dp, 0x3f, sizeof(dp));
    for (int i=1; i<limit; ++i)
    {
        int tmp=0, t=0;
        for (int x=i; x; x>>=1, ++t)
            if(x&1)tmp+=C[t];
        if(tmp<=M)sta[tot++]=i, dp[i]=1;
    }
    dp[0]=0;
    for (int i=0; i<limit; ++i)
    {
        for (int j=0; j<tot; ++j)if( (i|sta[j])==i )
        {
            dp[i]=min(dp[i], dp[sta[j]]+dp[sta[j]^i]);
        }
    }
    return dp[limit-1];
}
int dist[20][20];

int Distance(int x, int y)
{
    return (int)(sqrt((double)x*x+(double)y*y)+1-eps);/// maybe precision mistake . 
}

int tsp[1<<16][20];
int scd()
{
    for (int i=0; i<N; ++i)
        for (int j=0; j<N; ++j)
            dist[i][j] = Distance(X[i]-X[j], Y[i]-Y[j]); /// , printf("%d %d %d\n", X[i]-X[j], Y[i]-Y[j], Distance(X[i]-X[j], Y[i]-Y[j]));
            
    int limit = 1<<N;
    
    memset (tsp, 0x3f, sizeof(tsp));
    tsp[0][0]=tsp[1][0]=0;
    for (int i=0; i<N; ++i)
        tsp[1<<i][i]=tsp[1<<i|1][i]=dist[i][0];
    for (int i=1; i<limit; ++i)
    {
        for (int j=0; j<N; ++j)if((1<<j)&i)
        {
            for (int k=0; k<N; ++k)if(j!=k)if((1<<k)&i)
            {
                tsp[i][j]=min(tsp[i][j], tsp[i^(1<<j)][k]+dist[j][k]);
            }
//            if((i&(i-1)) == 0) printf("tsp=%d  %d\n", tsp[i][j], j);
        }
    }
    memset (dp, 0x3f, sizeof(dp));
    dp[0]=0;
    for (int i=0; i<tot; ++i)
    {
        for (int j=0; j<N; ++j)
            //dp[i]=min(dp[i], tsp[i][j]+dist[j][0]);
            dp[sta[i]]=min(dp[sta[i]], tsp[sta[i]][j]+dist[j][0]);
//        printf("dp=%d\n", dp[sta[i]]);
    }
    
    for (int i=1; i<limit; i+=2)
    {
        for (int sub=(i-1)&i; sub; sub=(sub-1)&i)
        {
            dp[i]=min(dp[sub]+dp[i^sub], dp[i]);
        }
    }
    return dp[limit-1];
}

int main ()
{
#ifndef ONLINE_JUDGE
	freopen("data.in","r",stdin);
#endif
    while (~scanf("%d%d", &N, &M))
    {
        for (int i=0; i<N; ++i)
            scanf("%d%d", X+i, Y+i);
        for (int i=0; i<N; ++i)
            scanf("%d", C+i);
        int ans1=fst(), ans2;
        
        if(ans1!=inf)
        {
            ans2=scd();
            printf("%d %d\n", ans1, ans2);
        }
        else puts("-1 -1");
    }
    return 0;
}

g题 hdu ， 水题一个， 不知道一开始怎么没人做， 比赛后半程才开始敲得。

floyd+状态dp

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int inf=0x3f3f3f3f;

int dist[123][123];

int dp[40000][20];
int N, M, W;
int C[20], D[20], num[20];

int main()
{
    int cas; scanf("%d", &cas);
    while (cas--)
    {
        scanf("%d%d%d", &N, &M, &W);
        memset (dist, 0x3f, sizeof(dist));
        for (int i=0; i<M; ++i)
        {
            int a, b, c; scanf("%d%d%d", &a, &b, &c);
            a--, b--;
            dist[a][b]=dist[b][a]=min(dist[a][b], c);
            
        }
        int H; scanf("%d", &H);
        for (int i=0; i<H; ++i)
        {
            scanf("%d%d%d", num+i, C+i, D+i);
            num[i]--;
        }
        int limit=1<<H;
        for (int i=0; i<N; ++i)dist[i][i]=0;
        for (int k=0; k<N; ++k)
        {
            for (int i=0; i<N; ++i)
            {
                for (int j=0; j<N; ++j)
                {
                    dist[i][j]=min(dist[i][k]+dist[k][j], dist[i][j]);
                }
            }
        }
        memset (dp, 0xff, sizeof(dp));
        
        
        for (int i=0; i<H; ++i)
            if(W>=dist[num[i]][0]+D[i])dp[1<<i][i]=W-dist[num[i]][0]-D[i]+C[i];
        
        for (int i=1; i<limit; ++i)
        {
            for (int j=0; j<H; ++j)
            {
                if(i & (1<<j))
                {
                    for (int k=0; k<H; ++k)if(k!=j)
                    {
                        if(i & (1<<k))if(dp[i^(1<<j)][k]>=dist[num[j]][num[k]]+D[j])
                        {
                            dp[i][j]=max(dp[i][j], dp[i^(1<<j)][k]+C[j]-D[j]-dist[num[j]][num[k]]);
                        }
                    }
                }
            }
        }
        bool flag=false;
        for (int i=0; i<H; ++i)
        {
            if(dp[limit-1][i]>=dist[num[i]][1])flag=true;
            ///printf("%d\n", dp[limit-1][i]);
        }
        if(flag)printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}