#244935 (C++17) No.5001 排他的論理和でランニング

提出ソース

結果

問題	No.5001 排他的論理和でランニング
ユーザー	mai
提出日時	2018-03-17 00:13:19
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	17 ms / 1,500 ms
コード長	6,380 bytes
コンパイル時間	2,705 ms
実行使用メモリ	7,488 KB
スコア	47,265,532
最終ジャッジ日時	2020-03-12 19:43:47
ジャッジサーバーID （参考情報）	judge6 /
	純コード判定しない問題か言語

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	16 ms 5,376 KB
testcase_01	AC	3 ms 5,380 KB
testcase_02	AC	5 ms 5,384 KB
testcase_03	AC	9 ms 5,380 KB
testcase_04	AC	16 ms 5,376 KB
testcase_05	AC	7 ms 5,376 KB
testcase_06	AC	10 ms 5,384 KB
testcase_07	AC	11 ms 5,380 KB
testcase_08	AC	16 ms 5,376 KB
testcase_09	AC	2 ms 5,384 KB
testcase_10	AC	6 ms 5,380 KB
testcase_11	AC	8 ms 7,488 KB
testcase_12	AC	5 ms 5,376 KB
testcase_13	AC	15 ms 5,380 KB
testcase_14	AC	10 ms 5,376 KB
testcase_15	AC	6 ms 5,376 KB
testcase_16	AC	3 ms 5,380 KB
testcase_17	AC	5 ms 5,376 KB
testcase_18	AC	10 ms 5,376 KB
testcase_19	AC	7 ms 5,376 KB
testcase_20	AC	5 ms 5,376 KB
testcase_21	AC	5 ms 5,380 KB
testcase_22	AC	3 ms 5,376 KB
testcase_23	AC	2 ms 5,380 KB
testcase_24	AC	6 ms 5,376 KB
testcase_25	AC	13 ms 5,376 KB
testcase_26	AC	12 ms 5,380 KB
testcase_27	AC	8 ms 5,376 KB
testcase_28	AC	11 ms 5,376 KB
testcase_29	AC	14 ms 5,376 KB
testcase_30	AC	3 ms 5,380 KB
testcase_31	AC	11 ms 5,380 KB
testcase_32	AC	6 ms 5,380 KB
testcase_33	AC	17 ms 5,384 KB
testcase_34	AC	17 ms 5,376 KB
testcase_35	AC	10 ms 5,376 KB
testcase_36	AC	16 ms 5,380 KB
testcase_37	AC	12 ms 5,380 KB
testcase_38	AC	5 ms 5,376 KB
testcase_39	AC	6 ms 5,376 KB
testcase_40	AC	8 ms 5,376 KB
testcase_41	AC	3 ms 5,376 KB
testcase_42	AC	8 ms 5,376 KB
testcase_43	AC	8 ms 5,376 KB
testcase_44	AC	14 ms 5,380 KB
testcase_45	AC	15 ms 5,380 KB
testcase_46	AC	14 ms 5,376 KB
testcase_47	AC	7 ms 5,380 KB
testcase_48	AC	5 ms 5,376 KB
testcase_49	AC	13 ms 5,376 KB

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

ソースコード

raw source code

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define debug(v) {printf("L%d %s > ",__LINE__,#v);cout<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


// http://marupeke296.com/TIPS_No17_Bit.html

inline int count32bit(unsigned v) {
    unsigned count = (v & 0x55555555) + ((v >> 1) & 0x55555555);
    count = (count & 0x33333333) + ((count >> 2) & 0x33333333);
    count = (count & 0x0f0f0f0f) + ((count >> 4) & 0x0f0f0f0f);
    count = (count & 0x00ff00ff) + ((count >> 8) & 0x00ff00ff);
    return (count & 0x0000ffff) + ((count >> 16) & 0x0000ffff);
}

inline bool MSB32bit(unsigned v, int &out) {
    if (v == 0) return false;
    v |= (v >> 1);
    v |= (v >> 2);
    v |= (v >> 4);
    v |= (v >> 8);
    v |= (v >> 16);
    out = count32bit(v) - 1;
    return true;
}

inline int MSB32bit(unsigned v) {
    v |= (v >> 1);
    v |= (v >> 2);
    v |= (v >> 4);
    v |= (v >> 8);
    v |= (v >> 16);
    return count32bit(v) - 1;
}


int m, n, kei;
int aa[100010];

vector<int> high[30];

vector<int> answer;

void print_answer() {
    bool rm = true;
    for (auto a : answer) {
        if (rm) rm = false;
        else printer << ' ';
        printer << a;
    }
    printer << '\n';
    exit(0);
}

int main() {
    scanner >> n >> m;
    scanner.in(aa, aa + n);
    repeat(i, n) {
        high[MSB32bit(aa[i])].push_back(aa[i]);
    }
    answer.reserve(m);

    int x = 0;
    rrepeat(i, 30) {
        if (high[i].empty()) continue;
        sort(ALL(high[i]), [](int l, int r) {return MSB32bit(l) > MSB32bit(r); });
        if (x & (1 << i)) continue;
        x ^= high[i].back();
        answer.push_back(high[i].back());
        high[i].pop_back();
        if (--m == 0) print_answer();
    }

    while (m > 0) {
        bool ok = false;

        rrepeat(i, min(m, 30)) {
            if (high[i].empty()) continue;
            if (ok && x & (1 << i)) continue;
            x ^= high[i].back();
            answer.push_back(high[i].back());
            high[i].pop_back();
            if (--m == 0) print_answer();
            if (!ok) { ok = true; ++i; continue; }
            ok = true;
        }
        if (!ok) break;
    }
    while (m > 0) {
        repeat(i, 30) {
            while (!high[i].empty()) {
                answer.push_back(high[i].back());
                high[i].pop_back();
                if (--m == 0) print_answer();
            }
        }
    }
    print_answer();

    return 0;
}

yukicoder

結果

テストケース

ソースコード