結果

問題 No.5001 排他的論理和でランニング
ユーザー koyumeishikoyumeishi
提出日時 2018-03-16 22:30:04
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,010 ms / 1,500 ms
コード長 5,093 bytes
コンパイル時間 856 ms
実行使用メモリ 7,484 KB
スコア 52,428,750
最終ジャッジ日時 2020-03-12 19:23:30
ジャッジサーバーID
(参考情報)
judge8 /
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,007 ms
5,380 KB
testcase_01 AC 1,003 ms
5,380 KB
testcase_02 AC 1,003 ms
5,384 KB
testcase_03 AC 1,004 ms
5,384 KB
testcase_04 AC 1,008 ms
5,376 KB
testcase_05 AC 1,005 ms
5,376 KB
testcase_06 AC 1,004 ms
5,376 KB
testcase_07 AC 1,005 ms
5,380 KB
testcase_08 AC 1,010 ms
5,380 KB
testcase_09 AC 1,003 ms
7,484 KB
testcase_10 AC 1,005 ms
5,380 KB
testcase_11 AC 1,005 ms
5,380 KB
testcase_12 AC 1,003 ms
5,376 KB
testcase_13 AC 1,009 ms
5,380 KB
testcase_14 AC 1,006 ms
5,380 KB
testcase_15 AC 1,004 ms
5,380 KB
testcase_16 AC 1,003 ms
5,380 KB
testcase_17 AC 1,004 ms
5,384 KB
testcase_18 AC 1,006 ms
5,380 KB
testcase_19 AC 1,004 ms
5,380 KB
testcase_20 AC 1,004 ms
5,376 KB
testcase_21 AC 1,004 ms
5,376 KB
testcase_22 AC 1,003 ms
5,384 KB
testcase_23 AC 1,002 ms
5,376 KB
testcase_24 AC 1,003 ms
5,380 KB
testcase_25 AC 1,003 ms
5,376 KB
testcase_26 AC 1,003 ms
5,380 KB
testcase_27 AC 1,002 ms
5,380 KB
testcase_28 AC 1,004 ms
5,376 KB
testcase_29 AC 1,005 ms
5,380 KB
testcase_30 AC 1,003 ms
5,384 KB
testcase_31 AC 1,006 ms
5,380 KB
testcase_32 AC 1,004 ms
5,384 KB
testcase_33 AC 1,009 ms
5,376 KB
testcase_34 AC 1,008 ms
5,376 KB
testcase_35 AC 1,005 ms
5,380 KB
testcase_36 AC 1,007 ms
5,376 KB
testcase_37 AC 1,005 ms
5,384 KB
testcase_38 AC 1,004 ms
5,376 KB
testcase_39 AC 1,004 ms
5,380 KB
testcase_40 AC 1,004 ms
5,376 KB
testcase_41 AC 1,003 ms
5,380 KB
testcase_42 AC 1,005 ms
5,376 KB
testcase_43 AC 1,005 ms
5,380 KB
testcase_44 AC 1,006 ms
5,376 KB
testcase_45 AC 1,006 ms
5,380 KB
testcase_46 AC 1,004 ms
5,380 KB
testcase_47 AC 1,004 ms
5,380 KB
testcase_48 AC 1,004 ms
5,384 KB
testcase_49 AC 1,009 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

class XorShift{
public:
  uint32_t x;
  uint32_t y;
  uint32_t z;
  uint32_t w;

  XorShift(){
    x = 123456789;
    y = 362436069;
    z = 521288629;
    w = 88675123;
  }
  
  XorShift(uint32_t seed){
    x = 123456789;
    y = 362436069;
    z = 521288629;
    w = seed;

    for(int i=0; i<100; i++){
      (*this)();
    }
  }

  uint32_t next() {
    uint32_t t = x ^ (x << 11);
    x = y; y = z; z = w;
    return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
  }

  uint32_t operator () () {
    return next();
  }

  // [0, range)
  int operator () (int range){
    return ((long long)next()) * range >> 32 ;
  }

  // [0, 1.0]
  double prob(){
    return (next()&0xfffffff) * 3.7252903123397e-9; // 0xfffffff = 268,435,455 = 2^28-1
  }

  template<class T>
  T& operator()(vector<T>& v){
    return v[ next()%v.size() ];
  }
};

int main(){
  auto start_time = chrono::steady_clock::now();

  XorShift rng(114514);

  int n,m;
  cin >> n,m;

  vector<int> a(n);
  cin >> a;

  vector<int> ans(m);
  int best = 0;
  shuffle(a.begin(), a.end(), mt);
  for(int i=0; i<m; i++){
    ans[i] = a[i];
    best ^= ans[i];
  }

  if( n==m ){
    println(ans);
    return 0;
  }

  int current = best;
  int itr = 0;
  for(itr=0; ; itr++){
    if( (itr&255) == 0 ){
      auto current_time = chrono::steady_clock::now();
      int elapsed = chrono::duration_cast<chrono::milliseconds>(current_time - start_time).count();
      if(elapsed > 1000) break;
    }

    int x = rng(m);
    int y = rng(n-m) + m;

    current ^= a[x] ^ a[y];
    swap(a[x], a[y]);

    if( current > best ){
      best = current;
      ans = vector<int>( begin(a), begin(a)+m );
    }
  }

  println(ans);
  eprintln("score =", best);
  eprintln("num itr = ", itr);

  return 0;
}
0