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

提出ソース

結果

問題	No.382 シャイな人たち (2)
ユーザー	anta
提出日時	2016-06-23 20:21:28
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	282 ms / 8,000 ms
コード長	6,280 bytes
コンパイル時間	2,494 ms
コンパイル使用メモリ	184,196 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-04-19 23:56:01
合計ジャッジ時間	7,077 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	282 ms 5,248 KB
testcase_01	AC	177 ms 5,376 KB
testcase_02	AC	164 ms 5,376 KB
testcase_03	AC	163 ms 5,376 KB
testcase_04	AC	171 ms 5,376 KB
testcase_05	AC	146 ms 5,376 KB
testcase_06	AC	192 ms 5,376 KB
testcase_07	AC	136 ms 5,376 KB
testcase_08	AC	185 ms 5,376 KB
testcase_09	AC	272 ms 5,376 KB
testcase_10	AC	144 ms 5,376 KB
testcase_11	AC	92 ms 5,376 KB
testcase_12	AC	142 ms 5,376 KB
testcase_13	AC	179 ms 5,376 KB
testcase_14	AC	167 ms 5,376 KB
testcase_15	AC	91 ms 5,376 KB
testcase_16	AC	133 ms 5,376 KB
testcase_17	AC	99 ms 5,376 KB
testcase_18	AC	108 ms 5,376 KB
testcase_19	AC	142 ms 5,376 KB
testcase_20	AC	2 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

struct BitSet {
	enum { K = 2, W = 64 };
	uint64_t data[K];

	BitSet() : data{} {}

	explicit operator bool() const {
		uint64_t r = 0;
		rep(i, K)
			r |= data[i];
		return r != 0;
	}

	bool get(unsigned pos) const {
		return data[pos / W] >> (pos % W) & 1;
	}

	void set(unsigned pos) {
		data[pos / W] |= uint64_t(1) << (pos % W);
	}

	void unset(unsigned pos) {
		data[pos / W] &= ~(uint64_t(1) << (pos % W));
	}

	int count() const {
		int res = 0;
		rep(i, K) res += popcount(data[i]);
		return res;
	}

	BitSet operator&(BitSet that) const {
		BitSet res;
		rep(i, K)
			res.data[i] = data[i] & that.data[i];
		return res;
	}

	bool isIntersectTo(const BitSet &that) const {
		return bool(*this & that);
	}

	int getSingleton() const {
		rep(i, K) if(data[i]) {
			if((data[i] & (data[i] - 1)) != 0)
				return -1;
			for(int j = i + 1; j < K; ++ j)
				if(data[j])
					return -1;
			return i * W + bsf(data[i]);
		}
		return -1;
	}

	static int bsf(uint64_t x) {
#if defined(__GNUC__)
		return __builtin_ctzll(x);
#else
		unsigned long res;
		_BitScanForward64(&res, x);
		return res;
#endif
	}

	static int popcount(uint64_t x) {
#if defined(__GNUC__)
		return __builtin_popcountll(x);
#else
		return (int)__popcnt64(x);
#endif
	}
};

class MaximumCliqueBranchAndBound {
public:
	typedef uint8_t Vertex;

	BitSet maximumClique(const vector<BitSet> &originalGraph) {
		graph = originalGraph;
		int N = (int)graph.size();
		levels.assign(N, BitSet());
		vertexLevel.assign(N, -1);
		BitSet initSet;
		vector<pair<int, int>> degreeOrder(N);
		for(int i = 0; i < N; ++ i) {
			initSet.set(i);
			degreeOrder[i] = make_pair(-(int)graph[i].count(), i);
		}
		sort(degreeOrder.begin(), degreeOrder.end());
		numRecs = 0;
		globalBuffer.resize(N * N + N + N * 2 * N);
		levelVertices.resize(N);
		rep(i, N)
			levelVertices[i].first = globalBuffer.data() + i * N;
		Vertex *initOrder = globalBuffer.data() + N * N,
			*nextBuffer = initOrder + N;
		rep(i, N)
			initOrder[i] = degreeOrder[i].second;
		rec(initSet, initOrder, N, nextBuffer);
		return maxClique;
	}

private:

