提出 #53149404

---

ソースコード 拡げる

/*
  Compete against Yourself.
  Author - Aryan (@aryanc403)
*/
/*
  Credits -
  Atcoder library - https://atcoder.github.io/ac-library/production/document_en/ (namespace atcoder)
  Github source code of library - https://github.com/atcoder/ac-library/tree/master/atcoder
  https://codeforces.com/contest/4/submission/150120627
*/

#include<atcoder/dsu>
#ifdef ARYANC403
    #include <header.h>
#else
    #pragma GCC optimize ("Ofast")
    // #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
    #pragma GCC target ("sse,sse2,mmx")
    #pragma GCC optimize ("-ffloat-store")
    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    #define dbg(args...) 42;
    #define endl "\n"
#endif

// y_combinator from @neal template https://codeforces.com/contest/1553/submission/123849801
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }

using namespace std;
#define fo(i,n)   for(i=0;i<(n);++i)
#define repA(i,j,n)   for(i=(j);i<=(n);++i)
#define repD(i,j,n)   for(i=(j);i>=(n);--i)
#define all(x) begin(x), end(x)
#define sz(x) ((lli)(x).size())
#define eb emplace_back
#define X first
#define Y second

using lli = long long int;
using mytype = long double;
using ii = pair<lli,lli>;
using vii = vector<ii>;
using vi = vector<lli>;

template <class T>
using ordered_set =  __gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
// X.find_by_order(k) return kth element. 0 indexed.
// X.order_of_key(k) returns count of elements strictly less than k.

// namespace Re = std::ranges;
// namespace Ve = std::ranges::views;

const auto start_time = std::chrono::high_resolution_clock::now();
void aryanc403()
{
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time-start_time;
    cerr<<"Time Taken : "<<diff.count()<<"\n";
}

const lli INF = 0xFFFFFFFFFFFFFFFLL;
const lli SEED=chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 rng(SEED);
inline lli rnd(lli l=0,lli r=INF)
{return uniform_int_distribution<lli>(l,r)(rng);}

class CMP
{public:
bool operator()(ii a , ii b) //For min priority_queue .
{    return ! ( a.X < b.X || ( a.X==b.X && a.Y <= b.Y ));   }};

void add( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt==m.end())         m.insert({x,cnt});
    else                    jt->Y+=cnt;
}

void del( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt->Y<=cnt)            m.erase(jt);
    else                      jt->Y-=cnt;
}

bool cmp(const ii &a,const ii &b)
{
    return a.X<b.X||(a.X==b.X&&a.Y<b.Y);
}

