#421920 (D) No.702 中央値を求めよ LIMITED

• 問題: No.702 中央値を求めよ LIMITED
• ユーザー: te-sh
• 提出日時: 2020-01-27 20:55:29
• 言語: D (dmd 2.109.1)
• 結果: AC
• 実行時間: 144 ms / 5,000 ms
• コード長: 2,616 bytes
• コンパイル時間: 1,359 ms
• コンパイル使用メモリ: 142,620 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 04:39:42
• 合計ジャッジ時間: 6,303 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 25

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
// URL: https://yukicoder.me/problems/no/702
import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string;
const n = 10000001;
version(unittest) {} else
void main()
{
  uint seed; io.getV(seed);
  init(seed);
  auto a = new int[](1<<16);
  foreach (_; 0..n) {
    auto r = generate();
    ++a[r>>16];
  }
  auto i = 0u, s = 0;
  for (; i < (1<<16); ++i) {
    if (s+a[i] >= (n+1)/2) break;
    s += a[i];
  }
  init(seed);
  a[] = 0;
  foreach (_; 0..n) {
    auto r = generate();
    if ((r>>16) == i)
      ++a[r&((1<<16)-1)];
  }
  foreach (j; 0..1u<<16) {
    s += a[j];
    if (s >= (n+1)/2) { io.put((i<<16)|j); return; }
  }
}
uint x, y, z, w;
void init(uint seed)
{
  x = seed;
  y = 1;
  z = 2;
  w = 3;
}
uint generate() {
  uint t = (x^(x<<11));
  x = y;
  y = z;
  z = w;
  w = (w^(w>>19))^(t^(t>>8)); 
  return w;
}
auto io = IO!()();
import std.stdio;
struct IO(string floatFormat = "%.10f", string delimiter = " ", alias IN = stdin, alias OUT = stdout)
{
  import std.conv, std.format, std.meta, std.traits;
  auto getV(T...)(ref T v) { foreach (ref w; v) get(w); }
  auto getA(T)(size_t n, ref T v) if (hasAssignableElements!T)
  { v = new T(n); foreach (ref w; v) get(w); }
  auto getC(T...)(size_t n, ref T v)
  if (allSatisfy!(hasAssignableElements, T))
  {
    foreach (ref w; v) w = new typeof(w)(n);
    foreach (i; 0..n) foreach (ref w; v) get(w[i]);
  }
  auto getM(T)(size_t r, size_t c, ref T v)
  if (hasAssignableElements!T && hasAssignableElements!(ElementType!T))
  {
    v = new T(r); foreach (ref w; v) getA(c, w);
  }
  template getS(E...)
  {
    auto getS(T)(size_t n, ref T v)
    {
      v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");");
    }
  }
  auto put(bool flush = false, T...)(T v)
  {
    foreach (i, w; v) { putA(w); if (i < v.length-1) OUT.write(delimiter); }
    OUT.writeln;
    static if (flush) OUT.flush();
  }
  auto putB(S, T)(bool c, S t, T f) { if (c) put(t); else put(f); }
  auto putRaw(T...)(T v) { OUT.write(v); OUT.writeln; }
  private
  {
    dchar[] buf;
    auto sp = (new dchar[](0)).splitter;
    void nextLine() { IN.readln(buf); sp = buf.splitter; }
    auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); }
    auto putR(T)(T v)
    {
      auto w = v;
      while (!w.empty) { putA(w.front); w.popFront(); if (!w.empty) OUT.write(delimiter); }
    }
    auto putA(T)(T v)
    {
      static if (isInputRange!T && !isSomeString!T) putR(v);
      else if (isFloatingPoint!T) OUT.write(format(floatFormat, v));
      else OUT.write(v);
    }
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX