旅する修理屋の作り方

# MIT License
# 
# Copyright (c) 2026
# 
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
# 
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
# 
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
# 
# Third-party exception: bitmap glyph data derived from Noto Sans CJK is licensed
# under the SIL Open Font License 1.1. See assets/NOTO-LICENSE.txt.

"""100 旅する修理屋 / 教材 1。"""
STAGE = 1

from dataclasses import dataclass, asdict, replace
from pathlib import Path
import json, hashlib
GAME='100_traveling_repairer'
VERSION=1
TITLES={'A':'川から始める','B':'森への便り','C':'鈴を届けたあと'}
TOWNS=('拠点','川町','丘町','森町')
GIFTS=('小瓶','小鈴','木札')
INITIAL={'A':(20,4,(2,3,3,2)),'B':(18,3,(3,2,3,2)),'C':(16,2,(2,2,2,3))}
METHODS={'gear':(2,1),'hand':(1,2),'rope':(1,2)}
@dataclass(frozen=True)
class State:
    case: str = 'A'
    town: int = 0
    time: int = 20
    visited: tuple = (True,False,False,False)
    ended: bool = False
def new(case='A',transport=True):
    if case not in INITIAL:raise ValueError('unknown case')
    return State(case=case,time=INITIAL[case][0])
def roads(s):
    costs=INITIAL[s.case][2]
    return {(0,1):costs[0],(0,2):costs[1],(1,3):costs[2],(2,3):costs[3]}
def distance(s,a,b):return roads(s).get(tuple(sorted((a,b))))

def shortest(s,start=None):
 start=s.town if start is None else start;ds=[999]*4;ds[0]=0;paths=[() for _ in range(4)];paths[0]=(0,)
 for _ in range(4):
  for (a,b),cost in roads(s).items():
   for u,v in ((a,b),(b,a)):
    path=(v,)+paths[u]
    if ds[u]+cost<ds[v] or (ds[u]+cost==ds[v] and path<paths[v]):ds[v]=ds[u]+cost;paths[v]=path
 return ds[start],paths[start]
def step(s,a):
    a=tuple(a)
    if s.ended:raise ValueError('journey ended')
    if not a:raise ValueError('empty action')
    if a[0]=='move' and len(a)==2:
        dst=a[1]
        if type(dst) is not int or dst not in range(4):raise ValueError('invalid town')
        cost=distance(s,s.town,dst)
        if cost is None or s.time<cost:raise ValueError('no road or insufficient time')
        visited=list(s.visited);visited[dst]=True
        return replace(s,town=dst,time=s.time-cost,visited=tuple(visited))
    if a==('finish',) and s.town==0:return replace(s,ended=True)
    raise ValueError('action unavailable')


KEYS={'SPACE','RETURN','X','P','H','R','M','UP','DOWN','LEFT','RIGHT','1','2','3','B','ESCAPE','TAB','Z'}
class Controller:
    def __init__(self,path=None):
        self.s=new();self.title=True;self.help=False;self.paused=False
        self.previous=set();self.gate=False;self.normalize()
    def normalize(self):
        self.view='map';self.destination=0 if self.s.town else 1
        self.choice=0;self.method='gear';self.dialog='';self.pending=None
        self.testing=False;self.test_frame=0;self.tested=None;self.notice=''
    def reset(self,case=None):
        self.s=new(case or self.s.case,getattr(self.s,'transport',True));self.normalize()
    def signature(self):return (self.s.town,self.method,getattr(self.s,'offset',2))
    def mechanism(self):return 0
    def options(self):
        out=[]
        if STAGE>=2 and self.s.town==1 and not getattr(self.s,'fixed',('',''))[0]:out.append(('TOOLS',('tools',)))
        if self.s.town==0:out.append(('FINISH',('finish',)))
        return out
    def apply(self,a):
        try:
            self.s=step(self.s,a);self.notice='';self.tested=None
            if a[0]=='move':self.view='town';self.destination=0 if self.s.town else 1;self.method='gear'
            if a[0]=='repair':self.view='map'
            return 'step:'+a[0]
        except ValueError as e:self.notice=str(e);return 'invalid'
    def preview(self,a):
        try:step(self.s,a);self.pending=a;self.dialog='action';return 'confirm:action'
        except ValueError as e:self.notice=str(e);return 'invalid:choice'
    def feed(self,down):
        down=set(down)&KEYS;fresh=down-self.previous;self.previous=down
        if self.testing and not (self.paused or self.help or self.dialog or self.title):
            self.test_frame+=1
            if self.test_frame>=120:
                self.testing=False;self.tested=self.signature();self.gate=True;return 'test:complete'
        if self.gate:
            if not down:self.gate=False
            return None
        if not fresh:return None
        self.gate=True
        if len(down)>1:return 'ignored:chord'
        k=next(iter(fresh));self.notice=''
        if self.dialog:
            if k in ('X','ESCAPE'):self.dialog='';self.pending=None;return 'cancel'
            if k=='RETURN':
                d=self.dialog;self.dialog=''
                if d=='quit':return 'quit'
                if d=='retry':self.reset();return 'reset'
                if d=='menu':self.title=True;return 'menu'
                if d=='action':a=self.pending;self.pending=None;return self.apply(a)
            return 'ignored:dialog'
        if k=='ESCAPE':self.dialog='quit';return 'confirm:quit'
        if k=='H':self.help=not self.help;return 'help'
        if self.help:return 'ignored:help'
        if self.title:
            if k in ('1','2','3'):self.reset('ABC'[int(k)-1]);return 'case'
            if STAGE>=3 and k=='B':self.s=new(self.s.case,not self.s.transport);self.normalize();return 'variant'
            if k in ('SPACE','RETURN'):self.title=False;return 'start'
            return 'ignored:title'
        if k=='P':self.paused=not self.paused;return 'pause'
        if self.paused:return 'ignored:pause'
        if self.testing:return 'ignored:test'
        if k=='R':self.dialog='retry';return 'confirm:retry'
        if k=='M':self.dialog='menu';return 'confirm:menu'
        if self.s.ended:return 'ignored:result'
        available=STAGE>=2 and self.s.town==1 and not getattr(self.s,'fixed',('',''))[0]
        if k=='TAB':
            views=('map','town','tools') if available else ('map','town')
            self.view=views[(views.index(self.view)+1)%len(views)] if self.view in views else 'map';return 'view'
        if k=='Z' and available:self.view='tools';return 'tools'
        if self.view=='map':
            if k in ('LEFT','RIGHT'):self.destination=(self.destination+(-1 if k=='LEFT' else 1))%4;return 'select-destination'
            if k=='RETURN':return self.preview(('move',self.destination))
        elif self.view=='town':
            if k=='RETURN' and self.options():
                a=self.options()[0][1]
                if a==('tools',):self.view='tools';return 'tools'
                return self.preview(a)
        else:
            if STAGE>=3 and k in ('LEFT','RIGHT'):self.method='hand' if self.method=='gear' else 'gear';self.tested=None;return 'select-method'
            if k in ('UP','DOWN'):return self.apply(('offset',(self.s.offset+(1 if k=='UP' else -1))%4))
            if k=='RETURN':
                if STAGE>=3 and self.tested==self.signature() and any(t[2] for t in ferry_trial(self.s.offset)):return self.preview(('repair',0,self.method))
                self.testing=True;self.test_frame=0;self.tested=None;return 'test:start'
        return 'ignored:key'

# ASCII teaching view. Controllers alone decide whether an input is committed.
NAMES=('H HOME','R RIVER','K HILL','F FOREST')
GIFT_NAMES=('JAR','BELL','TAG')
POINTS=((65,208),(223,110),(223,305),(393,208))
def tap(ui,key):
    ui.feed(set());event=ui.feed({key});ui.feed(set());return event

def go(ui,destination):
    while ui.view!='map':tap(ui,'TAB')
    for _ in range((destination-ui.destination)%4):tap(ui,'RIGHT')
    first=tap(ui,'RETURN')
    if first!='confirm:action':raise ValueError(first+': '+ui.notice)
    return tap(ui,'RETURN')

def run_trial(ui):
    tap(ui,'RETURN')
    for _ in range(120):ui.feed(set())
    ui.feed(set())
    if ui.testing:raise AssertionError('trial did not finish')

