Picnic Planning POJ

5000+B，调死我了

set里判重居然是用符号比较判的，调出这个问题之后又莫名re，maxn改到3000居然才能跑discuss的样例

后来本机测发现弹了个bad_alloc。。看来以后做题vector不能随便开这么多了，估计改成静态数组每个一个tot就可以maxn30了

//#include<bits/stdc++.h>  
//#pragma comment(linker, "/STACK:1024000000,1024000000")   
#include<stdio.h>  
#include<algorithm>  
#include<queue>  
#include<string.h>  
#include<iostream>  
#include<math.h>                    
#include<stack>
#include<set>  
#include<map>  
#include<vector>  
#include<iomanip> 
#include<bitset>
using namespace std;         //

#define ll long long  
#define ull unsigned long long
#define pb push_back  
#define FOR(a) for(int i=1;i<=a;i++) 
#define sqr(a) (a)*(a)
#define dis(a,b) sqrt(sqr(a.x-b.x)+sqr(a.y-b.y))
ll qp(ll a,ll b,ll mod){
    ll t=1;while(b){if(b&1)t=t*a%mod;b>>=1;a=a*a%mod;}return t;
}
struct DOT{int x;int y;};
inline void read(int &x){int k=0;char f=1;char c=getchar();for(;!isdigit(c);c=getchar())if(c=='-')f=-1;for(;isdigit(c);c=getchar())k=k*10+c-'0';x=k*f;} 
void ex(){puts("No");exit(0);}
const int dx[4]={0,0,-1,1};
const int dy[4]={1,-1,0,0};
const int inf=0x3f3f3f3f; 
const ll Linf=0x3f3f3f3f3f3f3f3fLL;
const ll Mod=1e18+7;

const int maxn=3300;

int n,lim;
map<string,int>idx;
char buf[2][15];
int tot;
int edgcnt;

struct EDGE{
    int u,v,w;
    bool del;
    int id;
    friend bool operator <(EDGE A,EDGE B){return A.w<B.w;}
};
set<int>DES;
vector<EDGE>G[maxn];
vector<EDGE>T[maxn];    //树图

int belong[maxn];
vector<int>hav[maxn];
int blkcnt;
int root;

int fa[maxn];
void init(int n){for(int i=1;i<=n;i++)fa[i]=i;}
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
void unite(int x,int y){x=find(x);y=find(y);fa[x]=y;}

vector<EDGE>BLK;

void dfs(int x,int fa){
    if(belong[x])return;
    belong[x]=blkcnt;
    hav[blkcnt].pb(x);
    for(int i=0;i<G[x].size();i++){
        int v=G[x][i].v,w=G[x][i].w;
        if(v==fa)continue;
        if(v==root)continue;
        dfs(v,x);
    }
}


int ans;

set<int>SSS;    //park连接的点
int du;            //root的度数

struct NODE{
    EDGE del;
    int val;
    int to;
    int newLen;    //
    friend bool operator<(NODE A,NODE B){
        return A.val<B.val;
    }
};

int flag;

void dfsx(int u,int fa,int &mxlen,EDGE &remo,int gf){
    //if(ans==82 && gf==6){
    //    cout<<u<<"路径"<<T[6].size()<<endl;
    //}
    if(u==root){
        flag=1;return;
    }


    for(int i=0;i<T[u].size();i++){

        if(DES.count(T[u][i].id))continue;

        //if(ans==82 && gf==6 && u==6){
        //    cout<<"goto"<<T[u][i].v<<"ww"<<i<<endl;
        //}


        int v=T[u][i].v,w=T[u][i].w;
        if(v==fa)continue;

        int tmplen=mxlen;
        EDGE tmpremo=remo;

        if(mxlen<w){
            mxlen=w;
            remo=T[u][i];
        }

        dfsx(v,u,mxlen,remo,gf);

        if(!flag){
            mxlen=tmplen;
            remo=tmpremo;
        }else{
            return;
        }
    }
}

