結果
問題 | No.202 1円玉投げ |
ユーザー | te-sh |
提出日時 | 2017-05-11 12:19:26 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 285 ms / 5,000 ms |
コード長 | 2,672 bytes |
コンパイル時間 | 1,270 ms |
コンパイル使用メモリ | 223,164 KB |
実行使用メモリ | 24,460 KB |
最終ジャッジ日時 | 2023-09-03 13:16:40 |
合計ジャッジ時間 | 7,706 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 234 ms
12,576 KB |
testcase_01 | AC | 285 ms
24,460 KB |
testcase_02 | AC | 5 ms
4,376 KB |
testcase_03 | AC | 6 ms
4,376 KB |
testcase_04 | AC | 6 ms
4,380 KB |
testcase_05 | AC | 33 ms
15,804 KB |
testcase_06 | AC | 239 ms
24,452 KB |
testcase_07 | AC | 254 ms
24,444 KB |
testcase_08 | AC | 262 ms
24,452 KB |
testcase_09 | AC | 163 ms
24,108 KB |
testcase_10 | AC | 86 ms
19,416 KB |
testcase_11 | AC | 140 ms
23,592 KB |
testcase_12 | AC | 148 ms
24,112 KB |
testcase_13 | AC | 86 ms
19,464 KB |
testcase_14 | AC | 37 ms
16,876 KB |
testcase_15 | AC | 148 ms
24,136 KB |
testcase_16 | AC | 221 ms
11,128 KB |
testcase_17 | AC | 223 ms
13,100 KB |
testcase_18 | AC | 221 ms
13,160 KB |
testcase_19 | AC | 148 ms
24,124 KB |
testcase_20 | AC | 216 ms
24,456 KB |
testcase_21 | AC | 143 ms
24,120 KB |
testcase_22 | AC | 7 ms
4,380 KB |
testcase_23 | AC | 7 ms
4,384 KB |
testcase_24 | AC | 7 ms
4,380 KB |
testcase_25 | AC | 7 ms
4,376 KB |
testcase_26 | AC | 12 ms
7,116 KB |
testcase_27 | AC | 12 ms
7,080 KB |
testcase_28 | AC | 8 ms
4,380 KB |
testcase_29 | AC | 7 ms
4,376 KB |
testcase_30 | AC | 11 ms
6,740 KB |
testcase_31 | AC | 7 ms
4,380 KB |
testcase_32 | AC | 11 ms
6,604 KB |
testcase_33 | AC | 8 ms
4,380 KB |
testcase_34 | AC | 8 ms
4,380 KB |
testcase_35 | AC | 225 ms
14,272 KB |
testcase_36 | AC | 225 ms
10,212 KB |
testcase_37 | AC | 284 ms
24,456 KB |
testcase_38 | AC | 227 ms
14,268 KB |
testcase_39 | AC | 6 ms
4,380 KB |
testcase_40 | AC | 6 ms
4,376 KB |
ソースコード
import std.algorithm, std.conv, std.range, std.stdio, std.string; alias Point!int point; const maxX = 20000, maxY = 20000, gs = 20; auto grid = Grid!(point[], int)(maxX / gs + 1, maxY / gs + 1); void main() { auto n = readln.chomp.to!size_t; auto r = 0; foreach (_; 0..n) { auto rd = readln.split.to!(int[]), p = point(rd[0], rd[1]), gp = p / gs; if (!isOverlap(p, gp)) { grid[gp] ~= p; ++r; } } writeln(r); } auto isOverlap(point p, point gp) { foreach (q; grid.sibPoints8(gp).chain([gp])) foreach (tp; grid[q]) if ((p - tp).hypot2 < 400) return true; return false; } struct Point(T) { T x, y; pure auto opBinary(string op: "+")(Point!T rhs) const { return Point!T(x + rhs.x, y + rhs.y); } pure auto opBinary(string op: "-")(Point!T rhs) const { return Point!T(x - rhs.x, y - rhs.y); } pure auto opBinary(string op: "*")(Point!T rhs) const { return x * rhs.x + y * rhs.y; } pure auto opBinary(string op: "*")(T a) const { return Point!T(x * a, y * a); } pure auto opBinary(string op: "/")(T a) const { return Point!T(x / a, y / a); } pure auto hypot2() const { return x ^^ 2 + y ^^ 2; } } struct Grid(T, U) { import std.algorithm, std.conv, std.range, std.traits, std.typecons; const sibs4 = [Point!U(-1, 0), Point!U(0, -1), Point!U(1, 0), Point!U(0, 1)]; const sibs8 = [Point!U(-1, 0), Point!U(-1, -1), Point!U(0, -1), Point!U(1, -1), Point!U(1, 0), Point!U(1, 1), Point!U(0, 1), Point!U(-1, 1)]; T[][] m; const size_t rows, cols; mixin Proxy!m; this(size_t r, size_t c) { rows = r; cols = c; m = new T[][](rows, cols); } this(T[][] s) { rows = s.length; cols = s[0].length; m = s; } pure auto opIndex(Point!U p) const { return m[p.y][p.x]; } pure auto opIndex(size_t y) { return m[y]; } pure auto opIndex(size_t y, size_t x) const { return m[y][x]; } static if (isAssignable!T) { auto opIndexAssign(T v, Point!U p) { return m[p.y][p.x] = v; } auto opIndexAssign(T v, size_t y, size_t x) { return m[y][x] = v; } auto opIndexOpAssign(string op, V)(V v, Point!U p) { return mixin("m[p.y][p.x] " ~ op ~ "= v"); } auto opIndexOpAssign(string op, V)(V v, size_t y, size_t x) { return mixin("m[y][x] " ~ op ~ "= v"); } } pure auto validPoint(Point!U p) const { return p.x >= 0 && p.x < cols && p.y >= 0 && p.y < rows; } pure auto points() const { return rows.to!U.iota.map!(y => cols.to!U.iota.map!(x => Point!U(x, y))).joiner; } pure auto sibPoints4(Point!U p) const { return sibs4.map!(s => p + s).filter!(p => validPoint(p)); } pure auto sibPoints8(Point!U p) const { return sibs8.map!(s => p + s).filter!(p => validPoint(p)); } }