제출 #307108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307108		rrrr10000	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	244 ms	22136 KiB

supertrees

#include "supertrees.h"
#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 all(a) a.begin(),a.end()
#define pb emplace_back
#define eb 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 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;
typedef multiset<ll> S;
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 noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
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;}
 
int construct(vector<vector<int>> v){
    int n=v.size();
    vector<vector<int>> ans(n,vector<int>(n));
    rep(i,n)rep(j,n)if(v[i][j]==3)return 0;
    vb used(n,false);
    vvi group;
    rep(i,n){
        if(used[i])continue;
        group.pb(vi(0));
        used[i]=true;group.back().pb(i);
        queue<ll> q;q.push(i);
        while(!q.empty()){
            auto t=q.front();q.pop();
            rep(j,n)if(v[t][j]&&!used[j]){
                used[j]=true;q.push(j);group.back().pb(j);
            }
        }
    }
    for(auto x:group)rep(i,x.size())rep(j,x.size())if(v[x[i]][x[j]]==0)return 0;
    rep(i,n)used[i]=false;
    for(auto x:group){
        vvi g;
        for(ll i:x){
            if(used[i])continue;
            g.pb(vi(0));
            used[i]=true;g.back().pb(i);
            queue<ll> q;q.push(i);
            while(!q.empty()){
                auto t=q.front();q.pop();
                rep(j,n)if(v[t][j]==1&&!used[j]){
                    used[j]=true;q.push(j);g.back().pb(j);
                }
            }
        }
        for(auto t:g)rep(i,t.size())rep(j,t.size())if(v[t[i]][t[j]]==2)return 0;
        if(g.size()==2)return 0;
        rep(i,g.size()-1){
            ans[g[i][0]][g[i+1][0]]=1;
            ans[g[i+1][0]][g[i][0]]=1;
        }
        for(auto t:g)rep(i,t.size()-1){
            ans[t[i]][t[i+1]]=1;
            ans[t[i+1]][t[i]]=1;
        }
    }
    build(ans);return 1;
}

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4