Hello!!!↵
↵
I'm very happy to announce that, with the permission by the Scientific Sub-Committee of [TOI19@NU](https://toi19.nu.ac.th/), an unofficial mirror for the TOI will be hosted this [contest_time:104390] and [contest_time:104391], accessible at [contest:104390] and [contest:104391], respectively.↵
↵
The tasks will be given in Thai and English. The scoring rule will be the IOI-style scoring (i.e., with subtasks in each of the problems). In each of the contests, you will be given **3 tasks** and **4 hours** to solve them.↵
↵
Note that the problems will probably be easier than the IOI, as the contest is intended as a regional selection rather than a national selection.↵
↵
Finally, I would like to thank the Scientific Sub-Committee of [TOI 19](https://toi19.nu.ac.th/) for the permission to reuse the problems and test data here, and also thank [user:MikeMirzayanov,2023-05-24] for Codeforces and Polygon. A feedback form will be provided after the end of the contests.↵
↵
I hope to see you all soon and thank you for joining the mirror contest!↵
↵
**Update 1:** To be clear: For the official contestants (and anyone who knows the tasks already), please don't participate in this contest directly. You can upsolve the problems after the contest.
↵
I'm very happy to announce that, with the permission by the Scientific Sub-Committee of [TOI19@NU](https://toi19.nu.ac.th/), an unofficial mirror for the TOI will be hosted this [contest_time:104390] and [contest_time:104391], accessible at [contest:104390] and [contest:104391], respectively.↵
↵
The tasks will be given in Thai and English. The scoring rule will be the IOI-style scoring (i.e., with subtasks in each of the problems). In each of the contests, you will be given **3 tasks** and **4 hours** to solve them.↵
↵
Note that the problems will probably be easier than the IOI, as the contest is intended as a regional selection rather than a national selection.↵
↵
Finally, I would like to thank the Scientific Sub-Committee of [TOI 19](https://toi19.nu.ac.th/) for the permission to reuse the problems and test data here, and also thank [user:MikeMirzayanov,2023-05-24] for Codeforces and Polygon. A feedback form will be provided after the end of the contests.↵
↵
I hope to see you all soon and thank you for joining the mirror contest!↵
↵
**Update 1:** To be clear: For the official contestants (and anyone who knows the tasks already), please don't participate in this contest directly. You can upsolve the problems after the contest.
