結果
問題 | No.2500 Products in a Range |
ユーザー |
👑 |
提出日時 | 2023-10-13 23:33:09 |
言語 | D (dmd 2.109.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,454 bytes |
コンパイル時間 | 1,167 ms |
コンパイル使用メモリ | 122,240 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-15 19:25:45 |
合計ジャッジ時間 | 4,065 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 48 WA * 13 |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, 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; }string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }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)); }void main() {try {for (; ; ) {const N = readInt;const L = readLong;const R = readLong;auto A = new long[N];foreach (i; 0 .. N) {A[i] = readLong;}A.sort;bool check(int i, int j) {const prod = A[i] * A[j];return (L <= prod && prod <= R);}int ans = 1;if (R < 0) {foreach (i; 0 .. N) foreach (j; i + 1 .. N) {if (check(i, j)) {chmax(ans, 2);}}} else if (0 < L) {foreach (i; 0 .. N) foreach (j; i + 1 .. N) {if (check(i, i + 1) && check(j - 1, j)) {chmax(ans, j - i + 1);}}} else {foreach (i; 0 .. N) foreach (j; i + 1 .. N) {if (check(i, i + 1) && check(i, j) && check(j - 1, j)) {chmax(ans, j - i + 1);}}const zL = A.lowerBound(0);const zR = A.upperBound(0);foreach (i; 0 .. zL) foreach (j; zR .. N) {if (check(i, j)) {if (check(i, i + 1)) chmax(ans, 1 + (j - zL + 1));if (check(j - 1, j)) chmax(ans, (zR - i) + 1);}}}writeln(ans);}} catch (EOFException e) {}}