結果

問題 No.702 中央値を求めよ LIMITED
ユーザー homesentinel
提出日時 2018-06-15 23:03:05
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2,031 ms / 5,000 ms
コード長 2,490 bytes
コンパイル時間 1,192 ms
コンパイル使用メモリ 112,008 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-22 22:08:30
合計ジャッジ時間 58,307 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
//#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
//#define EXIST(s, e) ((s).find(e)!=(s).end())
//#define SORT(c) sort(begin(c),end(c))
//#define pb emplace_back
//#define MP make_pair
//#define SZ(a) int((a).size())
//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x) cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif
//
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //1
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//
uint32_t x = 0, y = 1, z = 2, w = 3;
int seed;
uint32_t generate() {
uint32_t t = (x ^ (x << 11));
x = y;
y = z;
z = w;
w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
return w;
}
void reset() {
x = seed;
y = 1;
z = 2;
w = 3;
}
//num
int count(ll num) {
reset();
int ret = 0;
for (int i = 0; i < 10000001; i++) {
if (generate() <= num) ret++;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> seed;
x = seed;
const int lim = 5000000;
ll low = 0,high = (1ll << 32) - 1;
int low_num = count(low);
int high_num = count(high);
int ii = 100;
while(ii--){
// if(low_num < lim && high_num >= lim){
// break;
// }
ll mid = (low + high) / 2;
int mid_num = count(mid);
if(mid_num <= lim){
low_num = mid_num;
low = mid;
}else{
high_num = mid_num;
high = mid;
}
}
cout << high << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0