	void rec(BitSet remSet, const Vertex *originalOrder, int originalOrderSize, Vertex *buffer) {
		++ numRecs;

		int numLevels = 0, numVertices = 0;
		for(int ix = 0; ix < originalOrderSize; ++ ix) {
			int p = originalOrder[ix];
			if(!remSet.get(p)) continue;
			++ numVertices;
			int k = 0;
			while(k < numLevels && levels[k].isIntersectTo(graph[p]))
				++ k;
			if(k == numLevels) {
				levels[k] = BitSet();
				++ numLevels;
			}
			levels[k].set(p);
			vertexLevel[p] = k;

			int threshold = maxSize - curSize;
			if(k > threshold && k == numLevels - 1) {
				reNumber(p, k, threshold, numLevels);
				if(!levels[k])
					-- numLevels;
			}
		}

		Vertex *order = buffer, *levelOffsets = buffer + numVertices,
			*nextBuffer = levelOffsets + numLevels;
		for(int k = 0; k < numLevels; ++ k)
			levelVertices[k].second = 0;
		for(int ix = 0; ix < originalOrderSize; ++ ix) {
			int v = originalOrder[ix];
			if(remSet.get(v)) {
				auto &p = levelVertices[vertexLevel[v]];
				p.first[p.second ++] = v;
			}
		}
		numVertices = 0;
		for(int k = 0; k < numLevels; ++ k) {
			levelOffsets[k] = numVertices;
			auto p = levelVertices[k];
			for(int i = 0; i < p.second; ++ i)
				order[numVertices ++] = p.first[i];
		}

		while(1) {
			int threshold = max(maxSize - curSize, 0);
			if(threshold >= numLevels || numVertices <= levelOffsets[threshold])
				break;

			int u = order[-- numVertices];

			curClique.set(u), ++ curSize;

			BitSet newSet = remSet & graph[u];
			if(newSet) {
				rec(newSet, order, numVertices, nextBuffer);
			} else if(curSize > maxSize) {
				maxClique = curClique, maxSize = curSize;
			}
			curClique.unset(u), -- curSize;
		}
	}

	void reNumber(int p, int k, int threshold, int numLevels) {
		for(int i = 0; i < threshold; ++ i) {
			BitSet S = graph[p] & levels[i];
			int q = S.getSingleton();
			if(q == -1) continue;
			for(int j = i + 1; j <= threshold; ++ j) {
				if(graph[q] & levels[j]) continue;
				levels[k].unset(p);
				levels[i].unset(q);
				levels[i].set(p);
				levels[j].set(q);
				vertexLevel[p] = i;
				vertexLevel[q] = j;
				return;
			}
		}
	}

	vector<BitSet> graph;
	BitSet curClique, maxClique;
	int curSize, maxSize;

	vector<BitSet> levels;
	vector<int> vertexLevel;
	vector<pair<Vertex*, int>> levelVertices;
	vector<Vertex> globalBuffer;
	long long numRecs;
};

//#include "C:\Dropbox\backup\implements\Util\CPUTime.hpp"

int main() {
	int initS;
	while(~scanf("%d", &initS)) {
	vector<pair<double, int>> list;
	//int initS; for(initS = 1; initS < 1000003; ++initS) {
	//if(initS % 100 == 0)cerr << initS << "..." << endl;
	//for(int initS : vector<int>{ 115398, 267904, 52859, 518145, 66814, 519427, 882073, 670079, 758187, 65005, 31884, 519427 , 552242 , 394304 , 371116 , 626395, 60145, 649 }) CPUTIMEIT("test") {
		int N, P;
		vector<BitSet> g;
		{
			int S = initS;
			S = ((ll)S * 12345) % 1000003;
			N = (S % 120) + 2;
			g.assign(N, BitSet());
			S = ((ll)S * 12345) % 1000003;
			P = S;
			rep(i, N) reu(j, i + 1, N) {
				S = ((ll)S * 12345) % 1000003;
				if(S < P) {
					g[i].set(j);
					g[j].set(i);
				}
			}
		}
		//cerr << initS << " (" << N << ", " << P << ")" << ": ";
		MaximumCliqueBranchAndBound mc;
		//double start = getCPUTime();
		BitSet ans = mc.maximumClique(g);
		//list.emplace_back(getCPUTime() - start, initS);
		
		if(ans.count() == N) {
			puts("-1");
		} else {
			printf("%d\n", (int)ans.count() + 1);
			vector<int> v;
			rep(i, N) if(ans.get(i))
				v.push_back(i);
			for(int i = 0; i < (int)v.size(); ++ i) {
				if(i != 0) putchar(' ');
				printf("%d", v[i] + 1);
			}
			puts("");
		}
	}
	return 0;
}

yukicoder

結果

テストケース

ソースコード