結果

問題 No.1602 With Animals into Institute 2
コンテスト
ユーザー hotman78
提出日時 2022-07-27 09:34:23
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 9,184 bytes
コンパイル時間 17,715 ms
コンパイル使用メモリ 322,292 KB
最終ジャッジ日時 2025-01-30 14:23:50
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 15 WA * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#line 2 "/home/hotman/vscode/kyopro/library/cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
#line 1 "/home/hotman/vscode/kyopro/library/cpplib/util/ioutil.hpp"
// template <class Head,class... Args>
// std::ostream& output(std::ostream& out,const Head& head,const Args&... args){
//     out>>head;
//     return output(head,args...);
// }
// template <class Head>
// std::ostream& output(std::ostream& out,const Head& head){
//     out>>head;
//     return out;
// }

template<typename T,typename E>
std::ostream& operator<<(std::ostream& out,std::pair<T,E>v){
    out<<"("<<v.first<<","<<v.second<<")";return out;
}

// template <class... Args>
// ostream& operator<<(ostream& out,std::tuple<Args...>v){
//     std::apply(output,v);
//     return out;
// }
#line 8 "/home/hotman/vscode/kyopro/library/cpplib/util/template.hpp"
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)debug(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define _overload4(_1,_2,_3,_4,name,...) name
#define __rep(i,a) repi(i,0,a,1)
#define _rep(i,a,b) repi(i,a,b,1)
#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)
#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)
#define _overload3_rev(_1,_2,_3,name,...) name
#define _rep_rev(i,a) repi_rev(i,0,a)
#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)
#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)

// #define rep(i,...) for(auto i:range(__VA_ARGS__)) 
// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
// #define irep(i) for(lint i=0;;++i)
// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
// const array<lint,8> dx={1,0,-1,0,1,1,-1,-1};
// const array<lint,8> dy={0,1,0,-1,1,-1,1,-1};
// const string ds="RDLU";
#define SUM(v) accumulate(all(v),0LL)
#if __cplusplus>=201703L
    template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#endif
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
#define bit(n,a) ((n>>a)&1)
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
using graph=vector<vector<int>>;
template<typename T>using graph_w=vector<vector<pair<int,T>>>;

#if __cplusplus>=201703L
    constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}
#endif

template<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}
template<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}
template<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}
template<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}
#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
#define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);
#line 1 "/home/hotman/vscode/kyopro/library/cpplib/dsu/union_find_.hpp"
class UF{
    public:
    vector<int> data;
    int sz;
	public:
    UF(int sz=0):sz(sz){data.resize(sz,-1);}
    bool unite(int x,int y){
        x=root(x);y=root(y);
        if(x==y)return 0;
		data[x]+=data[y];
		data[y]=x;
		sz--;
        return 1;
    }
    inline int root(int x){return data[x]<0?x:data[x]=root(data[x]);}
    inline bool same(int x, int y){return root(x)==root(y);}
    inline int size(){return sz;}
	inline int size(int x){return -data[root(x)];}
};
#line 3 "main.cpp"
struct group{
    lint x;
    static group id(){
        return group{0LL};
    }
};
group operator+(group x,group y){
    return group{x.x^y.x};
}
bool operator==(group x,group y){
    return x.x==y.x;
}
template<typename T,typename G>
struct sssp{
    int s;
    vector<T>dist;
    vector<int>parent,depth;
    vector<G>label;
};
template<typename T,typename G>
sssp<T,G> sssp_(const vector<vector<tuple<int,T,G>>>& g,int s){
    priority_queue<pair<T,int>,vector<pair<T,int>>,greater<pair<T,int>>>que;
    vector<T> dist(g.size(),numeric_limits<T>::max());
    vector<int>depth(g.size()),parent(g.size());
    vector<G>label(g.size(),G::id());
    dist[s]=0;
    depth[s]=0;
    que.emplace(0,s);
    while(!que.empty()){
        auto [d,u]=que.top();
        que.pop();
        if(dist[u]!=d)continue;
        for(auto [v,l,edge_label]:g[u]){
            auto d2=d+l;
            if(dist[v]>d2){
                dist[v]=d2;
                depth[v]=depth[u]+1;
                parent[v]=u;
                label[v]=label[u]+edge_label;
                que.emplace(d2,v);
            }
        }
    }
    return sssp<T,G>{s,dist,parent,depth,label};
}
template<typename T,typename G>
vector<T> sssup(const vector<vector<tuple<int,T,G>>>&g,const sssp<T,G>& sp){
    const int n=g.size();
    vector<T> dist(n,numeric_limits<T>::max());
    UF uf(n);
    priority_queue<tuple<T,int,int>,vector<tuple<T,int,int>>,greater<tuple<T,int,int>>>que;
    for(int u=0;u<n;++u){
        for(int i=0;i<(int)g[u].size();++i){
            auto [v,l,edge_label]=g[u][i];
            if(u<v&&!(sp.label[v]==(sp.label[u]+edge_label))){
                que.emplace(sp.dist[u]+sp.dist[v]+l,u,i);
            }
        }
    }
    while(!que.empty()){
        auto [h,u0,i]=que.top();
        que.pop();
        auto v0=get<0>(g[u0][i]);
        auto u=uf.root(u0);
        auto v=uf.root(v0);
        vector<int>bs;
        while(u!=v){
            if(sp.depth[u]>sp.depth[v]){
                bs.emplace_back(u);
                u=uf.root(sp.parent[u]);
            }else{
                bs.emplace_back(v);
                v=uf.root(sp.parent[v]);
            }
        }
        for(auto x:bs){
            uf.unite(u,x);
            dist[x]=h-sp.dist[x];
            for(int i=0;i<(int)g[x].size();++i){
                auto [y,l,edge_label]=g[x][i];
                if(sp.label[v]==(sp.label[u]+edge_label)){
                    que.emplace(dist[x]+sp.dist[y]+l,x,i);
                }
            }
        }
    }
    for(int i=0;i<n;++i){
        if(!(sp.label[i]==G::id())&&sp.dist[i]<dist[i]){
            dist[i]=sp.dist[i];
        }
    }
    return dist;
}

int main(){
    lint n,m,k;
    cin>>n>>m>>k;
    vector<vector<tuple<int,lint,group>>>g(n);
    rep(i,m){
        int s,t,c;
        string ss;
        cin>>s>>t>>c>>ss;
        s--;t--;
        lint x=0;
        rep(j,k)x+=lint(ss[j]-'0')<<j;
        g[s].emplace_back(t,(lint)c,group{x});
        g[t].emplace_back(s,(lint)c,group{x});
    }
    auto ans=sssup<lint,group>(g,sssp_<lint,group>(g,n-1));
    rep(i,n)if(ans[i]>=INF/2)ans[i]=-1;
    ans.pop_back();
    rep(i,n-1){
        cout<<ans[i]<<endl;
    }
}
0