#307395 (C++14) No.382 シャイな人たち (2)

提出ソース
結果

問題	No.382 シャイな人たち (2)
ユーザー	kopricky
提出日時	2018-12-31 10:43:57
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,508 ms / 8,000 ms
コード長	12,874 bytes
コンパイル時間	2,211 ms
コンパイル使用メモリ	178,384 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-04-20 04:00:21
合計ジャッジ時間	29,642 ms
ジャッジサーバーID （参考情報）	judge1 / judge2
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,508 ms 5,248 KB
testcase_01	AC	1,414 ms 5,376 KB
testcase_02	AC	1,289 ms 5,376 KB
testcase_03	AC	1,258 ms 5,376 KB
testcase_04	AC	1,254 ms 5,376 KB
testcase_05	AC	1,342 ms 5,376 KB
testcase_06	AC	1,186 ms 5,376 KB
testcase_07	AC	1,342 ms 5,376 KB
testcase_08	AC	1,155 ms 5,376 KB
testcase_09	AC	1,181 ms 5,376 KB
testcase_10	AC	1,228 ms 5,376 KB
testcase_11	AC	1,167 ms 5,376 KB
testcase_12	AC	1,111 ms 5,376 KB
testcase_13	AC	1,228 ms 5,376 KB
testcase_14	AC	1,354 ms 5,376 KB
testcase_15	AC	1,219 ms 5,376 KB
testcase_16	AC	1,250 ms 5,376 KB
testcase_17	AC	1,056 ms 5,376 KB
testcase_18	AC	1,330 ms 5,376 KB
testcase_19	AC	1,089 ms 5,376 KB
testcase_20	AC	1 ms 5,376 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

template<typename T> class ListIterator;

// 常に不変なイテレーターが欲しい場合に使う
template<typename T>
class List {
public:
    using iterator = ListIterator<T>;
    
private:
    int N, sz;
    vector<int> prev, next;
    vector<T> container;
    friend ListIterator<T>;
    
public:
    // 添字 next_index の要素の前に添字 now_index の要素を挿入
    iterator insert(int next_index, int now_index){
        sz++;
        prev[now_index] = prev[next_index], next[now_index] = next_index;
        next[prev[next_index]] = now_index, prev[next_index] = now_index;
        return iterator(this, now_index);
    }
    // 添字 index の値を削除 → 次の要素の iterator を返す
    iterator erase(int index){
        sz--;
        next[prev[index]] = next[index], prev[next[index]] = prev[index];
        return iterator(this, next[index]);
    }
	
public:
    friend ostream& operator<< (ostream& os, List& ls){
        for(auto& val : ls){
            os << val << ' ';
        }
        return os;
    }
    const T& operator[](size_t index) const {
        return container[index];
    }
    T& operator[](size_t index){
        return container[index];
    }
    size_t size(){
        return sz;
    }
    bool empty(){
        return size() == 0;
    }
    T& front(){
        return container[next[N]];
    }
    T& back(){
        return container[prev[N]];
    }
    iterator begin(){
        return iterator(this, next[N]);
    }
    iterator end(){
        return iterator(this, N);
    }
    iterator insert(const iterator& itr, int index){
        return insert(itr.index, index);
    }
    iterator erase(const iterator& itr){
        return erase(itr.index);
    }
    iterator push_back(){
        return insert(N, prev[N]+1);
    }
    void pop_back(){
        erase(prev[N]);
    }
    void index_clear(){
        N = sz = 0, prev = next = {0};
    }
    void clear(){
        index_clear();
        container.clear();
    }
	
public:
    List() : N(0), sz(0), prev({0}), next({0}){}
    List(int _N) : container(_N){
        build();
    }
    List(int _N, T val) : container(_N, val){
        build();
    }
    List(const List& ls):
        N(ls.N), sz(ls.sz), prev(ls.prev), next(ls.next), container(ls.container){}
    List(const vector<T>& vec) : container(vec){
        build();
    }
    List& operator=(const List& ls){
        container = ls.container;
        build();
        return *this;
    }
    List& operator=(const vector<T>& vec){
        container = vec;
        build();
        return *this;
    }
    List& operator=(const List&& ls) noexcept {
        container = ls.container;
        build();
        return *this;
    }
    List(initializer_list<T> vals) : container(vals.begin(), vals.end()){
        build();
    }
    iterator push_back(T val){
        N++, sz++;
        prev.push_back(N-1), prev[0] = N;
        next.back() = N, next.push_back(0);
        container.push_back(val);
        return iterator(this, N-1);
    }
	void build(){
        N = sz = (int)container.size();
        prev.resize(N+1), next.resize(N+1);
        iota(prev.begin(), prev.end(), -1), iota(next.begin(), next.end(), 1);
        prev[0] = N, next[N] = 0;
    }
};