class App:
    def __init__(self,save_path='save_100.json'):
        self.ui=Controller(save_path);self.event='READY'
    def draw(self,p):
        u=self.ui;s=u.s;p.cls(1)
        p.text(16,12,'TRAVELING REPAIRER / STAGE '+str(STAGE)+' / CASE '+s.case,10)
        p.text(16,30,'CURRENT '+NAMES[s.town]+'  TIME '+str(s.time)+'  MATERIALS '+str(getattr(s,'materials','-')),11)
        p.text(440,30,'INITIAL ROADS / NO REPAIRS YET' if STAGE<3 else 'TRAVEL EDGES '+('OPEN AFTER REPAIR' if s.transport else 'COMPARISON: INITIAL ROADS ONLY'),6)
        p.text(16,49,'VIEW '+u.view.upper()+(' / CHOOSING DOES NOT USE TRAVEL TIME' if STAGE==1 else ' / CHOOSING AND FREE TESTS DO NOT USE TRAVEL TIME'),7)
        if u.view=='tools' and not s.ended:
            p.rectb(16,70,430,305,5)
            mech=u.mechanism();p.text(30,86,'FERRY' if mech==0 else 'FOREST ROPE' if u.method=='rope' else 'FOREST GEARS',10)
            if mech==0:
                frames=ferry_trial(s.offset);phase=min(3,u.test_frame//30) if u.testing or u.tested else 0
                p.text(30,108,'OFFSET '+str(s.offset)+' / UP DOWN: 0..3',7)
                for i,(left,right,aligned) in enumerate(frames):
                    y=142+i*36
                    if i==phase:p.rect(25,y-5,406,28,5)
                    p.text(34,y,'PHASE '+str(i)+'  LEFT '+str(left)+'  RIGHT '+str(right)+'  '+('DEPART' if aligned else 'WAIT'),10 if aligned else 7)
                p.text(30,305,'THE FOUR ROWS ARE A FREE MECHANISM TEST',6)
                p.text(30,322,'THEY ARE NOT FOUR TRAVEL-TIME CHARGES',6)
            elif u.method=='rope':
                p.line(75,298,380,135,6);p.line(75,304,380,141,6)
                p.rect(195,280-s.stop*57,44,20,9);p.rect(245,225,130,6,4)
                p.text(30,108,'STOP '+str(s.stop)+' / UP DOWN: 0..2',7)
                p.text(256,243,'PIER = STOP 1',10)
                p.text(30,338,'PASS ONLY WHEN THE LOAD STOPS AT 1',6)
            else:
                result=gear_trial(s.edges);coords=((95,218),(230,144),(365,218))
                for i,(a,b) in enumerate(((0,1),(1,2),(0,2))):
                    x,y=coords[a];xx,yy=coords[b];p.line(x,y,xx,yy,10 if s.edges&(1<<i) else 5)
                    p.text((x+xx)//2,(y+yy)//2-12,str(i+1),7)
                for i,(x,y) in enumerate(coords):
                    p.circ(x,y,22,9);p.circ(x,y,13,1)
                    p.text(x-17,y+32,('D','A','LOAD')[i]+' '+{1:'+1',-1:'-1',0:'STOP'}[result['signs'][i]],7)
                p.text(30,108,'MASK '+str(s.edges)+' / 1 2 3: TOGGLE EDGES',7)
                p.text(30,300,'ODD CYCLE: STOP' if result['conflict'] else 'LOAD -1: PASS' if result['passes'] else 'NOT READY: LOAD MUST BE -1',8 if result['conflict'] else 10)
                p.text(30,338,'SIGNS SHOW CONSTRAINTS, NOT TRAVEL SPEED',6)
        else:
            p.rectb(16,70,430,305,5)
            for (a,b),cost in roads(s).items():
                x,y=POINTS[a];xx,yy=POINTS[b];c=10 if (a,b) in ((1,2),(0,3)) else 6
                p.line(x,y,xx,yy,c);mx=(x+xx)//2;my=(y+yy)//2
                if (a,b)==(1,2):my-=35
                if (a,b)==(0,3):mx+=45
                p.rect(mx-10,my-8,20,17,1);p.text(mx-2,my-2,str(cost),c)
            for i,(x,y) in enumerate(POINTS):
                p.circ(x,y,17,3 if s.visited[i] else 5);p.text(x-2,y-2,'HRKF'[i],7)
                if i==s.town:p.circb(x,y,22,10)
                if u.view=='map' and i==u.destination and not s.ended:p.rectb(x-27,y-27,55,55,7)
                p.text(x-22,y+34,('HOME','RIVER','HILL','FOREST')[i],7)
            p.text(30,353,'INITIAL ROADS / COST SHOWN ON EACH EDGE' if STAGE<3 else 'YELLOW EDGE = OPEN REPAIR ROUTE, BOTH DIRECTIONS',6)
        x=470;p.text(x,78,'CURRENT LEDGER',10)
        home,path=shortest(s);p.text(x,98,'HOME COST '+str(home)+'  PATH '+'>'.join('HRKF'[n] for n in path),11)
        if s.time<home:p.text(x,117,'WARNING: NOT ENOUGH TIME TO RETURN',8)
        if STAGE>=3:p.text(x,136,'FIXED '+str(s.fixed),7)
        if STAGE>=4:
            carried=[i for i,v in enumerate(s.gifts) if v==-1]
            p.text(x,158,'BAG '+('/'.join(GIFT_NAMES[i] for i in carried) or 'EMPTY')+' / 2 SLOTS',7)
            p.text(x,180,'GIFT LOCATIONS: -1 = BAG',6)
            for i,g in enumerate(s.gifts):p.text(x,198+i*16,GIFT_NAMES[i]+': '+('BAG' if g==-1 else NAMES[g]),7)
            p.text(x,250,'SUPPLY TAKEN '+str(s.supplied),7)
            p.text(x,270,'TOWN LIFE: '+(','.join(('FISH','PLANTS','BELL')[i] for i in s.life) or 'NONE'),11)
        if STAGE==5:p.text(x,297,'HISTORY '+str(len(s.history))+' DECISIONS',6)
        if s.ended:
            result='SUCCESS' if STAGE>=3 and success(s) else 'SCOUTING / NO REPAIR' if STAGE>=3 else 'TRAINING TOUR ENDED'
            p.text(16,397,'RESULT: '+result,10)
        elif u.view=='map':
            cost=distance(s,s.town,u.destination)
            p.text(16,397,'DESTINATION '+NAMES[u.destination]+' / COST '+str(cost)+' / LEFT RIGHT THEN ENTER',10)
        elif u.view=='town':
            options=u.options();a=options[u.choice%len(options)][1] if options else ()
            p.text(16,397,'TOWN ACTION '+str(a)+' / LEFT RIGHT THEN ENTER' if options else 'NO TOWN ACTION / TAB TO MAP',10)
            if STAGE>=4 and len([g for g in s.gifts if g==-1])==2:
                bag=[i for i,g in enumerate(s.gifts) if g==-1]
                p.text(16,416,'SWAP: LEAVE '+GIFT_NAMES[bag[u.old%2]]+' HERE / UP DOWN SELECT',7)
        else:
            passed=any(row[2] for row in ferry_trial(s.offset)) if STAGE<4 else trial(s,u.mechanism(),u.method)['passes']
            status='TEST '+str(u.test_frame)+'/120 FEEDS' if u.testing else ('TEST DONE: '+('PASS' if passed else 'FAIL') if u.tested==u.signature() else 'ENTER STARTS FREE TEST')
            p.text(16,397,status+' / TRAVEL TIME UNCHANGED',10)
            if STAGE>=3:
                mat,time=METHODS[u.method];p.text(16,416,'METHOD '+u.method.upper()+' / MATERIALS '+str(mat)+' / TIME '+str(time)+' / LEFT RIGHT CHANGE',7)
                p.text(16,435,'AFTER PASS: RELEASE, ENTER PREVIEW, RELEASE, ENTER COMMIT',6)
            else:p.text(16,416,'STAGE 02: TEST ONLY / NO REPAIR COMMIT YET',6)
        if u.notice:
            reason='SAVED' if self.event=='save' else 'LOADED' if self.event=='load' else 'ACTION/IO REJECTED'
            for token,label in (('帰り','RETURN RESERVE TOO LOW'),('資材','NOT ENOUGH MATERIALS'),('試運転','ADJUST AND RETEST'),('その二町','NO DIRECT ROAD'),('時間','NOT ENOUGH TRAVEL TIME'),('丘の工具','SUPPLY ALREADY TAKEN'),('保存を変更','SAVE/LOAD FAILED; STATE KEPT')):
                if token in u.notice:reason=label
            p.text(470,333,'NOTICE: '+reason,8)
        p.text(16,462,'TAB MAP/TOWN / ENTER PREVIEW THEN CONFIRM' if STAGE==1 else 'TAB MAP/TOWN/TOOLS / Z TOOLS / ENTER PREVIEW THEN CONFIRM',7)
        p.text(16,480,'H HELP / P PAUSE / R RETRY / M TITLE / ESC QUIT / X CANCEL DIALOG',6)
        p.text(16,498,'X UNDO / S SAVE / L LOAD (STAGE 05) / RELEASE EVERY KEY',6)
        p.text(16,516,'R RESETS STATE ONLY. SAVE CODE, QUIT, AND RERUN AFTER EDITS.',6)
        p.text(16,540,'LAST INPUT '+self.event[:100],10)
        if u.title or u.help:
            p.rect(32,66,716,379,1);p.rectb(32,66,716,379,10)
            lines=['TRAVELING REPAIRER / STAGE '+str(STAGE),'TITLE: 1 2 3 CASE / B COMPARISON (03+) / SPACE START',
                   'MAP: LEFT RIGHT DESTINATION / ENTER PREVIEW / ENTER COMMIT',
                   'TOWN: LEFT RIGHT ACTION / ENTER PREVIEW / ENTER COMMIT',
                   'TAB MAP/TOWN / NO TOOLS IN STAGE 01' if STAGE==1 else 'TAB CHANGES VIEW / Z OPENS AN UNREPAIRED MECHANISM',
                   'TOOLS: UP DOWN PHASE OR STOP / LEFT RIGHT METHOD (03+)',
                   'FOREST GEARS: 1 2 3 TOGGLE EDGES (04+)',
                   'FREE MECHANISM TESTS ARRIVE IN STAGE 02' if STAGE==1 else 'ENTER FREE TEST: 120 UNPAUSED FEEDS, 4 DISPLAY PHASES',
                   'REPAIR COMMIT ARRIVES IN STAGE 03' if STAGE<3 else 'AFTER PASS: RELEASE / ENTER PREVIEW / RELEASE / ENTER COMMIT',
                   'H CLOSES HELP / P PAUSES / R M ESC REQUIRE CONFIRMATION',
                   'X CANCELS A DIALOG / X UNDO, S SAVE, L LOAD (05)',
                   'EDITS AND TESTS ARE FREE; MOVES AND REPAIRS USE TIME',
                   'CURRENT CASE '+s.case+' / '+('OPEN TRAVEL EDGES' if getattr(s,'transport',True) else 'LIFE ONLY COMPARISON')]
            for i,line in enumerate(lines):p.text(50,86+i*27,line,10 if i in (0,12) else 7)
        if u.paused:
            p.rect(60,165,660,135,1);p.rectb(60,165,660,135,10)
            p.text(83,191,'PAUSED / P RESUMES / RELEASE ALL KEYS FIRST',10)
            p.text(83,229,'TRIAL CLOCK AND TRAVEL TIME ARE STOPPED',7)
        if u.dialog:
            p.rect(48,88,684,339,1);p.rectb(48,88,684,339,10)
            lines=['CONFIRM '+u.dialog.upper(),'ENTER ACCEPT / X CANCEL / RELEASE BETWEEN EVERY PRESS']
            if u.dialog=='action':
                future=step(s,u.pending);return_cost,route=shortest(future)
                lines=['PENDING ACTION '+str(u.pending),'CURRENT: TIME '+str(s.time)+' MATERIALS '+str(getattr(s,'materials','-')),
                       'AFTER CONFIRM: TIME '+str(future.time)+' MATERIALS '+str(getattr(future,'materials','-')),
                       'AFTER CONFIRM HOME: '+str(return_cost)+' VIA '+'>'.join('HRKF'[n] for n in route)]
                if STAGE>=4 and u.pending[0]=='gift':lines.append('AFTER CONFIRM GIFT LOCATIONS '+str(future.gifts)+' (-1 = BAG)')
                if u.pending[0]=='move' and future.time<return_cost:lines.append('WARNING: RETURN TIME IS SHORT; UNDO IN STAGE 05')
                if u.pending[0]=='repair':lines.append('AFTER CONFIRM ROAD OPENS' if future.transport else 'COMPARISON: LIFE CHANGES, NO EXTRA TRAVEL EDGE')
                lines+=['PREVIEW ONLY: CURRENT STATE HAS NOT CHANGED','RELEASE / ENTER ONCE TO COMMIT / X CANCEL']
            for i,line in enumerate(lines):p.text(70,112+i*35,line,10 if i in (0,len(lines)-1) else 7)

def demo(app):
    u=app.ui;tap(u,'SPACE');go(u,1)
    if STAGE>=2:
        tap(u,'Z');tap(u,'DOWN');tap(u,'DOWN');run_trial(u)
    if STAGE>=3:
        tap(u,'RETURN');tap(u,'RETURN')
    if STAGE>=4:
        go(u,2)
        # Hill options are gift first, supply second.
        tap(u,'RIGHT');tap(u,'RETURN');tap(u,'RETURN')
    app.event='SYNTHETIC CHECKPOINT'

def main(headless=False,screenshot=None,state_json=None,checkpoint=False):
    save_path=str((Path.cwd()/'save_100.json').resolve())
    import pyxel as p
    app=App(save_path)
    if checkpoint:demo(app)
    p.init(780,570,title='Traveling repairer lesson '+str(STAGE),fps=30,display_scale=1,quit_key=p.KEY_NONE,headless=headless)
    keys={k:getattr(p,'KEY_'+k) for k in KEYS}
    def update():
        if headless and p.frame_count>=5:
            app.draw(p)
            if screenshot:p.screen.save(screenshot,1)
            if state_json:Path(state_json).write_text(json.dumps({'stage':STAGE,'state':asdict(app.ui.s),'title':app.ui.title,'scope':'actual Linux headless Pyxel; synthetic controls'},ensure_ascii=False,indent=2)+'\n',encoding='utf-8')
            p.quit();return
        e=app.ui.feed(set() if headless else {k for k,v in keys.items() if p.btn(v)})
        if e:
            app.event=e
            if e=='quit':p.quit()
    p.run(update,lambda:app.draw(p))

if __name__=='__main__':
    import argparse
    parser=argparse.ArgumentParser(description='Standalone traveling repairer tutorial')
    parser.add_argument('--headless-smoke',action='store_true')
    parser.add_argument('--demo-checkpoint',action='store_true')
    parser.add_argument('--screenshot');parser.add_argument('--state-json')
    args=parser.parse_args()
    if (args.demo_checkpoint or args.screenshot or args.state_json) and not args.headless_smoke:parser.error('outputs/checkpoint require --headless-smoke')
    for field,suffix in (('screenshot','.png'),('state_json','.json')):
        value=getattr(args,field)
        if value is not None:
            target=Path(value).resolve()
            if target.suffix.lower()!=suffix or not target.parent.is_dir() or target.exists():parser.error('output must be a new '+suffix+' in an existing directory')
            setattr(args,field,str(target))
    main(args.headless_smoke,args.screenshot,args.state_json,args.demo_checkpoint)

# MIT License
# 
# Copyright (c) 2026
# 
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
# 
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
# 
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
# 
# Third-party exception: bitmap glyph data derived from Noto Sans CJK is licensed
# under the SIL Open Font License 1.1. See assets/NOTO-LICENSE.txt.

"""100 旅する修理屋 / 教材 2。"""
STAGE = 2

from dataclasses import dataclass, asdict, replace
from pathlib import Path
import json, hashlib
GAME='100_traveling_repairer'
VERSION=1
TITLES={'A':'川から始める','B':'森への便り','C':'鈴を届けたあと'}
TOWNS=('拠点','川町','丘町','森町')
GIFTS=('小瓶','小鈴','木札')
INITIAL={'A':(20,4,(2,3,3,2)),'B':(18,3,(3,2,3,2)),'C':(16,2,(2,2,2,3))}
METHODS={'gear':(2,1),'hand':(1,2),'rope':(1,2)}
@dataclass(frozen=True)
class State:
    case: str = 'A'
    town: int = 0
    time: int = 20
    visited: tuple = (True,False,False,False)
    offset: int = 2
    ended: bool = False
def new(case='A',transport=True):
    if case not in INITIAL:raise ValueError('unknown case')
    return State(case=case,time=INITIAL[case][0])
def roads(s):
    costs=INITIAL[s.case][2]
    return {(0,1):costs[0],(0,2):costs[1],(1,3):costs[2],(2,3):costs[3]}
def distance(s,a,b):return roads(s).get(tuple(sorted((a,b))))

def shortest(s,start=None):
 start=s.town if start is None else start;ds=[999]*4;ds[0]=0;paths=[() for _ in range(4)];paths[0]=(0,)
 for _ in range(4):
  for (a,b),cost in roads(s).items():
   for u,v in ((a,b),(b,a)):
    path=(v,)+paths[u]
    if ds[u]+cost<ds[v] or (ds[u]+cost==ds[v] and path<paths[v]):ds[v]=ds[u]+cost;paths[v]=path
 return ds[start],paths[start]

def ferry_trial(offset):return tuple((t%4,(t+offset)%4,t%4==0 and (t+offset)%4==0) for t in range(4))
def step(s,a):
    a=tuple(a)
    if s.ended:raise ValueError('journey ended')
    if not a:raise ValueError('empty action')
    if a[0]=='move' and len(a)==2:
        dst=a[1]
        if type(dst) is not int or dst not in range(4):raise ValueError('invalid town')
        cost=distance(s,s.town,dst)
        if cost is None or s.time<cost:raise ValueError('no road or insufficient time')
        visited=list(s.visited);visited[dst]=True
        return replace(s,town=dst,time=s.time-cost,visited=tuple(visited))
    if a[0]=='offset' and len(a)==2:
        if s.town!=1 or type(a[1]) is not int or a[1] not in range(4):raise ValueError('offset unavailable')
        return replace(s,offset=a[1])
    if a==('finish',) and s.town==0:return replace(s,ended=True)
    raise ValueError('action unavailable')


KEYS={'SPACE','RETURN','X','P','H','R','M','UP','DOWN','LEFT','RIGHT','1','2','3','B','ESCAPE','TAB','Z'}
class Controller:
    def __init__(self,path=None):
        self.s=new();self.title=True;self.help=False;self.paused=False
        self.previous=set();self.gate=False;self.normalize()
    def normalize(self):
        self.view='map';self.destination=0 if self.s.town else 1
        self.choice=0;self.method='gear';self.dialog='';self.pending=None
        self.testing=False;self.test_frame=0;self.tested=None;self.notice=''
    def reset(self,case=None):
        self.s=new(case or self.s.case,getattr(self.s,'transport',True));self.normalize()
    def signature(self):return (self.s.town,self.method,getattr(self.s,'offset',2))
    def mechanism(self):return 0
    def options(self):
        out=[]
        if STAGE>=2 and self.s.town==1 and not getattr(self.s,'fixed',('',''))[0]:out.append(('TOOLS',('tools',)))
        if self.s.town==0:out.append(('FINISH',('finish',)))
        return out
    def apply(self,a):
        try:
            self.s=step(self.s,a);self.notice='';self.tested=None
            if a[0]=='move':self.view='town';self.destination=0 if self.s.town else 1;self.method='gear'
            if a[0]=='repair':self.view='map'
            return 'step:'+a[0]
        except ValueError as e:self.notice=str(e);return 'invalid'
    def preview(self,a):
        try:step(self.s,a);self.pending=a;self.dialog='action';return 'confirm:action'
        except ValueError as e:self.notice=str(e);return 'invalid:choice'
    def feed(self,down):
        down=set(down)&KEYS;fresh=down-self.previous;self.previous=down
        if self.testing and not (self.paused or self.help or self.dialog or self.title):
            self.test_frame+=1
            if self.test_frame>=120:
                self.testing=False;self.tested=self.signature();self.gate=True;return 'test:complete'
        if self.gate:
            if not down:self.gate=False
            return None
        if not fresh:return None
        self.gate=True
        if len(down)>1:return 'ignored:chord'
        k=next(iter(fresh));self.notice=''
        if self.dialog:
            if k in ('X','ESCAPE'):self.dialog='';self.pending=None;return 'cancel'
            if k=='RETURN':
                d=self.dialog;self.dialog=''
                if d=='quit':return 'quit'
                if d=='retry':self.reset();return 'reset'
                if d=='menu':self.title=True;return 'menu'
                if d=='action':a=self.pending;self.pending=None;return self.apply(a)
            return 'ignored:dialog'
        if k=='ESCAPE':self.dialog='quit';return 'confirm:quit'
        if k=='H':self.help=not self.help;return 'help'
        if self.help:return 'ignored:help'
        if self.title:
            if k in ('1','2','3'):self.reset('ABC'[int(k)-1]);return 'case'
            if STAGE>=3 and k=='B':self.s=new(self.s.case,not self.s.transport);self.normalize();return 'variant'
            if k in ('SPACE','RETURN'):self.title=False;return 'start'
            return 'ignored:title'
        if k=='P':self.paused=not self.paused;return 'pause'
        if self.paused:return 'ignored:pause'
        if self.testing:return 'ignored:test'
        if k=='R':self.dialog='retry';return 'confirm:retry'
        if k=='M':self.dialog='menu';return 'confirm:menu'
        if self.s.ended:return 'ignored:result'
        available=STAGE>=2 and self.s.town==1 and not getattr(self.s,'fixed',('',''))[0]
        if k=='TAB':
            views=('map','town','tools') if available else ('map','town')
            self.view=views[(views.index(self.view)+1)%len(views)] if self.view in views else 'map';return 'view'
        if k=='Z' and available:self.view='tools';return 'tools'
        if self.view=='map':
            if k in ('LEFT','RIGHT'):self.destination=(self.destination+(-1 if k=='LEFT' else 1))%4;return 'select-destination'
            if k=='RETURN':return self.preview(('move',self.destination))
        elif self.view=='town':
            if k=='RETURN' and self.options():
                a=self.options()[0][1]
                if a==('tools',):self.view='tools';return 'tools'
                return self.preview(a)
        else:
            if STAGE>=3 and k in ('LEFT','RIGHT'):self.method='hand' if self.method=='gear' else 'gear';self.tested=None;return 'select-method'
            if k in ('UP','DOWN'):return self.apply(('offset',(self.s.offset+(1 if k=='UP' else -1))%4))
            if k=='RETURN':
                if STAGE>=3 and self.tested==self.signature() and any(t[2] for t in ferry_trial(self.s.offset)):return self.preview(('repair',0,self.method))
                self.testing=True;self.test_frame=0;self.tested=None;return 'test:start'
        return 'ignored:key'

# ASCII teaching view. Controllers alone decide whether an input is committed.
NAMES=('H HOME','R RIVER','K HILL','F FOREST')
GIFT_NAMES=('JAR','BELL','TAG')
POINTS=((65,208),(223,110),(223,305),(393,208))
def tap(ui,key):
    ui.feed(set());event=ui.feed({key});ui.feed(set());return event

def go(ui,destination):
    while ui.view!='map':tap(ui,'TAB')
    for _ in range((destination-ui.destination)%4):tap(ui,'RIGHT')
    first=tap(ui,'RETURN')
    if first!='confirm:action':raise ValueError(first+': '+ui.notice)
    return tap(ui,'RETURN')

def run_trial(ui):
    tap(ui,'RETURN')
    for _ in range(120):ui.feed(set())
    ui.feed(set())
    if ui.testing:raise AssertionError('trial did not finish')

class App:
    def __init__(self,save_path='save_100.json'):
        self.ui=Controller(save_path);self.event='READY'
    def draw(self,p):
        u=self.ui;s=u.s;p.cls(1)
        p.text(16,12,'TRAVELING REPAIRER / STAGE '+str(STAGE)+' / CASE '+s.case,10)
        p.text(16,30,'CURRENT '+NAMES[s.town]+'  TIME '+str(s.time)+'  MATERIALS '+str(getattr(s,'materials','-')),11)
        p.text(440,30,'INITIAL ROADS / NO REPAIRS YET' if STAGE<3 else 'TRAVEL EDGES '+('OPEN AFTER REPAIR' if s.transport else 'COMPARISON: INITIAL ROADS ONLY'),6)
        p.text(16,49,'VIEW '+u.view.upper()+(' / CHOOSING DOES NOT USE TRAVEL TIME' if STAGE==1 else ' / CHOOSING AND FREE TESTS DO NOT USE TRAVEL TIME'),7)
        if u.view=='tools' and not s.ended:
            p.rectb(16,70,430,305,5)
            mech=u.mechanism();p.text(30,86,'FERRY' if mech==0 else 'FOREST ROPE' if u.method=='rope' else 'FOREST GEARS',10)
            if mech==0:
                frames=ferry_trial(s.offset);phase=min(3,u.test_frame//30) if u.testing or u.tested else 0
                p.text(30,108,'OFFSET '+str(s.offset)+' / UP DOWN: 0..3',7)
                for i,(left,right,aligned) in enumerate(frames):
                    y=142+i*36
                    if i==phase:p.rect(25,y-5,406,28,5)
                    p.text(34,y,'PHASE '+str(i)+'  LEFT '+str(left)+'  RIGHT '+str(right)+'  '+('DEPART' if aligned else 'WAIT'),10 if aligned else 7)
                p.text(30,305,'THE FOUR ROWS ARE A FREE MECHANISM TEST',6)
                p.text(30,322,'THEY ARE NOT FOUR TRAVEL-TIME CHARGES',6)
            elif u.method=='rope':
                p.line(75,298,380,135,6);p.line(75,304,380,141,6)
                p.rect(195,280-s.stop*57,44,20,9);p.rect(245,225,130,6,4)
                p.text(30,108,'STOP '+str(s.stop)+' / UP DOWN: 0..2',7)
                p.text(256,243,'PIER = STOP 1',10)
                p.text(30,338,'PASS ONLY WHEN THE LOAD STOPS AT 1',6)
            else:
                result=gear_trial(s.edges);coords=((95,218),(230,144),(365,218))
                for i,(a,b) in enumerate(((0,1),(1,2),(0,2))):
                    x,y=coords[a];xx,yy=coords[b];p.line(x,y,xx,yy,10 if s.edges&(1<<i) else 5)
                    p.text((x+xx)//2,(y+yy)//2-12,str(i+1),7)
                for i,(x,y) in enumerate(coords):
                    p.circ(x,y,22,9);p.circ(x,y,13,1)
                    p.text(x-17,y+32,('D','A','LOAD')[i]+' '+{1:'+1',-1:'-1',0:'STOP'}[result['signs'][i]],7)
                p.text(30,108,'MASK '+str(s.edges)+' / 1 2 3: TOGGLE EDGES',7)
                p.text(30,300,'ODD CYCLE: STOP' if result['conflict'] else 'LOAD -1: PASS' if result['passes'] else 'NOT READY: LOAD MUST BE -1',8 if result['conflict'] else 10)
                p.text(30,338,'SIGNS SHOW CONSTRAINTS, NOT TRAVEL SPEED',6)
        else:
            p.rectb(16,70,430,305,5)
            for (a,b),cost in roads(s).items():
                x,y=POINTS[a];xx,yy=POINTS[b];c=10 if (a,b) in ((1,2),(0,3)) else 6
                p.line(x,y,xx,yy,c);mx=(x+xx)//2;my=(y+yy)//2
                if (a,b)==(1,2):my-=35
                if (a,b)==(0,3):mx+=45
                p.rect(mx-10,my-8,20,17,1);p.text(mx-2,my-2,str(cost),c)
            for i,(x,y) in enumerate(POINTS):
                p.circ(x,y,17,3 if s.visited[i] else 5);p.text(x-2,y-2,'HRKF'[i],7)
                if i==s.town:p.circb(x,y,22,10)
                if u.view=='map' and i==u.destination and not s.ended:p.rectb(x-27,y-27,55,55,7)
                p.text(x-22,y+34,('HOME','RIVER','HILL','FOREST')[i],7)
            p.text(30,353,'INITIAL ROADS / COST SHOWN ON EACH EDGE' if STAGE<3 else 'YELLOW EDGE = OPEN REPAIR ROUTE, BOTH DIRECTIONS',6)
        x=470;p.text(x,78,'CURRENT LEDGER',10)
        home,path=shortest(s);p.text(x,98,'HOME COST '+str(home)+'  PATH '+'>'.join('HRKF'[n] for n in path),11)
        if s.time<home:p.text(x,117,'WARNING: NOT ENOUGH TIME TO RETURN',8)
        if STAGE>=3:p.text(x,136,'FIXED '+str(s.fixed),7)
        if STAGE>=4:
            carried=[i for i,v in enumerate(s.gifts) if v==-1]
            p.text(x,158,'BAG '+('/'.join(GIFT_NAMES[i] for i in carried) or 'EMPTY')+' / 2 SLOTS',7)
            p.text(x,180,'GIFT LOCATIONS: -1 = BAG',6)
            for i,g in enumerate(s.gifts):p.text(x,198+i*16,GIFT_NAMES[i]+': '+('BAG' if g==-1 else NAMES[g]),7)
            p.text(x,250,'SUPPLY TAKEN '+str(s.supplied),7)
            p.text(x,270,'TOWN LIFE: '+(','.join(('FISH','PLANTS','BELL')[i] for i in s.life) or 'NONE'),11)
        if STAGE==5:p.text(x,297,'HISTORY '+str(len(s.history))+' DECISIONS',6)
        if s.ended:
            result='SUCCESS' if STAGE>=3 and success(s) else 'SCOUTING / NO REPAIR' if STAGE>=3 else 'TRAINING TOUR ENDED'
            p.text(16,397,'RESULT: '+result,10)
        elif u.view=='map':
            cost=distance(s,s.town,u.destination)
            p.text(16,397,'DESTINATION '+NAMES[u.destination]+' / COST '+str(cost)+' / LEFT RIGHT THEN ENTER',10)
        elif u.view=='town':
            options=u.options();a=options[u.choice%len(options)][1] if options else ()
            p.text(16,397,'TOWN ACTION '+str(a)+' / LEFT RIGHT THEN ENTER' if options else 'NO TOWN ACTION / TAB TO MAP',10)
            if STAGE>=4 and len([g for g in s.gifts if g==-1])==2:
                bag=[i for i,g in enumerate(s.gifts) if g==-1]
                p.text(16,416,'SWAP: LEAVE '+GIFT_NAMES[bag[u.old%2]]+' HERE / UP DOWN SELECT',7)
        else:
            passed=any(row[2] for row in ferry_trial(s.offset)) if STAGE<4 else trial(s,u.mechanism(),u.method)['passes']
            status='TEST '+str(u.test_frame)+'/120 FEEDS' if u.testing else ('TEST DONE: '+('PASS' if passed else 'FAIL') if u.tested==u.signature() else 'ENTER STARTS FREE TEST')
            p.text(16,397,status+' / TRAVEL TIME UNCHANGED',10)
            if STAGE>=3:
                mat,time=METHODS[u.method];p.text(16,416,'METHOD '+u.method.upper()+' / MATERIALS '+str(mat)+' / TIME '+str(time)+' / LEFT RIGHT CHANGE',7)
                p.text(16,435,'AFTER PASS: RELEASE, ENTER PREVIEW, RELEASE, ENTER COMMIT',6)
            else:p.text(16,416,'STAGE 02: TEST ONLY / NO REPAIR COMMIT YET',6)
        if u.notice:
            reason='SAVED' if self.event=='save' else 'LOADED' if self.event=='load' else 'ACTION/IO REJECTED'
            for token,label in (('帰り','RETURN RESERVE TOO LOW'),('資材','NOT ENOUGH MATERIALS'),('試運転','ADJUST AND RETEST'),('その二町','NO DIRECT ROAD'),('時間','NOT ENOUGH TRAVEL TIME'),('丘の工具','SUPPLY ALREADY TAKEN'),('保存を変更','SAVE/LOAD FAILED; STATE KEPT')):
                if token in u.notice:reason=label
            p.text(470,333,'NOTICE: '+reason,8)
        p.text(16,462,'TAB MAP/TOWN / ENTER PREVIEW THEN CONFIRM' if STAGE==1 else 'TAB MAP/TOWN/TOOLS / Z TOOLS / ENTER PREVIEW THEN CONFIRM',7)
        p.text(16,480,'H HELP / P PAUSE / R RETRY / M TITLE / ESC QUIT / X CANCEL DIALOG',6)
        p.text(16,498,'X UNDO / S SAVE / L LOAD (STAGE 05) / RELEASE EVERY KEY',6)
        p.text(16,516,'R RESETS STATE ONLY. SAVE CODE, QUIT, AND RERUN AFTER EDITS.',6)
        p.text(16,540,'LAST INPUT '+self.event[:100],10)
        if u.title or u.help:
            p.rect(32,66,716,379,1);p.rectb(32,66,716,379,10)
            lines=['TRAVELING REPAIRER / STAGE '+str(STAGE),'TITLE: 1 2 3 CASE / B COMPARISON (03+) / SPACE START',
                   'MAP: LEFT RIGHT DESTINATION / ENTER PREVIEW / ENTER COMMIT',
                   'TOWN: LEFT RIGHT ACTION / ENTER PREVIEW / ENTER COMMIT',
                   'TAB MAP/TOWN / NO TOOLS IN STAGE 01' if STAGE==1 else 'TAB CHANGES VIEW / Z OPENS AN UNREPAIRED MECHANISM',
                   'TOOLS: UP DOWN PHASE OR STOP / LEFT RIGHT METHOD (03+)',
                   'FOREST GEARS: 1 2 3 TOGGLE EDGES (04+)',
                   'FREE MECHANISM TESTS ARRIVE IN STAGE 02' if STAGE==1 else 'ENTER FREE TEST: 120 UNPAUSED FEEDS, 4 DISPLAY PHASES',
                   'REPAIR COMMIT ARRIVES IN STAGE 03' if STAGE<3 else 'AFTER PASS: RELEASE / ENTER PREVIEW / RELEASE / ENTER COMMIT',
                   'H CLOSES HELP / P PAUSES / R M ESC REQUIRE CONFIRMATION',
                   'X CANCELS A DIALOG / X UNDO, S SAVE, L LOAD (05)',
                   'EDITS AND TESTS ARE FREE; MOVES AND REPAIRS USE TIME',
                   'CURRENT CASE '+s.case+' / '+('OPEN TRAVEL EDGES' if getattr(s,'transport',True) else 'LIFE ONLY COMPARISON')]
            for i,line in enumerate(lines):p.text(50,86+i*27,line,10 if i in (0,12) else 7)
        if u.paused:
            p.rect(60,165,660,135,1);p.rectb(60,165,660,135,10)
            p.text(83,191,'PAUSED / P RESUMES / RELEASE ALL KEYS FIRST',10)
            p.text(83,229,'TRIAL CLOCK AND TRAVEL TIME ARE STOPPED',7)
        if u.dialog:
            p.rect(48,88,684,339,1);p.rectb(48,88,684,339,10)
            lines=['CONFIRM '+u.dialog.upper(),'ENTER ACCEPT / X CANCEL / RELEASE BETWEEN EVERY PRESS']
            if u.dialog=='action':
                future=step(s,u.pending);return_cost,route=shortest(future)
                lines=['PENDING ACTION '+str(u.pending),'CURRENT: TIME '+str(s.time)+' MATERIALS '+str(getattr(s,'materials','-')),
                       'AFTER CONFIRM: TIME '+str(future.time)+' MATERIALS '+str(getattr(future,'materials','-')),
                       'AFTER CONFIRM HOME: '+str(return_cost)+' VIA '+'>'.join('HRKF'[n] for n in route)]
                if STAGE>=4 and u.pending[0]=='gift':lines.append('AFTER CONFIRM GIFT LOCATIONS '+str(future.gifts)+' (-1 = BAG)')
                if u.pending[0]=='move' and future.time<return_cost:lines.append('WARNING: RETURN TIME IS SHORT; UNDO IN STAGE 05')
                if u.pending[0]=='repair':lines.append('AFTER CONFIRM ROAD OPENS' if future.transport else 'COMPARISON: LIFE CHANGES, NO EXTRA TRAVEL EDGE')
                lines+=['PREVIEW ONLY: CURRENT STATE HAS NOT CHANGED','RELEASE / ENTER ONCE TO COMMIT / X CANCEL']
            for i,line in enumerate(lines):p.text(70,112+i*35,line,10 if i in (0,len(lines)-1) else 7)

def demo(app):
    u=app.ui;tap(u,'SPACE');go(u,1)
    if STAGE>=2:
        tap(u,'Z');tap(u,'DOWN');tap(u,'DOWN');run_trial(u)
    if STAGE>=3:
        tap(u,'RETURN');tap(u,'RETURN')
    if STAGE>=4:
        go(u,2)
        # Hill options are gift first, supply second.
        tap(u,'RIGHT');tap(u,'RETURN');tap(u,'RETURN')
    app.event='SYNTHETIC CHECKPOINT'

def main(headless=False,screenshot=None,state_json=None,checkpoint=False):
    save_path=str((Path.cwd()/'save_100.json').resolve())
    import pyxel as p
    app=App(save_path)
    if checkpoint:demo(app)
    p.init(780,570,title='Traveling repairer lesson '+str(STAGE),fps=30,display_scale=1,quit_key=p.KEY_NONE,headless=headless)
    keys={k:getattr(p,'KEY_'+k) for k in KEYS}
    def update():
        if headless and p.frame_count>=5:
            app.draw(p)
            if screenshot:p.screen.save(screenshot,1)
            if state_json:Path(state_json).write_text(json.dumps({'stage':STAGE,'state':asdict(app.ui.s),'title':app.ui.title,'scope':'actual Linux headless Pyxel; synthetic controls'},ensure_ascii=False,indent=2)+'\n',encoding='utf-8')
            p.quit();return
        e=app.ui.feed(set() if headless else {k for k,v in keys.items() if p.btn(v)})
        if e:
            app.event=e
            if e=='quit':p.quit()
    p.run(update,lambda:app.draw(p))

if __name__=='__main__':
    import argparse
    parser=argparse.ArgumentParser(description='Standalone traveling repairer tutorial')
    parser.add_argument('--headless-smoke',action='store_true')
    parser.add_argument('--demo-checkpoint',action='store_true')
    parser.add_argument('--screenshot');parser.add_argument('--state-json')
    args=parser.parse_args()
    if (args.demo_checkpoint or args.screenshot or args.state_json) and not args.headless_smoke:parser.error('outputs/checkpoint require --headless-smoke')
    for field,suffix in (('screenshot','.png'),('state_json','.json')):
        value=getattr(args,field)
        if value is not None:
            target=Path(value).resolve()
            if target.suffix.lower()!=suffix or not target.parent.is_dir() or target.exists():parser.error('output must be a new '+suffix+' in an existing directory')
            setattr(args,field,str(target))
    main(args.headless_smoke,args.screenshot,args.state_json,args.demo_checkpoint)

# MIT License
# 
# Copyright (c) 2026
# 
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
# 
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
# 
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
# 
# Third-party exception: bitmap glyph data derived from Noto Sans CJK is licensed
# under the SIL Open Font License 1.1. See assets/NOTO-LICENSE.txt.

"""100 旅する修理屋 / 教材 3。"""
STAGE = 3

from dataclasses import dataclass, asdict, replace
from pathlib import Path
import json, hashlib
GAME='100_traveling_repairer'
VERSION=1
TITLES={'A':'川から始める','B':'森への便り','C':'鈴を届けたあと'}
TOWNS=('拠点','川町','丘町','森町')
GIFTS=('小瓶','小鈴','木札')
INITIAL={'A':(20,4,(2,3,3,2)),'B':(18,3,(3,2,3,2)),'C':(16,2,(2,2,2,3))}
METHODS={'gear':(2,1),'hand':(1,2),'rope':(1,2)}
@dataclass(frozen=True)
class State:
    case: str = 'A'
    transport: bool = True
    town: int = 0
    time: int = 20
    materials: int = 4
    fixed: tuple = ('','')
    visited: tuple = (True,False,False,False)
    offset: int = 2
    ended: bool = False
def new(case='A',transport=True):
    if case not in INITIAL or type(transport) is not bool:raise ValueError('invalid start')
    return State(case=case,transport=transport,time=INITIAL[case][0],materials=INITIAL[case][1])
def trial(s,mechanism,method):
    if mechanism!=0:raise ValueError('only the ferry is taught here')
    return {'passes':any(row[2] for row in ferry_trial(s.offset)),'frames':ferry_trial(s.offset)}
def roads(s):
 costs=INITIAL[s.case][2];r={(0,1):costs[0],(0,2):costs[1],(1,3):costs[2],(2,3):costs[3]}
 if s.transport:
  if s.fixed[0]:r[(1,2)]=1
  if s.fixed[1]:r[(0,3)]=1
 return r

def distance(s,a,b):return roads(s).get(tuple(sorted((a,b))))

def shortest(s,start=None):
 start=s.town if start is None else start;ds=[999]*4;ds[0]=0;paths=[() for _ in range(4)];paths[0]=(0,)
 for _ in range(4):
  for (a,b),cost in roads(s).items():
   for u,v in ((a,b),(b,a)):
    path=(v,)+paths[u]
    if ds[u]+cost<ds[v] or (ds[u]+cost==ds[v] and path<paths[v]):ds[v]=ds[u]+cost;paths[v]=path
 return ds[start],paths[start]

def ferry_trial(offset):return tuple((t%4,(t+offset)%4,t%4==0 and (t+offset)%4==0) for t in range(4))

def success(s):return s.ended and s.town==0 and any(s.fixed)
def repair_forecast(s,mechanism,method):
 if s.ended or mechanism not in (0,) or s.town!=(1 if mechanism==0 else 3):raise ValueError('ここでは、その修理はできません')
 if s.fixed[mechanism]:raise ValueError('この機構は修理済みです')
 if method not in (('gear','hand') if mechanism==0 else ('gear','rope')):raise ValueError('修理法が不正です')
 if not trial(s,mechanism,method)['passes']:raise ValueError('試運転で便が動くように調整してください')
 mat,time=METHODS[method]
 if s.materials<mat:raise ValueError('工具資材が足りません')
 fixed=list(s.fixed);fixed[mechanism]=method;future=replace(s,fixed=tuple(fixed));home,path=shortest(future)
 if s.time-time<home:raise ValueError('この修理後は帰りに'+str(home-(s.time-time))+'刻足りません')
 return {'materials':mat,'time':time,'remaining':s.time-time,'home':home,'path':path,'new_edge':(1,2) if mechanism==0 else (0,3),'opens':s.transport}
def step(s,a):
    a=tuple(a)
    if s.ended:raise ValueError('journey ended')
    if not a:raise ValueError('empty action')
    if a[0]=='move' and len(a)==2:
        dst=a[1]
        if type(dst) is not int or dst not in range(4):raise ValueError('invalid town')
        cost=distance(s,s.town,dst)
        if cost is None or s.time<cost:raise ValueError('no road or insufficient time')
        visited=list(s.visited);visited[dst]=True
        return replace(s,town=dst,time=s.time-cost,visited=tuple(visited))
    if a[0]=='offset' and len(a)==2:
        if s.town!=1 or s.fixed[0] or type(a[1]) is not int or a[1] not in range(4):raise ValueError('offset unavailable')
        return replace(s,offset=a[1])
    if a[0]=='repair' and len(a)==3:
        mechanism,method=a[1:]
        if type(mechanism) is not int:raise ValueError('invalid mechanism')
        f=repair_forecast(s,mechanism,method)
        fixed=list(s.fixed);fixed[mechanism]=method
        return replace(s,fixed=tuple(fixed),time=s.time-f['time'],materials=s.materials-f['materials'])
    if a==('finish',) and s.town==0:return replace(s,ended=True)
    raise ValueError('action unavailable')


KEYS={'SPACE','RETURN','X','P','H','R','M','UP','DOWN','LEFT','RIGHT','1','2','3','B','ESCAPE','TAB','Z'}
class Controller:
    def __init__(self,path=None):
        self.s=new();self.title=True;self.help=False;self.paused=False
        self.previous=set();self.gate=False;self.normalize()
    def normalize(self):
        self.view='map';self.destination=0 if self.s.town else 1
        self.choice=0;self.method='gear';self.dialog='';self.pending=None
        self.testing=False;self.test_frame=0;self.tested=None;self.notice=''
    def reset(self,case=None):
        self.s=new(case or self.s.case,getattr(self.s,'transport',True));self.normalize()
    def signature(self):return (self.s.town,self.method,getattr(self.s,'offset',2))
    def mechanism(self):return 0
    def options(self):
        out=[]
        if STAGE>=2 and self.s.town==1 and not getattr(self.s,'fixed',('',''))[0]:out.append(('TOOLS',('tools',)))
        if self.s.town==0:out.append(('FINISH',('finish',)))
        return out
    def apply(self,a):
        try:
            self.s=step(self.s,a);self.notice='';self.tested=None
            if a[0]=='move':self.view='town';self.destination=0 if self.s.town else 1;self.method='gear'
            if a[0]=='repair':self.view='map'
            return 'step:'+a[0]
        except ValueError as e:self.notice=str(e);return 'invalid'
    def preview(self,a):
        try:step(self.s,a);self.pending=a;self.dialog='action';return 'confirm:action'
        except ValueError as e:self.notice=str(e);return 'invalid:choice'
    def feed(self,down):
        down=set(down)&KEYS;fresh=down-self.previous;self.previous=down
        if self.testing and not (self.paused or self.help or self.dialog or self.title):
            self.test_frame+=1
            if self.test_frame>=120:
                self.testing=False;self.tested=self.signature();self.gate=True;return 'test:complete'
        if self.gate:
            if not down:self.gate=False
            return None
        if not fresh:return None
        self.gate=True
        if len(down)>1:return 'ignored:chord'
        k=next(iter(fresh));self.notice=''
        if self.dialog:
            if k in ('X','ESCAPE'):self.dialog='';self.pending=None;return 'cancel'
            if k=='RETURN':
                d=self.dialog;self.dialog=''
                if d=='quit':return 'quit'
                if d=='retry':self.reset();return 'reset'
                if d=='menu':self.title=True;return 'menu'
                if d=='action':a=self.pending;self.pending=None;return self.apply(a)
            return 'ignored:dialog'
        if k=='ESCAPE':self.dialog='quit';return 'confirm:quit'
        if k=='H':self.help=not self.help;return 'help'
        if self.help:return 'ignored:help'
        if self.title:
            if k in ('1','2','3'):self.reset('ABC'[int(k)-1]);return 'case'
            if STAGE>=3 and k=='B':self.s=new(self.s.case,not self.s.transport);self.normalize();return 'variant'
            if k in ('SPACE','RETURN'):self.title=False;return 'start'
            return 'ignored:title'
        if k=='P':self.paused=not self.paused;return 'pause'
        if self.paused:return 'ignored:pause'
        if self.testing:return 'ignored:test'
        if k=='R':self.dialog='retry';return 'confirm:retry'
        if k=='M':self.dialog='menu';return 'confirm:menu'
        if self.s.ended:return 'ignored:result'
        available=STAGE>=2 and self.s.town==1 and not getattr(self.s,'fixed',('',''))[0]
        if k=='TAB':
            views=('map','town','tools') if available else ('map','town')
            self.view=views[(views.index(self.view)+1)%len(views)] if self.view in views else 'map';return 'view'
        if k=='Z' and available:self.view='tools';return 'tools'
        if self.view=='map':
            if k in ('LEFT','RIGHT'):self.destination=(self.destination+(-1 if k=='LEFT' else 1))%4;return 'select-destination'
            if k=='RETURN':return self.preview(('move',self.destination))
        elif self.view=='town':
            if k=='RETURN' and self.options():
                a=self.options()[0][1]
                if a==('tools',):self.view='tools';return 'tools'
                return self.preview(a)
        else:
            if STAGE>=3 and k in ('LEFT','RIGHT'):self.method='hand' if self.method=='gear' else 'gear';self.tested=None;return 'select-method'
            if k in ('UP','DOWN'):return self.apply(('offset',(self.s.offset+(1 if k=='UP' else -1))%4))
            if k=='RETURN':
                if STAGE>=3 and self.tested==self.signature() and any(t[2] for t in ferry_trial(self.s.offset)):return self.preview(('repair',0,self.method))
                self.testing=True;self.test_frame=0;self.tested=None;return 'test:start'
        return 'ignored:key'

# ASCII teaching view. Controllers alone decide whether an input is committed.
NAMES=('H HOME','R RIVER','K HILL','F FOREST')
GIFT_NAMES=('JAR','BELL','TAG')
POINTS=((65,208),(223,110),(223,305),(393,208))
def tap(ui,key):
    ui.feed(set());event=ui.feed({key});ui.feed(set());return event

def go(ui,destination):
    while ui.view!='map':tap(ui,'TAB')
    for _ in range((destination-ui.destination)%4):tap(ui,'RIGHT')
    first=tap(ui,'RETURN')
    if first!='confirm:action':raise ValueError(first+': '+ui.notice)
    return tap(ui,'RETURN')

def run_trial(ui):
    tap(ui,'RETURN')
    for _ in range(120):ui.feed(set())
    ui.feed(set())
    if ui.testing:raise AssertionError('trial did not finish')

class App:
    def __init__(self,save_path='save_100.json'):
        self.ui=Controller(save_path);self.event='READY'
    def draw(self,p):
        u=self.ui;s=u.s;p.cls(1)
        p.text(16,12,'TRAVELING REPAIRER / STAGE '+str(STAGE)+' / CASE '+s.case,10)
        p.text(16,30,'CURRENT '+NAMES[s.town]+'  TIME '+str(s.time)+'  MATERIALS '+str(getattr(s,'materials','-')),11)
        p.text(440,30,'INITIAL ROADS / NO REPAIRS YET' if STAGE<3 else 'TRAVEL EDGES '+('OPEN AFTER REPAIR' if s.transport else 'COMPARISON: INITIAL ROADS ONLY'),6)
        p.text(16,49,'VIEW '+u.view.upper()+(' / CHOOSING DOES NOT USE TRAVEL TIME' if STAGE==1 else ' / CHOOSING AND FREE TESTS DO NOT USE TRAVEL TIME'),7)
        if u.view=='tools' and not s.ended:
            p.rectb(16,70,430,305,5)
            mech=u.mechanism();p.text(30,86,'FERRY' if mech==0 else 'FOREST ROPE' if u.method=='rope' else 'FOREST GEARS',10)
            if mech==0:
                frames=ferry_trial(s.offset);phase=min(3,u.test_frame//30) if u.testing or u.tested else 0
                p.text(30,108,'OFFSET '+str(s.offset)+' / UP DOWN: 0..3',7)
                for i,(left,right,aligned) in enumerate(frames):
                    y=142+i*36
                    if i==phase:p.rect(25,y-5,406,28,5)
                    p.text(34,y,'PHASE '+str(i)+'  LEFT '+str(left)+'  RIGHT '+str(right)+'  '+('DEPART' if aligned else 'WAIT'),10 if aligned else 7)
                p.text(30,305,'THE FOUR ROWS ARE A FREE MECHANISM TEST',6)
                p.text(30,322,'THEY ARE NOT FOUR TRAVEL-TIME CHARGES',6)
            elif u.method=='rope':
                p.line(75,298,380,135,6);p.line(75,304,380,141,6)
                p.rect(195,280-s.stop*57,44,20,9);p.rect(245,225,130,6,4)
                p.text(30,108,'STOP '+str(s.stop)+' / UP DOWN: 0..2',7)
                p.text(256,243,'PIER = STOP 1',10)
                p.text(30,338,'PASS ONLY WHEN THE LOAD STOPS AT 1',6)
            else:
                result=gear_trial(s.edges);coords=((95,218),(230,144),(365,218))
                for i,(a,b) in enumerate(((0,1),(1,2),(0,2))):
                    x,y=coords[a];xx,yy=coords[b];p.line(x,y,xx,yy,10 if s.edges&(1<<i) else 5)
                    p.text((x+xx)//2,(y+yy)//2-12,str(i+1),7)
                for i,(x,y) in enumerate(coords):
                    p.circ(x,y,22,9);p.circ(x,y,13,1)
                    p.text(x-17,y+32,('D','A','LOAD')[i]+' '+{1:'+1',-1:'-1',0:'STOP'}[result['signs'][i]],7)
                p.text(30,108,'MASK '+str(s.edges)+' / 1 2 3: TOGGLE EDGES',7)
                p.text(30,300,'ODD CYCLE: STOP' if result['conflict'] else 'LOAD -1: PASS' if result['passes'] else 'NOT READY: LOAD MUST BE -1',8 if result['conflict'] else 10)
                p.text(30,338,'SIGNS SHOW CONSTRAINTS, NOT TRAVEL SPEED',6)
        else:
            p.rectb(16,70,430,305,5)
            for (a,b),cost in roads(s).items():
                x,y=POINTS[a];xx,yy=POINTS[b];c=10 if (a,b) in ((1,2),(0,3)) else 6
                p.line(x,y,xx,yy,c);mx=(x+xx)//2;my=(y+yy)//2
                if (a,b)==(1,2):my-=35
                if (a,b)==(0,3):mx+=45
                p.rect(mx-10,my-8,20,17,1);p.text(mx-2,my-2,str(cost),c)
            for i,(x,y) in enumerate(POINTS):
                p.circ(x,y,17,3 if s.visited[i] else 5);p.text(x-2,y-2,'HRKF'[i],7)
                if i==s.town:p.circb(x,y,22,10)
                if u.view=='map' and i==u.destination and not s.ended:p.rectb(x-27,y-27,55,55,7)
                p.text(x-22,y+34,('HOME','RIVER','HILL','FOREST')[i],7)
            p.text(30,353,'INITIAL ROADS / COST SHOWN ON EACH EDGE' if STAGE<3 else 'YELLOW EDGE = OPEN REPAIR ROUTE, BOTH DIRECTIONS',6)
        x=470;p.text(x,78,'CURRENT LEDGER',10)
        home,path=shortest(s);p.text(x,98,'HOME COST '+str(home)+'  PATH '+'>'.join('HRKF'[n] for n in path),11)
        if s.time<home:p.text(x,117,'WARNING: NOT ENOUGH TIME TO RETURN',8)
        if STAGE>=3:p.text(x,136,'FIXED '+str(s.fixed),7)
        if STAGE>=4:
            carried=[i for i,v in enumerate(s.gifts) if v==-1]
            p.text(x,158,'BAG '+('/'.join(GIFT_NAMES[i] for i in carried) or 'EMPTY')+' / 2 SLOTS',7)
            p.text(x,180,'GIFT LOCATIONS: -1 = BAG',6)
            for i,g in enumerate(s.gifts):p.text(x,198+i*16,GIFT_NAMES[i]+': '+('BAG' if g==-1 else NAMES[g]),7)
            p.text(x,250,'SUPPLY TAKEN '+str(s.supplied),7)
            p.text(x,270,'TOWN LIFE: '+(','.join(('FISH','PLANTS','BELL')[i] for i in s.life) or 'NONE'),11)
        if STAGE==5:p.text(x,297,'HISTORY '+str(len(s.history))+' DECISIONS',6)
        if s.ended:
            result='SUCCESS' if STAGE>=3 and success(s) else 'SCOUTING / NO REPAIR' if STAGE>=3 else 'TRAINING TOUR ENDED'
            p.text(16,397,'RESULT: '+result,10)
        elif u.view=='map':
            cost=distance(s,s.town,u.destination)
            p.text(16,397,'DESTINATION '+NAMES[u.destination]+' / COST '+str(cost)+' / LEFT RIGHT THEN ENTER',10)
        elif u.view=='town':
            options=u.options();a=options[u.choice%len(options)][1] if options else ()
            p.text(16,397,'TOWN ACTION '+str(a)+' / LEFT RIGHT THEN ENTER' if options else 'NO TOWN ACTION / TAB TO MAP',10)
            if STAGE>=4 and len([g for g in s.gifts if g==-1])==2:
                bag=[i for i,g in enumerate(s.gifts) if g==-1]
                p.text(16,416,'SWAP: LEAVE '+GIFT_NAMES[bag[u.old%2]]+' HERE / UP DOWN SELECT',7)
        else:
            passed=any(row[2] for row in ferry_trial(s.offset)) if STAGE<4 else trial(s,u.mechanism(),u.method)['passes']
            status='TEST '+str(u.test_frame)+'/120 FEEDS' if u.testing else ('TEST DONE: '+('PASS' if passed else 'FAIL') if u.tested==u.signature() else 'ENTER STARTS FREE TEST')
            p.text(16,397,status+' / TRAVEL TIME UNCHANGED',10)
            if STAGE>=3:
                mat,time=METHODS[u.method];p.text(16,416,'METHOD '+u.method.upper()+' / MATERIALS '+str(mat)+' / TIME '+str(time)+' / LEFT RIGHT CHANGE',7)
                p.text(16,435,'AFTER PASS: RELEASE, ENTER PREVIEW, RELEASE, ENTER COMMIT',6)
            else:p.text(16,416,'STAGE 02: TEST ONLY / NO REPAIR COMMIT YET',6)
        if u.notice:
            reason='SAVED' if self.event=='save' else 'LOADED' if self.event=='load' else 'ACTION/IO REJECTED'
            for token,label in (('帰り','RETURN RESERVE TOO LOW'),('資材','NOT ENOUGH MATERIALS'),('試運転','ADJUST AND RETEST'),('その二町','NO DIRECT ROAD'),('時間','NOT ENOUGH TRAVEL TIME'),('丘の工具','SUPPLY ALREADY TAKEN'),('保存を変更','SAVE/LOAD FAILED; STATE KEPT')):
                if token in u.notice:reason=label
            p.text(470,333,'NOTICE: '+reason,8)
        p.text(16,462,'TAB MAP/TOWN / ENTER PREVIEW THEN CONFIRM' if STAGE==1 else 'TAB MAP/TOWN/TOOLS / Z TOOLS / ENTER PREVIEW THEN CONFIRM',7)
        p.text(16,480,'H HELP / P PAUSE / R RETRY / M TITLE / ESC QUIT / X CANCEL DIALOG',6)
        p.text(16,498,'X UNDO / S SAVE / L LOAD (STAGE 05) / RELEASE EVERY KEY',6)
        p.text(16,516,'R RESETS STATE ONLY. SAVE CODE, QUIT, AND RERUN AFTER EDITS.',6)
        p.text(16,540,'LAST INPUT '+self.event[:100],10)
        if u.title or u.help:
            p.rect(32,66,716,379,1);p.rectb(32,66,716,379,10)
            lines=['TRAVELING REPAIRER / STAGE '+str(STAGE),'TITLE: 1 2 3 CASE / B COMPARISON (03+) / SPACE START',
                   'MAP: LEFT RIGHT DESTINATION / ENTER PREVIEW / ENTER COMMIT',
                   'TOWN: LEFT RIGHT ACTION / ENTER PREVIEW / ENTER COMMIT',
                   'TAB MAP/TOWN / NO TOOLS IN STAGE 01' if STAGE==1 else 'TAB CHANGES VIEW / Z OPENS AN UNREPAIRED MECHANISM',
                   'TOOLS: UP DOWN PHASE OR STOP / LEFT RIGHT METHOD (03+)',
                   'FOREST GEARS: 1 2 3 TOGGLE EDGES (04+)',
                   'FREE MECHANISM TESTS ARRIVE IN STAGE 02' if STAGE==1 else 'ENTER FREE TEST: 120 UNPAUSED FEEDS, 4 DISPLAY PHASES',
                   'REPAIR COMMIT ARRIVES IN STAGE 03' if STAGE<3 else 'AFTER PASS: RELEASE / ENTER PREVIEW / RELEASE / ENTER COMMIT',
                   'H CLOSES HELP / P PAUSES / R M ESC REQUIRE CONFIRMATION',
                   'X CANCELS A DIALOG / X UNDO, S SAVE, L LOAD (05)',
                   'EDITS AND TESTS ARE FREE; MOVES AND REPAIRS USE TIME',
                   'CURRENT CASE '+s.case+' / '+('OPEN TRAVEL EDGES' if getattr(s,'transport',True) else 'LIFE ONLY COMPARISON')]
            for i,line in enumerate(lines):p.text(50,86+i*27,line,10 if i in (0,12) else 7)
        if u.paused:
            p.rect(60,165,660,135,1);p.rectb(60,165,660,135,10)
            p.text(83,191,'PAUSED / P RESUMES / RELEASE ALL KEYS FIRST',10)
            p.text(83,229,'TRIAL CLOCK AND TRAVEL TIME ARE STOPPED',7)
        if u.dialog:
            p.rect(48,88,684,339,1);p.rectb(48,88,684,339,10)
            lines=['CONFIRM '+u.dialog.upper(),'ENTER ACCEPT / X CANCEL / RELEASE BETWEEN EVERY PRESS']
            if u.dialog=='action':
                future=step(s,u.pending);return_cost,route=shortest(future)
                lines=['PENDING ACTION '+str(u.pending),'CURRENT: TIME '+str(s.time)+' MATERIALS '+str(getattr(s,'materials','-')),
                       'AFTER CONFIRM: TIME '+str(future.time)+' MATERIALS '+str(getattr(future,'materials','-')),
                       'AFTER CONFIRM HOME: '+str(return_cost)+' VIA '+'>'.join('HRKF'[n] for n in route)]
                if STAGE>=4 and u.pending[0]=='gift':lines.append('AFTER CONFIRM GIFT LOCATIONS '+str(future.gifts)+' (-1 = BAG)')
                if u.pending[0]=='move' and future.time<return_cost:lines.append('WARNING: RETURN TIME IS SHORT; UNDO IN STAGE 05')
                if u.pending[0]=='repair':lines.append('AFTER CONFIRM ROAD OPENS' if future.transport else 'COMPARISON: LIFE CHANGES, NO EXTRA TRAVEL EDGE')
                lines+=['PREVIEW ONLY: CURRENT STATE HAS NOT CHANGED','RELEASE / ENTER ONCE TO COMMIT / X CANCEL']
            for i,line in enumerate(lines):p.text(70,112+i*35,line,10 if i in (0,len(lines)-1) else 7)

def demo(app):
    u=app.ui;tap(u,'SPACE');go(u,1)
    if STAGE>=2:
        tap(u,'Z');tap(u,'DOWN');tap(u,'DOWN');run_trial(u)
    if STAGE>=3:
        tap(u,'RETURN');tap(u,'RETURN')
    if STAGE>=4:
        go(u,2)
        # Hill options are gift first, supply second.
        tap(u,'RIGHT');tap(u,'RETURN');tap(u,'RETURN')
    app.event='SYNTHETIC CHECKPOINT'

def main(headless=False,screenshot=None,state_json=None,checkpoint=False):
    save_path=str((Path.cwd()/'save_100.json').resolve())
    import pyxel as p
    app=App(save_path)
    if checkpoint:demo(app)
    p.init(780,570,title='Traveling repairer lesson '+str(STAGE),fps=30,display_scale=1,quit_key=p.KEY_NONE,headless=headless)
    keys={k:getattr(p,'KEY_'+k) for k in KEYS}
    def update():
        if headless and p.frame_count>=5:
            app.draw(p)
            if screenshot:p.screen.save(screenshot,1)
            if state_json:Path(state_json).write_text(json.dumps({'stage':STAGE,'state':asdict(app.ui.s),'title':app.ui.title,'scope':'actual Linux headless Pyxel; synthetic controls'},ensure_ascii=False,indent=2)+'\n',encoding='utf-8')
            p.quit();return
        e=app.ui.feed(set() if headless else {k for k,v in keys.items() if p.btn(v)})
        if e:
            app.event=e
            if e=='quit':p.quit()
    p.run(update,lambda:app.draw(p))

if __name__=='__main__':
    import argparse
    parser=argparse.ArgumentParser(description='Standalone traveling repairer tutorial')
    parser.add_argument('--headless-smoke',action='store_true')
    parser.add_argument('--demo-checkpoint',action='store_true')
    parser.add_argument('--screenshot');parser.add_argument('--state-json')
    args=parser.parse_args()
    if (args.demo_checkpoint or args.screenshot or args.state_json) and not args.headless_smoke:parser.error('outputs/checkpoint require --headless-smoke')
    for field,suffix in (('screenshot','.png'),('state_json','.json')):
        value=getattr(args,field)
        if value is not None:
            target=Path(value).resolve()
            if target.suffix.lower()!=suffix or not target.parent.is_dir() or target.exists():parser.error('output must be a new '+suffix+' in an existing directory')
            setattr(args,field,str(target))
    main(args.headless_smoke,args.screenshot,args.state_json,args.demo_checkpoint)

# MIT License
# 
# Copyright (c) 2026
# 
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
# 
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
# 
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
# 
# Third-party exception: bitmap glyph data derived from Noto Sans CJK is licensed
# under the SIL Open Font License 1.1. See assets/NOTO-LICENSE.txt.

"""100 旅する修理屋 / 教材 4。"""
STAGE = 4

from dataclasses import dataclass, asdict, replace
from pathlib import Path
import json, hashlib
GAME='100_traveling_repairer'
VERSION=1
TITLES={'A':'川から始める','B':'森への便り','C':'鈴を届けたあと'}
TOWNS=('拠点','川町','丘町','森町')
GIFTS=('小瓶','小鈴','木札')
INITIAL={'A':(20,4,(2,3,3,2)),'B':(18,3,(3,2,3,2)),'C':(16,2,(2,2,2,3))}
METHODS={'gear':(2,1),'hand':(1,2),'rope':(1,2)}
@dataclass(frozen=True)
class State:
 case:str='A'; transport:bool=True; town:int=0; time:int=20; materials:int=4
 fixed:tuple=('',''); visited:tuple=(True,False,False,False); gifts:tuple=(1,2,3)
 supplied:bool=False; life:tuple=(); offset:int=2; edges:int=3; stop:int=0
 ended:bool=False; history:tuple=(); last:tuple=('止まった道を、次の旅に。',)

def new(case='A',transport=True):
 if case not in TITLES or type(transport) is not bool:raise ValueError('旅支度が不正です')
 t,m,_=INITIAL[case];return State(case=case,transport=transport,time=t,materials=m)

def roads(s):
 costs=INITIAL[s.case][2];r={(0,1):costs[0],(0,2):costs[1],(1,3):costs[2],(2,3):costs[3]}
 if s.transport:
  if s.fixed[0]:r[(1,2)]=1
  if s.fixed[1]:r[(0,3)]=1
 return r

def distance(s,a,b):return roads(s).get(tuple(sorted((a,b))))

def shortest(s,start=None):
 start=s.town if start is None else start;ds=[999]*4;ds[0]=0;paths=[() for _ in range(4)];paths[0]=(0,)
 for _ in range(4):
  for (a,b),cost in roads(s).items():
   for u,v in ((a,b),(b,a)):
    path=(v,)+paths[u]
    if ds[u]+cost<ds[v] or (ds[u]+cost==ds[v] and path<paths[v]):ds[v]=ds[u]+cost;paths[v]=path
 return ds[start],paths[start]

def ferry_trial(offset):return tuple((t%4,(t+offset)%4,t%4==0 and (t+offset)%4==0) for t in range(4))

def gear_trial(mask):
 signs={0:1};edges=[(0,1),(1,2),(0,2)];changed=True;conflict=False
 while changed:
  changed=False
  for i,(a,b) in enumerate(edges):
   if not mask&(1<<i):continue
   if a in signs and b in signs:
    if signs[a]!=-signs[b]:conflict=True
   elif a in signs:signs[b]=-signs[a];changed=True
   elif b in signs:signs[a]=-signs[b];changed=True
 return {'signs':tuple(signs.get(i,0) for i in range(3)),'conflict':conflict,'passes':not conflict and signs.get(2)==-1}

def trial(s,mechanism,method):
 if mechanism==0:return {'passes':any(t[2] for t in ferry_trial(s.offset)),'frames':ferry_trial(s.offset)}
 if method=='rope':return {'passes':s.stop==1,'stop':s.stop}
 return gear_trial(s.edges)

def repair_forecast(s,mechanism,method):
 if s.ended or mechanism not in (0,1) or s.town!=(1 if mechanism==0 else 3):raise ValueError('ここでは、その修理はできません')
 if s.fixed[mechanism]:raise ValueError('この機構は修理済みです')
 if method not in (('gear','hand') if mechanism==0 else ('gear','rope')):raise ValueError('修理法が不正です')
 if not trial(s,mechanism,method)['passes']:raise ValueError('試運転で便が動くように調整してください')
 mat,time=METHODS[method]
 if s.materials<mat:raise ValueError('工具資材が足りません')
 fixed=list(s.fixed);fixed[mechanism]=method;future=replace(s,fixed=tuple(fixed));home,path=shortest(future)
 if s.time-time<home:raise ValueError('この修理後は帰りに'+str(home-(s.time-time))+'刻足りません')
 return {'materials':mat,'time':time,'remaining':s.time-time,'home':home,'path':path,'new_edge':(1,2) if mechanism==0 else (0,3),'opens':s.transport}

def success(s):return s.ended and s.town==0 and any(s.fixed)

def step(s,a):
 a=tuple(a)
 if s.ended:raise ValueError('旅は終わっています。Xで一決定戻せます')
 if not a or type(a[0]) is not str:raise ValueError('操作が不正です')
 t=s;kind=a[0];msg=()
 if kind=='move' and len(a)==2:
  dst=a[1]
  if type(dst) is not int or dst not in range(4):raise ValueError('行き先が不正です')
  cost=distance(s,s.town,dst)
  if cost is None:raise ValueError('その二町を直接つなぐ道はありません')
  if s.time<cost:raise ValueError('移動の時間が足りません')
  visited=list(s.visited);visited[dst]=True;t=replace(s,town=dst,time=s.time-cost,visited=tuple(visited));msg=(TOWNS[s.town]+'から'+TOWNS[dst]+'へ '+str(cost)+'刻。','帰り道の最短所要 '+str(shortest(t)[0])+'刻。')
 elif kind=='repair' and len(a)==3:
  mech,method=a[1:]
  if type(mech) is not int:raise ValueError('機構番号が不正です')
  f=repair_forecast(s,mech,method);fixed=list(s.fixed);fixed[mech]=method
  life=tuple(k for k,p in enumerate((bool(fixed[0]),bool(fixed[1]),all(fixed))) if p)
  t=replace(s,fixed=tuple(fixed),time=s.time-f['time'],materials=s.materials-f['materials'],life=life)
  msg=(('渡し' if mech==0 else '索道')+'が動きました。資材 -'+str(f['materials'])+' / 旅 -'+str(f['time'])+'刻。',('新しい便を、次の移動に選べます。' if s.transport else '比較版: 町の荷物は動きますが、旅の道は増えません。'))
 elif kind=='supply' and len(a)==1:
  if s.town!=2 or s.supplied:raise ValueError('丘の工具は一度だけ受け取れます')
  t=replace(s,supplied=True,materials=s.materials+1);msg=('丘町の工房から、工具資材を１つ。','お礼は一度だけ。無料で受け取れます。')
 elif kind=='gift' and len(a)==3:
  item,old=a[1:]
  if type(item) is not int or item not in range(3) or s.gifts[item]!=s.town:raise ValueError('この町には、その品はありません')
  carried=[i for i,x in enumerate(s.gifts) if x==-1];g=list(s.gifts)
  if len(carried)==2:
   if type(old) is not int or old not in carried:raise ValueError('持帰りは２枠。置く一品を選んでください')
   g[old]=s.town
  elif old!=-1:raise ValueError('空き枠があるので、交換は不要です')
  g[item]=-1;t=replace(s,gifts=tuple(g));msg=(GIFTS[item]+'を、旅のかばんへ。',('置いた'+GIFTS[old]+'はこの町に残ります。' if len(carried)==2 else '品に能力や点数はありません。景色の記憶です。'))
 elif kind in ('offset','edges','stop') and len(a)==2:
  limit={'offset':4,'edges':8,'stop':3}[kind]
  if type(a[1]) is not int or a[1] not in range(limit):raise ValueError('機構の調整値が不正です')
  if s.town!=(1 if kind=='offset' else 3) or s.fixed[0 if kind=='offset' else 1]:raise ValueError('調整は未修理の町で行います')
  t=replace(s,**{kind:a[1]});msg=('調整は無料です。旅時間と資材は減りません。',)
 elif kind=='finish' and len(a)==1:
  if s.town!=0:raise ValueError('旅を終えるのは拠点です')
  t=replace(s,ended=True);msg=('おかえり。直した道と、選んだ二品。','町の暮らしに、旅の足あとが残りました。' if any(s.fixed) else '今回は下見の旅。修理のない記録も残せます。')
 else:raise ValueError('この操作は今できません')
 return replace(t,history=s.history+(a,),last=msg)

from pathlib import Path
KEYS={'SPACE','RETURN','Z','X','P','H','R','M','UP','DOWN','LEFT','RIGHT','1','2','3','B','F12','ESCAPE','TAB','S','L'}
class Controller:
 def __init__(self,path=None):
  self.s=new();self.title=True;self.help=False;self.paused=False;self.dialog='';self.previous=set();self.gate=False;self.view='map';self.destination=1;self.choice=0;self.method='gear';self.old=0;self.pending=None;self.notice='';self.testing=False;self.test_frame=0;self.tested=None;self.path=Path(path) if path else Path(__file__).parent/'save.json'
 def normalize(self):
  self.view='map';self.destination=0 if self.s.town else 1;self.choice=0;self.method='gear';self.old=0;self.dialog='';self.pending=None;self.testing=False;self.tested=None;self.test_frame=0;self.notice=''
 def reset(self,case=None):
  self.s=new(case or self.s.case,self.s.transport);self.normalize()
 def mechanism(self):return 0 if self.s.town==1 else 1
 def signature(self):return (self.s.town,self.method,self.s.offset,self.s.edges,self.s.stop)
 def options(self):
  s=self.s;out=[]
  if s.town in (1,3) and not s.fixed[self.mechanism()]:out.append(('機構を調べる',('tools',)))
  for i,x in enumerate(s.gifts):
   if x==s.town:out.append((GIFTS[i]+'を持帰る',('gift',i)))
  if s.town==2 and not s.supplied:out.append(('工具を１つ受取る',('supply',)))
  if s.town==0:out.append(('旅を終える',('finish',)))
  return out
 def apply(self,a):
  try:
   self.s=step(self.s,a);self.choice=0;self.notice='';self.tested=None
   if a[0]=='move':self.view='town';self.destination=0 if self.s.town else 1;self.method='gear'
   if a[0]=='repair':self.view='map'
   return 'step:'+a[0]
  except ValueError as e:self.notice=str(e);return 'invalid'
 def preview(self,a):
  try:step(self.s,a);self.pending=a;self.dialog='action';return 'confirm:action'
  except ValueError as e:self.notice=str(e);return 'invalid:choice'
 def feed(self,down):
  down=set(down)&KEYS;fresh=down-self.previous;self.previous=down
  if self.testing and not (self.paused or self.help or self.dialog or self.title):
   self.test_frame+=1
   if self.test_frame>=120:self.testing=False;self.tested=self.signature();self.gate=True;return 'test:complete'
  if self.gate:
   if not down:self.gate=False
   return None
  if not fresh:return None
  self.gate=True
  if len(down)>1:return 'ignored:chord'
  k=next(iter(fresh));self.notice=''
  if k=='F12':return 'screenshot'
  if self.dialog:
   if k in ('X','ESCAPE'):self.dialog='';self.pending=None;return 'cancel'
   if k=='RETURN':
    d=self.dialog;self.dialog=''
    if d=='quit':return 'quit'
    if d=='action':a=self.pending;self.pending=None;return self.apply(a)
    if d=='retry':self.reset();return 'reset'
    if d=='menu':self.title=True;return 'menu'
   return 'ignored:dialog'
  if k=='ESCAPE':self.dialog='quit';return 'confirm:quit'
  if k=='H':self.help=not self.help;return 'help'
  if self.help:return 'ignored:help'
  if self.title:
   if k in ('1','2','3'):self.reset('ABC'[int(k)-1]);return 'case'
   if k=='B':self.s=new(self.s.case,not self.s.transport);self.normalize();return 'variant'
   if k in ('SPACE','RETURN'):self.title=False;return 'start'
   return 'ignored:title'
  if k=='P':self.paused=not self.paused;return 'pause'
  if self.paused:return 'ignored:pause'
  if self.testing:return 'ignored:test'
  if k=='R':self.dialog='retry';return 'confirm:retry'
  if k=='M':self.dialog='menu';return 'confirm:menu'
  if self.s.ended:return 'ignored:result'
  if k=='TAB':
   views=('map','town','tools') if self.s.town in (1,3) and not self.s.fixed[self.mechanism()] else ('map','town');self.view=views[(views.index(self.view)+1)%len(views)] if self.view in views else 'map';return 'view'
  if k=='Z' and self.s.town in (1,3) and not self.s.fixed[self.mechanism()]:self.view='tools';return 'tools'
  if self.view=='map':
   if k in ('LEFT','RIGHT'):self.destination=(self.destination+(-1 if k=='LEFT' else 1))%4;return 'select-destination'
   if k=='RETURN':return self.preview(('move',self.destination))
  elif self.view=='town':
   opts=self.options()
   if k in ('LEFT','RIGHT') and opts:self.choice=(self.choice+(-1 if k=='LEFT' else 1))%len(opts);return 'select-town'
   if k in ('UP','DOWN'):self.old=1-self.old;return 'select-replacement'
   if k=='RETURN' and opts:
    a=opts[self.choice%len(opts)][1]
    if a[0]=='tools':self.view='tools';return 'tools'
    if a[0]=='gift':carried=[i for i,x in enumerate(self.s.gifts) if x==-1];a=(*a,carried[self.old%2] if len(carried)==2 else -1)
    return self.preview(a)
  else:
   mech=self.mechanism()
   if k in ('LEFT','RIGHT'):self.method=('hand' if mech==0 else 'rope') if self.method=='gear' else 'gear';self.tested=None;return 'select-method'
   if k in ('UP','DOWN'):
    field='offset' if mech==0 else 'stop';n=getattr(self.s,field);return self.apply((field,(n+(1 if k=='UP' else -1))%(4 if mech==0 else 3)))
   if k in ('1','2','3') and mech==1 and self.method=='gear':return self.apply(('edges',self.s.edges^(1<<(int(k)-1))))
   if k=='RETURN':
    if self.tested==self.signature() and trial(self.s,mech,self.method)['passes']:return self.preview(('repair',mech,self.method))
    self.testing=True;self.test_frame=0;self.tested=None;return 'test:start'
  return 'ignored:key'

# ASCII teaching view. Controllers alone decide whether an input is committed.
NAMES=('H HOME','R RIVER','K HILL','F FOREST')
GIFT_NAMES=('JAR','BELL','TAG')
POINTS=((65,208),(223,110),(223,305),(393,208))
def tap(ui,key):
    ui.feed(set());event=ui.feed({key});ui.feed(set());return event

def go(ui,destination):
    while ui.view!='map':tap(ui,'TAB')
    for _ in range((destination-ui.destination)%4):tap(ui,'RIGHT')
    first=tap(ui,'RETURN')
    if first!='confirm:action':raise ValueError(first+': '+ui.notice)
    return tap(ui,'RETURN')

def run_trial(ui):
    tap(ui,'RETURN')
    for _ in range(120):ui.feed(set())
    ui.feed(set())
    if ui.testing:raise AssertionError('trial did not finish')

class App:
    def __init__(self,save_path='save_100.json'):
        self.ui=Controller(save_path);self.event='READY'
    def draw(self,p):
        u=self.ui;s=u.s;p.cls(1)
        p.text(16,12,'TRAVELING REPAIRER / STAGE '+str(STAGE)+' / CASE '+s.case,10)
        p.text(16,30,'CURRENT '+NAMES[s.town]+'  TIME '+str(s.time)+'  MATERIALS '+str(getattr(s,'materials','-')),11)
        p.text(440,30,'INITIAL ROADS / NO REPAIRS YET' if STAGE<3 else 'TRAVEL EDGES '+('OPEN AFTER REPAIR' if s.transport else 'COMPARISON: INITIAL ROADS ONLY'),6)
        p.text(16,49,'VIEW '+u.view.upper()+(' / CHOOSING DOES NOT USE TRAVEL TIME' if STAGE==1 else ' / CHOOSING AND FREE TESTS DO NOT USE TRAVEL TIME'),7)
        if u.view=='tools' and not s.ended:
            p.rectb(16,70,430,305,5)
            mech=u.mechanism();p.text(30,86,'FERRY' if mech==0 else 'FOREST ROPE' if u.method=='rope' else 'FOREST GEARS',10)
            if mech==0:
                frames=ferry_trial(s.offset);phase=min(3,u.test_frame//30) if u.testing or u.tested else 0
                p.text(30,108,'OFFSET '+str(s.offset)+' / UP DOWN: 0..3',7)
                for i,(left,right,aligned) in enumerate(frames):
                    y=142+i*36
                    if i==phase:p.rect(25,y-5,406,28,5)
                    p.text(34,y,'PHASE '+str(i)+'  LEFT '+str(left)+'  RIGHT '+str(right)+'  '+('DEPART' if aligned else 'WAIT'),10 if aligned else 7)
                p.text(30,305,'THE FOUR ROWS ARE A FREE MECHANISM TEST',6)
                p.text(30,322,'THEY ARE NOT FOUR TRAVEL-TIME CHARGES',6)
            elif u.method=='rope':
                p.line(75,298,380,135,6);p.line(75,304,380,141,6)
                p.rect(195,280-s.stop*57,44,20,9);p.rect(245,225,130,6,4)
                p.text(30,108,'STOP '+str(s.stop)+' / UP DOWN: 0..2',7)
                p.text(256,243,'PIER = STOP 1',10)
                p.text(30,338,'PASS ONLY WHEN THE LOAD STOPS AT 1',6)
            else:
                result=gear_trial(s.edges);coords=((95,218),(230,144),(365,218))
                for i,(a,b) in enumerate(((0,1),(1,2),(0,2))):
                    x,y=coords[a];xx,yy=coords[b];p.line(x,y,xx,yy,10 if s.edges&(1<<i) else 5)
                    p.text((x+xx)//2,(y+yy)//2-12,str(i+1),7)
                for i,(x,y) in enumerate(coords):
                    p.circ(x,y,22,9);p.circ(x,y,13,1)
                    p.text(x-17,y+32,('D','A','LOAD')[i]+' '+{1:'+1',-1:'-1',0:'STOP'}[result['signs'][i]],7)
                p.text(30,108,'MASK '+str(s.edges)+' / 1 2 3: TOGGLE EDGES',7)
                p.text(30,300,'ODD CYCLE: STOP' if result['conflict'] else 'LOAD -1: PASS' if result['passes'] else 'NOT READY: LOAD MUST BE -1',8 if result['conflict'] else 10)
                p.text(30,338,'SIGNS SHOW CONSTRAINTS, NOT TRAVEL SPEED',6)
        else:
            p.rectb(16,70,430,305,5)
            for (a,b),cost in roads(s).items():
                x,y=POINTS[a];xx,yy=POINTS[b];c=10 if (a,b) in ((1,2),(0,3)) else 6
                p.line(x,y,xx,yy,c);mx=(x+xx)//2;my=(y+yy)//2
                if (a,b)==(1,2):my-=35
                if (a,b)==(0,3):mx+=45
                p.rect(mx-10,my-8,20,17,1);p.text(mx-2,my-2,str(cost),c)
            for i,(x,y) in enumerate(POINTS):
                p.circ(x,y,17,3 if s.visited[i] else 5);p.text(x-2,y-2,'HRKF'[i],7)
                if i==s.town:p.circb(x,y,22,10)
                if u.view=='map' and i==u.destination and not s.ended:p.rectb(x-27,y-27,55,55,7)
                p.text(x-22,y+34,('HOME','RIVER','HILL','FOREST')[i],7)
            p.text(30,353,'INITIAL ROADS / COST SHOWN ON EACH EDGE' if STAGE<3 else 'YELLOW EDGE = OPEN REPAIR ROUTE, BOTH DIRECTIONS',6)
        x=470;p.text(x,78,'CURRENT LEDGER',10)
        home,path=shortest(s);p.text(x,98,'HOME COST '+str(home)+'  PATH '+'>'.join('HRKF'[n] for n in path),11)
        if s.time<home:p.text(x,117,'WARNING: NOT ENOUGH TIME TO RETURN',8)
        if STAGE>=3:p.text(x,136,'FIXED '+str(s.fixed),7)
        if STAGE>=4:
            carried=[i for i,v in enumerate(s.gifts) if v==-1]
            p.text(x,158,'BAG '+('/'.join(GIFT_NAMES[i] for i in carried) or 'EMPTY')+' / 2 SLOTS',7)
            p.text(x,180,'GIFT LOCATIONS: -1 = BAG',6)
            for i,g in enumerate(s.gifts):p.text(x,198+i*16,GIFT_NAMES[i]+': '+('BAG' if g==-1 else NAMES[g]),7)
            p.text(x,250,'SUPPLY TAKEN '+str(s.supplied),7)
            p.text(x,270,'TOWN LIFE: '+(','.join(('FISH','PLANTS','BELL')[i] for i in s.life) or 'NONE'),11)
        if STAGE==5:p.text(x,297,'HISTORY '+str(len(s.history))+' DECISIONS',6)
        if s.ended:
            result='SUCCESS' if STAGE>=3 and success(s) else 'SCOUTING / NO REPAIR' if STAGE>=3 else 'TRAINING TOUR ENDED'
            p.text(16,397,'RESULT: '+result,10)
        elif u.view=='map':
            cost=distance(s,s.town,u.destination)
            p.text(16,397,'DESTINATION '+NAMES[u.destination]+' / COST '+str(cost)+' / LEFT RIGHT THEN ENTER',10)
        elif u.view=='town':
            options=u.options();a=options[u.choice%len(options)][1] if options else ()
            p.text(16,397,'TOWN ACTION '+str(a)+' / LEFT RIGHT THEN ENTER' if options else 'NO TOWN ACTION / TAB TO MAP',10)
            if STAGE>=4 and len([g for g in s.gifts if g==-1])==2:
                bag=[i for i,g in enumerate(s.gifts) if g==-1]
                p.text(16,416,'SWAP: LEAVE '+GIFT_NAMES[bag[u.old%2]]+' HERE / UP DOWN SELECT',7)
        else:
            passed=any(row[2] for row in ferry_trial(s.offset)) if STAGE<4 else trial(s,u.mechanism(),u.method)['passes']
            status='TEST '+str(u.test_frame)+'/120 FEEDS' if u.testing else ('TEST DONE: '+('PASS' if passed else 'FAIL') if u.tested==u.signature() else 'ENTER STARTS FREE TEST')
            p.text(16,397,status+' / TRAVEL TIME UNCHANGED',10)
            if STAGE>=3:
                mat,time=METHODS[u.method];p.text(16,416,'METHOD '+u.method.upper()+' / MATERIALS '+str(mat)+' / TIME '+str(time)+' / LEFT RIGHT CHANGE',7)
                p.text(16,435,'AFTER PASS: RELEASE, ENTER PREVIEW, RELEASE, ENTER COMMIT',6)
            else:p.text(16,416,'STAGE 02: TEST ONLY / NO REPAIR COMMIT YET',6)
        if u.notice:
            reason='SAVED' if self.event=='save' else 'LOADED' if self.event=='load' else 'ACTION/IO REJECTED'
            for token,label in (('帰り','RETURN RESERVE TOO LOW'),('資材','NOT ENOUGH MATERIALS'),('試運転','ADJUST AND RETEST'),('その二町','NO DIRECT ROAD'),('時間','NOT ENOUGH TRAVEL TIME'),('丘の工具','SUPPLY ALREADY TAKEN'),('保存を変更','SAVE/LOAD FAILED; STATE KEPT')):
                if token in u.notice:reason=label
            p.text(470,333,'NOTICE: '+reason,8)
        p.text(16,462,'TAB MAP/TOWN / ENTER PREVIEW THEN CONFIRM' if STAGE==1 else 'TAB MAP/TOWN/TOOLS / Z TOOLS / ENTER PREVIEW THEN CONFIRM',7)
        p.text(16,480,'H HELP / P PAUSE / R RETRY / M TITLE / ESC QUIT / X CANCEL DIALOG',6)
        p.text(16,498,'X UNDO / S SAVE / L LOAD (STAGE 05) / RELEASE EVERY KEY',6)
        p.text(16,516,'R RESETS STATE ONLY. SAVE CODE, QUIT, AND RERUN AFTER EDITS.',6)
        p.text(16,540,'LAST INPUT '+self.event[:100],10)
        if u.title or u.help:
            p.rect(32,66,716,379,1);p.rectb(32,66,716,379,10)
            lines=['TRAVELING REPAIRER / STAGE '+str(STAGE),'TITLE: 1 2 3 CASE / B COMPARISON (03+) / SPACE START',
                   'MAP: LEFT RIGHT DESTINATION / ENTER PREVIEW / ENTER COMMIT',
                   'TOWN: LEFT RIGHT ACTION / ENTER PREVIEW / ENTER COMMIT',
                   'TAB MAP/TOWN / NO TOOLS IN STAGE 01' if STAGE==1 else 'TAB CHANGES VIEW / Z OPENS AN UNREPAIRED MECHANISM',
                   'TOOLS: UP DOWN PHASE OR STOP / LEFT RIGHT METHOD (03+)',
                   'FOREST GEARS: 1 2 3 TOGGLE EDGES (04+)',
                   'FREE MECHANISM TESTS ARRIVE IN STAGE 02' if STAGE==1 else 'ENTER FREE TEST: 120 UNPAUSED FEEDS, 4 DISPLAY PHASES',
                   'REPAIR COMMIT ARRIVES IN STAGE 03' if STAGE<3 else 'AFTER PASS: RELEASE / ENTER PREVIEW / RELEASE / ENTER COMMIT',
                   'H CLOSES HELP / P PAUSES / R M ESC REQUIRE CONFIRMATION',
                   'X CANCELS A DIALOG / X UNDO, S SAVE, L LOAD (05)',
                   'EDITS AND TESTS ARE FREE; MOVES AND REPAIRS USE TIME',
                   'CURRENT CASE '+s.case+' / '+('OPEN TRAVEL EDGES' if getattr(s,'transport',True) else 'LIFE ONLY COMPARISON')]
            for i,line in enumerate(lines):p.text(50,86+i*27,line,10 if i in (0,12) else 7)
        if u.paused:
            p.rect(60,165,660,135,1);p.rectb(60,165,660,135,10)
            p.text(83,191,'PAUSED / P RESUMES / RELEASE ALL KEYS FIRST',10)
            p.text(83,229,'TRIAL CLOCK AND TRAVEL TIME ARE STOPPED',7)
        if u.dialog:
            p.rect(48,88,684,339,1);p.rectb(48,88,684,339,10)
            lines=['CONFIRM '+u.dialog.upper(),'ENTER ACCEPT / X CANCEL / RELEASE BETWEEN EVERY PRESS']
            if u.dialog=='action':
                future=step(s,u.pending);return_cost,route=shortest(future)
                lines=['PENDING ACTION '+str(u.pending),'CURRENT: TIME '+str(s.time)+' MATERIALS '+str(getattr(s,'materials','-')),
                       'AFTER CONFIRM: TIME '+str(future.time)+' MATERIALS '+str(getattr(future,'materials','-')),
                       'AFTER CONFIRM HOME: '+str(return_cost)+' VIA '+'>'.join('HRKF'[n] for n in route)]
                if STAGE>=4 and u.pending[0]=='gift':lines.append('AFTER CONFIRM GIFT LOCATIONS '+str(future.gifts)+' (-1 = BAG)')
                if u.pending[0]=='move' and future.time<return_cost:lines.append('WARNING: RETURN TIME IS SHORT; UNDO IN STAGE 05')
                if u.pending[0]=='repair':lines.append('AFTER CONFIRM ROAD OPENS' if future.transport else 'COMPARISON: LIFE CHANGES, NO EXTRA TRAVEL EDGE')
                lines+=['PREVIEW ONLY: CURRENT STATE HAS NOT CHANGED','RELEASE / ENTER ONCE TO COMMIT / X CANCEL']
            for i,line in enumerate(lines):p.text(70,112+i*35,line,10 if i in (0,len(lines)-1) else 7)

def demo(app):
    u=app.ui;tap(u,'SPACE');go(u,1)
    if STAGE>=2:
        tap(u,'Z');tap(u,'DOWN');tap(u,'DOWN');run_trial(u)
    if STAGE>=3:
        tap(u,'RETURN');tap(u,'RETURN')
    if STAGE>=4:
        go(u,2)
        # Hill options are gift first, supply second.
        tap(u,'RIGHT');tap(u,'RETURN');tap(u,'RETURN')
    app.event='SYNTHETIC CHECKPOINT'

def main(headless=False,screenshot=None,state_json=None,checkpoint=False):
    save_path=str((Path.cwd()/'save_100.json').resolve())
    import pyxel as p
    app=App(save_path)
    if checkpoint:demo(app)
    p.init(780,570,title='Traveling repairer lesson '+str(STAGE),fps=30,display_scale=1,quit_key=p.KEY_NONE,headless=headless)
    keys={k:getattr(p,'KEY_'+k) for k in KEYS}
    def update():
        if headless and p.frame_count>=5:
            app.draw(p)
            if screenshot:p.screen.save(screenshot,1)
            if state_json:Path(state_json).write_text(json.dumps({'stage':STAGE,'state':asdict(app.ui.s),'title':app.ui.title,'scope':'actual Linux headless Pyxel; synthetic controls'},ensure_ascii=False,indent=2)+'\n',encoding='utf-8')
            p.quit();return
        e=app.ui.feed(set() if headless else {k for k,v in keys.items() if p.btn(v)})
        if e:
            app.event=e
            if e=='quit':p.quit()
    p.run(update,lambda:app.draw(p))

if __name__=='__main__':
    import argparse
    parser=argparse.ArgumentParser(description='Standalone traveling repairer tutorial')
    parser.add_argument('--headless-smoke',action='store_true')
    parser.add_argument('--demo-checkpoint',action='store_true')
    parser.add_argument('--screenshot');parser.add_argument('--state-json')
    args=parser.parse_args()
    if (args.demo_checkpoint or args.screenshot or args.state_json) and not args.headless_smoke:parser.error('outputs/checkpoint require --headless-smoke')
    for field,suffix in (('screenshot','.png'),('state_json','.json')):
        value=getattr(args,field)
        if value is not None:
            target=Path(value).resolve()
            if target.suffix.lower()!=suffix or not target.parent.is_dir() or target.exists():parser.error('output must be a new '+suffix+' in an existing directory')
            setattr(args,field,str(target))
    main(args.headless_smoke,args.screenshot,args.state_json,args.demo_checkpoint)

# MIT License
# 
# Copyright (c) 2026
# 
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
# 
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
# 
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
# 
# Third-party exception: bitmap glyph data derived from Noto Sans CJK is licensed
# under the SIL Open Font License 1.1. See assets/NOTO-LICENSE.txt.

"""100 旅する修理屋 / 教材 5。"""
STAGE = 5

"""Pure model: a tiny journey, repair mechanisms, return routes and visible town life."""
from dataclasses import dataclass,asdict,replace
import json,hashlib
GAME='100_traveling_repairer';VERSION=1
TITLES={'A':'川から始める','B':'森への便り','C':'鈴を届けたあと'}
TOWNS=('拠点','川町','丘町','森町');GIFTS=('小瓶','小鈴','木札')
INITIAL={'A':(20,4,(2,3,3,2)),'B':(18,3,(3,2,3,2)),'C':(16,2,(2,2,2,3))}
METHODS={'gear':(2,1),'hand':(1,2),'rope':(1,2)}
@dataclass(frozen=True)
class State:
 case:str='A'; transport:bool=True; town:int=0; time:int=20; materials:int=4
 fixed:tuple=('',''); visited:tuple=(True,False,False,False); gifts:tuple=(1,2,3)
 supplied:bool=False; life:tuple=(); offset:int=2; edges:int=3; stop:int=0
 ended:bool=False; history:tuple=(); last:tuple=('止まった道を、次の旅に。',)
def new(case='A',transport=True):
 if case not in TITLES or type(transport) is not bool:raise ValueError('旅支度が不正です')
 t,m,_=INITIAL[case];return State(case=case,transport=transport,time=t,materials=m)
def roads(s):
 costs=INITIAL[s.case][2];r={(0,1):costs[0],(0,2):costs[1],(1,3):costs[2],(2,3):costs[3]}
 if s.transport:
  if s.fixed[0]:r[(1,2)]=1
  if s.fixed[1]:r[(0,3)]=1
 return r
def distance(s,a,b):return roads(s).get(tuple(sorted((a,b))))
def shortest(s,start=None):
 start=s.town if start is None else start;ds=[999]*4;ds[0]=0;paths=[() for _ in range(4)];paths[0]=(0,)
 for _ in range(4):
  for (a,b),cost in roads(s).items():
   for u,v in ((a,b),(b,a)):
    path=(v,)+paths[u]
    if ds[u]+cost<ds[v] or (ds[u]+cost==ds[v] and path<paths[v]):ds[v]=ds[u]+cost;paths[v]=path
 return ds[start],paths[start]
def ferry_trial(offset):return tuple((t%4,(t+offset)%4,t%4==0 and (t+offset)%4==0) for t in range(4))
def gear_trial(mask):
 signs={0:1};edges=[(0,1),(1,2),(0,2)];changed=True;conflict=False
 while changed:
  changed=False
  for i,(a,b) in enumerate(edges):
   if not mask&(1<<i):continue
   if a in signs and b in signs:
    if signs[a]!=-signs[b]:conflict=True
   elif a in signs:signs[b]=-signs[a];changed=True
   elif b in signs:signs[a]=-signs[b];changed=True
 return {'signs':tuple(signs.get(i,0) for i in range(3)),'conflict':conflict,'passes':not conflict and signs.get(2)==-1}
def trial(s,mechanism,method):
 if mechanism==0:return {'passes':any(t[2] for t in ferry_trial(s.offset)),'frames':ferry_trial(s.offset)}
 if method=='rope':return {'passes':s.stop==1,'stop':s.stop}
 return gear_trial(s.edges)
def repair_forecast(s,mechanism,method):
 if s.ended or mechanism not in (0,1) or s.town!=(1 if mechanism==0 else 3):raise ValueError('ここでは、その修理はできません')
 if s.fixed[mechanism]:raise ValueError('この機構は修理済みです')
 if method not in (('gear','hand') if mechanism==0 else ('gear','rope')):raise ValueError('修理法が不正です')
 if not trial(s,mechanism,method)['passes']:raise ValueError('試運転で便が動くように調整してください')
 mat,time=METHODS[method]
 if s.materials<mat:raise ValueError('工具資材が足りません')
 fixed=list(s.fixed);fixed[mechanism]=method;future=replace(s,fixed=tuple(fixed));home,path=shortest(future)
 if s.time-time<home:raise ValueError('この修理後は帰りに'+str(home-(s.time-time))+'刻足りません')
 return {'materials':mat,'time':time,'remaining':s.time-time,'home':home,'path':path,'new_edge':(1,2) if mechanism==0 else (0,3),'opens':s.transport}
def success(s):return s.ended and s.town==0 and any(s.fixed)
def step(s,a):
 a=tuple(a)
 if s.ended:raise ValueError('旅は終わっています。Xで一決定戻せます')
 if not a or type(a[0]) is not str:raise ValueError('操作が不正です')
 t=s;kind=a[0];msg=()
 if kind=='move' and len(a)==2:
  dst=a[1]
  if type(dst) is not int or dst not in range(4):raise ValueError('行き先が不正です')
  cost=distance(s,s.town,dst)
  if cost is None:raise ValueError('その二町を直接つなぐ道はありません')
  if s.time<cost:raise ValueError('移動の時間が足りません')
  visited=list(s.visited);visited[dst]=True;t=replace(s,town=dst,time=s.time-cost,visited=tuple(visited));msg=(TOWNS[s.town]+'から'+TOWNS[dst]+'へ '+str(cost)+'刻。','帰り道の最短所要 '+str(shortest(t)[0])+'刻。')
 elif kind=='repair' and len(a)==3:
  mech,method=a[1:]
  if type(mech) is not int:raise ValueError('機構番号が不正です')
  f=repair_forecast(s,mech,method);fixed=list(s.fixed);fixed[mech]=method
  life=tuple(k for k,p in enumerate((bool(fixed[0]),bool(fixed[1]),all(fixed))) if p)
  t=replace(s,fixed=tuple(fixed),time=s.time-f['time'],materials=s.materials-f['materials'],life=life)
  msg=(('渡し' if mech==0 else '索道')+'が動きました。資材 -'+str(f['materials'])+' / 旅 -'+str(f['time'])+'刻。',('新しい便を、次の移動に選べます。' if s.transport else '比較版: 町の荷物は動きますが、旅の道は増えません。'))
 elif kind=='supply' and len(a)==1:
  if s.town!=2 or s.supplied:raise ValueError('丘の工具は一度だけ受け取れます')
  t=replace(s,supplied=True,materials=s.materials+1);msg=('丘町の工房から、工具資材を１つ。','お礼は一度だけ。無料で受け取れます。')
 elif kind=='gift' and len(a)==3:
  item,old=a[1:]
  if type(item) is not int or item not in range(3) or s.gifts[item]!=s.town:raise ValueError('この町には、その品はありません')
  carried=[i for i,x in enumerate(s.gifts) if x==-1];g=list(s.gifts)
  if len(carried)==2:
   if type(old) is not int or old not in carried:raise ValueError('持帰りは２枠。置く一品を選んでください')
   g[old]=s.town
  elif old!=-1:raise ValueError('空き枠があるので、交換は不要です')
  g[item]=-1;t=replace(s,gifts=tuple(g));msg=(GIFTS[item]+'を、旅のかばんへ。',('置いた'+GIFTS[old]+'はこの町に残ります。' if len(carried)==2 else '品に能力や点数はありません。景色の記憶です。'))
 elif kind in ('offset','edges','stop') and len(a)==2:
  limit={'offset':4,'edges':8,'stop':3}[kind]
  if type(a[1]) is not int or a[1] not in range(limit):raise ValueError('機構の調整値が不正です')
  if s.town!=(1 if kind=='offset' else 3) or s.fixed[0 if kind=='offset' else 1]:raise ValueError('調整は未修理の町で行います')
  t=replace(s,**{kind:a[1]});msg=('調整は無料です。旅時間と資材は減りません。',)
 elif kind=='finish' and len(a)==1:
  if s.town!=0:raise ValueError('旅を終えるのは拠点です')
  t=replace(s,ended=True);msg=('おかえり。直した道と、選んだ二品。','町の暮らしに、旅の足あとが残りました。' if any(s.fixed) else '今回は下見の旅。修理のない記録も残せます。')
 else:raise ValueError('この操作は今できません')
 return replace(t,history=s.history+(a,),last=msg)
def replay(case,transport,history):
 s=new(case,transport)
 for a in history:s=step(s,a)
 return s
def undo(s):return replay(s.case,s.transport,s.history[:-1]) if s.history else s
def digest(s):return hashlib.sha256(json.dumps(asdict(s),ensure_ascii=False,sort_keys=True).encode('utf-8')).hexdigest()
def restore(d):
 if not isinstance(d,dict) or set(d)!=set(asdict(new())) or type(d['history']) is not list:raise ValueError('保存の項目か履歴が不正です')
 if any(type(a) is not list or any(type(x) not in (str,int) for x in a) for a in d['history']):raise ValueError('操作記録が不正です')
 s=replay(d['case'],d['transport'],d['history']);expected=json.loads(json.dumps(asdict(s),ensure_ascii=False))
 def strict(a,b):
  if type(a) is not type(b):return False
  if isinstance(a,list):return len(a)==len(b) and all(strict(x,y) for x,y in zip(a,b))
  if isinstance(a,dict):return a.keys()==b.keys() and all(strict(a[k],b[k]) for k in a)
  return a==b
 if not strict(expected,d):raise ValueError('保存の型か再生結果が一致しません')
 return s

from pathlib import Path
KEYS={'SPACE','RETURN','Z','X','P','H','R','M','UP','DOWN','LEFT','RIGHT','1','2','3','B','F12','ESCAPE','TAB','S','L'}
class Controller:
 def __init__(self,path=None):
  self.s=new();self.title=True;self.help=False;self.paused=False;self.dialog='';self.previous=set();self.gate=False;self.view='map';self.destination=1;self.choice=0;self.method='gear';self.old=0;self.pending=None;self.notice='';self.testing=False;self.test_frame=0;self.tested=None;self.path=Path(path) if path else Path(__file__).parent/'save.json'
 def normalize(self):
  self.view='map';self.destination=0 if self.s.town else 1;self.choice=0;self.method='gear';self.old=0;self.dialog='';self.pending=None;self.testing=False;self.tested=None;self.test_frame=0;self.notice=''
 def reset(self,case=None):
  self.s=new(case or self.s.case,self.s.transport);self.normalize()
 def mechanism(self):return 0 if self.s.town==1 else 1
 def signature(self):return (self.s.town,self.method,self.s.offset,self.s.edges,self.s.stop)
 def options(self):
  s=self.s;out=[]
  if s.town in (1,3) and not s.fixed[self.mechanism()]:out.append(('機構を調べる',('tools',)))
  for i,x in enumerate(s.gifts):
   if x==s.town:out.append((GIFTS[i]+'を持帰る',('gift',i)))
  if s.town==2 and not s.supplied:out.append(('工具を１つ受取る',('supply',)))
  if s.town==0:out.append(('旅を終える',('finish',)))
  return out
 def apply(self,a):
  try:
   self.s=step(self.s,a);self.choice=0;self.notice='';self.tested=None
   if a[0]=='move':self.view='town';self.destination=0 if self.s.town else 1;self.method='gear'
   if a[0]=='repair':self.view='map'
   return 'step:'+a[0]
  except ValueError as e:self.notice=str(e);return 'invalid'
 def save(self):
  d={'game':GAME,'version':VERSION,'state':asdict(self.s),'settings':{'transport':self.s.transport}}
  tmp=self.path.with_suffix('.tmp');tmp.write_text(json.dumps(d,ensure_ascii=False,indent=2),encoding='utf-8');tmp.replace(self.path)
 def load(self):
  d=json.loads(self.path.read_text(encoding='utf-8'))
  if not isinstance(d,dict) or set(d)!={'game','version','state','settings'} or d['game']!=GAME or type(d['version']) is not int or d['version']!=VERSION:raise ValueError('未知の保存版。Rで新規開始できます')
  s=restore(d['state'])
  if d['settings']!={'transport':s.transport} or type(d['settings'].get('transport')) is not bool:raise ValueError('保存の設定が不正です')
  self.s=s;self.title=False;self.normalize()
 def preview(self,a):
  try:step(self.s,a);self.pending=a;self.dialog='action';return 'confirm:action'
  except ValueError as e:self.notice=str(e);return 'invalid:choice'
 def feed(self,down):
  down=set(down)&KEYS;fresh=down-self.previous;self.previous=down
  if self.testing and not (self.paused or self.help or self.dialog or self.title):
   self.test_frame+=1
   if self.test_frame>=120:self.testing=False;self.tested=self.signature();self.gate=True;return 'test:complete'
  if self.gate:
   if not down:self.gate=False
   return None
  if not fresh:return None
  self.gate=True
  if len(down)>1:return 'ignored:chord'
  k=next(iter(fresh));self.notice=''
  if k=='F12':return 'screenshot'
  if self.dialog:
   if k in ('X','ESCAPE'):self.dialog='';self.pending=None;return 'cancel'
   if k=='RETURN':
    d=self.dialog;self.dialog=''
    if d=='quit':return 'quit'
    if d=='action':a=self.pending;self.pending=None;return self.apply(a)
    if d=='retry':self.reset();return 'reset'
    if d=='menu':self.title=True;return 'menu'
   return 'ignored:dialog'
  if k=='ESCAPE':self.dialog='quit';return 'confirm:quit'
  if k=='H':self.help=not self.help;return 'help'
  if self.help:return 'ignored:help'
  if self.title:
   if k in ('1','2','3'):self.reset('ABC'[int(k)-1]);return 'case'
   if k=='B':self.s=new(self.s.case,not self.s.transport);self.normalize();return 'variant'
   if k in ('SPACE','RETURN'):self.title=False;return 'start'
   return 'ignored:title'
  if k=='P':self.paused=not self.paused;return 'pause'
  if self.paused:return 'ignored:pause'
  if self.testing:return 'ignored:test'
  if k=='R':self.dialog='retry';return 'confirm:retry'
  if k=='M':self.dialog='menu';return 'confirm:menu'
  if k in ('S','L'):
   try:
    if k=='S':self.save();self.notice='保存しました'
    else:self.load();self.notice='読込みました'
    return 'save' if k=='S' else 'load'
   except (OSError,ValueError,TypeError,KeyError) as e:self.notice='保存を変更せず停止: '+str(e);return 'save-error'
  if k=='X':self.s=undo(self.s);self.normalize();return 'undo'
  if self.s.ended:return 'ignored:result'
  if k=='TAB':
   views=('map','town','tools') if self.s.town in (1,3) and not self.s.fixed[self.mechanism()] else ('map','town');self.view=views[(views.index(self.view)+1)%len(views)] if self.view in views else 'map';return 'view'
  if k=='Z' and self.s.town in (1,3) and not self.s.fixed[self.mechanism()]:self.view='tools';return 'tools'
  if self.view=='map':
   if k in ('LEFT','RIGHT'):self.destination=(self.destination+(-1 if k=='LEFT' else 1))%4;return 'select-destination'
   if k=='RETURN':return self.preview(('move',self.destination))
  elif self.view=='town':
   opts=self.options()
   if k in ('LEFT','RIGHT') and opts:self.choice=(self.choice+(-1 if k=='LEFT' else 1))%len(opts);return 'select-town'
   if k in ('UP','DOWN'):self.old=1-self.old;return 'select-replacement'
   if k=='RETURN' and opts:
    a=opts[self.choice%len(opts)][1]
    if a[0]=='tools':self.view='tools';return 'tools'
    if a[0]=='gift':carried=[i for i,x in enumerate(self.s.gifts) if x==-1];a=(*a,carried[self.old%2] if len(carried)==2 else -1)
    return self.preview(a)
  else:
   mech=self.mechanism()
   if k in ('LEFT','RIGHT'):self.method=('hand' if mech==0 else 'rope') if self.method=='gear' else 'gear';self.tested=None;return 'select-method'
   if k in ('UP','DOWN'):
    field='offset' if mech==0 else 'stop';n=getattr(self.s,field);return self.apply((field,(n+(1 if k=='UP' else -1))%(4 if mech==0 else 3)))
   if k in ('1','2','3') and mech==1 and self.method=='gear':return self.apply(('edges',self.s.edges^(1<<(int(k)-1))))
   if k=='RETURN':
    if self.tested==self.signature() and trial(self.s,mech,self.method)['passes']:return self.preview(('repair',mech,self.method))
    self.testing=True;self.test_frame=0;self.tested=None;return 'test:start'
  return 'ignored:key'

# ASCII teaching view. Controllers alone decide whether an input is committed.
NAMES=('H HOME','R RIVER','K HILL','F FOREST')
GIFT_NAMES=('JAR','BELL','TAG')
POINTS=((65,208),(223,110),(223,305),(393,208))
def tap(ui,key):
    ui.feed(set());event=ui.feed({key});ui.feed(set());return event

def go(ui,destination):
    while ui.view!='map':tap(ui,'TAB')
    for _ in range((destination-ui.destination)%4):tap(ui,'RIGHT')
    first=tap(ui,'RETURN')
    if first!='confirm:action':raise ValueError(first+': '+ui.notice)
    return tap(ui,'RETURN')

def run_trial(ui):
    tap(ui,'RETURN')
    for _ in range(120):ui.feed(set())
    ui.feed(set())
    if ui.testing:raise AssertionError('trial did not finish')

class App:
    def __init__(self,save_path='save_100.json'):
        self.ui=Controller(save_path);self.event='READY'
    def draw(self,p):
        u=self.ui;s=u.s;p.cls(1)
        p.text(16,12,'TRAVELING REPAIRER / STAGE '+str(STAGE)+' / CASE '+s.case,10)
        p.text(16,30,'CURRENT '+NAMES[s.town]+'  TIME '+str(s.time)+'  MATERIALS '+str(getattr(s,'materials','-')),11)
        p.text(440,30,'INITIAL ROADS / NO REPAIRS YET' if STAGE<3 else 'TRAVEL EDGES '+('OPEN AFTER REPAIR' if s.transport else 'COMPARISON: INITIAL ROADS ONLY'),6)
        p.text(16,49,'VIEW '+u.view.upper()+(' / CHOOSING DOES NOT USE TRAVEL TIME' if STAGE==1 else ' / CHOOSING AND FREE TESTS DO NOT USE TRAVEL TIME'),7)
        if u.view=='tools' and not s.ended:
            p.rectb(16,70,430,305,5)
            mech=u.mechanism();p.text(30,86,'FERRY' if mech==0 else 'FOREST ROPE' if u.method=='rope' else 'FOREST GEARS',10)
            if mech==0:
                frames=ferry_trial(s.offset);phase=min(3,u.test_frame//30) if u.testing or u.tested else 0
                p.text(30,108,'OFFSET '+str(s.offset)+' / UP DOWN: 0..3',7)
                for i,(left,right,aligned) in enumerate(frames):
                    y=142+i*36
                    if i==phase:p.rect(25,y-5,406,28,5)
                    p.text(34,y,'PHASE '+str(i)+'  LEFT '+str(left)+'  RIGHT '+str(right)+'  '+('DEPART' if aligned else 'WAIT'),10 if aligned else 7)
                p.text(30,305,'THE FOUR ROWS ARE A FREE MECHANISM TEST',6)
                p.text(30,322,'THEY ARE NOT FOUR TRAVEL-TIME CHARGES',6)
            elif u.method=='rope':
                p.line(75,298,380,135,6);p.line(75,304,380,141,6)
                p.rect(195,280-s.stop*57,44,20,9);p.rect(245,225,130,6,4)
                p.text(30,108,'STOP '+str(s.stop)+' / UP DOWN: 0..2',7)
                p.text(256,243,'PIER = STOP 1',10)
                p.text(30,338,'PASS ONLY WHEN THE LOAD STOPS AT 1',6)
            else:
                result=gear_trial(s.edges);coords=((95,218),(230,144),(365,218))
                for i,(a,b) in enumerate(((0,1),(1,2),(0,2))):
                    x,y=coords[a];xx,yy=coords[b];p.line(x,y,xx,yy,10 if s.edges&(1<<i) else 5)
                    p.text((x+xx)//2,(y+yy)//2-12,str(i+1),7)
                for i,(x,y) in enumerate(coords):
                    p.circ(x,y,22,9);p.circ(x,y,13,1)
                    p.text(x-17,y+32,('D','A','LOAD')[i]+' '+{1:'+1',-1:'-1',0:'STOP'}[result['signs'][i]],7)
                p.text(30,108,'MASK '+str(s.edges)+' / 1 2 3: TOGGLE EDGES',7)
                p.text(30,300,'ODD CYCLE: STOP' if result['conflict'] else 'LOAD -1: PASS' if result['passes'] else 'NOT READY: LOAD MUST BE -1',8 if result['conflict'] else 10)
                p.text(30,338,'SIGNS SHOW CONSTRAINTS, NOT TRAVEL SPEED',6)
        else:
            p.rectb(16,70,430,305,5)
            for (a,b),cost in roads(s).items():
                x,y=POINTS[a];xx,yy=POINTS[b];c=10 if (a,b) in ((1,2),(0,3)) else 6
                p.line(x,y,xx,yy,c);mx=(x+xx)//2;my=(y+yy)//2
                if (a,b)==(1,2):my-=35
                if (a,b)==(0,3):mx+=45
                p.rect(mx-10,my-8,20,17,1);p.text(mx-2,my-2,str(cost),c)
            for i,(x,y) in enumerate(POINTS):
                p.circ(x,y,17,3 if s.visited[i] else 5);p.text(x-2,y-2,'HRKF'[i],7)
                if i==s.town:p.circb(x,y,22,10)
                if u.view=='map' and i==u.destination and not s.ended:p.rectb(x-27,y-27,55,55,7)
                p.text(x-22,y+34,('HOME','RIVER','HILL','FOREST')[i],7)
            p.text(30,353,'INITIAL ROADS / COST SHOWN ON EACH EDGE' if STAGE<3 else 'YELLOW EDGE = OPEN REPAIR ROUTE, BOTH DIRECTIONS',6)
        x=470;p.text(x,78,'CURRENT LEDGER',10)
        home,path=shortest(s);p.text(x,98,'HOME COST '+str(home)+'  PATH '+'>'.join('HRKF'[n] for n in path),11)
        if s.time<home:p.text(x,117,'WARNING: NOT ENOUGH TIME TO RETURN',8)
        if STAGE>=3:p.text(x,136,'FIXED '+str(s.fixed),7)
        if STAGE>=4:
            carried=[i for i,v in enumerate(s.gifts) if v==-1]
            p.text(x,158,'BAG '+('/'.join(GIFT_NAMES[i] for i in carried) or 'EMPTY')+' / 2 SLOTS',7)
            p.text(x,180,'GIFT LOCATIONS: -1 = BAG',6)
            for i,g in enumerate(s.gifts):p.text(x,198+i*16,GIFT_NAMES[i]+': '+('BAG' if g==-1 else NAMES[g]),7)
            p.text(x,250,'SUPPLY TAKEN '+str(s.supplied),7)
            p.text(x,270,'TOWN LIFE: '+(','.join(('FISH','PLANTS','BELL')[i] for i in s.life) or 'NONE'),11)
        if STAGE==5:p.text(x,297,'HISTORY '+str(len(s.history))+' DECISIONS',6)
        if s.ended:
            result='SUCCESS' if STAGE>=3 and success(s) else 'SCOUTING / NO REPAIR' if STAGE>=3 else 'TRAINING TOUR ENDED'
            p.text(16,397,'RESULT: '+result,10)
        elif u.view=='map':
            cost=distance(s,s.town,u.destination)
            p.text(16,397,'DESTINATION '+NAMES[u.destination]+' / COST '+str(cost)+' / LEFT RIGHT THEN ENTER',10)
        elif u.view=='town':
            options=u.options();a=options[u.choice%len(options)][1] if options else ()
            p.text(16,397,'TOWN ACTION '+str(a)+' / LEFT RIGHT THEN ENTER' if options else 'NO TOWN ACTION / TAB TO MAP',10)
            if STAGE>=4 and len([g for g in s.gifts if g==-1])==2:
                bag=[i for i,g in enumerate(s.gifts) if g==-1]
                p.text(16,416,'SWAP: LEAVE '+GIFT_NAMES[bag[u.old%2]]+' HERE / UP DOWN SELECT',7)
        else:
            passed=any(row[2] for row in ferry_trial(s.offset)) if STAGE<4 else trial(s,u.mechanism(),u.method)['passes']
            status='TEST '+str(u.test_frame)+'/120 FEEDS' if u.testing else ('TEST DONE: '+('PASS' if passed else 'FAIL') if u.tested==u.signature() else 'ENTER STARTS FREE TEST')
            p.text(16,397,status+' / TRAVEL TIME UNCHANGED',10)
            if STAGE>=3:
                mat,time=METHODS[u.method];p.text(16,416,'METHOD '+u.method.upper()+' / MATERIALS '+str(mat)+' / TIME '+str(time)+' / LEFT RIGHT CHANGE',7)
                p.text(16,435,'AFTER PASS: RELEASE, ENTER PREVIEW, RELEASE, ENTER COMMIT',6)
            else:p.text(16,416,'STAGE 02: TEST ONLY / NO REPAIR COMMIT YET',6)
        if u.notice:
            reason='SAVED' if self.event=='save' else 'LOADED' if self.event=='load' else 'ACTION/IO REJECTED'
            for token,label in (('帰り','RETURN RESERVE TOO LOW'),('資材','NOT ENOUGH MATERIALS'),('試運転','ADJUST AND RETEST'),('その二町','NO DIRECT ROAD'),('時間','NOT ENOUGH TRAVEL TIME'),('丘の工具','SUPPLY ALREADY TAKEN'),('保存を変更','SAVE/LOAD FAILED; STATE KEPT')):
                if token in u.notice:reason=label
            p.text(470,333,'NOTICE: '+reason,8)
        p.text(16,462,'TAB MAP/TOWN / ENTER PREVIEW THEN CONFIRM' if STAGE==1 else 'TAB MAP/TOWN/TOOLS / Z TOOLS / ENTER PREVIEW THEN CONFIRM',7)
        p.text(16,480,'H HELP / P PAUSE / R RETRY / M TITLE / ESC QUIT / X CANCEL DIALOG',6)
        p.text(16,498,'X UNDO / S SAVE / L LOAD (STAGE 05) / RELEASE EVERY KEY',6)
        p.text(16,516,'R RESETS STATE ONLY. SAVE CODE, QUIT, AND RERUN AFTER EDITS.',6)
        p.text(16,540,'LAST INPUT '+self.event[:100],10)
        if u.title or u.help:
            p.rect(32,66,716,379,1);p.rectb(32,66,716,379,10)
            lines=['TRAVELING REPAIRER / STAGE '+str(STAGE),'TITLE: 1 2 3 CASE / B COMPARISON (03+) / SPACE START',
                   'MAP: LEFT RIGHT DESTINATION / ENTER PREVIEW / ENTER COMMIT',
                   'TOWN: LEFT RIGHT ACTION / ENTER PREVIEW / ENTER COMMIT',
                   'TAB MAP/TOWN / NO TOOLS IN STAGE 01' if STAGE==1 else 'TAB CHANGES VIEW / Z OPENS AN UNREPAIRED MECHANISM',
                   'TOOLS: UP DOWN PHASE OR STOP / LEFT RIGHT METHOD (03+)',
                   'FOREST GEARS: 1 2 3 TOGGLE EDGES (04+)',
                   'FREE MECHANISM TESTS ARRIVE IN STAGE 02' if STAGE==1 else 'ENTER FREE TEST: 120 UNPAUSED FEEDS, 4 DISPLAY PHASES',
                   'REPAIR COMMIT ARRIVES IN STAGE 03' if STAGE<3 else 'AFTER PASS: RELEASE / ENTER PREVIEW / RELEASE / ENTER COMMIT',
                   'H CLOSES HELP / P PAUSES / R M ESC REQUIRE CONFIRMATION',
                   'X CANCELS A DIALOG / X UNDO, S SAVE, L LOAD (05)',
                   'EDITS AND TESTS ARE FREE; MOVES AND REPAIRS USE TIME',
                   'CURRENT CASE '+s.case+' / '+('OPEN TRAVEL EDGES' if getattr(s,'transport',True) else 'LIFE ONLY COMPARISON')]
            for i,line in enumerate(lines):p.text(50,86+i*27,line,10 if i in (0,12) else 7)
        if u.paused:
            p.rect(60,165,660,135,1);p.rectb(60,165,660,135,10)
            p.text(83,191,'PAUSED / P RESUMES / RELEASE ALL KEYS FIRST',10)
            p.text(83,229,'TRIAL CLOCK AND TRAVEL TIME ARE STOPPED',7)
        if u.dialog:
            p.rect(48,88,684,339,1);p.rectb(48,88,684,339,10)
            lines=['CONFIRM '+u.dialog.upper(),'ENTER ACCEPT / X CANCEL / RELEASE BETWEEN EVERY PRESS']
            if u.dialog=='action':
                future=step(s,u.pending);return_cost,route=shortest(future)
                lines=['PENDING ACTION '+str(u.pending),'CURRENT: TIME '+str(s.time)+' MATERIALS '+str(getattr(s,'materials','-')),
                       'AFTER CONFIRM: TIME '+str(future.time)+' MATERIALS '+str(getattr(future,'materials','-')),
                       'AFTER CONFIRM HOME: '+str(return_cost)+' VIA '+'>'.join('HRKF'[n] for n in route)]
                if STAGE>=4 and u.pending[0]=='gift':lines.append('AFTER CONFIRM GIFT LOCATIONS '+str(future.gifts)+' (-1 = BAG)')
                if u.pending[0]=='move' and future.time<return_cost:lines.append('WARNING: RETURN TIME IS SHORT; UNDO IN STAGE 05')
                if u.pending[0]=='repair':lines.append('AFTER CONFIRM ROAD OPENS' if future.transport else 'COMPARISON: LIFE CHANGES, NO EXTRA TRAVEL EDGE')
                lines+=['PREVIEW ONLY: CURRENT STATE HAS NOT CHANGED','RELEASE / ENTER ONCE TO COMMIT / X CANCEL']
            for i,line in enumerate(lines):p.text(70,112+i*35,line,10 if i in (0,len(lines)-1) else 7)

def demo(app):
    u=app.ui;tap(u,'SPACE');go(u,1)
    if STAGE>=2:
        tap(u,'Z');tap(u,'DOWN');tap(u,'DOWN');run_trial(u)
    if STAGE>=3:
        tap(u,'RETURN');tap(u,'RETURN')
    if STAGE>=4:
        go(u,2)
        # Hill options are gift first, supply second.
        tap(u,'RIGHT');tap(u,'RETURN');tap(u,'RETURN')
    app.event='SYNTHETIC CHECKPOINT'

def main(headless=False,screenshot=None,state_json=None,checkpoint=False):
    save_path=str((Path.cwd()/'save_100.json').resolve())
    import pyxel as p
    app=App(save_path)
    if checkpoint:demo(app)
    p.init(780,570,title='Traveling repairer lesson '+str(STAGE),fps=30,display_scale=1,quit_key=p.KEY_NONE,headless=headless)
    keys={k:getattr(p,'KEY_'+k) for k in KEYS}
    def update():
        if headless and p.frame_count>=5:
            app.draw(p)
            if screenshot:p.screen.save(screenshot,1)
            if state_json:Path(state_json).write_text(json.dumps({'stage':STAGE,'state':asdict(app.ui.s),'title':app.ui.title,'scope':'actual Linux headless Pyxel; synthetic controls'},ensure_ascii=False,indent=2)+'\n',encoding='utf-8')
            p.quit();return
        e=app.ui.feed(set() if headless else {k for k,v in keys.items() if p.btn(v)})
        if e:
            app.event=e
            if e=='quit':p.quit()
    p.run(update,lambda:app.draw(p))

if __name__=='__main__':
    import argparse
    parser=argparse.ArgumentParser(description='Standalone traveling repairer tutorial')
    parser.add_argument('--headless-smoke',action='store_true')
    parser.add_argument('--demo-checkpoint',action='store_true')
    parser.add_argument('--screenshot');parser.add_argument('--state-json')
    args=parser.parse_args()
    if (args.demo_checkpoint or args.screenshot or args.state_json) and not args.headless_smoke:parser.error('outputs/checkpoint require --headless-smoke')
    for field,suffix in (('screenshot','.png'),('state_json','.json')):
        value=getattr(args,field)
        if value is not None:
            target=Path(value).resolve()
            if target.suffix.lower()!=suffix or not target.parent.is_dir() or target.exists():parser.error('output must be a new '+suffix+' in an existing directory')
            setattr(args,field,str(target))
    main(args.headless_smoke,args.screenshot,args.state_json,args.demo_checkpoint)