結果
問題 | No.702 中央値を求めよ LIMITED |
ユーザー |
![]() |
提出日時 | 2017-10-01 06:27:53 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 1,003 ms / 5,000 ms |
コード長 | 2,308 bytes |
コンパイル時間 | 486 ms |
コンパイル使用メモリ | 56,320 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-02 09:11:17 |
合計ジャッジ時間 | 26,462 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 908 ms
5,248 KB |
testcase_01 | AC | 998 ms
5,376 KB |
testcase_02 | AC | 779 ms
5,376 KB |
testcase_03 | AC | 780 ms
5,376 KB |
testcase_04 | AC | 837 ms
5,376 KB |
testcase_05 | AC | 979 ms
5,376 KB |
testcase_06 | AC | 974 ms
5,376 KB |
testcase_07 | AC | 885 ms
5,376 KB |
testcase_08 | AC | 998 ms
5,376 KB |
testcase_09 | AC | 936 ms
5,376 KB |
testcase_10 | AC | 949 ms
5,376 KB |
testcase_11 | AC | 898 ms
5,376 KB |
testcase_12 | AC | 890 ms
5,376 KB |
testcase_13 | AC | 879 ms
5,376 KB |
testcase_14 | AC | 824 ms
5,376 KB |
testcase_15 | AC | 1,003 ms
5,376 KB |
testcase_16 | AC | 944 ms
5,376 KB |
testcase_17 | AC | 886 ms
5,376 KB |
testcase_18 | AC | 988 ms
5,376 KB |
testcase_19 | AC | 823 ms
5,376 KB |
testcase_20 | AC | 819 ms
5,376 KB |
testcase_21 | AC | 580 ms
5,376 KB |
testcase_22 | AC | 935 ms
5,376 KB |
testcase_23 | AC | 717 ms
5,376 KB |
testcase_24 | AC | 811 ms
5,376 KB |
testcase_25 | AC | 829 ms
5,376 KB |
testcase_26 | AC | 950 ms
5,376 KB |
ソースコード
#include <iostream> /* #include<vector> #include<algorithm> */ using namespace std; #define rep(i,n) for(long long i = 0; i < (long long)(n); i++) #define all(x) (x).begin(), (x).end() template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); } template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } using ll = int64_t; #define ldout fixed << setprecision(40) const int N = 10000001; uint32_t x = 0, y = 1, z = 2, w = 3; uint32_t x_org, y_org, z_org, w_org; uint32_t t = 0; uint32_t generate() { t = (x^(x<<11)); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); return w; } void reset(void) { x = x_org, y = y_org, z = z_org, w = w_org; } ll seed; ll min_ = 2130000000, max_ = 2170000000; ll less_, greater_, equal_, c = 0; ll guess, maxltguess, mingtguess, median; ll n; int main(void) { cin >> seed; x = seed; x_org = x, y_org = y, z_org = z, w_org = w; /* rep(i, N) { ll x = generate(); chmax(max_, x); chmin(min_, x); } */ while (1) { reset(); // cout << "iter"<<endl; guess = (min_+max_)/2; less_ = 0; greater_ = 0; equal_ = 0; maxltguess = min_; mingtguess = max_; c = 0; rep(i, N) { n = generate(); if (n < guess) { less_++; if (n > maxltguess) maxltguess = n; } else if (n > guess) { greater_++; if (n < mingtguess) mingtguess = n; } else { equal_++; } c = i + 1; } if (less_ <= (N+1)/2 && greater_ <= (N+1)/2) break; if (less_>greater_) max_ = maxltguess; else min_ = mingtguess; } if (less_ >= (N+1)/2) median = maxltguess; else if (less_+equal_ >= (N+1)/2) median = guess; else median = mingtguess; cout << median << endl; #if 0 reset(); vector<ll> a(N); rep(i, N) a[i] = generate(); sort(all(a)); cout << a[N/2] << endl; if (a[N/2] != median) { cerr << "NOT MATCH" << endl; abort(); } #endif return 0; }