結果

問題 No.670 log は定数
ユーザー fumiphysfumiphys
提出日時 2019-06-15 19:29:24
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,722 ms / 4,000 ms
コード長 4,125 bytes
コンパイル時間 1,691 ms
コンパイル使用メモリ 171,764 KB
実行使用メモリ 157,540 KB
最終ジャッジ日時 2023-08-12 14:10:34
合計ジャッジ時間 20,938 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge7
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,674 ms
157,524 KB
testcase_01 AC 1,688 ms
157,180 KB
testcase_02 AC 1,699 ms
157,184 KB
testcase_03 AC 1,680 ms
157,212 KB
testcase_04 AC 1,705 ms
157,164 KB
testcase_05 AC 1,691 ms
157,164 KB
testcase_06 AC 1,692 ms
157,272 KB
testcase_07 AC 1,675 ms
157,540 KB
testcase_08 AC 1,693 ms
157,168 KB
testcase_09 AC 1,722 ms
157,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

unsigned ll seed;
int next() {
    seed = seed ^ (seed << 13);
    seed = seed ^ (seed >> 7);
    seed = seed ^ (seed << 17);
    return (seed >> 33);
}


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); INT(q); cin >> seed;
  for(int i = 0; i < 10000; i++)next();
  vector<int> a(n); rep(i, n)a[i] = next();
  int m = 9, M = 31 - m;
  vector<int> cnt(bit(M), 0);
  vector<vector<int>> v(bit(M));
  rep(i, n){
  	cnt[a[i] / bit(m)]++;
  	v[a[i] / bit(m)].pb(a[i]);
  }
  vector<ll> sum(bit(M), 0); rep(i, sz(sum))sum[i] = cnt[i] + (i > 0 ? sum[i-1]: 0);
  ll res = 0;
  rep(i, q){
  	int x = next();
  	int ind = x / bit(m);
  	ll tmp = (ind > 0 ? sum[ind-1]: 0);
  	rep(j, sz(v[ind]))if(v[ind][j] < x)tmp++;
  	res = res ^ tmp * i;
  }
  cout << res << endl;
  return 0;
}
0