int main(void) {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // freopen("txt.in", "r", stdin);
    // freopen("txt.out", "w", stdout);
// cout<<std::fixed<<std::setprecision(35);
// Ve::iota(1, 6) | Ve::transform([](int x) { return x * 2; }) | Ve::reverse | Ve::take(3)
lli T=1;
// cin>>T;
while(T--)
{
    lli n,m;
    cin>>n>>m;
    vector<vii> e(n);
    atcoder::dsu d(n);
    for(lli k=0;k<m;k++){
        lli u,v,c;
        cin>>u>>v>>c;
        u--;v--;
        if(d.same(u,v))
            continue;
        e[v].eb(ii{u,c});
        e[u].eb(ii{v,-c});
        d.merge(u,v);
    }

    const auto gps=d.groups();
    vi hei(n,-1);
    vii msks;
    vi maxAllowed;
    for(const auto &gp:gps){
        const lli root = gp[0];
        map<lli,lli> he;
        y_combinator([&](const auto &self,const lli u,const lli h)->void{
            if(he.count(u)){
                assert(he[u]==h);
                return;
            }
            he[u]=h;
            for(const auto &v:e[u])
                self(v.X,h+v.Y);
        })(root,0);

        lli minDis = INF,node=-1;
        for(const auto &u:he){
            if(minDis>u.Y){
                minDis=u.Y;
                node=u.X;
            }
        }

        lli curMsk=0,maxDist=-INF;
        for(const auto &u:he){
            const lli h=u.Y-minDis;
            hei[u.X]=h;
            assert(0<=h&&h<n);
            assert((curMsk&(1LL<<h))==0);
            curMsk|=1LL<<h;
            maxDist=max(maxDist,h);
        }
        msks.eb(ii{node,curMsk});
        maxAllowed.eb(n-maxDist);
    }
    dbg(msks);
    const lli tot = (1LL<<n)-1;
    const lli M = sz(gps);

    lli tim = 0,tr=-2,fal=-3;
    auto chk=[&](const lli exc,const lli rest)->bool{
        vector<vi> vis(M,vi(1LL<<n,-1));
        tim++;
        tr = tim;
        tim++;
        fal=tim;
        // dbg(exc,rest);
        return y_combinator([&](const auto &self,const lli idx,const lli rem)->bool{
            // dbg(exc,rest,idx,rem);
            if(idx==M)
                return rem==0;
            if(idx==exc)
                return self(idx+1,rem);
            auto &ans=vis[idx][rem];
            if(ans==tr||ans==fal)
                return ans;
            for(lli r=0;r<=n;r++){
                const lli curMsk = msks[idx].Y<<r;
                dbg(msks[idx],r,curMsk);
                if((rem&curMsk)!=curMsk)
                    continue;
                if(self(idx+1,rem^curMsk)){
                    ans=tr;
                    return true;
                }
            }
            ans=fal;
            return false;
        })(0,rest);
    };

    vi ans(n,-1);
    dbg(hei);

    if(chk(-1,tot))
    for(lli j=0;j<M;j++){
        const auto &z=msks[j];
        vi posRank;
        for(lli r=0;r<=n;r++){
            const lli curMsk = z.Y<<r;
            if((tot&curMsk)!=curMsk)
                continue;
            const auto resp = chk(j,tot^curMsk);
            dbg(r,z,resp);
            if(resp){
                dbg("passed",r,z);
                posRank.eb(r);
            }
        }
        dbg(z,posRank);
        if(sz(posRank)!=1)
            continue;
        for(const auto &k:gps[j])
            ans[k]=posRank[0]+hei[k];
    }
    for(lli i=0;i<n;i++){
        if(ans[i]!=-1)
            ans[i]++;
        cout<<ans[i]<<" \n"[i+1==n];
    }
}   aryanc403();
    return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int main()’:
Main.cpp:23:26: warning: statement has no effect [-Wunused-value]
   23 |     #define dbg(args...) 42;
      |                          ^~
Main.cpp:161:5: note: in expansion of macro ‘dbg’
  161 |     dbg(msks);
      |     ^~~
Main.cpp:23:26: warning: statement has no effect [-Wunused-value]
   23 |     #define dbg(args...) 42;
      |                          ^~
Main.cpp:198:5: note: in expansion of macro ‘dbg’
  198 |     dbg(hei);
      |     ^~~
Main.cpp:23:26: warning: statement has no effect [-Wunused-value]
   23 |     #define dbg(args...) 42;
      |                          ^~
Main.cpp:209:13: note: in expansion of macro ‘dbg’
  209 |             dbg(r,z,resp);
      |             ^~~
Main.cpp:23:26: warning: statement has no effect [-Wunused-value]
   23 |     #define dbg(args...) 42;
      |                          ^~
Main.cpp:211:17: note: in expansion of macro ‘dbg’
  211 |                 dbg("passed",r,z);
      |                 ^~~
Main.cpp:23:26: warning: statement has no effect [-Wunused-value]
   23 |     #define dbg(args...) 42;
      |                          ^~
Main.cpp:215:9: note: in expansion of macro ‘dbg’
  215 |         dbg(z,posRank);
      |         ^~~
Main.cpp: In instantiation of ‘main()::<lambda(lli, lli)>::<lambda(const auto:54&, lli, lli)> [with auto:54 = std::reference_wrapper<y_combinator_result<main()::<lambda(lli, lli)>::<lambda(const auto:54&, lli, lli)> > >; lli = long long int]’:
Main.cpp:33:84:   required from ‘decltype(auto) y_combinator_result<Fun>::operator()(Args&& ...) [with Args = {int, const long long int&}; Fun = main()::<lambda(lli, lli)>::<lambda(const auto:54&, lli, lli)>]’
Main.cpp:194:11:   required from here
Main.cpp:23:26: warning: statement has no effect [-Wunused-value]
   23 |     #define dbg(args...) 42;
      |                          ^~
Main.cpp:184:17: note: in expansion of macro ‘dbg’
  184 |                 dbg(msks[idx],r,curMsk);
      |                 ^~~

ジャッジ結果