結果

問題 No.869 ふたつの距離
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-08-17 00:50:07
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 384 ms / 1,500 ms
コード長 5,773 bytes
コンパイル時間 2,987 ms
コンパイル使用メモリ 171,868 KB
実行使用メモリ 7,348 KB
最終ジャッジ日時 2024-06-22 02:23:12
合計ジャッジ時間 10,291 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 1 ms
6,944 KB
testcase_13 AC 1 ms
6,944 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 2 ms
6,944 KB
testcase_16 AC 1 ms
6,944 KB
testcase_17 AC 1 ms
6,940 KB
testcase_18 AC 1 ms
6,944 KB
testcase_19 AC 2 ms
6,944 KB
testcase_20 AC 1 ms
6,940 KB
testcase_21 AC 1 ms
6,944 KB
testcase_22 AC 1 ms
6,940 KB
testcase_23 AC 1 ms
6,940 KB
testcase_24 AC 1 ms
6,944 KB
testcase_25 AC 1 ms
6,940 KB
testcase_26 AC 2 ms
6,944 KB
testcase_27 AC 2 ms
6,944 KB
testcase_28 AC 1 ms
6,940 KB
testcase_29 AC 1 ms
6,940 KB
testcase_30 AC 1 ms
6,944 KB
testcase_31 AC 1 ms
6,940 KB
testcase_32 AC 1 ms
6,944 KB
testcase_33 AC 1 ms
6,940 KB
testcase_34 AC 2 ms
6,944 KB
testcase_35 AC 1 ms
6,944 KB
testcase_36 AC 1 ms
6,944 KB
testcase_37 AC 2 ms
6,940 KB
testcase_38 AC 1 ms
6,940 KB
testcase_39 AC 1 ms
6,944 KB
testcase_40 AC 2 ms
6,944 KB
testcase_41 AC 1 ms
6,944 KB
testcase_42 AC 86 ms
7,068 KB
testcase_43 AC 35 ms
6,940 KB
testcase_44 AC 32 ms
6,944 KB
testcase_45 AC 55 ms
6,944 KB
testcase_46 AC 7 ms
6,940 KB
testcase_47 AC 14 ms
6,944 KB
testcase_48 AC 49 ms
7,268 KB
testcase_49 AC 19 ms
6,940 KB
testcase_50 AC 18 ms
6,944 KB
testcase_51 AC 5 ms
6,940 KB
testcase_52 AC 3 ms
6,944 KB
testcase_53 AC 23 ms
6,944 KB
testcase_54 AC 178 ms
7,256 KB
testcase_55 AC 24 ms
6,940 KB
testcase_56 AC 11 ms
6,944 KB
testcase_57 AC 32 ms
6,944 KB
testcase_58 AC 6 ms
6,940 KB
testcase_59 AC 28 ms
6,940 KB
testcase_60 AC 140 ms
7,272 KB
testcase_61 AC 31 ms
6,940 KB
testcase_62 AC 24 ms
6,940 KB
testcase_63 AC 69 ms
7,124 KB
testcase_64 AC 15 ms
6,940 KB
testcase_65 AC 165 ms
7,060 KB
testcase_66 AC 42 ms
6,944 KB
testcase_67 AC 114 ms
7,320 KB
testcase_68 AC 41 ms
6,940 KB
testcase_69 AC 210 ms
7,148 KB
testcase_70 AC 47 ms
6,940 KB
testcase_71 AC 86 ms
7,280 KB
testcase_72 AC 245 ms
7,172 KB
testcase_73 AC 96 ms
7,252 KB
testcase_74 AC 225 ms
7,344 KB
testcase_75 AC 49 ms
6,940 KB
testcase_76 AC 25 ms
6,940 KB
testcase_77 AC 57 ms
6,940 KB
testcase_78 AC 90 ms
7,256 KB
testcase_79 AC 34 ms
6,940 KB
testcase_80 AC 308 ms
7,204 KB
testcase_81 AC 36 ms
6,940 KB
testcase_82 AC 191 ms
7,160 KB
testcase_83 AC 130 ms
7,260 KB
testcase_84 AC 259 ms
7,320 KB
testcase_85 AC 24 ms
6,940 KB
testcase_86 AC 23 ms
6,940 KB
testcase_87 AC 25 ms
6,944 KB
testcase_88 AC 23 ms
6,940 KB
testcase_89 AC 23 ms
6,940 KB
testcase_90 AC 25 ms
6,944 KB
testcase_91 AC 20 ms
6,944 KB
testcase_92 AC 384 ms
7,348 KB
testcase_93 AC 1 ms
6,944 KB
testcase_94 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, A, B;
real[] X, Y;

int calc(real d) {
  int cnt;
  foreach (i; 0 .. N) foreach (j; i + 1 .. N) {
    if ((X[i] - X[j])^^2 + (Y[i] - Y[j])^^2 <= d^^2) {
      ++cnt;
    }
  }
  return cnt;
}