int main(){
    while(~scanf("%d",&n)){

        int x;
        lim=0;
        tot=0;blkcnt=0;ans=0;du=0;edgcnt=0;root=0;

        for(int i=0;i<=32;i++){
            G[i].clear();T[i].clear();
            hav[i].clear();
        }
        du=0;BLK.clear();SSS.clear();DES.clear();
        memset(belong,0,sizeof belong);idx.clear();
        flag=0;


        
        //idx["Park"]=8;
        //idx["1"]=1;idx["2"]=2;
        //idx["3"]=3;idx["4"]=4;
        //idx["5"]=5;idx["6"]=6;
        //idx["7"]=7;idx["8"]=8;
        //tot=8;    



        for(int i=1;i<=n;i++){
            scanf("%s%s%d",buf[0]+1,buf[1]+1,&x);

            
            if(idx[buf[0]+1]==0){
                idx[buf[0]+1]=++tot;
            }
            if(idx[buf[1]+1]==0){
                idx[buf[1]+1]=++tot;
            }
            

            int u=idx[buf[0]+1],v=idx[buf[1]+1];

            //cout<<u<<"ww"<<v<<endl;

            int w=x;

            G[idx[buf[0]+1]].pb((EDGE){u,v,w,false,edgcnt++});
            G[idx[buf[1]+1]].pb((EDGE){v,u,w,false,edgcnt++});
        }
        scanf("%d",&lim);

        root=idx["Park"];
        for(int i=1;i<=tot;i++){
            if(!belong[i] && i!=root){
                ++blkcnt;
                dfs(i,i);
            }
        }
        
        init(tot);

        for(int i=1;i<=blkcnt;i++){
            int mnlen=inf,toid=0;

            BLK.clear();
            for(int j=0;j<hav[i].size();j++){
                for(int k=0;k<G[hav[i][j]].size();k++){
                    int v=G[hav[i][j]][k].v,w=G[hav[i][j]][k].w;
                    if(v!=root)BLK.pb(G[hav[i][j]][k]);
                    else{
                        if(w<mnlen){
                            mnlen=w;
                            toid=hav[i][j];
                        }
                    }
                }
            }

            sort(BLK.begin(),BLK.end());

            for(int j=0;j<BLK.size();j++){
                int x=BLK[j].u,y=BLK[j].v;
                x=find(x);y=find(y);
                if(x==y)continue;
                else{
                    unite(x,y);
                    ans+=BLK[j].w;
                    
                    x=BLK[j].u;
                    y=BLK[j].v;

                    T[x].pb((EDGE){x,y,BLK[j].w,false,edgcnt++});
                    T[y].pb((EDGE){y,x,BLK[j].w,false,edgcnt++});

                    //cout<<x<<" "<<y<<" "<<BLK[j].w<<endl;
                }
            }

            //cout<<toid<<"www"<<mnlen<<endl;

            //cout<<ans<<"ww"<<endl;exit(0);
            //选代表元素
            T[root].pb((EDGE){root,toid,mnlen,false,edgcnt++});
            T[toid].pb((EDGE){toid,root,mnlen,false,edgcnt++});

            ans+=mnlen;
            SSS.insert(toid);
            du++;
        }

        while(du<lim){
            priority_queue<NODE>Q;

            for(int i=0;i<G[root].size();i++){        
                
                int v=G[root][i].v,w=G[root][i].w;
                if(SSS.count(v))continue;
                EDGE plc;
                int vvl=0;

                flag=0;

                dfsx(v,v,vvl,plc,v);    //v到root的路径找最长边
                
                //if(ans==82){
                //    cout<<v<<"ww"<<plc.u<<"__"<<plc.v<<endl;
                //}

                Q.push((NODE){plc,vvl-w,v,w});
            }
            if(Q.empty())break;
            NODE now=Q.top();
            if(now.val<0)break;
            ans-=now.val;

            //cout<<now.to<<"ww"<<now.newLen<<"ww"<<now.val<<"ww"<<ans<<endl;
            //cout<<now.del.u<<"ww"<<now.del.v<<endl;

            T[root].pb((EDGE){root,now.to,now.newLen,edgcnt++});
            T[now.to].pb((EDGE){now.to,root,now.newLen,edgcnt++});

            //cout<<du<<"du"<<now.to<<"qqq"<<root<<endl;

            SSS.insert(now.to);
            DES.insert(now.del.id);
            DES.insert(now.del.id^1);
            
            du++;
        }
        printf("Total miles driven: %d
",ans);
    }    
}