結果

問題 No.702 中央値を求めよ LIMITED
ユーザー maimai
提出日時 2018-06-15 22:45:30
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 693 ms / 5,000 ms
コード長 5,545 bytes
コンパイル時間 2,036 ms
コンパイル使用メモリ 175,004 KB
実行使用メモリ 4,388 KB
最終ジャッジ日時 2023-08-14 21:09:09
合計ジャッジ時間 23,004 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 690 ms
4,380 KB
testcase_01 AC 693 ms
4,380 KB
testcase_02 AC 691 ms
4,376 KB
testcase_03 AC 691 ms
4,380 KB
testcase_04 AC 688 ms
4,380 KB
testcase_05 AC 692 ms
4,380 KB
testcase_06 AC 691 ms
4,380 KB
testcase_07 AC 693 ms
4,384 KB
testcase_08 AC 691 ms
4,380 KB
testcase_09 AC 691 ms
4,380 KB
testcase_10 AC 692 ms
4,376 KB
testcase_11 AC 691 ms
4,388 KB
testcase_12 AC 691 ms
4,376 KB
testcase_13 AC 690 ms
4,380 KB
testcase_14 AC 693 ms
4,380 KB
testcase_15 AC 691 ms
4,380 KB
testcase_16 AC 690 ms
4,376 KB
testcase_17 AC 691 ms
4,380 KB
testcase_18 AC 691 ms
4,380 KB
testcase_19 AC 691 ms
4,380 KB
testcase_20 AC 691 ms
4,376 KB
testcase_21 AC 692 ms
4,380 KB
testcase_22 AC 690 ms
4,376 KB
testcase_23 AC 689 ms
4,376 KB
testcase_24 AC 685 ms
4,380 KB
testcase_25 AC 690 ms
4,380 KB
testcase_26 AC 692 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debug(v) {printf("L%d %s > ",__LINE__,#v);cout<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_const<decltype(l)>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream &o, const Vec& p) { o << '['; for (auto& e : p) o << e << ','; o << ']'; return o; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this <<* begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


uint32_t x = 0, y = 1, z = 2, w = 3;
uint32_t 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; }

const int N = 10000001, H = N/2;

int main(){
    cin >> seed;
    
    uint32_t ng = 0, ok = uint32_t(-1);
    while (ng+1 < ok){
        reset();
        int ngcnt = 0;
        uint32_t threshold = (ok-ng)/2+ng;
        repeat(i, N) ngcnt += generate() < threshold;
        if (ngcnt <= H) ng = threshold;
        else ok = threshold;
    }
    cout << ng << endl;
    return 0;
}
0