template<typename T>
class ListIterator : public std::iterator<bidirectional_iterator_tag, T, ptrdiff_t, T*, T&>{
private:
    friend List<T>;
    List<T>* ls_ptr;
    int index;

private:
    ListIterator(List<T>* ls, int _index) : ls_ptr(ls), index(_index){}
	
public:
    ListIterator(){}
    ListIterator(const ListIterator& itr){
        ls_ptr = itr.ls_ptr, index = itr.index;
    }
    operator int() const noexcept { return index; }
    ListIterator& operator=(const ListIterator& itr) & {
        ls_ptr = itr.ls_ptr, index = itr.index;
        return *this;
    }
    ListIterator& operator=(ListIterator&& itr) & noexcept {
        ls_ptr = itr.ls_ptr, index = itr.index;
        return *this;
    }
    T& operator*() const {
        return ls_ptr->container[index];
    }
    T* operator->() const {
        return &ls_ptr->container[index];
    }
    ListIterator& operator++(){
        index = ls_ptr->next[index];
        return *this;
    }
    ListIterator operator++(int){
        ListIterator res = *this;
        index = ls_ptr->next[index];
        return res;
    }
    ListIterator& operator--(){
        index = ls_ptr->prev[index];
        return *this;
    };
    ListIterator operator--(int){
        ListIterator res = *this;
        index = ls_ptr->prev[index];
        return res;
    };
    bool operator==(const ListIterator& itr) const {
        return !(*this != itr);
    };
    bool operator!=(const ListIterator& itr) const {
        return this->ls_ptr != itr.ls_ptr || this->index != itr.index;
    }
    friend void swap(const ListIterator<T>& itr1, const ListIterator<T>& itr2){
        ListIterator<T> tmp = itr1;
        itr1 = itr2, itr2 = itr1;
    };
};

// 多重辺はなし
class MVC {
private:
    struct edge {
        int to, rev;
    };
    
    using LL = unsigned __int128;
    
    int V, rem_edge_size, fp_size;
    LL* G;
    List<int> rem_ver;
    vector<int> cand, deg;
    LL cand_ver, use_ver, not_use_ver;
    
