結果
問題 | No.670 log は定数 |
ユーザー |
![]() |
提出日時 | 2018-03-24 01:03:07 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2,842 ms / 4,000 ms |
コード長 | 1,753 bytes |
コンパイル時間 | 880 ms |
コンパイル使用メモリ | 107,228 KB |
実行使用メモリ | 430,856 KB |
最終ジャッジ日時 | 2024-06-25 02:29:08 |
合計ジャッジ時間 | 32,521 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
# include <iostream># include <algorithm># include <vector># include <string># include <set># include <map># include <cmath># include <iomanip># include <functional># include <utility># include <stack># include <queue># include <list># include <tuple># include <unordered_map># include <numeric># include <complex># include <bitset># include <random># include <chrono>using namespace std;using LL = long long;using ULL = unsigned long long;typedef pair<LL, LL> P;constexpr int INF = 2000000000;constexpr int HINF = INF / 2;constexpr double DINF = 100000000000000000.0;constexpr long long LINF = 9223372036854775807;constexpr long long HLINF = 4500000000000000000;const double PI = acos(-1);int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };# define ALL(x) (x).begin(),(x).end()# define UNIQ(c) (c).erase(unique(ALL((c))),(c).end())# define mp make_pair# define eb emplace_back# define FOR(i,a,b) for(int i=(a);i<(b);i++)# define RFOR(i,a,b) for(int i=(a);i>=(b);i--)# define REP(i,n) FOR(i,0,n)# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)ULL n, q;ULL a[202020];ULL sum[14202020];vector<ULL> v[14202020];ULL seed;ULL next() {seed = seed ^ (seed << 13);seed = seed ^ (seed >> 7);seed = seed ^ (seed << 17);return (seed >> 33);}int main() {cin >> n >> q >> seed;REP(i, 10000)next();REP(i, n) {a[i] = next();sum[(a[i] / 200) + 1]++;v[a[i] / 200].emplace_back(a[i]);}REP(i, (INF / 200) + (INF / 2000) + INF / 20000) {sum[i + 1] += sum[i];}ULL ans = 0;REP(i, q) {ULL x = next();ULL cnt = sum[x / 200];REP(j, v[x / 200].size()) {if (v[x / 200][j] < x)cnt++;}ans ^= (ULL)cnt*i;}cout << ans << endl;}