void doIt(int l, int x, int y, int r, int s0, int s1, int dir) {
  debug {
    writefln("N = %d, A = %d, B = %d; B' = %d", N, A, B, N * (N - 1) / 2 - B);
    writefln("  l = %d, x = %d, y = %d, r = %d; s0 = %d, s1 = %d, dir = %d", l, x, y, r, s0, s1, dir);
  }
  
  /*
    |--------20----|
        |----20--------|
      l          x   1   y
  */
  enum real C = 1e-4;
  enum real D = 1e-4 * tan(1.0);
  enum real E = 1e-4 * tan(2.0);
  debug {
    writefln("  C = %.10f", C);
    writefln("  D = %.10f", D);
    writefln("  E = %.10f", E);
  }
  
  X = new real[N];
  Y = new real[N];
  foreach (i; 0 .. l) {
    X[i] = C * i;
    Y[i] = 0.0;
  }
  foreach (j; 0 .. x) {
    X[l + j] = 18.0 + D * j;
    Y[l + j] = 0.0;
  }
  X[l + x] = 20.0 + C * (r - 0.5);
  Y[l + x] = 0.0;
  foreach (j; 0 .. y) {
    X[l + x + 1 + j] = 25.0 + E * j;
    Y[l + x + 1 + j] = 0.0;
  }
  
  debug {
    writeln("  X = ", X);
    writeln("  Y = ", Y);
    writeln("  10: ", calc(10.0));
    writeln("  20: ", calc(20.0));
  }
  assert(calc(10.0) == s0);
  assert(calc(20.0) == B);
  
  int now = s0;
  foreach (j; 0 .. x) {
    real t0 = 18.0 + D * j;
    real t1 = 8.0 + D * j;
    Tuple!(real, int)[] events;
    events ~= tuple(t0, 0);
    events ~= tuple(t1, 0);
    foreach (i; 0 .. l + j) {
      real t = X[i] + 10.0;
      if (t1 <= t && t <= t0) {
        events ~= tuple(t, +1);
      }
    }
    foreach (i; l + j + 1 .. N) {
      real t = X[i] - 10.0;
      if (t1 <= t && t <= t0) {
        events ~= tuple(t, -1);
      }
    }
    sort(events);
    debug {
      writeln("  events = ", events);
    }
    const eventsLen = cast(int)(events.length);
    int best = now, cur;
    int hm;
    cur = now;
    foreach_reverse (h; 1 .. eventsLen) {
      cur += events[h][1];
      if ((dir == 0) ? chmax(best, cur) : chmin(best, cur)) {
        hm = h;
      }
    }
    bool ok;
    cur = now;
    foreach_reverse (h; 1 .. eventsLen) {
      cur += events[h][1];
      if (cur == A) {
        ok = true;
        X[l + j] = (events[h][0] + events[h - 1][0]) / 2.0;
        debug {
          writeln("    j = ", j);
          writeln("    ", cur, " ", calc(10.0));
        }
        break;
      }
    }
    if (ok) {
      break;
    }
    X[l + j] = (events[hm][0] + events[hm - 1][0]) / 2.0;
    now = best;
    debug {
      writeln("    j = ", j);
      writeln("    X = ", X);
      writeln("    ", now, " ", calc(10.0));
    }
  }
  assert(calc(10.0) == A);
  assert(calc(20.0) == B);
}

void main() {
  debug {
    foreach (n; 1 .. 50) {
      foreach (b; (n * (n - 1) + 3) / 4 + n .. n * (n - 1) / 2 + 1) {
        // writefln("n = %d, b = %d", n, b);
        auto flg = new bool[n * (n - 1) / 2 + 1];
        foreach (l; 0 .. n + 1) {
          foreach (x; 0 .. (n - l - 1) + 1) {
            const y = n - l - 1 - x;
            foreach (r; 0 .. l + 1) {
              if (n * (n - 1) / 2 - b == 0 * x + r + l * y) {
                const scores = [
                    l * (l - 1) / 2 + (n - l) * (n - l - 1) / 2,
                    (l + x) * (l + x - 1) / 2 + (n - l - x) * (n - l - x - 1) / 2
                ];
                foreach (score; min(scores[0], scores[1]) .. max(scores[0], scores[1]) + 1) {
                  flg[score] = true;
                }
              }
            }
          }
        }
        // writefln("  [%d, %d]", mn, mx);
        foreach (a; (n * (n - 1) + 3) / 4 .. b - n + 1) {
          assert(flg[a]);
        }
      }
    }
  }
  
  try {
    for (; ; ) {
      N = readInt();
      A = readInt();
      B = readInt();
      
      foreach (l; 0 .. N + 1) {
        foreach (x; 0 .. (N - l - 1) + 1) {
          const y = N - l - 1 - x;
          int r = N * (N - 1) / 2 - B;
          if (y > 0) {
            r %= y;
          }
          if (0 <= r && r <= l && N * (N - 1) / 2 - B == 0 * x + r + l * y) {
            int s0 = l * (l - 1) / 2 + (N - l) * (N - l - 1) / 2;
            int s1 = (l + x) * (l + x - 1) / 2 + (N - l - x) * (N - l - x - 1) / 2;
            if (s0 <= A && A <= s1) {
              doIt(l, x, y, r, s0, s1, 0);
              goto done;
            }
            if (s1 <= A && A <= s0) {
              doIt(l, x, y, r, s0, s1, 1);
              goto done;
            }
          }
        }
      }
      assert(false);
     done:
      foreach (i; 0 .. N) {
        writefln("%.10f %.10f", X[i], Y[i]);
      }
    }
  } catch (EOFException e) {
  }
}
0