    int get_first_element(LL num){
        int x = __builtin_ffsll(num & (((LL)1 << 64) - 1));
        int y = __builtin_ffsll((num >> 64) & (((LL)1 << 64) - 1));
        return x ? (x - 1) : (y + 63);
    }
    int get_size(LL num){
        return __builtin_popcountll(num & (((LL)1 << 64) - 1)) + __builtin_popcountll((num >> 64) & (((LL)1 << 64) - 1));
    }
    bool push_cand(int u, int& add_size){
        add_size++, cand.push_back(u), cand_ver |= (LL)1 << u;
        return (int)cand.size() < ans_size;
    }
    bool erase(int u, bool use, int& add_size, vector<pair<int, int> >& erase_ver, vector<pair<int, int> >& erase_edge){
        if(use){
            if(!push_cand(u, add_size)) return false;
        }else{
            use_ver |= G[u], not_use_ver |= (LL)1 << u;
            if(get_size(use_ver | cand_ver) >= ans_size) return false;
        }
        erase_ver.emplace_back(u, rem_ver.erase(u));
        int v;
        for(LL st = G[u], used = 0; st != 0; st ^= (LL)1 << v, used |= (LL)1 << v){
            v = get_first_element(st);
            G[v] ^= (LL)1 << u, erase_edge.emplace_back(v, u);
            deg[v]--, rem_edge_size--;
            if(deg[v] == 0 && !(use_ver >> v & 1)) erase_ver.emplace_back(v, rem_ver.erase(v));
            if(!use){
                if(not_use_ver >> v & 1) return false;
                if(deg[v] == 0){
                    if(!(cand_ver >> v & 1) && !push_cand(v, add_size)) return false;
                    continue;
                }
                if(cand_ver >> v & 1) continue;
                if(!erase(v, true, add_size, erase_ver, erase_edge)) return false;
                st = G[u] ^ used;
            }else{
                if(not_use_ver >> v & 1) continue;
                if(deg[v] == 1 && !(use_ver >> v & 1) && !erase(v, false, add_size, erase_ver, erase_edge)) return false;
                st = G[u] ^ used;
            }
        }
        return true;
    }
    bool erase_rec(int u, bool use, int& add_size, vector<pair<int, int> >& erase_ver, vector<pair<int, int> >& erase_edge){
        if(use) use_ver |= (LL)1 << u;
        bool res = erase(u, use, add_size, erase_ver, erase_edge);
        use_ver = not_use_ver = 0;
        return res;
    }
    bool preprocessing(int K, int& add_size, vector<pair<int, int> >& erase_ver, vector<pair<int, int> >& erase_edge){
        for(int u : rem_ver){
            if(deg[u] > K){
                if(!erase_rec(u, true, add_size, erase_ver, erase_edge)) return false;
            }
        }
        return true;
    }
    void postprocessing(int K, int add_size, vector<pair<int, int> >& erase_ver, vector<pair<int, int> >& erase_edge){
        if(K == fp_size) return;
        for(int i = 0; i < add_size; i++){
            cand_ver ^= (LL)1 << cand.back(), cand.pop_back();
        }
        for(int i = (int)erase_ver.size() - 1; i >= 0; i--){
            auto& p = erase_ver[i];
            rem_ver.insert(p.second, p.first);
        }
        for(int i = (int)erase_edge.size() - 1; i >= 0; i--){
            P p = erase_edge[i];
            G[p.first] |= (LL)1 << p.second, deg[p.first]++, rem_edge_size++;
        }
    }
    bool check(){
        if(rem_edge_size == 0){
            if((int)cand.size() < ans_size){
                ans_size = (int)cand.size(), ans_set = cand;
            }
            return false;
        }
        return (int)rem_ver.size() > 0;
    }
    void transition(int K, int next_ver, bool use){
        int pl_add_size = 0;
        vector<pair<int, int> > pl_erase_ver, pl_erase_edge;
        if(!erase_rec(next_ver, use, pl_add_size, pl_erase_ver, pl_erase_edge)){
            return postprocessing(K-1, pl_add_size, pl_erase_ver, pl_erase_edge);
        }
        if(check()) judge(K-1);
        return postprocessing(K-1, pl_add_size, pl_erase_ver, pl_erase_edge);
    }
    int find_max_degree_ver(){
        int max_deg = -1, next_ver = -1;
        for(int v : rem_ver){
            if(deg[v] > max_deg) max_deg = deg[v], next_ver = v;
        }
        if(2 * rem_edge_size > (long long)max_deg * (int)rem_ver.size()) return -1;
        return next_ver;
    }
    void judge(int K){
        int add_size = 0;
        vector<pair<int, int> > erase_ver, erase_edge;
        if(!preprocessing(K, add_size, erase_ver, erase_edge)) return postprocessing(K, add_size, erase_ver, erase_edge);
        if(!check()) return postprocessing(K, add_size, erase_ver, erase_edge);
        int next_ver = find_max_degree_ver();
        if(next_ver < 0) return postprocessing(K, add_size, erase_ver, erase_edge);
        transition(K, next_ver, true);
        if((int)cand.size() + deg[next_ver] < ans_size){
            transition(K, next_ver, false);
        }
        return postprocessing(K, add_size, erase_ver, erase_edge);
    }
public:
    vector<int> ans_set;
    int ans_size;
    
    MVC(int node_size) :
        V(node_size), rem_edge_size(0), rem_ver(V), deg(V, 0), cand_ver(0), use_ver(0), not_use_ver(0){
            G = new LL[V];
            for(int i = 0; i < V; i++) rem_ver[i] = i;
    }
    void add_edge(int u, int v){
        G[u] |= (LL)1 << v, G[v] |= (LL)1 << u;
        deg[u]++, deg[v]++, rem_edge_size++;
    }
    bool solve(int K){
        fp_size = K, ans_size = fp_size + 1;
        judge(fp_size);
        return ans_size <= fp_size;
    }
};

bool used[125];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll S;
    cin >> S;
    S = S * 12345LL % 1000003LL;
    int n = (S % 120) + 2, m = 0;
    MVC mvc(n);
    S = S * 12345LL % 1000003LL;
    ll P = S;
    rep(i,n){
        srep(j,i+1,n){
            S = S * 12345LL % 1000003LL;
            if(S >= P){
                mvc.add_edge(i, j);
                m++;
            }
        }
    }
    if(m == 0){
        cout << "-1\n";
    }else{
		mvc.solve(n);
        cout << n - mvc.ans_size + 1 << "\n";
		each(v, mvc.ans_set){
			used[v] = true;
		}
		vector<int> ans;
		rep(i,n){
			if(!used[i]) ans.pb(i);
		}
		rep(i,len(ans)-1){
			cout << ans[i] + 1 << " ";
		}
		cout << ans.back() + 1 << "\n";
    }
    // int n, m;
    // cin >> n >> m;
    // MVC mvc(n);
    // rep(i,m){
    //     int a,b;
    //     cin >> a >> b;
    //     mvc.add_edge(a, b);
    // }
    // mvc.solve(n);
    // svec(mvc.ans_set);
    return 0;
}
yukicoder

結果

テストケース

ソースコード
