結果
問題 | No.471 直列回転機 |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-05-21 10:44:10 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 383 ms / 3,141 ms |
コード長 | 1,779 bytes |
コンパイル時間 | 676 ms |
コンパイル使用メモリ | 106,888 KB |
実行使用メモリ | 24,408 KB |
平均クエリ数 | 19589.39 |
最終ジャッジ日時 | 2023-09-04 01:10:17 |
合計ジャッジ時間 | 16,604 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 30 ms
23,532 KB |
testcase_01 | AC | 26 ms
23,388 KB |
testcase_02 | AC | 26 ms
23,532 KB |
testcase_03 | AC | 26 ms
24,408 KB |
testcase_04 | AC | 25 ms
23,364 KB |
testcase_05 | AC | 27 ms
24,024 KB |
testcase_06 | AC | 26 ms
23,520 KB |
testcase_07 | AC | 27 ms
24,000 KB |
testcase_08 | AC | 49 ms
24,048 KB |
testcase_09 | AC | 52 ms
23,400 KB |
testcase_10 | AC | 39 ms
23,520 KB |
testcase_11 | AC | 161 ms
23,832 KB |
testcase_12 | AC | 301 ms
23,412 KB |
testcase_13 | AC | 303 ms
24,408 KB |
testcase_14 | AC | 331 ms
23,424 KB |
testcase_15 | AC | 383 ms
23,400 KB |
testcase_16 | AC | 28 ms
23,532 KB |
testcase_17 | AC | 24 ms
24,336 KB |
testcase_18 | AC | 26 ms
23,388 KB |
testcase_19 | AC | 25 ms
24,012 KB |
testcase_20 | AC | 340 ms
23,652 KB |
testcase_21 | AC | 100 ms
23,364 KB |
testcase_22 | AC | 307 ms
24,000 KB |
testcase_23 | AC | 283 ms
23,376 KB |
testcase_24 | AC | 179 ms
24,024 KB |
testcase_25 | AC | 79 ms
24,348 KB |
testcase_26 | AC | 331 ms
23,364 KB |
testcase_27 | AC | 178 ms
23,832 KB |
testcase_28 | AC | 204 ms
23,412 KB |
testcase_29 | AC | 226 ms
23,988 KB |
testcase_30 | AC | 102 ms
23,820 KB |
testcase_31 | AC | 346 ms
23,400 KB |
testcase_32 | AC | 293 ms
24,012 KB |
testcase_33 | AC | 232 ms
24,036 KB |
testcase_34 | AC | 330 ms
24,012 KB |
testcase_35 | AC | 97 ms
24,372 KB |
testcase_36 | AC | 144 ms
24,024 KB |
testcase_37 | AC | 53 ms
24,012 KB |
testcase_38 | AC | 82 ms
24,060 KB |
testcase_39 | AC | 131 ms
23,400 KB |
testcase_40 | AC | 249 ms
23,364 KB |
testcase_41 | AC | 343 ms
23,520 KB |
testcase_42 | AC | 226 ms
23,604 KB |
testcase_43 | AC | 311 ms
23,532 KB |
testcase_44 | AC | 59 ms
23,640 KB |
testcase_45 | AC | 218 ms
24,000 KB |
testcase_46 | AC | 253 ms
24,348 KB |
testcase_47 | AC | 321 ms
23,820 KB |
testcase_48 | AC | 270 ms
23,832 KB |
testcase_49 | AC | 267 ms
24,264 KB |
testcase_50 | AC | 315 ms
23,520 KB |
testcase_51 | AC | 138 ms
23,628 KB |
testcase_52 | AC | 29 ms
24,000 KB |
testcase_53 | AC | 29 ms
24,000 KB |
testcase_54 | AC | 28 ms
24,036 KB |
testcase_55 | AC | 102 ms
24,324 KB |
testcase_56 | AC | 96 ms
24,012 KB |
testcase_57 | AC | 69 ms
24,036 KB |
testcase_58 | AC | 41 ms
23,532 KB |
ソースコード
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 M; long[] X, Y; void main() { M = readInt(); X = new long[M]; Y = new long[M]; foreach (i; 0 .. M) { X[i] = readLong(); Y[i] = readLong(); } writeln("? 0 0"); stdout.flush; const ax = readLong(); const ay = readLong(); writeln("? 1 0"); stdout.flush; const bx = readLong(); const by = readLong(); writeln("? 0 1"); stdout.flush; const cx = readLong(); const cy = readLong(); writeln("!"); foreach (i; 0 .. M) { const ansX = ax + (bx - ax) * X[i] + (cx - ax) * Y[i]; const ansY = ay + (by - ay) * X[i] + (cy - ay) * Y[i]; writeln(ansX, " ", ansY); } stdout.flush; }