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

提出ソース

結果

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

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,023 ms 5,384 KB
testcase_01	AC	1,019 ms 5,376 KB
testcase_02	AC	1,020 ms 5,380 KB
testcase_03	AC	1,021 ms 5,380 KB
testcase_04	AC	1,024 ms 5,380 KB
testcase_05	AC	1,022 ms 5,380 KB
testcase_06	AC	1,020 ms 5,376 KB
testcase_07	AC	1,021 ms 5,380 KB
testcase_08	AC	1,026 ms 5,376 KB
testcase_09	AC	1,020 ms 5,380 KB
testcase_10	AC	1,021 ms 5,376 KB
testcase_11	AC	1,022 ms 5,376 KB
testcase_12	AC	1,020 ms 5,376 KB
testcase_13	AC	1,025 ms 5,380 KB
testcase_14	AC	1,023 ms 5,376 KB
testcase_15	AC	1,021 ms 5,376 KB
testcase_16	AC	1,020 ms 5,380 KB
testcase_17	AC	1,020 ms 5,380 KB
testcase_18	AC	1,023 ms 5,380 KB
testcase_19	AC	1,020 ms 7,424 KB
testcase_20	AC	1,021 ms 5,376 KB
testcase_21	AC	1,021 ms 5,380 KB
testcase_22	AC	1,019 ms 5,380 KB
testcase_23	AC	1,019 ms 6,148 KB
testcase_24	AC	1,020 ms 5,380 KB
testcase_25	AC	1,020 ms 5,376 KB
testcase_26	AC	1,019 ms 5,376 KB
testcase_27	AC	1,019 ms 5,376 KB
testcase_28	AC	1,022 ms 5,380 KB
testcase_29	AC	1,021 ms 5,380 KB
testcase_30	AC	1,020 ms 5,376 KB
testcase_31	AC	1,023 ms 7,480 KB
testcase_32	AC	1,021 ms 5,384 KB
testcase_33	AC	1,024 ms 5,380 KB
testcase_34	AC	1,024 ms 5,380 KB
testcase_35	AC	1,022 ms 5,384 KB
testcase_36	AC	1,023 ms 5,376 KB
testcase_37	AC	1,020 ms 5,380 KB
testcase_38	AC	1,020 ms 5,380 KB
testcase_39	AC	1,021 ms 5,380 KB
testcase_40	AC	1,021 ms 5,376 KB
testcase_41	AC	1,020 ms 5,380 KB
testcase_42	AC	1,022 ms 5,380 KB
testcase_43	AC	1,022 ms 5,380 KB
testcase_44	AC	1,022 ms 5,376 KB
testcase_45	AC	1,023 ms 5,376 KB
testcase_46	AC	1,021 ms 5,380 KB
testcase_47	AC	1,021 ms 5,384 KB
testcase_48	AC	1,020 ms 5,376 KB
testcase_49	AC	1,024 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; }

class XRand {
public:
	unsigned int x, y, z, w;
	XRand() { init(); }
	void init() {
		x = 314159261;
		y = 358979323;
		z = 846264338;
		w = 327950288;
	}
	unsigned int next() {
		unsigned int t = x ^ x << 11;
		x = y;
		y = z;
		z = w;
		return w = w ^ w >> 19 ^ t ^ t >> 8;
	}
	int nextInt(int m) { return (int)(next() % m); }
};

const double TIMEOUT = 0.900;
double starttime, gt;
XRand rnd = XRand();
std::random_device srnd;
int score;

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

	score = 0;
	bitset<100005> used;

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

	while (GetSeconds() - starttime < TIMEOUT) {
		int a, b;
		do {
			a = rnd.nextInt(n);
		} while (used[a] == 0);
		do {
			b = rnd.nextInt(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;
		}
	}
	vi ans;
	rep(i, n) {
		if (used[i]) {
			ans.emplace_back(A[i]);
		}
	}
	rep(i, m) {
		cout << ans[i];
		if (i + 1 < m) cout << ' ';
		else cout << endl;
	}
}

signed main() {
	starttime = GetSeconds();
	srand(srnd());
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();

	return 0;
}

yukicoder

結果

テストケース

ソースコード