From 8749babe6f74628dffcfdbe29eba3ee7d968fcee Mon Sep 17 00:00:00 2001 From: Codex Date: Tue, 20 Oct 2026 12:16:21 +0800 Subject: [PATCH] Import calibrated Bos n2 batch 9 group 12 --- docs/progress.md | 2 + tasks/S500_n2_066/cheat/task.py | 32 +++++ .../cheat_only_first_overlap/task.py | 32 +++++ tasks/S500_n2_066/check.py | 73 ++++++++++ tasks/S500_n2_066/gold/task.py | 35 +++++ tasks/S500_n2_066/noop/task.py | 2 + tasks/S500_n2_066/prompt.md | 3 + tasks/S500_n2_066/spec.md | 63 +++++++++ tasks/S500_n2_066/task.json | 36 +++++ tasks/S500_n2_066/template/README.md | 7 + tasks/S500_n2_066/template/task.py | 3 + tasks/S500_n2_066/valid_alternative/task.py | 32 +++++ tasks/S500_n2_066/verify.py | 130 +++++++++++++++++ tasks/S500_n2_140/cheat/task.py | 63 +++++++++ .../cheat_stale_replica_update/task.py | 63 +++++++++ tasks/S500_n2_140/check.py | 92 ++++++++++++ tasks/S500_n2_140/gold/task.py | 63 +++++++++ tasks/S500_n2_140/noop/task.py | 2 + tasks/S500_n2_140/prompt.md | 3 + tasks/S500_n2_140/spec.md | 65 +++++++++ tasks/S500_n2_140/task.json | 36 +++++ tasks/S500_n2_140/template/README.md | 9 ++ tasks/S500_n2_140/template/task.py | 3 + tasks/S500_n2_140/valid_alternative/task.py | 58 ++++++++ tasks/S500_n2_140/verify.py | 130 +++++++++++++++++ tasks/S500_n2_142/cheat/task.py | 46 ++++++ .../cheat_ttl_zero_dropped/task.py | 46 ++++++ tasks/S500_n2_142/check.py | 79 +++++++++++ tasks/S500_n2_142/gold/task.py | 46 ++++++ tasks/S500_n2_142/noop/task.py | 2 + tasks/S500_n2_142/prompt.md | 3 + tasks/S500_n2_142/spec.md | 63 +++++++++ tasks/S500_n2_142/task.json | 36 +++++ tasks/S500_n2_142/template/README.md | 7 + tasks/S500_n2_142/template/task.py | 3 + tasks/S500_n2_142/valid_alternative/task.py | 44 ++++++ tasks/S500_n2_142/verify.py | 130 +++++++++++++++++ tasks/S500_n2_143/cheat/task.py | 62 +++++++++ .../cheat_forgets_loop_after_restart/task.py | 61 ++++++++ tasks/S500_n2_143/check.py | 101 ++++++++++++++ tasks/S500_n2_143/gold/task.py | 61 ++++++++ tasks/S500_n2_143/noop/task.py | 2 + tasks/S500_n2_143/prompt.md | 3 + tasks/S500_n2_143/spec.md | 63 +++++++++ tasks/S500_n2_143/task.json | 36 +++++ tasks/S500_n2_143/template/README.md | 13 ++ tasks/S500_n2_143/template/task.py | 3 + tasks/S500_n2_143/valid_alternative/task.py | 58 ++++++++ tasks/S500_n2_143/verify.py | 130 +++++++++++++++++ tasks/S500_n2_145/cheat/task.py | 54 ++++++++ .../cheat_reset_timer_on_append/task.py | 54 ++++++++ tasks/S500_n2_145/check.py | 90 ++++++++++++ tasks/S500_n2_145/gold/task.py | 54 ++++++++ tasks/S500_n2_145/noop/task.py | 2 + tasks/S500_n2_145/prompt.md | 3 + tasks/S500_n2_145/spec.md | 63 +++++++++ tasks/S500_n2_145/task.json | 36 +++++ tasks/S500_n2_145/template/README.md | 7 + tasks/S500_n2_145/template/task.py | 3 + tasks/S500_n2_145/valid_alternative/task.py | 50 +++++++ tasks/S500_n2_145/verify.py | 130 +++++++++++++++++ tasks/S500_n2_146/cheat/task.py | 42 ++++++ .../cheat_ignores_merge_states/task.py | 42 ++++++ .../cheat_trailing_zero_rank/task.py | 42 ++++++ tasks/S500_n2_146/check.py | 113 +++++++++++++++ tasks/S500_n2_146/gold/task.py | 42 ++++++ tasks/S500_n2_146/noop/task.py | 2 + tasks/S500_n2_146/prompt.md | 3 + tasks/S500_n2_146/spec.md | 63 +++++++++ tasks/S500_n2_146/task.json | 38 +++++ tasks/S500_n2_146/template/README.md | 11 ++ tasks/S500_n2_146/template/task.py | 3 + tasks/S500_n2_146/valid_alternative/task.py | 48 +++++++ tasks/S500_n2_146/verify.py | 130 +++++++++++++++++ tasks/S500_n2_148/cheat/task.py | 43 ++++++ .../cheat_rounded_float_bucket/task.py | 43 ++++++ tasks/S500_n2_148/check.py | 81 +++++++++++ tasks/S500_n2_148/gold/task.py | 43 ++++++ tasks/S500_n2_148/noop/task.py | 2 + tasks/S500_n2_148/prompt.md | 3 + tasks/S500_n2_148/spec.md | 63 +++++++++ tasks/S500_n2_148/task.json | 36 +++++ tasks/S500_n2_148/template/README.md | 7 + tasks/S500_n2_148/template/task.py | 3 + tasks/S500_n2_148/valid_alternative/task.py | 34 +++++ tasks/S500_n2_148/verify.py | 130 +++++++++++++++++ tasks/S500_n2_149/cheat/task.py | 74 ++++++++++ .../task.py | 74 ++++++++++ tasks/S500_n2_149/check.py | 131 ++++++++++++++++++ tasks/S500_n2_149/gold/task.py | 74 ++++++++++ tasks/S500_n2_149/noop/task.py | 2 + tasks/S500_n2_149/prompt.md | 3 + tasks/S500_n2_149/spec.md | 63 +++++++++ tasks/S500_n2_149/task.json | 36 +++++ tasks/S500_n2_149/template/README.md | 9 ++ tasks/S500_n2_149/template/task.py | 3 + tasks/S500_n2_149/valid_alternative/task.py | 70 ++++++++++ tasks/S500_n2_149/verify.py | 130 +++++++++++++++++ tasks/S500_n2_151/cheat/task.py | 49 +++++++ .../cheat_union_instead_of_sum/task.py | 49 +++++++ tasks/S500_n2_151/check.py | 79 +++++++++++ tasks/S500_n2_151/gold/task.py | 71 ++++++++++ tasks/S500_n2_151/noop/task.py | 2 + tasks/S500_n2_151/prompt.md | 3 + tasks/S500_n2_151/spec.md | 63 +++++++++ tasks/S500_n2_151/task.json | 36 +++++ tasks/S500_n2_151/template/README.md | 7 + tasks/S500_n2_151/template/task.py | 3 + tasks/S500_n2_151/valid_alternative/task.py | 49 +++++++ tasks/S500_n2_151/verify.py | 130 +++++++++++++++++ tasks/S500_n2_152/cheat/task.py | 53 +++++++ .../task.py | 53 +++++++ tasks/S500_n2_152/check.py | 105 ++++++++++++++ tasks/S500_n2_152/gold/task.py | 53 +++++++ tasks/S500_n2_152/noop/task.py | 2 + tasks/S500_n2_152/prompt.md | 3 + tasks/S500_n2_152/spec.md | 63 +++++++++ tasks/S500_n2_152/task.json | 36 +++++ tasks/S500_n2_152/template/README.md | 11 ++ tasks/S500_n2_152/template/task.py | 3 + tasks/S500_n2_152/valid_alternative/task.py | 53 +++++++ tasks/S500_n2_152/verify.py | 130 +++++++++++++++++ 122 files changed, 5523 insertions(+) create mode 100644 tasks/S500_n2_066/cheat/task.py create mode 100644 tasks/S500_n2_066/cheat_only_first_overlap/task.py create mode 100644 tasks/S500_n2_066/check.py create mode 100644 tasks/S500_n2_066/gold/task.py create mode 100644 tasks/S500_n2_066/noop/task.py create mode 100644 tasks/S500_n2_066/prompt.md create mode 100644 tasks/S500_n2_066/spec.md create mode 100644 tasks/S500_n2_066/task.json create mode 100644 tasks/S500_n2_066/template/README.md create mode 100644 tasks/S500_n2_066/template/task.py create mode 100644 tasks/S500_n2_066/valid_alternative/task.py create mode 100644 tasks/S500_n2_066/verify.py create mode 100644 tasks/S500_n2_140/cheat/task.py create mode 100644 tasks/S500_n2_140/cheat_stale_replica_update/task.py create mode 100644 tasks/S500_n2_140/check.py create mode 100644 tasks/S500_n2_140/gold/task.py create mode 100644 tasks/S500_n2_140/noop/task.py create mode 100644 tasks/S500_n2_140/prompt.md create mode 100644 tasks/S500_n2_140/spec.md create mode 100644 tasks/S500_n2_140/task.json create mode 100644 tasks/S500_n2_140/template/README.md create mode 100644 tasks/S500_n2_140/template/task.py create mode 100644 tasks/S500_n2_140/valid_alternative/task.py create mode 100644 tasks/S500_n2_140/verify.py create mode 100644 tasks/S500_n2_142/cheat/task.py create mode 100644 tasks/S500_n2_142/cheat_ttl_zero_dropped/task.py create mode 100644 tasks/S500_n2_142/check.py create mode 100644 tasks/S500_n2_142/gold/task.py create mode 100644 tasks/S500_n2_142/noop/task.py create mode 100644 tasks/S500_n2_142/prompt.md create mode 100644 tasks/S500_n2_142/spec.md create mode 100644 tasks/S500_n2_142/task.json create mode 100644 tasks/S500_n2_142/template/README.md create mode 100644 tasks/S500_n2_142/template/task.py create mode 100644 tasks/S500_n2_142/valid_alternative/task.py create mode 100644 tasks/S500_n2_142/verify.py create mode 100644 tasks/S500_n2_143/cheat/task.py create mode 100644 tasks/S500_n2_143/cheat_forgets_loop_after_restart/task.py create mode 100644 tasks/S500_n2_143/check.py create mode 100644 tasks/S500_n2_143/gold/task.py create mode 100644 tasks/S500_n2_143/noop/task.py create mode 100644 tasks/S500_n2_143/prompt.md create mode 100644 tasks/S500_n2_143/spec.md create mode 100644 tasks/S500_n2_143/task.json create mode 100644 tasks/S500_n2_143/template/README.md create mode 100644 tasks/S500_n2_143/template/task.py create mode 100644 tasks/S500_n2_143/valid_alternative/task.py create mode 100644 tasks/S500_n2_143/verify.py create mode 100644 tasks/S500_n2_145/cheat/task.py create mode 100644 tasks/S500_n2_145/cheat_reset_timer_on_append/task.py create mode 100644 tasks/S500_n2_145/check.py create mode 100644 tasks/S500_n2_145/gold/task.py create mode 100644 tasks/S500_n2_145/noop/task.py create mode 100644 tasks/S500_n2_145/prompt.md create mode 100644 tasks/S500_n2_145/spec.md create mode 100644 tasks/S500_n2_145/task.json create mode 100644 tasks/S500_n2_145/template/README.md create mode 100644 tasks/S500_n2_145/template/task.py create mode 100644 tasks/S500_n2_145/valid_alternative/task.py create mode 100644 tasks/S500_n2_145/verify.py create mode 100644 tasks/S500_n2_146/cheat/task.py create mode 100644 tasks/S500_n2_146/cheat_ignores_merge_states/task.py create mode 100644 tasks/S500_n2_146/cheat_trailing_zero_rank/task.py create mode 100644 tasks/S500_n2_146/check.py create mode 100644 tasks/S500_n2_146/gold/task.py create mode 100644 tasks/S500_n2_146/noop/task.py create mode 100644 tasks/S500_n2_146/prompt.md create mode 100644 tasks/S500_n2_146/spec.md create mode 100644 tasks/S500_n2_146/task.json create mode 100644 tasks/S500_n2_146/template/README.md create mode 100644 tasks/S500_n2_146/template/task.py create mode 100644 tasks/S500_n2_146/valid_alternative/task.py create mode 100644 tasks/S500_n2_146/verify.py create mode 100644 tasks/S500_n2_148/cheat/task.py create mode 100644 tasks/S500_n2_148/cheat_rounded_float_bucket/task.py create mode 100644 tasks/S500_n2_148/check.py create mode 100644 tasks/S500_n2_148/gold/task.py create mode 100644 tasks/S500_n2_148/noop/task.py create mode 100644 tasks/S500_n2_148/prompt.md create mode 100644 tasks/S500_n2_148/spec.md create mode 100644 tasks/S500_n2_148/task.json create mode 100644 tasks/S500_n2_148/template/README.md create mode 100644 tasks/S500_n2_148/template/task.py create mode 100644 tasks/S500_n2_148/valid_alternative/task.py create mode 100644 tasks/S500_n2_148/verify.py create mode 100644 tasks/S500_n2_149/cheat/task.py create mode 100644 tasks/S500_n2_149/cheat_revoked_credit_returns_available/task.py create mode 100644 tasks/S500_n2_149/check.py create mode 100644 tasks/S500_n2_149/gold/task.py create mode 100644 tasks/S500_n2_149/noop/task.py create mode 100644 tasks/S500_n2_149/prompt.md create mode 100644 tasks/S500_n2_149/spec.md create mode 100644 tasks/S500_n2_149/task.json create mode 100644 tasks/S500_n2_149/template/README.md create mode 100644 tasks/S500_n2_149/template/task.py create mode 100644 tasks/S500_n2_149/valid_alternative/task.py create mode 100644 tasks/S500_n2_149/verify.py create mode 100644 tasks/S500_n2_151/cheat/task.py create mode 100644 tasks/S500_n2_151/cheat_union_instead_of_sum/task.py create mode 100644 tasks/S500_n2_151/check.py create mode 100644 tasks/S500_n2_151/gold/task.py create mode 100644 tasks/S500_n2_151/noop/task.py create mode 100644 tasks/S500_n2_151/prompt.md create mode 100644 tasks/S500_n2_151/spec.md create mode 100644 tasks/S500_n2_151/task.json create mode 100644 tasks/S500_n2_151/template/README.md create mode 100644 tasks/S500_n2_151/template/task.py create mode 100644 tasks/S500_n2_151/valid_alternative/task.py create mode 100644 tasks/S500_n2_151/verify.py create mode 100644 tasks/S500_n2_152/cheat/task.py create mode 100644 tasks/S500_n2_152/cheat_first_wall_instead_of_nearest/task.py create mode 100644 tasks/S500_n2_152/check.py create mode 100644 tasks/S500_n2_152/gold/task.py create mode 100644 tasks/S500_n2_152/noop/task.py create mode 100644 tasks/S500_n2_152/prompt.md create mode 100644 tasks/S500_n2_152/spec.md create mode 100644 tasks/S500_n2_152/task.json create mode 100644 tasks/S500_n2_152/template/README.md create mode 100644 tasks/S500_n2_152/template/task.py create mode 100644 tasks/S500_n2_152/valid_alternative/task.py create mode 100644 tasks/S500_n2_152/verify.py diff --git a/docs/progress.md b/docs/progress.md index 288392ec..e1561986 100644 --- a/docs/progress.md +++ b/docs/progress.md @@ -26,6 +26,8 @@ 第11组新增/修订 10 题(119,123,127,130,133,136,139,131,134,137)已完成当前摘要双门校准:本地305/305、trace6正式305/305符合预期且cleanup confirmed;原判据/gold/valid摘要保持,README澄清及升版逐题见spec,root只读/交叉审与回执核验见root-review-group11.json。累计提交110道不同新题,均CALIBRATED/UNMEASURED;不调用模型、不推送,继续本批。 +第12组新增/修订 10 题(066,140,142,143,145,146,148,149,151,152)已完成当前摘要双门校准:本地305/305、trace6正式305/305符合预期且cleanup confirmed;原判据/gold/valid摘要保持,README澄清及升版逐题见spec,root只读/交叉审与回执核验见root-review-group12.json。累计提交120道不同新题,均CALIBRATED/UNMEASURED;不调用模型、不推送,继续本批。 + ## 此前进度记录(原文保留) 2026-10-19 第6批会话3续跑:按 BRIEF → CONTINUE → CONTINUE-2 的覆盖顺序,从 main=a79211f 继续(git pull --ff-only 已最新,/home 约115GiB)。下一步先复核 archive-staged-tar 超时轨迹因果及 config-overlay-relocation 结案口径,再只补剩余6题,累计每题原始尝试最多15次;trace6/Qwen全局2路、3600秒、30GiB停止线保持,DIR/ELF最后。涉及已跟踪 difficulty-review.json、本进度及本批过程证据;不增题、不改平台/题库索引/其他批次,不推送。验收为剩余题逐一结案(不足则列作废原因)、真实失败依据复核、完整轨迹重判归档、最终报告与核验冷迁后删热;外部依赖为Qwen服务、Docker与JuiceFS,Salty可用性另按事实报告。 diff --git a/tasks/S500_n2_066/cheat/task.py b/tasks/S500_n2_066/cheat/task.py new file mode 100644 index 00000000..ccc2f9ac --- /dev/null +++ b/tasks/S500_n2_066/cheat/task.py @@ -0,0 +1,32 @@ +import math + +def obj(x): + if not isinstance(x,dict):raise ValueError('expected object') + return x + +def arr(x,n=None): + if not isinstance(x,list) or (n is not None and len(x)!=n):raise ValueError('expected list') + return x + +def num(x): + if isinstance(x,bool) or not isinstance(x,(int,float)) or abs(x)>1000000 or not math.isfinite(x):raise ValueError('expected finite number') + return float(x) + +def vec(x,n):return [num(v) for v in arr(x,n)] + +def field(d,k): + if k not in d:raise ValueError('missing field') + return d[k] + +def prepare(d): + d=obj(d);A=[vec(p,2) for p in arr(field(d,'left'))];B=[vec(p,2) for p in arr(field(d,'right'))] + if any(a>=b for a,b in A+B):raise ValueError('interval') + return A,B +import bisect +def solve(data): + A,B=prepare(data);A=[list(p) for p in sorted(set(map(tuple,A)))];right=sorted((a,b,i) for i,(a,b) in enumerate(B));starts=[a for a,b,i in right];rows=[] + for i,(a,b) in enumerate(A): + for c,d,j in right[:bisect.bisect_left(starts,b)]: + if d<=a:continue + lo=max(a,c);hi=min(b,d);rows.append([i,j,lo,hi,hi-lo]) + rows.sort(key=lambda r:(r[2],r[3],r[0],r[1]));return rows diff --git a/tasks/S500_n2_066/cheat_only_first_overlap/task.py b/tasks/S500_n2_066/cheat_only_first_overlap/task.py new file mode 100644 index 00000000..e2dc9dc4 --- /dev/null +++ b/tasks/S500_n2_066/cheat_only_first_overlap/task.py @@ -0,0 +1,32 @@ +import math + +def obj(x): + if not isinstance(x,dict):raise ValueError('expected object') + return x + +def arr(x,n=None): + if not isinstance(x,list) or (n is not None and len(x)!=n):raise ValueError('expected list') + return x + +def num(x): + if isinstance(x,bool) or not isinstance(x,(int,float)) or abs(x)>1000000 or not math.isfinite(x):raise ValueError('expected finite number') + return float(x) + +def vec(x,n):return [num(v) for v in arr(x,n)] + +def field(d,k): + if k not in d:raise ValueError('missing field') + return d[k] + +def prepare(d): + d=obj(d);A=[vec(p,2) for p in arr(field(d,'left'))];B=[vec(p,2) for p in arr(field(d,'right'))] + if any(a>=b for a,b in A+B):raise ValueError('interval') + return A,B +import bisect +def solve(data): + A,B=prepare(data);right=sorted((a,b,i) for i,(a,b) in enumerate(B));starts=[a for a,b,i in right];rows=[] + for i,(a,b) in enumerate(A): + for c,d,j in right[:bisect.bisect_left(starts,b)]: + if d<=a:continue + lo=max(a,c);hi=min(b,d);rows.append([i,j,lo,hi,hi-lo]);break + rows.sort(key=lambda r:(r[2],r[3],r[0],r[1]));return rows diff --git a/tasks/S500_n2_066/check.py b/tasks/S500_n2_066/check.py new file mode 100644 index 00000000..1f36f85c --- /dev/null +++ b/tasks/S500_n2_066/check.py @@ -0,0 +1,73 @@ +import math,random,collections,itertools +def fixtures(): + cases=[dict(left=[[0,2],[2,3],[0,2]],right=[[2,4],[1,2],[0,5]]),dict(left=[],right=[[0,1]]),dict(left=[[3,5],[-2,4]],right=[[5,6],[-3,-2],[0,3]])];rng=random.Random(1066) + for n in [10,1000]: + A=[[i*10+rng.randrange(3),i*10+5+rng.randrange(3)] for i in range(n)];B=[[i*10-1,i*10+3] for i in range(n)];rng.shuffle(A);rng.shuffle(B);cases.append(dict(left=A,right=B)) + def oracle(d): + rows=[] + for i,(a,b) in enumerate(d['left']): + for j,(c,e) in enumerate(d['right']): + start=max(a,c);end=min(b,e) + if start') + print('FAIL:',type(exc).__name__,message[:500]);sys.exit(1) diff --git a/tasks/S500_n2_066/gold/task.py b/tasks/S500_n2_066/gold/task.py new file mode 100644 index 00000000..c70f157d --- /dev/null +++ b/tasks/S500_n2_066/gold/task.py @@ -0,0 +1,35 @@ +import math + +def obj(x): + if not isinstance(x,dict):raise ValueError('expected object') + return x + +def arr(x,n=None): + if not isinstance(x,list) or (n is not None and len(x)!=n):raise ValueError('expected list') + return x + +def num(x): + if isinstance(x,bool) or not isinstance(x,(int,float)) or abs(x)>1000000 or not math.isfinite(x):raise ValueError('expected finite number') + return float(x) + +def vec(x,n):return [num(v) for v in arr(x,n)] + +def field(d,k): + if k not in d:raise ValueError('missing field') + return d[k] + +def prepare(d): + d=obj(d);A=[vec(p,2) for p in arr(field(d,'left'))];B=[vec(p,2) for p in arr(field(d,'right'))] + if any(a>=b for a,b in A+B):raise ValueError('interval') + return A,B +def solve(data): + A,B=prepare(data);events=[] + for side,P in enumerate((A,B)): + for i,(a,b) in enumerate(P):events.extend([(a,1,side,i),(b,0,side,i)]) + active=[set(),set()];out=[] + for t,kind,side,i in sorted(events): + if kind==0:active[side].remove(i);continue + for j in active[1-side]: + li,ri=(i,j) if side==0 else (j,i);start=max(A[li][0],B[ri][0]);end=min(A[li][1],B[ri][1]);out.append([li,ri,start,end,end-start]) + active[side].add(i) + return sorted(out,key=lambda r:(r[2],r[3],r[0],r[1])) diff --git a/tasks/S500_n2_066/noop/task.py b/tasks/S500_n2_066/noop/task.py new file mode 100644 index 00000000..c01d8a71 --- /dev/null +++ b/tasks/S500_n2_066/noop/task.py @@ -0,0 +1,2 @@ +import os +os._exit(0) diff --git a/tasks/S500_n2_066/prompt.md b/tasks/S500_n2_066/prompt.md new file mode 100644 index 00000000..b2d63538 --- /dev/null +++ b/tasks/S500_n2_066/prompt.md @@ -0,0 +1,3 @@ +当前目录task.py尚未实现。请按README.md公开契约完成传感有效时间区间关联并自行验证。 + +最终只提交并评分以下文件:`task.py`。 diff --git a/tasks/S500_n2_066/spec.md b/tasks/S500_n2_066/spec.md new file mode 100644 index 00000000..6a117422 --- /dev/null +++ b/tasks/S500_n2_066/spec.md @@ -0,0 +1,63 @@ +# 任务规格:S500_n2_066 + +本规格仅供控制侧,路线 A 只填写第 1、4、7 节,其余沿用 Bos 原题。规范见 [任务制作规范](../../docs/task-authoring.md)。 + +## 1. 身份与来源 + +| 字段 | 填写 | +| --- | --- | +| task-id / 任务版本 | S500_n2_066 / 2 | +| 作者 / 独立评审人 | Bos 原作者;本批 Codex lane1 / 待主控只读复核 | +| 审核状态 / 难度 | CALIBRATED / UNMEASURED | +| 来源路线 | A 导入成熟任务;bos.origin=original_authored | +| 来源 ID / split 分组键 | S500_n2_066;new_n2_066_sensor_interval_overlap_join / bos:new_n2_066_sensor_interval_overlap_join | +| 原项目与冻结版本 | Bos-qiao task_factory_500_20260914;本批只读本地快照 factory/20261020-A-bos-n2-9/bos-envs/S500_n2_066;原 task.json SHA-256 4b8e96e05fc9f4b78c61356a2870c31106d78f8b3148a89a8dc20f08f3bd7049;无独立上游 commit | +| 授权与隐私 | 用户 2026-10-20 明确授权本批全部剩余 n2 导入;仅保留任务资产,不执行来源脚本,不含用户会话与凭据 | +| 来源组 / 任务族 | Bos n2 / motor-sensor-control | +| 替身测试与用途 | software:异步曝光/采样分析器查找两路有效时间区间的重叠;合成输入可完整复现,无外设依赖 | +| 与已有任务关系 | 独立来源 S500_n2_066,保持来源 split;未声称已经完成跨全部来源的语义去重 | +| 验证范围 | README 声明的纯软件数学/事件模型 | +| 未验证范围 | 真实 Agent、模型难度、板卡/外设/电气/真实时序和物理安全 | + +## 2. 初态与环境 + +沿用 Bos 原题。 + +## 3. 公开题面与接口 + +沿用 Bos 原题。 + +## 4. 判据检查项 ↔ 依据与合法解 + +| 判据检查项 | 公开依据 | 场景与可观察结果 | 检查方法与容差 | +| --- | --- | --- | --- | +| 每对半开时间交集 | README第3段“begin1000000 or not math.isfinite(x):raise ValueError('expected finite number') + return float(x) + +def vec(x,n):return [num(v) for v in arr(x,n)] + +def field(d,k): + if k not in d:raise ValueError('missing field') + return d[k] + +def prepare(d): + d=obj(d);A=[vec(p,2) for p in arr(field(d,'left'))];B=[vec(p,2) for p in arr(field(d,'right'))] + if any(a>=b for a,b in A+B):raise ValueError('interval') + return A,B +import bisect +def solve(data): + A,B=prepare(data);right=sorted((a,b,i) for i,(a,b) in enumerate(B));starts=[a for a,b,i in right];rows=[] + for i,(a,b) in enumerate(A): + for c,d,j in right[:bisect.bisect_left(starts,b)]: + if d<=a:continue + lo=max(a,c);hi=min(b,d);rows.append([i,j,lo,hi,hi-lo]) + rows.sort(key=lambda r:(r[2],r[3],r[0],r[1]));return rows diff --git a/tasks/S500_n2_066/verify.py b/tasks/S500_n2_066/verify.py new file mode 100644 index 00000000..9e2c6c26 --- /dev/null +++ b/tasks/S500_n2_066/verify.py @@ -0,0 +1,130 @@ +"""Run an imported Bos-qiao check.py unchanged; candidate processes run as UID 65534.""" + +import json +import os +from pathlib import Path +import shutil +import subprocess +import sys +import tempfile + +GRADER = Path(__file__).resolve().parent +BLOCKED = "isolation-blocked.txt" +GUARD = 86 +# Runs the original check unchanged as the trusted user. In isolation mode every child process drops to +# UID 65534 and every mkdtemp scratch is handed to it; an audit hook stops the check if candidate code +# would run inside this process. Failing child processes also copy their stderr tail out for private triage. +CHECK = ( + "import os, runpy, subprocess, sys, tempfile\n" + "isolated, sys.argv = sys.argv[1] == '1', sys.argv[2:]\n" + "untrusted = [os.path.realpath(sys.argv[1])]\n" + "def inside(path):\n" + " path = os.path.realpath(str(path))\n" + " return any(path == root or path.startswith(root + os.sep) for root in untrusted)\n" + "spawns = ('os.system', 'os.exec', 'os.spawn', 'os.fork', 'os.forkpty', 'os.posix_spawn') if isolated else ()\n" + "def guard(event, args):\n" + " if (event in spawns or event == 'exec' and inside(getattr(args[0], 'co_filename', '')) or\n" + " event == 'ctypes.dlopen' and args[0] and inside(args[0]) or\n" + " event == 'import' and any(inside(entry or '.') for entry in sys.path)):\n" + " sys.__stderr__.write('rollout-guard: ' + event + '\\n')\n" + " sys.__stderr__.flush()\n" + " os._exit(%d)\n" + "mkdtemp = tempfile.mkdtemp\n" + "def scratch(*args, **kwargs):\n" + " path = mkdtemp(*args, **kwargs)\n" + " untrusted.append(os.path.realpath(path))\n" + " if isolated:\n" + " os.chown(path, 65534, 65534)\n" + " return path\n" + "tempfile.mkdtemp = scratch\n" + "popen = subprocess.Popen.__init__\n" + "def drop(self, *args, **kwargs):\n" + " if isolated:\n" + " kwargs.update(user=65534, group=65534, extra_groups=[])\n" + " popen(self, *args, **kwargs)\n" + "subprocess.Popen.__init__ = drop\n" + "real = subprocess.run\n" + "def run(*args, **kwargs):\n" + " result = real(*args, **kwargs)\n" + " if result.returncode and result.stderr:\n" + " tail = result.stderr if isinstance(result.stderr, str) else result.stderr.decode('utf-8', 'replace')\n" + " sys.__stderr__.write(tail[-2000:] + '\\n')\n" + " return result\n" + "subprocess.run = run\n" + "sys.addaudithook(guard)\n" + "runpy.run_path(sys.argv[0], run_name='__main__')\n" % GUARD) + + +class UnsupportedEnvironment(RuntimeError): + pass + + +def candidate_user(): + os.setgroups([]) + os.setgid(65534) + os.setuid(65534) + + +def isolation(): + if os.environ.get("ROLLOUT_GRADE_ISOLATION") != "uid65534": + return None + if sys.platform != "linux" or os.geteuid() != 0: + raise UnsupportedEnvironment("isolated grader requires a Linux root supervisor") + probe = ( + "from pathlib import Path\n" + "try: Path('/grader/verify.py').read_bytes()\n" + "except PermissionError: raise SystemExit(0)\n" + "raise SystemExit(1)\n" + ) + try: + result = subprocess.run([sys.executable, "-I", "-c", probe], + capture_output=True, timeout=10, preexec_fn=candidate_user) + except subprocess.SubprocessError as error: + raise UnsupportedEnvironment("candidate identity could not be isolated") from error + if result.returncode != 0: + raise UnsupportedEnvironment("candidate can read the private grader or isolation probe failed") + return candidate_user + + +def verify(candidate): + if (GRADER / BLOCKED).exists(): + raise UnsupportedEnvironment("isolation blocked: " + (GRADER / BLOCKED).read_text().strip()[:200]) + isolated = isolation() is not None + if shutil.which("gcc") is None: + raise UnsupportedEnvironment("C compiler unavailable") + with tempfile.TemporaryDirectory(prefix="bos-grade-") as temporary: + root = Path(temporary) + work, grader = root / "work", root / "grader" + shutil.copytree(candidate, work, symlinks=True) + shutil.copytree(GRADER, grader, ignore=lambda folder, names: ["verify.py"] if Path(folder) == GRADER else []) + if isolated: + os.chmod(root, 0o711) + os.chmod(grader, 0o700) + for path in (work, *work.rglob("*")): + os.lchown(path, 65534, 65534) + # shortcut: the check runs as root and follows symlinks a child plants in shared scratch directories; + # upgrade by running the check under its own unprivileged UID once a setuid helper is available. + completed = subprocess.run([sys.executable, "-I", "-B", "-c", CHECK, "1" if isolated else "0", + str(grader / "check.py"), str(work)], + cwd=root, capture_output=True, text=True, timeout=100) + # grade.stderr stays on the trusted side with the archive; it may quote hidden test lines. + sys.stderr.write(completed.stderr[-4000:]) + if completed.returncode == GUARD and "rollout-guard: " in completed.stderr: + raise UnsupportedEnvironment("isolation blocked: the check would run candidate code in the grader process") + lines = completed.stdout.splitlines() + if completed.returncode == 0 and lines[-1:] == ["PASS"]: + return {"status": "PASS", "checks": 1} + return {"status": "FAIL", "checks": 1, "reason": (lines[-1] if lines else "no checker output")[:300]} + + +if __name__ == "__main__": + try: + result = verify(Path(sys.argv[1])) + except UnsupportedEnvironment as error: + result = {"status": "UNVERIFIED", "checks": 0, "reason": str(error)} + except subprocess.TimeoutExpired: + result = {"status": "FAIL", "checks": 1, "reason": "timeout"} + except Exception as error: + result = {"status": "INFRA_ERROR", "checks": 0, "reason": str(error)} + print(json.dumps(result, sort_keys=True)) + sys.exit({"PASS": 0, "FAIL": 1}.get(result["status"], 2)) diff --git a/tasks/S500_n2_140/cheat/task.py b/tasks/S500_n2_140/cheat/task.py new file mode 100644 index 00000000..d5a601bf --- /dev/null +++ b/tasks/S500_n2_140/cheat/task.py @@ -0,0 +1,63 @@ +import math + +def obj(x): + if not isinstance(x,dict):raise ValueError('expected object') + return x + +def arr(x,n=None): + if not isinstance(x,list) or (n is not None and len(x)!=n):raise ValueError('expected list') + return x + +def num(x): + if isinstance(x,bool) or not isinstance(x,(int,float)) or abs(x)>1000000 or not math.isfinite(x):raise ValueError('expected finite number') + return float(x) + +def vec(x,n):return [num(v) for v in arr(x,n)] + +def field(d,k): + if k not in d:raise ValueError('missing field') + return d[k] + +import hashlib + +def utf8(x,nonempty=False): + if not isinstance(x,str) or (nonempty and not x):raise ValueError('text') + try:b=x.encode('utf-8') + except UnicodeError:raise ValueError('utf8') + if len(b)>1024:raise ValueError('text length') + return b + +def prepare(data): + d=obj(data);bits=field(d,'bits');E=[] + if type(bits) is not int or not 1<=bits<=16:raise ValueError('bits') + for row in arr(field(d,'events')): + row=obj(row);op=field(row,'op') + if op in ('add','remove'): + node=field(row,'node');utf8(node,True);replicas=field(row,'replicas') if op=='add' else None + if op=='add' and (type(replicas) is not int or not 1<=replicas<=32):raise ValueError('replicas') + E.append((op,node,replicas)) + elif op=='lookup':key=field(row,'key');utf8(key);E.append((op,key,None)) + elif op=='ring':E.append((op,None,None)) + else:raise ValueError('op') + return bits,E + +def digest(bits,prefix,name,index=None): + encoded=utf8(name);payload=prefix+len(encoded).to_bytes(4,'big')+encoded + if index is not None:payload+=index.to_bytes(4,'big') + return int.from_bytes(hashlib.sha256(payload).digest()[:8],'big')&((1<1000000 or not math.isfinite(x):raise ValueError('expected finite number') + return float(x) + +def vec(x,n):return [num(v) for v in arr(x,n)] + +def field(d,k): + if k not in d:raise ValueError('missing field') + return d[k] + +import hashlib + +def utf8(x,nonempty=False): + if not isinstance(x,str) or (nonempty and not x):raise ValueError('text') + try:b=x.encode('utf-8') + except UnicodeError:raise ValueError('utf8') + if len(b)>1024:raise ValueError('text length') + return b + +def prepare(data): + d=obj(data);bits=field(d,'bits');E=[] + if type(bits) is not int or not 1<=bits<=16:raise ValueError('bits') + for row in arr(field(d,'events')): + row=obj(row);op=field(row,'op') + if op in ('add','remove'): + node=field(row,'node');utf8(node,True);replicas=field(row,'replicas') if op=='add' else None + if op=='add' and (type(replicas) is not int or not 1<=replicas<=32):raise ValueError('replicas') + E.append((op,node,replicas)) + elif op=='lookup':key=field(row,'key');utf8(key);E.append((op,key,None)) + elif op=='ring':E.append((op,None,None)) + else:raise ValueError('op') + return bits,E + +def digest(bits,prefix,name,index=None): + encoded=utf8(name);payload=prefix+len(encoded).to_bytes(4,'big')+encoded + if index is not None:payload+=index.to_bytes(4,'big') + return int.from_bytes(hashlib.sha256(payload).digest()[:8],'big')&((1<>shift)&255 for shift in [24,16,8,0]])+b + if index is not None:encoded+=bytes([(index>>shift)&255 for shift in [24,16,8,0]]) + first=hashlib.sha256(encoded).hexdigest()[:16];return int(first,16)%(2**d['bits']) + nodes={};out=[];cache=None + for e in d['events']: + op=e['op'] + if op=='add':out.append(e['node'] not in nodes);nodes[e['node']]=e['replicas'];cache=None;continue + if op=='remove':out.append(e['node'] in nodes);nodes.pop(e['node'],None);cache=None;continue + if cache is None:cache=[(hash_value(b'V',node,i),node,i) for node,n in nodes.items() for i in range(n)] + if op=='ring':out.append([dict(position=p,node=n,replica=i) for p,n,i in sorted(cache)]) + elif not cache:out.append(None) + else: + h=hash_value(b'K',e['key']);distance=min((position-h)%(2**d['bits']) for position,node,i in cache);choices=[(node,i) for position,node,i in cache if (position-h)%(2**d['bits'])==distance];out.append(min(choices)[0]) + return out + base=dict(bits=8,events=[]);bad=[None,{},dict(base,bits=0),dict(base,bits=17),dict(base,bits=True),dict(base,events=[add('',1)]),dict(base,events=[add('a',0)]),dict(base,events=[add('a',33)]),dict(base,events=[add('a',True)]),dict(base,events=[lookup(1)]),dict(base,events=[lookup('\ud800')]),dict(base,events=[add('a'*1025,1)]),dict(base,events=[dict(op='change')]),dict(base,events=[dict(op='lookup')])] + return cases+bad,[{'ok':oracle(d)} for d in cases]+[{'error':'ValueError'} for _ in bad] + + +_original_fixtures=fixtures +def fixtures(): + import copy + cases,expected=_original_fixtures() + boundary_case,boundary_truth=({'bits': 16, 'events': [{'op': 'add', 'node': 'a', 'replicas': 32}, {'op': 'lookup', 'key': ''}, {'op': 'remove', 'node': 'a'}, {'op': 'lookup', 'key': ''}]}, [True, 'a', True, None]) + cases.append(boundary_case);expected.append({'ok':boundary_truth}) + def replace_first(x,value): + if isinstance(x,dict): + for k,v in x.items(): + if isinstance(v,(int,float)) and not isinstance(v,bool):x[k]=value;return True + if replace_first(v,value):return True + elif isinstance(x,list): + for i,v in enumerate(x): + if isinstance(v,(int,float)) and not isinstance(v,bool):x[i]=value;return True + if replace_first(v,value):return True + return False + for bad in [1000001,-1000001,1e308,-1e308,10**400,-10**400]: + case=copy.deepcopy(boundary_case) + if not replace_first(case,bad):continue # Tasks without numeric fields use structural boundary fixtures. + cases.append(case);expected.append({'error':'ValueError'}) + return cases,expected + +import pathlib,sys,tempfile,shutil,subprocess,json,math,secrets +ROOT=pathlib.Path(sys.argv[1]).resolve() +def require(ok,message): + if not ok:raise AssertionError(message) +def same(actual,expected): + if isinstance(expected,bool) or expected is None or isinstance(expected,str):return type(actual) is type(expected) and actual==expected + if isinstance(expected,int):return type(actual) is int and actual==expected + if isinstance(expected,float):return not isinstance(actual,bool) and isinstance(actual,(int,float)) and math.isfinite(actual) and math.isclose(actual,expected,rel_tol=1e-8,abs_tol=1e-8) + if isinstance(expected,list):return isinstance(actual,list) and len(actual)==len(expected) and all(same(a,b) for a,b in zip(actual,expected)) + if isinstance(expected,dict):return isinstance(actual,dict) and actual.keys()==expected.keys() and all(same(actual[k],v) for k,v in expected.items()) + return False +RUNNER="""import sys,json,copy,pickle\nsys.path.insert(0,sys.argv[1])\nnonce=sys.argv[2]\nimport task\nrows=[]\nfor case in json.load(sys.stdin):\n value=copy.deepcopy(case);before=pickle.dumps(value)\n try:rows.append({'ok':task.solve(value)})\n except ValueError:rows.append({'error':'ValueError'})\n if pickle.dumps(value)!=before:raise AssertionError('input mutated')\nprint('RESULT:'+nonce+':'+json.dumps(rows,ensure_ascii=True,allow_nan=True))\nprint('COMPLETE:'+nonce)\n""" +try: + cases,expected=fixtures() + require(len(cases)==len(expected),'internal fixture size') + with tempfile.TemporaryDirectory(prefix='n2-check-',dir='/tmp') as td: + scratch=pathlib.Path(td);source=ROOT/'task.py' + require(source.is_file() and not source.is_symlink(),'missing task.py') + shutil.copyfile(source,scratch/'task.py');(scratch/'runner.py').write_text(RUNNER) + nonce=secrets.token_hex(16) + p=subprocess.run([sys.executable,'-I','-B',str(scratch/'runner.py'),str(scratch),nonce],input=json.dumps(cases,allow_nan=True),text=True,capture_output=True,cwd=scratch,timeout=25) + require(p.returncode==0,'candidate execution failed') + lines=p.stdout.splitlines();prefix='RESULT:'+nonce+':' + require(lines.count('COMPLETE:'+nonce)==1,'trusted runner did not complete') + result_lines=[x[len(prefix):] for x in lines if x.startswith(prefix)] + require(len(result_lines)==1,'result marker count') + try:got=json.loads(result_lines[0]) + except (ValueError,TypeError):raise AssertionError('candidate output protocol') + require(isinstance(got,list) and len(got)==len(expected),'result count') + for i,(a,e) in enumerate(zip(got,expected)):require(same(a,e),'case '+str(i)+' mismatch') + print('PASS') +except Exception as exc: + message=str(exc) + if 'scratch' in globals():message=message.replace(str(scratch),'') + print('FAIL:',type(exc).__name__,message[:500]);sys.exit(1) diff --git a/tasks/S500_n2_140/gold/task.py b/tasks/S500_n2_140/gold/task.py new file mode 100644 index 00000000..30707be5 --- /dev/null +++ b/tasks/S500_n2_140/gold/task.py @@ -0,0 +1,63 @@ +import math + +def obj(x): + if not isinstance(x,dict):raise ValueError('expected object') + return x + +def arr(x,n=None): + if not isinstance(x,list) or (n is not None and len(x)!=n):raise ValueError('expected list') + return x + +def num(x): + if isinstance(x,bool) or not isinstance(x,(int,float)) or abs(x)>1000000 or not math.isfinite(x):raise ValueError('expected finite number') + return float(x) + +def vec(x,n):return [num(v) for v in arr(x,n)] + +def field(d,k): + if k not in d:raise ValueError('missing field') + return d[k] + +import hashlib + +def utf8(x,nonempty=False): + if not isinstance(x,str) or (nonempty and not x):raise ValueError('text') + try:b=x.encode('utf-8') + except UnicodeError:raise ValueError('utf8') + if len(b)>1024:raise ValueError('text length') + return b + +def prepare(data): + d=obj(data);bits=field(d,'bits');E=[] + if type(bits) is not int or not 1<=bits<=16:raise ValueError('bits') + for row in arr(field(d,'events')): + row=obj(row);op=field(row,'op') + if op in ('add','remove'): + node=field(row,'node');utf8(node,True);replicas=field(row,'replicas') if op=='add' else None + if op=='add' and (type(replicas) is not int or not 1<=replicas<=32):raise ValueError('replicas') + E.append((op,node,replicas)) + elif op=='lookup':key=field(row,'key');utf8(key);E.append((op,key,None)) + elif op=='ring':E.append((op,None,None)) + else:raise ValueError('op') + return bits,E + +def digest(bits,prefix,name,index=None): + encoded=utf8(name);payload=prefix+len(encoded).to_bytes(4,'big')+encoded + if index is not None:payload+=index.to_bytes(4,'big') + return int.from_bytes(hashlib.sha256(payload).digest()[:8],'big')&((1<=h否则环绕;同点按node/replica | +| 替换删除与空环 | template/README.md:3(更新/删除后不能复用陈旧环) | 重复add原子换replicas返回False,remove存在bool,空环lookupNone,ring全token排序 | +| 字符串型域及批量 | template/README.md:9(与 events 等长且顺序一致的 Python list) | bits/replicas int非bool,严格UTF8/1024bytes含NUL非ASCII,10000事件/128节点支持;空[] | + +- 题面改动:solve(data) 的整体返回值是与 events 等长且顺序一致的 Python list,每项分别为对应事件规定的 bool、node 字符串、None 或 token 列表;events 为空时返回 [],仍须验证 bits。 +- 改动依据:原文每事件对应输出未明确solve外层类型,原check/gold/valid均为保序等长list;只补容器和空返回,输入字节编码/数值类型已明确。 +- 判据与标准答案:原判据、gold 和 valid 未因校准结果而改写;重写隔离时仅迁移执行边界,保留原断言语义。 +- 合法解:只要求原公开接口、类型和行为;原 valid 样例(如有)作为合法替代解校准,不限定实现算法或源码形态。 +- 隔离:沿用受保护 verify.py 的 root 判据和降权候选子进程;正式容器独立校准;本地模式只执行本仓库可信样例。 + +## 5. 四类样例与校准 + +沿用 Bos 原题。 + +## 6. 真实试采与证据 + +沿用 Bos 原题。本批按 BRIEF 不运行 Qwen 或其他模型;难度 UNMEASURED,未试采。 + +## 7. 评审与准入 + +- 作者已逐题完整读 README、check.py、附属 Python 判据、gold 与 valid(如有),核对阈值等号、精确/浮点语义、int/float/bool、规模、空输入、异常及容差。 +- 状态:CALIBRATED;只到两道校准闸门,尚未真实试采,不记 ADMITTED。 +- 闸门1可信本地:PASS;30 次;cleanup=confirmed;证据 runs/20261020-A-bos-n2-9/local/calibration-90909e4cd519494da087facad1e38361。 +- 闸门2trace6 Docker:PASS;30 次;cleanup=confirmed;证据 runs/20261020-A-bos-n2-9/docker/calibration-09f07d9f17ff4184807775f94b1af5e0。 +- 正式镜像:ccr-29eug8s3-pub.cnc.bj.baidubce.com/algo/bench-runtime@sha256:1519f8daa403998e5401eeb70b973e8aac8346e25a937033bc502dc5de1641a1。 +- 每类样例分别五次;若含 cheat_read_grader,本地无隔离可读而 PASS 仅按规范 §7 记例外,正式 Docker 必须 FAIL。 +- 独立只读审阅由主控另存本批 review 证据;本 spec 不代替独立审阅或模型难度测量。 + + diff --git a/tasks/S500_n2_140/task.json b/tasks/S500_n2_140/task.json new file mode 100644 index 00000000..3e3d3705 --- /dev/null +++ b/tasks/S500_n2_140/task.json @@ -0,0 +1,36 @@ +{ + "id": "S500_n2_140", + "version": "2", + "family": "serial-protocol", + "source": "bos-qiao/task_factory_500_20260914/envs/S500_n2_140", + "template": "template", + "verifier": "verify.py", + "candidate_files": [ + "task.py" + ], + "timeout_seconds": 120, + "fixtures": { + "gold": "PASS", + "template": "FAIL", + "noop": "FAIL", + "cheat": "FAIL", + "cheat_stale_replica_update": "FAIL", + "valid_alternative": "PASS" + }, + "grader_files": [ + "check.py" + ], + "bos": { + "source_qid": "new_n2_140_route_consistent_hash_ring", + "origin": "original_authored", + "image": "python@sha256:78387bc3881b8273120a12ebe6c1ab22b018ccc2c9adf565ae1ac9b536e184ea", + "budget_s": 600, + "fixture_scripts": { + "gold": "gold.sh", + "noop": "cheat_exit_zero.sh", + "cheat": "cheat_predecessor_instead_of_successor.sh", + "cheat_stale_replica_update": "cheat_stale_replica_update.sh", + "valid_alternative": "valid_alternative.sh" + } + } +} diff --git a/tasks/S500_n2_140/template/README.md b/tasks/S500_n2_140/template/README.md new file mode 100644 index 00000000..00073985 --- /dev/null +++ b/tasks/S500_n2_140/template/README.md @@ -0,0 +1,9 @@ +# 分片遥测一致性哈希 + +输入{bits:b,events:[event,...]},b为1..16的int不含bool,环大小2^b。哈希H(bytes)=SHA256摘要前8字节按大端无符号整数解释后,与(2^b-1)按位AND。节点名须非空str,key可为空str;都必须能严格UTF-8编码且编码长度<=1024字节(允许NUL和非ASCII)。虚拟节点i(0起)token输入字节为b'V'+节点UTF8字节数的4字节大端整数+节点UTF8+i的4字节大端整数。key哈希输入字节为b'K'+key字节数的4字节大端整数+key UTF8。事件add:{op:'add',node,replicas},replicas为1..32的int;新增节点或原子替换已有节点的虚拟节点数量,输出是否此前不存在的bool。remove:{op:'remove',node}删除其全部token,输出是否存在bool。lookup:{op:'lookup',key}选择position>=key哈希的第一个token,若无则环绕到最小position;相同position按(node字符串字典序,replica索引)取最小,输出所属node,空环输出None。ring:{op:'ring'}输出全部token列表[{position,node,replica},...],按(position,node,replica)排序。solve返回每事件对应输出,初始无节点。支持128个活跃节点及10000事件。小bits故意允许真实哈希碰撞,不能丢弃碰撞token;更新/删除后不能复用陈旧环。 + +这是经授权原创的纯软件数学/事件处理题,source_qid以new_开头,不是历史工程恢复,也不证明任何板卡或外设结果。实现当前目录task.py中的solve(data),允许额外正常日志,判据只比较函数结果。仅依赖Python标准库。输入中的“数值”指绝对值<=1000000的有限int/float且不包括bool(范围限制适用于所有输入数值,输出不受此范围限制);无效输入(包括缺必需字段、类型错误及下述越界)必须抛ValueError。未说明的额外字典键可忽略。不得改写传入数据。允许添加额外文件,但task.py必须自包含,判据仅复制它到干净临时目录导入。输出浮点容差绝对/相对1e-8。可用python3导入task并调用solve自行验证。 + +## 本批公开约定澄清 + +solve(data) 的整体返回值是与 events 等长且顺序一致的 Python list,每项分别为对应事件规定的 bool、node 字符串、None 或 token 列表;events 为空时返回 [],仍须验证 bits。 diff --git a/tasks/S500_n2_140/template/task.py b/tasks/S500_n2_140/template/task.py new file mode 100644 index 00000000..eca5aea9 --- /dev/null +++ b/tasks/S500_n2_140/template/task.py @@ -0,0 +1,3 @@ +"""Implement solve(data) according to README.md.""" +def solve(data): + raise NotImplementedError("not implemented") diff --git a/tasks/S500_n2_140/valid_alternative/task.py b/tasks/S500_n2_140/valid_alternative/task.py new file mode 100644 index 00000000..53ccbed6 --- /dev/null +++ b/tasks/S500_n2_140/valid_alternative/task.py @@ -0,0 +1,58 @@ +import math + +def obj(x): + if not isinstance(x,dict):raise ValueError('expected object') + return x + +def arr(x,n=None): + if not isinstance(x,list) or (n is not None and len(x)!=n):raise ValueError('expected list') + return x + +def num(x): + if isinstance(x,bool) or not isinstance(x,(int,float)) or abs(x)>1000000 or not math.isfinite(x):raise ValueError('expected finite number') + return float(x) + +def vec(x,n):return [num(v) for v in arr(x,n)] + +def field(d,k): + if k not in d:raise ValueError('missing field') + return d[k] + +import hashlib + +def utf8(x,nonempty=False): + if not isinstance(x,str) or (nonempty and not x):raise ValueError('text') + try:b=x.encode('utf-8') + except UnicodeError:raise ValueError('utf8') + if len(b)>1024:raise ValueError('text length') + return b + +def prepare(data): + d=obj(data);bits=field(d,'bits');E=[] + if type(bits) is not int or not 1<=bits<=16:raise ValueError('bits') + for row in arr(field(d,'events')): + row=obj(row);op=field(row,'op') + if op in ('add','remove'): + node=field(row,'node');utf8(node,True);replicas=field(row,'replicas') if op=='add' else None + if op=='add' and (type(replicas) is not int or not 1<=replicas<=32):raise ValueError('replicas') + E.append((op,node,replicas)) + elif op=='lookup':key=field(row,'key');utf8(key);E.append((op,key,None)) + elif op=='ring':E.append((op,None,None)) + else:raise ValueError('op') + return bits,E + +def digest(bits,prefix,name,index=None): + encoded=utf8(name);payload=prefix+len(encoded).to_bytes(4,'big')+encoded + if index is not None:payload+=index.to_bytes(4,'big') + return int.from_bytes(hashlib.sha256(payload).digest()[:8],'big')&((1<