Hugging Face's logo

grapheneaffiliates
/
h4-polytopic-attention

Text Generation
Safetensors
English
geometric-attention
h4-polytope
ternary-quantization
project-olympus
transformer-vm
hilbert-modular-form
e8-lattice
percepta
Model card Files
xet
 Community
grapheneaffiliates commited on
Commit
b9d47dc
·
verified ·
1 Parent(s): fa2fec3

Upload data/arc_python_solutions_b11.json with huggingface_hub

Browse files
Files changed (1) hide show
  1. data/arc_python_solutions_b11.json +745 -0
data/arc_python_solutions_b11.json ADDED
@@ -0,0 +1,745 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "7468f01a": {
3
+ "solver": "def solve_7468f01a(grid):\n rows, cols = len(grid), len(grid[0])\n min_r, max_r, min_c, max_c = rows, 0, cols, 0\n for r in range(rows):\n for c in range(cols):\n if grid[r][c] != 0:\n min_r = min(min_r, r)\n max_r = max(max_r, r)\n min_c = min(min_c, c)\n max_c = max(max_c, c)\n result = []\n for r in range(min_r, max_r + 1):\n row = grid[r][min_c:max_c + 1]\n result.append(row[::-1])\n return result\n",
4
+ "test_output": [
5
+ [
6
+ [
7
+ 1,
8
+ 1,
9
+ 1,
10
+ 8,
11
+ 1,
12
+ 1,
13
+ 1,
14
+ 1
15
+ ],
16
+ [
17
+ 1,
18
+ 8,
19
+ 8,
20
+ 1,
21
+ 1,
22
+ 1,
23
+ 1,
24
+ 1
25
+ ],
26
+ [
27
+ 1,
28
+ 1,
29
+ 1,
30
+ 1,
31
+ 1,
32
+ 1,
33
+ 1,
34
+ 1
35
+ ],
36
+ [
37
+ 1,
38
+ 1,
39
+ 1,
40
+ 1,
41
+ 1,
42
+ 8,
43
+ 8,
44
+ 8
45
+ ],
46
+ [
47
+ 1,
48
+ 1,
49
+ 1,
50
+ 1,
51
+ 1,
52
+ 1,
53
+ 1,
54
+ 1
55
+ ],
56
+ [
57
+ 1,
58
+ 1,
59
+ 1,
60
+ 8,
61
+ 8,
62
+ 8,
63
+ 1,
64
+ 1
65
+ ],
66
+ [
67
+ 1,
68
+ 1,
69
+ 1,
70
+ 1,
71
+ 1,
72
+ 1,
73
+ 1,
74
+ 1
75
+ ]
76
+ ]
77
+ ],
78
+ "all_pass": true
79
+ },
80
+ "746b3537": {
81
+ "solver": "def solve_746b3537(grid):\n deduped = [grid[0]]\n for r in range(1, len(grid)):\n if grid[r] != grid[r - 1]:\n deduped.append(grid[r])\n if not deduped:\n return deduped\n ncols = len(deduped[0])\n keep = [0]\n for c in range(1, ncols):\n col_curr = [deduped[r][c] for r in range(len(deduped))]\n col_prev = [deduped[r][c - 1] for r in range(len(deduped))]\n if col_curr != col_prev:\n keep.append(c)\n return [[row[c] for c in keep] for row in deduped]\n",
82
+ "test_output": [
83
+ [
84
+ [
85
+ 1,
86
+ 2,
87
+ 3,
88
+ 8,
89
+ 4
90
+ ]
91
+ ]
92
+ ],
93
+ "all_pass": true
94
+ },
95
+ "75b8110e": {
96
+ "solver": "def solve_75b8110e(grid):\n H, W = len(grid), len(grid[0])\n h, w = H // 2, W // 2\n TL = [[grid[r][c] for c in range(w)] for r in range(h)]\n TR = [[grid[r][c] for c in range(w, W)] for r in range(h)]\n BL = [[grid[r][c] for c in range(w)] for r in range(h, H)]\n BR = [[grid[r][c] for c in range(w, W)] for r in range(h, H)]\n result = [[0] * w for _ in range(h)]\n for r in range(h):\n for c in range(w):\n if TR[r][c] != 0:\n result[r][c] = TR[r][c]\n elif BL[r][c] != 0:\n result[r][c] = BL[r][c]\n elif BR[r][c] != 0:\n result[r][c] = BR[r][c]\n elif TL[r][c] != 0:\n result[r][c] = TL[r][c]\n return result\n",
97
+ "test_output": [
98
+ [
99
+ [
100
+ 5,
101
+ 9,
102
+ 6,
103
+ 6
104
+ ],
105
+ [
106
+ 5,
107
+ 9,
108
+ 5,
109
+ 5
110
+ ],
111
+ [
112
+ 4,
113
+ 5,
114
+ 5,
115
+ 5
116
+ ],
117
+ [
118
+ 5,
119
+ 9,
120
+ 0,
121
+ 0
122
+ ]
123
+ ]
124
+ ],
125
+ "all_pass": true
126
+ },
127
+ "760b3cac": {
128
+ "solver": "def solve_760b3cac(grid):\n result = [row[:] for row in grid]\n h = len(grid)\n eight_rows = range(0, h // 2)\n arrow_rows = range(h // 2, h)\n\n bar_row = None\n bar_center = None\n for r in arrow_rows:\n fours = [c for c in range(len(grid[0])) if grid[r][c] == 4]\n if len(fours) == 3:\n bar_row = r\n bar_center = fours[1]\n break\n\n head_col = None\n for r in arrow_rows:\n if r == bar_row:\n continue\n fours = [c for c in range(len(grid[0])) if grid[r][c] == 4]\n if len(fours) == 1 and fours[0] != bar_center:\n head_col = fours[0]\n break\n\n if head_col is not None:\n direction = 'left' if head_col < bar_center else 'right'\n else:\n direction = 'left'\n\n col_start = bar_center - 1\n col_end = bar_center + 2\n\n for r in eight_rows:\n pattern = grid[r][col_start:col_end]\n reversed_pattern = pattern[::-1]\n if direction == 'left':\n dest_start = col_start - 3\n for i, v in enumerate(reversed_pattern):\n if v != 0:\n result[r][dest_start + i] = v\n else:\n dest_start = col_end\n for i, v in enumerate(reversed_pattern):\n if v != 0:\n result[r][dest_start + i] = v\n return result\n",
129
+ "test_output": [
130
+ [
131
+ [
132
+ 0,
133
+ 0,
134
+ 0,
135
+ 8,
136
+ 0,
137
+ 8,
138
+ 8,
139
+ 0,
140
+ 8
141
+ ],
142
+ [
143
+ 0,
144
+ 0,
145
+ 0,
146
+ 0,
147
+ 8,
148
+ 8,
149
+ 8,
150
+ 8,
151
+ 0
152
+ ],
153
+ [
154
+ 0,
155
+ 0,
156
+ 0,
157
+ 8,
158
+ 0,
159
+ 0,
160
+ 0,
161
+ 0,
162
+ 8
163
+ ],
164
+ [
165
+ 0,
166
+ 0,
167
+ 0,
168
+ 0,
169
+ 0,
170
+ 4,
171
+ 0,
172
+ 0,
173
+ 0
174
+ ],
175
+ [
176
+ 0,
177
+ 0,
178
+ 0,
179
+ 4,
180
+ 4,
181
+ 4,
182
+ 0,
183
+ 0,
184
+ 0
185
+ ],
186
+ [
187
+ 0,
188
+ 0,
189
+ 0,
190
+ 0,
191
+ 4,
192
+ 0,
193
+ 0,
194
+ 0,
195
+ 0
196
+ ]
197
+ ]
198
+ ],
199
+ "all_pass": true
200
+ },
201
+ "77fdfe62": {
202
+ "solver": "def solve_77fdfe62(grid):\n H, W = len(grid), len(grid[0])\n border_rows = [r for r in range(H) if all(v == 1 for v in grid[r])]\n top_border = border_rows[0]\n bot_border = border_rows[-1]\n\n left_col = None\n right_col = None\n for c in range(W):\n if all(grid[r][c] == 1 for r in range(top_border, bot_border + 1)):\n if left_col is None:\n left_col = c\n right_col = c\n\n top_row = grid[top_border - 1]\n bot_row = grid[bot_border + 1]\n tl_color = tr_color = bl_color = br_color = 0\n\n for c in range(W):\n if top_row[c] not in (0, 1):\n if c <= left_col:\n tl_color = top_row[c]\n else:\n tr_color = top_row[c]\n for c in range(W):\n if bot_row[c] not in (0, 1):\n if c <= left_col:\n bl_color = bot_row[c]\n else:\n br_color = bot_row[c]\n\n inner_top = top_border + 1\n inner_bot = bot_border - 1\n inner_left = left_col + 1\n inner_right = right_col - 1\n inner_h = inner_bot - inner_top + 1\n inner_w = inner_right - inner_left + 1\n mid_r = inner_h / 2.0\n mid_c = inner_w / 2.0\n\n result = []\n for r in range(inner_h):\n row = []\n for c in range(inner_w):\n val = grid[inner_top + r][inner_left + c]\n if val == 8:\n if r < mid_r and c < mid_c:\n row.append(tl_color)\n elif r < mid_r and c >= mid_c:\n row.append(tr_color)\n elif r >= mid_r and c < mid_c:\n row.append(bl_color)\n else:\n row.append(br_color)\n else:\n row.append(0)\n result.append(row)\n return result\n",
203
+ "test_output": [
204
+ [
205
+ [
206
+ 0,
207
+ 3,
208
+ 3,
209
+ 0,
210
+ 0,
211
+ 0
212
+ ],
213
+ [
214
+ 3,
215
+ 3,
216
+ 3,
217
+ 0,
218
+ 4,
219
+ 0
220
+ ],
221
+ [
222
+ 0,
223
+ 0,
224
+ 3,
225
+ 0,
226
+ 4,
227
+ 0
228
+ ],
229
+ [
230
+ 0,
231
+ 7,
232
+ 0,
233
+ 5,
234
+ 5,
235
+ 0
236
+ ],
237
+ [
238
+ 7,
239
+ 7,
240
+ 0,
241
+ 5,
242
+ 0,
243
+ 5
244
+ ],
245
+ [
246
+ 0,
247
+ 7,
248
+ 0,
249
+ 0,
250
+ 5,
251
+ 0
252
+ ]
253
+ ]
254
+ ],
255
+ "all_pass": true
256
+ },
257
+ "794b24be": {
258
+ "solver": "def solve_794b24be(grid):\n count = sum(grid[r][c] for r in range(3) for c in range(3))\n result = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\n fill_order = [(0, 0), (0, 1), (0, 2), (1, 1)]\n for i in range(min(count, len(fill_order))):\n r, c = fill_order[i]\n result[r][c] = 2\n return result\n",
259
+ "test_output": [
260
+ [
261
+ [
262
+ 2,
263
+ 2,
264
+ 0
265
+ ],
266
+ [
267
+ 0,
268
+ 0,
269
+ 0
270
+ ],
271
+ [
272
+ 0,
273
+ 0,
274
+ 0
275
+ ]
276
+ ],
277
+ [
278
+ [
279
+ 2,
280
+ 2,
281
+ 2
282
+ ],
283
+ [
284
+ 0,
285
+ 2,
286
+ 0
287
+ ],
288
+ [
289
+ 0,
290
+ 0,
291
+ 0
292
+ ]
293
+ ]
294
+ ],
295
+ "all_pass": true
296
+ },
297
+ "7b7f7511": {
298
+ "solver": "def solve_7b7f7511(grid):\n H, W = len(grid), len(grid[0])\n for th in range(1, H + 1):\n if H % th != 0:\n continue\n for tw in range(1, W + 1):\n if W % tw != 0:\n continue\n tile = [grid[r][:tw] for r in range(th)]\n valid = True\n for r in range(H):\n for c in range(W):\n if grid[r][c] != tile[r % th][c % tw]:\n valid = False\n break\n if not valid:\n break\n if valid and (th < H or tw < W):\n return tile\n return grid\n",
299
+ "test_output": [
300
+ [
301
+ [
302
+ 5,
303
+ 4,
304
+ 5
305
+ ],
306
+ [
307
+ 4,
308
+ 5,
309
+ 4
310
+ ],
311
+ [
312
+ 6,
313
+ 6,
314
+ 4
315
+ ],
316
+ [
317
+ 2,
318
+ 6,
319
+ 2
320
+ ]
321
+ ]
322
+ ],
323
+ "all_pass": true
324
+ },
325
+ "7c008303": {
326
+ "solver": "def solve_7c008303(grid):\n H, W = len(grid), len(grid[0])\n\n eight_row = None\n for r in range(H):\n if all(v == 8 for v in grid[r]):\n eight_row = r\n break\n\n eight_col = None\n for c in range(W):\n if all(grid[r][c] == 8 for r in range(H)):\n eight_col = c\n break\n\n regions = [\n (0, eight_row, 0, eight_col),\n (0, eight_row, eight_col + 1, W),\n (eight_row + 1, H, 0, eight_col),\n (eight_row + 1, H, eight_col + 1, W),\n ]\n\n key_data = None\n pattern_data = None\n\n for r1, r2, c1, c2 in regions:\n qh, qw = r2 - r1, c2 - c1\n q = [[grid[r][c] for c in range(c1, c2)] for r in range(r1, r2)]\n has_content = any(q[r][c] != 0 for r in range(qh) for c in range(qw))\n if not has_content:\n continue\n if key_data is None:\n key_data = q\n else:\n pattern_data = q\n\n key_h, key_w = len(key_data), len(key_data[0])\n pat_h, pat_w = len(pattern_data), len(pattern_data[0])\n\n if key_h * key_w > pat_h * pat_w:\n key_data, pattern_data = pattern_data, key_data\n key_h, key_w = len(key_data), len(key_data[0])\n pat_h, pat_w = len(pattern_data), len(pattern_data[0])\n\n tile_h = pat_h // key_h\n tile_w = pat_w // key_w\n\n pat_color = 0\n for r in range(pat_h):\n for c in range(pat_w):\n if pattern_data[r][c] != 0:\n pat_color = pattern_data[r][c]\n break\n if pat_color:\n break\n\n result = [[0] * pat_w for _ in range(pat_h)]\n for kr in range(key_h):\n for kc in range(key_w):\n color = key_data[kr][kc]\n for tr in range(tile_h):\n for tc in range(tile_w):\n pr = kr * tile_h + tr\n pc = kc * tile_w + tc\n if pattern_data[pr][pc] == pat_color:\n result[pr][pc] = color\n return result\n",
327
+ "test_output": [
328
+ [
329
+ [
330
+ 0,
331
+ 0,
332
+ 0,
333
+ 1,
334
+ 0,
335
+ 0
336
+ ],
337
+ [
338
+ 2,
339
+ 2,
340
+ 0,
341
+ 1,
342
+ 0,
343
+ 1
344
+ ],
345
+ [
346
+ 0,
347
+ 2,
348
+ 0,
349
+ 1,
350
+ 0,
351
+ 1
352
+ ],
353
+ [
354
+ 0,
355
+ 4,
356
+ 4,
357
+ 7,
358
+ 0,
359
+ 0
360
+ ],
361
+ [
362
+ 0,
363
+ 4,
364
+ 0,
365
+ 0,
366
+ 0,
367
+ 7
368
+ ],
369
+ [
370
+ 0,
371
+ 0,
372
+ 4,
373
+ 0,
374
+ 0,
375
+ 0
376
+ ]
377
+ ]
378
+ ],
379
+ "all_pass": true
380
+ },
381
+ "7ddcd7ec": {
382
+ "solver": "def solve_7ddcd7ec(grid):\n H, W = len(grid), len(grid[0])\n result = [row[:] for row in grid]\n\n color = 0\n cells = set()\n for r in range(H):\n for c in range(W):\n if grid[r][c] != 0:\n color = grid[r][c]\n cells.add((r, c))\n\n if not cells:\n return result\n\n body = set()\n for r, c in cells:\n if (r+1, c) in cells and (r, c+1) in cells and (r+1, c+1) in cells:\n body = {(r, c), (r+1, c), (r, c+1), (r+1, c+1)}\n break\n\n appendages = cells - body\n\n for ar, ac in appendages:\n min_dist = float('inf')\n nearest = None\n for br, bc in body:\n d = abs(ar - br) + abs(ac - bc)\n if d < min_dist:\n min_dist = d\n nearest = (br, bc)\n\n dr = ar - nearest[0]\n dc = ac - nearest[1]\n\n cr, cc = ar + dr, ac + dc\n while 0 <= cr < H and 0 <= cc < W:\n result[cr][cc] = color\n cr += dr\n cc += dc\n\n return result\n",
383
+ "test_output": [
384
+ [
385
+ [
386
+ 0,
387
+ 0,
388
+ 0,
389
+ 0,
390
+ 0,
391
+ 0,
392
+ 0,
393
+ 0,
394
+ 8,
395
+ 0
396
+ ],
397
+ [
398
+ 0,
399
+ 0,
400
+ 0,
401
+ 0,
402
+ 0,
403
+ 0,
404
+ 0,
405
+ 8,
406
+ 0,
407
+ 0
408
+ ],
409
+ [
410
+ 0,
411
+ 0,
412
+ 0,
413
+ 0,
414
+ 0,
415
+ 0,
416
+ 8,
417
+ 0,
418
+ 0,
419
+ 0
420
+ ],
421
+ [
422
+ 0,
423
+ 0,
424
+ 0,
425
+ 0,
426
+ 0,
427
+ 8,
428
+ 0,
429
+ 0,
430
+ 0,
431
+ 0
432
+ ],
433
+ [
434
+ 0,
435
+ 0,
436
+ 0,
437
+ 8,
438
+ 8,
439
+ 0,
440
+ 0,
441
+ 0,
442
+ 0,
443
+ 0
444
+ ],
445
+ [
446
+ 0,
447
+ 0,
448
+ 0,
449
+ 8,
450
+ 8,
451
+ 0,
452
+ 0,
453
+ 0,
454
+ 0,
455
+ 0
456
+ ],
457
+ [
458
+ 0,
459
+ 0,
460
+ 8,
461
+ 0,
462
+ 0,
463
+ 8,
464
+ 0,
465
+ 0,
466
+ 0,
467
+ 0
468
+ ],
469
+ [
470
+ 0,
471
+ 8,
472
+ 0,
473
+ 0,
474
+ 0,
475
+ 0,
476
+ 8,
477
+ 0,
478
+ 0,
479
+ 0
480
+ ],
481
+ [
482
+ 8,
483
+ 0,
484
+ 0,
485
+ 0,
486
+ 0,
487
+ 0,
488
+ 0,
489
+ 8,
490
+ 0,
491
+ 0
492
+ ],
493
+ [
494
+ 0,
495
+ 0,
496
+ 0,
497
+ 0,
498
+ 0,
499
+ 0,
500
+ 0,
501
+ 0,
502
+ 8,
503
+ 0
504
+ ]
505
+ ]
506
+ ],
507
+ "all_pass": true
508
+ },
509
+ "7e0986d6": {
510
+ "solver": "def solve_7e0986d6(grid):\n H, W = len(grid), len(grid[0])\n counts = Counter()\n for r in range(H):\n for c in range(W):\n if grid[r][c] != 0:\n counts[grid[r][c]] += 1\n main_color = counts.most_common(1)[0][0]\n noise_color = counts.most_common(2)[1][0] if len(counts) > 1 else None\n\n result = [row[:] for row in grid]\n if noise_color:\n for r in range(H):\n for c in range(W):\n if result[r][c] == noise_color:\n nn = 0\n for dr, dc in [(-1,0),(1,0),(0,-1),(0,1)]:\n nr, nc = r+dr, c+dc\n if 0 <= nr < H and 0 <= nc < W and grid[nr][nc] != 0:\n nn += 1\n if nn >= 2:\n result[r][c] = main_color\n else:\n result[r][c] = 0\n return result\n",
511
+ "test_output": [
512
+ [
513
+ [
514
+ 0,
515
+ 0,
516
+ 0,
517
+ 0,
518
+ 0,
519
+ 0,
520
+ 0,
521
+ 0,
522
+ 0,
523
+ 0,
524
+ 0,
525
+ 0,
526
+ 5,
527
+ 5,
528
+ 5,
529
+ 5,
530
+ 0
531
+ ],
532
+ [
533
+ 0,
534
+ 0,
535
+ 0,
536
+ 0,
537
+ 0,
538
+ 0,
539
+ 0,
540
+ 0,
541
+ 0,
542
+ 0,
543
+ 0,
544
+ 0,
545
+ 5,
546
+ 5,
547
+ 5,
548
+ 5,
549
+ 0
550
+ ],
551
+ [
552
+ 0,
553
+ 5,
554
+ 5,
555
+ 5,
556
+ 5,
557
+ 5,
558
+ 5,
559
+ 5,
560
+ 5,
561
+ 0,
562
+ 0,
563
+ 0,
564
+ 5,
565
+ 5,
566
+ 5,
567
+ 5,
568
+ 0
569
+ ],
570
+ [
571
+ 0,
572
+ 5,
573
+ 5,
574
+ 5,
575
+ 5,
576
+ 5,
577
+ 5,
578
+ 5,
579
+ 5,
580
+ 0,
581
+ 0,
582
+ 0,
583
+ 5,
584
+ 5,
585
+ 5,
586
+ 5,
587
+ 0
588
+ ],
589
+ [
590
+ 0,
591
+ 5,
592
+ 5,
593
+ 5,
594
+ 5,
595
+ 5,
596
+ 5,
597
+ 5,
598
+ 5,
599
+ 0,
600
+ 0,
601
+ 0,
602
+ 5,
603
+ 5,
604
+ 5,
605
+ 5,
606
+ 0
607
+ ],
608
+ [
609
+ 0,
610
+ 5,
611
+ 5,
612
+ 5,
613
+ 5,
614
+ 5,
615
+ 5,
616
+ 5,
617
+ 5,
618
+ 0,
619
+ 0,
620
+ 0,
621
+ 5,
622
+ 5,
623
+ 5,
624
+ 5,
625
+ 0
626
+ ],
627
+ [
628
+ 0,
629
+ 5,
630
+ 5,
631
+ 5,
632
+ 5,
633
+ 5,
634
+ 5,
635
+ 5,
636
+ 5,
637
+ 0,
638
+ 0,
639
+ 0,
640
+ 5,
641
+ 5,
642
+ 5,
643
+ 5,
644
+ 0
645
+ ],
646
+ [
647
+ 0,
648
+ 5,
649
+ 5,
650
+ 5,
651
+ 5,
652
+ 5,
653
+ 5,
654
+ 5,
655
+ 5,
656
+ 0,
657
+ 0,
658
+ 0,
659
+ 0,
660
+ 0,
661
+ 0,
662
+ 0,
663
+ 0
664
+ ],
665
+ [
666
+ 0,
667
+ 0,
668
+ 0,
669
+ 0,
670
+ 0,
671
+ 0,
672
+ 0,
673
+ 0,
674
+ 0,
675
+ 0,
676
+ 0,
677
+ 0,
678
+ 0,
679
+ 0,
680
+ 0,
681
+ 0,
682
+ 0
683
+ ],
684
+ [
685
+ 0,
686
+ 0,
687
+ 0,
688
+ 0,
689
+ 0,
690
+ 0,
691
+ 0,
692
+ 0,
693
+ 0,
694
+ 0,
695
+ 0,
696
+ 0,
697
+ 0,
698
+ 0,
699
+ 0,
700
+ 0,
701
+ 0
702
+ ],
703
+ [
704
+ 0,
705
+ 0,
706
+ 0,
707
+ 0,
708
+ 0,
709
+ 0,
710
+ 5,
711
+ 5,
712
+ 5,
713
+ 5,
714
+ 5,
715
+ 5,
716
+ 0,
717
+ 0,
718
+ 0,
719
+ 0,
720
+ 0
721
+ ],
722
+ [
723
+ 0,
724
+ 0,
725
+ 0,
726
+ 0,
727
+ 0,
728
+ 0,
729
+ 5,
730
+ 5,
731
+ 5,
732
+ 5,
733
+ 5,
734
+ 5,
735
+ 0,
736
+ 0,
737
+ 0,
738
+ 0,
739
+ 0
740
+ ]
741
+ ]
742
+ ],
743
+ "all_pass": true
744
+ }
745
+ }