#958973 (C++17) No.2669 Generalized Hitting Set

提出ソース

結果

問題	No.2669 Generalized Hitting Set
ユーザー	👑 Nachia
提出日時	2024-03-09 01:22:02
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	594 ms / 4,000 ms
コード長	8,222 bytes
コンパイル時間	1,119 ms
コンパイル使用メモリ	90,376 KB
実行使用メモリ	69,856 KB
最終ジャッジ日時	2024-03-09 01:22:14
合計ジャッジ時間	10,162 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	1 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	7 ms 6,676 KB
testcase_04	AC	7 ms 6,676 KB
testcase_05	AC	6 ms 6,676 KB
testcase_06	AC	10 ms 6,676 KB
testcase_07	AC	3 ms 6,676 KB
testcase_08	AC	4 ms 6,676 KB
testcase_09	AC	8 ms 6,676 KB
testcase_10	AC	6 ms 6,676 KB
testcase_11	AC	4 ms 6,676 KB
testcase_12	AC	12 ms 6,676 KB
testcase_13	AC	537 ms 68,324 KB
testcase_14	AC	60 ms 10,980 KB
testcase_15	AC	3 ms 6,676 KB
testcase_16	AC	16 ms 6,676 KB
testcase_17	AC	59 ms 10,980 KB
testcase_18	AC	2 ms 6,676 KB
testcase_19	AC	9 ms 6,676 KB
testcase_20	AC	2 ms 6,676 KB
testcase_21	AC	17 ms 6,676 KB
testcase_22	AC	5 ms 6,676 KB
testcase_23	AC	25 ms 6,676 KB
testcase_24	AC	14 ms 6,676 KB
testcase_25	AC	40 ms 6,676 KB
testcase_26	AC	511 ms 68,832 KB
testcase_27	AC	17 ms 6,676 KB
testcase_28	AC	594 ms 69,856 KB
testcase_29	AC	571 ms 69,856 KB
testcase_30	AC	590 ms 69,856 KB
testcase_31	AC	568 ms 69,856 KB
testcase_32	AC	555 ms 69,856 KB
testcase_33	AC	32 ms 6,676 KB
testcase_34	AC	20 ms 6,676 KB
testcase_35	AC	150 ms 20,192 KB
testcase_36	AC	2 ms 6,676 KB
testcase_37	AC	31 ms 6,884 KB
testcase_38	AC	4 ms 6,676 KB
testcase_39	AC	569 ms 69,856 KB
testcase_40	AC	544 ms 69,856 KB

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

ソースコード

raw source code

#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cctype>
#include <cstdint>

