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

提出ソース

結果

問題	No.5001 排他的論理和でランニング
ユーザー	しらっ亭
提出日時	2018-03-16 23:16:18
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,430 ms / 1,500 ms
コード長	6,300 bytes
コンパイル時間	930 ms
実行使用メモリ	7,424 KB
スコア	52,428,750
最終ジャッジ日時	2020-03-12 19:34:19
ジャッジサーバーID （参考情報）	judge10 /
	純コード判定しない問題か言語

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,428 ms 5,376 KB
testcase_01	AC	1,417 ms 5,376 KB
testcase_02	AC	1,419 ms 5,380 KB
testcase_03	AC	1,422 ms 7,420 KB
testcase_04	AC	1,429 ms 5,380 KB
testcase_05	AC	1,419 ms 5,380 KB
testcase_06	AC	1,422 ms 5,376 KB
testcase_07	AC	1,424 ms 5,380 KB
testcase_08	AC	1,428 ms 5,376 KB
testcase_09	AC	1,414 ms 7,424 KB
testcase_10	AC	1,420 ms 5,376 KB
testcase_11	AC	1,421 ms 5,376 KB
testcase_12	AC	1,419 ms 5,376 KB
testcase_13	AC	1,428 ms 5,384 KB
testcase_14	AC	1,423 ms 5,380 KB
testcase_15	AC	1,420 ms 5,380 KB
testcase_16	AC	1,417 ms 5,380 KB
testcase_17	AC	1,418 ms 5,380 KB
testcase_18	AC	1,421 ms 5,380 KB
testcase_19	AC	1,420 ms 5,380 KB
testcase_20	AC	1,418 ms 5,384 KB
testcase_21	AC	1,418 ms 5,380 KB
testcase_22	AC	1,416 ms 5,380 KB
testcase_23	AC	1,416 ms 5,376 KB
testcase_24	AC	1,419 ms 5,380 KB
testcase_25	AC	1,424 ms 5,380 KB
testcase_26	AC	1,423 ms 5,384 KB
testcase_27	AC	1,420 ms 5,384 KB
testcase_28	AC	1,423 ms 5,376 KB
testcase_29	AC	1,425 ms 5,384 KB
testcase_30	AC	1,417 ms 6,148 KB
testcase_31	AC	1,424 ms 5,380 KB
testcase_32	AC	1,419 ms 5,376 KB
testcase_33	AC	1,429 ms 5,380 KB
testcase_34	AC	1,430 ms 5,380 KB
testcase_35	AC	1,424 ms 5,376 KB
testcase_36	AC	1,427 ms 5,376 KB
testcase_37	AC	1,424 ms 5,380 KB
testcase_38	AC	1,418 ms 5,376 KB
testcase_39	AC	1,420 ms 5,380 KB
testcase_40	AC	1,422 ms 5,380 KB
testcase_41	AC	1,417 ms 5,380 KB
testcase_42	AC	1,421 ms 5,376 KB
testcase_43	AC	1,422 ms 5,376 KB
testcase_44	AC	1,425 ms 5,380 KB
testcase_45	AC	1,427 ms 5,376 KB
testcase_46	AC	1,425 ms 5,380 KB
testcase_47	AC	1,420 ms 5,376 KB
testcase_48	AC	1,419 ms 5,380 KB
testcase_49	AC	1,426 ms 5,376 KB

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

ソースコード

raw source code

#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <tuple>
#include <cstring>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

inline long long GetTSC() {
	long long lo, hi;
	asm volatile("rdtsc" : "=a"(lo), "=d"(hi));
	return lo + (hi << 32);
}

inline double GetSeconds() { return GetTSC() / 2.6e9; }

struct xor128_random {
	uint32_t seed;
	random_device rnd;
	xor128_random(uint32_t s = 0) {
		if (s) seed = s;
		else seed = (uint32_t) rnd();
		for (int i = 0; i < 10; ++i) next();
	}

	uint32_t next() {
		static uint32_t x = 123456789, y = 362436069, z = 521288629, w = seed;
		uint32_t t = x ^ (x << 11);
		x = y;
		y = z;
		z = w;
		w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
		return w;
	}

	int32_t operator()() { return next(); }
	int32_t operator()(int32_t r) { return next_int(r); }
	int32_t operator()(int32_t l, int32_t r) { return next_int(l, r); }
	int32_t next_int(int32_t l, int32_t r) { return l + next() % (r - l + 1); }
	int32_t next_int(int r) { return next() % r; }
	double next_double() { return next() * 0.00000000023283064365386962890625; }
	double next_double(double r) { return next() * 0.00000000023283064365386962890625 * r; }
};
xor128_random rnd;

const double TIMEOUT = 0.25;
int best;
bitset<100005> ansset;

void solve(int n, int m, vi A) {
	double start = GetSeconds();
	bitset<100005> used;

	int score = 0;

	vi U(n);
	rep(i, n) U[i] = i;

	rep(i, n) {
		int j = rnd.next_int(n-i);
		swap(U[i], U[j]);
	}

	rep(i, m) {
		score ^= A[U[i]];
		used[U[i]] = 1;
	}

	int cnt = 0;
	while (GetSeconds() - start < TIMEOUT) {
		cnt++;
		int a, b;
		do {
			a = rnd.next_int(n);
		} while (used[a] == 0);
		do {
			b = rnd.next_int(n);
		} while (a == b || used[b] == 1);

		int cand = score ^ A[a] ^ A[b];
		if (cand > score) {
			used[a] = 0;
			used[b] = 1;
			score = cand;
		}
	}

	out(cnt, score, best);
	if (score > best) {
		ansset = used;
		best = score;
	}
}

void Main() {
	int n = ri(), m = ri();
	vector<int> A(n);
	rep(i, n) A[i] = ri();

	rep(_, 5) {
		solve(n, m, A);
	}

	vi ans;
	rep(i, n) {
		if (ansset[i]) {
			cout << A[i] << ' ';
		}
	}
	cout << endl;
}

signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();

	return 0;
}

yukicoder

結果

テストケース

ソースコード