Submission #27198758

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
class UF{
    vi data;stack<P> st;
public:
    UF(ll n){
        data=vi(n,1);
    }
    bool merge(ll x,ll y,bool undo=false){
        x=root(x);y=root(y);
        if(data[x]>data[y])swap(x,y);
        if(undo){st.emplace(y,data[y]);st.emplace(x,data[x]);}
        if(x==y)return false;
        data[y]+=data[x];data[x]=-y;
        return true;
    }
    ll root(ll i){if(data[i]>0)return i;return root(-data[i]);}
    ll getsize(ll i){return data[root(i)];}
    bool same(ll a,ll b){return root(a)==root(b);}
    void undo(){rep(i,2){data[st.top().fi]=st.top().se;st.pop();}}
};

vi solve(vvp g,ll n,ll m){
    vi res;
    vb used(m,false);
    function<void(ll)> dfs=[&](ll i){
        for(auto x:g[i])if(!used[x.se]){
            used[x.se]=true;
            dfs(x.fi);
        }
        res.pb(i);
    };dfs(0);
    reverse(all(res));
    return res;
}

#include <atcoder/all>
using namespace atcoder;

int main(){
    vi cnt(9);rep(i,9)cin>>cnt[i];rep(i,9)cnt[i]*=2;
    vi sum(2);rep(i,9)sum[i%2]+=cnt[i];
    if(sum[0]!=sum[1])dame("NO");
    vp edge;
    rep(i,9){
        if(i+3<9)edge.pb(i,i+3);
        if(i%3!=2)edge.pb(i,i+1);
    }
    rep(bit,1<<12)if(__builtin_popcount(bit)==8){
        vi c=cnt;
        UF uf(9);
        bool ok=true;
        rep(i,12)if(bit>>i&1){
            if(!uf.merge(edge[i].fi,edge[i].se))ok=false;
            c[edge[i].fi]--;c[edge[i].se]--;
        }
        rep(i,9)if(c[i]<0)ok=false;
        if(!ok)continue;
        mf_graph<ll> G(11);
        rep(i,12){
            if(edge[i].fi%2)G.add_edge(edge[i].se,edge[i].fi,10000);
            else G.add_edge(edge[i].fi,edge[i].se,10000);
        }
        rep(i,9){
            if(i%2)G.add_edge(i,10,c[i]);
            else G.add_edge(9,i,c[i]);
        }
        if(G.flow(9,10)!=sum[0]-8)continue;
        vvp g(9);
        ll tmp=0;
        rep(i,12)rep(j,(bit>>i&1)+G.get_edge(i).flow){
            g[edge[i].fi].pb(edge[i].se,tmp);
            g[edge[i].se].pb(edge[i].fi,tmp++);
        }
        assert(tmp==sum[0]);
        vi res=solve(g,9,tmp);
        string ans;
        rep(i,res.size()-1){
            if(res[i+1]==res[i]+1)ans+='R';
            if(res[i+1]==res[i]-1)ans+='L';
            if(res[i+1]==res[i]+3)ans+='D';
            if(res[i+1]==res[i]-3)ans+='U';
        }
        {
            vvi tmp(3,vi(3));
            rep(i,3)rep(j,3)tmp[i][j]=cnt[i*3+j]/2;
            ll x=0,y=0;
            for(char c:ans){
                if(c=='R')y++;
                if(c=='L')y--;
                if(c=='D')x++;
                if(c=='U')x--;
                if(x<0||x>2||y<0||y>2)assert(false);
                tmp[x][y]--;
            }
            rep(i,3)rep(j,3)if(tmp[i][j]!=0)assert(false);
        }
        dame(ans);
    }
    out("NO");
}

Submission Info

Compile Error

./Main.cpp: In function ‘vi solve(vvp, ll, ll)’:
./Main.cpp:70:19: warning: unused parameter ‘n’ [-Wunused-parameter]
   70 | vi solve(vvp g,ll n,ll m){
      |                ~~~^

Judge Result