namespace nachia{

struct CInStream{
private:
	static const unsigned int INPUT_BUF_SIZE = 1 << 17;
	unsigned int p = INPUT_BUF_SIZE;
	static char Q[INPUT_BUF_SIZE];
public:
	using MyType = CInStream;
	char seekChar(){
		if(p == INPUT_BUF_SIZE){
			size_t len = fread(Q, 1, INPUT_BUF_SIZE, stdin);
			if(len != INPUT_BUF_SIZE) Q[len] = '\0';
			p = 0;
		}
		return Q[p];
	}
	void skipSpace(){ while(isspace(seekChar())) p++; }
private:
	template<class T, int sp = 1>
	T nextUInt(){
		if constexpr (sp) skipSpace();
		T buf = 0;
		while(true){
			char tmp = seekChar();
			if('9' < tmp || tmp < '0') break;
			buf = buf * 10 + (tmp - '0');
			p++;
		}
		return buf;
	}
public:
	uint32_t nextU32(){ return nextUInt<uint32_t>(); }
	int32_t nextI32(){
		skipSpace();
		if(seekChar() == '-'){
			p++; return (int32_t)(-nextUInt<uint32_t, 0>());
		}
		return (int32_t)nextUInt<uint32_t, 0>();
	}
	uint64_t nextU64(){ return nextUInt<uint64_t>();}
	int64_t nextI64(){
		skipSpace();
		if(seekChar() == '-'){
			p++; return (int64_t)(-nextUInt<int64_t, 0>());
		}
		return (int64_t)nextUInt<int64_t, 0>();
	}
	template<class T>
	T nextInt(){
		skipSpace();
		if(seekChar() == '-'){
			p++;
			return - nextUInt<T, 0>();
		}
		return nextUInt<T, 0>();
	}
	char nextChar(){ skipSpace(); char buf = seekChar(); p++; return buf; }
	std::string nextToken(){
		skipSpace();
		std::string buf;
		while(true){
			char ch = seekChar();
			if(isspace(ch) || ch == '\0') break;
			buf.push_back(ch);
			p++;
		}
		return buf;
	}
	MyType& operator>>(unsigned int& dest){ dest = nextU32(); return *this; }
	MyType& operator>>(int& dest){ dest = nextI32(); return *this; }
	MyType& operator>>(unsigned long& dest){ dest = nextU64(); return *this; }
	MyType& operator>>(long& dest){ dest = nextI64(); return *this; }
	MyType& operator>>(unsigned long long& dest){ dest = nextU64(); return *this; }
	MyType& operator>>(long long& dest){ dest = nextI64(); return *this; }
	MyType& operator>>(std::string& dest){ dest = nextToken(); return *this; }
	MyType& operator>>(char& dest){ dest = nextChar(); return *this; }
} cin;

struct FastOutputTable{
	char LZ[1000][4] = {};
	char NLZ[1000][4] = {};
	constexpr FastOutputTable(){
		using u32 = uint_fast32_t;
		for(u32 d=0; d<1000; d++){
			LZ[d][0] = ('0' + d / 100 % 10);
			LZ[d][1] = ('0' + d /  10 % 10);
			LZ[d][2] = ('0' + d /   1 % 10);
			LZ[d][3] = '\0';
		}
		for(u32 d=0; d<1000; d++){
			u32 i = 0;
			if(d >= 100) NLZ[d][i++] = ('0' + d / 100 % 10);
			if(d >=  10) NLZ[d][i++] = ('0' + d /  10 % 10);
			if(d >=   1) NLZ[d][i++] = ('0' + d /   1 % 10);
			NLZ[d][i++] = '\0';
		}
	}
};

struct COutStream{
private:
	using u32 = uint32_t;
	using u64 = uint64_t;
	using MyType = COutStream;
	static const u32 OUTPUT_BUF_SIZE = 1 << 17;
	static char Q[OUTPUT_BUF_SIZE];
	static constexpr FastOutputTable TB = FastOutputTable();
	u32 p = 0;
	static constexpr u32 P10(u32 d){ return d ? P10(d-1)*10 : 1; }
	static constexpr u64 P10L(u32 d){ return d ? P10L(d-1)*10 : 1; }
	template<class T, class U> static void Fil(T& m, U& l, U x){ m = l/x; l -= m*x; }
public:
	void next_dig9(u32 x){
		u32 y;
		Fil(y, x, P10(6));
		nextCstr(TB.LZ[y]);
		Fil(y, x, P10(3));
		nextCstr(TB.LZ[y]); nextCstr(TB.LZ[x]);
	}
	void nextChar(char c){
		Q[p++] = c;
		if(p == OUTPUT_BUF_SIZE){ fwrite(Q, p, 1, stdout); p = 0; }
	}
	void nextEoln(){ nextChar('\n'); }
	void nextCstr(const char* s){ while(*s) nextChar(*(s++)); }
	void nextU32(uint32_t x){
		u32 y = 0;
		if(x >= P10(9)){
			Fil(y, x, P10(9));
			nextCstr(TB.NLZ[y]); next_dig9(x);
		}
		else if(x >= P10(6)){
			Fil(y, x, P10(6));
			nextCstr(TB.NLZ[y]);
			Fil(y, x, P10(3));
			nextCstr(TB.LZ[y]); nextCstr(TB.LZ[x]);
		}
		else if(x >= P10(3)){
			Fil(y, x, P10(3));
			nextCstr(TB.NLZ[y]); nextCstr(TB.LZ[x]);
		}
		else if(x >= 1) nextCstr(TB.NLZ[x]);
		else nextChar('0');
	}
	void nextI32(int32_t x){
		if(x >= 0) nextU32(x);
		else{ nextChar('-'); nextU32((u32)-x); }
	}
	void nextU64(uint64_t x){
		u32 y = 0;
		if(x >= P10L(18)){
			Fil(y, x, P10L(18));
			nextU32(y);
			Fil(y, x, P10L(9));
			next_dig9(y); next_dig9(x);
		}
		else if(x >= P10L(9)){
			Fil(y, x, P10L(9));
			nextU32(y); next_dig9(x);
		}
		else nextU32(x);
	}
	void nextI64(int64_t x){
		if(x >= 0) nextU64(x);
		else{ nextChar('-'); nextU64((u64)-x); }
	}
	template<class T>
	void nextInt(T x){
		if(x < 0){ nextChar('-'); x = -x; }
		if(!(0 < x)){ nextChar('0'); return; }
		std::string buf;
		while(0 < x){
			buf.push_back('0' + (int)(x % 10));
			x /= 10;
		}
		for(int i=(int)buf.size()-1; i>=0; i--){
			nextChar(buf[i]);
		}
	}
	void writeToFile(bool flush = false){
		fwrite(Q, p, 1, stdout);
		if(flush) fflush(stdout);
		p = 0;
	}
	COutStream(){ Q[0] = 0; }
	~COutStream(){ writeToFile(); }
	MyType& operator<<(unsigned int tg){ nextU32(tg); return *this; }
	MyType& operator<<(unsigned long tg){ nextU64(tg); return *this; }
	MyType& operator<<(unsigned long long tg){ nextU64(tg); return *this; }
	MyType& operator<<(int tg){ nextI32(tg); return *this; }
	MyType& operator<<(long tg){ nextI64(tg); return *this; }
	MyType& operator<<(long long tg){ nextI64(tg); return *this; }
	MyType& operator<<(const std::string& tg){ nextCstr(tg.c_str()); return *this; }
	MyType& operator<<(const char* tg){ nextCstr(tg); return *this; }
	MyType& operator<<(char tg){ nextChar(tg); return *this; }
} cout;

char CInStream::Q[INPUT_BUF_SIZE];
char COutStream::Q[OUTPUT_BUF_SIZE];

} // namespace nachia

namespace nachia{

int Popcount(unsigned long long c) noexcept {
#ifdef __GNUC__
    return __builtin_popcountll(c);
#else
    c = (c & (~0ull/3)) + ((c >> 1) & (~0ull/3));
    c = (c & (~0ull/5)) + ((c >> 2) & (~0ull/5));
    c = (c & (~0ull/17)) + ((c >> 4) & (~0ull/17));
    c = (c * (~0ull/257)) >> 56;
    return c;
#endif
}

// please ensure x != 0
int MsbIndex(unsigned long long x) noexcept {
#ifdef __GNUC__
    return 63 - __builtin_clzll(x);
#else
    using u64 = unsigned long long;
    int q = (x >> 32) ? 32 : 0;
    auto m = x >> q;
    constexpr u64 hi = 0x8888'8888;
    constexpr u64 mi = 0x1111'1111;
    m = (((m | ~(hi - (m & ~hi))) & hi) * mi) >> 35;
    m = (((m | ~(hi - (x & ~hi))) & hi) * mi) >> 31;
    q += (m & 0xf) << 2;
    q += 0x3333'3333'2222'1100 >> (((x >> q) & 0xf) << 2) & 0xf;
    return q;
#endif
}

// please ensure x != 0
int LsbIndex(unsigned long long x) noexcept {
#ifdef __GNUC__
    return __builtin_ctzll(x);
#else
    return MsbIndex(x & -x);
#endif
}

}

#define rep(i,n) for(int i=0; i<(int)(n); i++)
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;


void testcase(){
    using nachia::cin;
    using nachia::cout;
    using u32 = unsigned int;
    u32 N, M, K; cin >> N >> M >> K;
    vector<u32> A(1<<N);
    rep(i,M){
        u32 q = 0;
        rep(i,N) if(cin.nextChar() == '1') q |= 1 << i;
        A[q]++;
    }
    rep(q,1<<N){
        int f = q;
        for(int d=1; d&f; d<<=1){
            rep(i,d) A[f-d+i] += A[f+i];
            f -= d;
        }
    }
    vector<vector<u32>> C(N+1);
    rep(i,N+1) C[i].assign(i+1, 1);
    for(u32 n=1; n<=N; n++) for(u32 k=1; k<n; k++) C[n][k] = C[n-1][k-1] + C[n-1][k];
    rep(i,1<<N){
        u32 x = nachia::Popcount(i);
        if(x < K){ A[i] = 0; continue; }
        if((x - K) % 2 == 1) A[i] = -A[i];
        A[i] *= C[x-1][K-1];
    }
    rep(q,1<<N){
        int f = q;
        for(int d=1; d&f; d<<=1){
            rep(i,d) A[f+i] += A[f-d+i];
            f -= d;
        }
    }
    vector<u32> Q(N+1);
    rep(i,1<<N){
        u32 x = nachia::Popcount(i);
        chmax(Q[x], A[i]);
    }
    vector<int> ans(M+1, N);
    rep(i,N+1) chmin(ans[Q[i]], i);
    rep(i,M) chmin(ans[M-1-i], ans[M-i]);
    rep(i,M) cout << ans[i+1] << '\n';
}

int main(){
    using nachia::cin;
    using nachia::cout;
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}

yukicoder

結果

テストケース

ソースコード