├── ICPCCamp Wiki.page ├── animism ├── 2017 Multi-University Training Contest - Team 3.page ├── 2017 Multi-University Training Contest - Team 4.page ├── Asia Beijing Regional 2016.page ├── Asia Qingdao Regional 2016.page ├── Codeforces Round 296 (Div. 1).page ├── Codeforces Round 299 (Div. 1).page ├── Codeforces Round 380 (Div. 1).page ├── Codeforces Round 381 (Div. 1).page ├── Codeforces Round 382 (Div. 1).page ├── Front Page.page ├── GY个人.page ├── Gitit User’s Guide.page ├── Help.page ├── LQY个人.page ├── Petrozavodsk Summer-2015. Moscow IPT Contest.page ├── Petrozavodsk Summer-2016. Pavel Khaustov Contest 2.page ├── Petrozavodsk Winter-2016. JAG Contest.page ├── WP个人.page ├── XV Open Cup GP of SPb.page ├── XVII Open Cup EV Pankratiev GP of SPb.page ├── XVII Open Cup GP of Eurasia.page ├── XVII Open Cup GP of Siberia.page ├── XVII Open Cup Grand Prix of Japan.page ├── stackqueue.page ├── 简单总结.page ├── 补(Tian)题(Keng)行动.page └── 题目总结.page ├── beat-yiquan ├── 2014 ACM-ICPC Asia Regional Beijing Onsite.page ├── 2017 ACM-ICPC Asia Regional Nanning Onsite.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── Kyle.page ├── Skydog.page ├── UST Weekly Training.page ├── ZOJ Monthly, January 2018.page ├── zls.page ├── zls │ ├── CF Educational Round 36.page │ ├── CF Round 448.page │ ├── Yandex 2018 Qualification Round.page │ └── graph-theory.page ├── 分块.page ├── 白书字符串.page ├── 错题.page └── 队内训练.page ├── blackaker ├── Front Page.page ├── Gitit User’s Guide.page └── Help.page ├── bnu-faraway ├── 2016CCPC东北地区大学生程序设计竞赛.page ├── 2017-2018 ACM-ICPC Latin American Regional Programming Contest.page ├── 2017中国大学生程序设计竞赛 - 女生专场.page ├── 2018 Multi-University Training Contest 1.page ├── 2018 Multi-University Training Contest 7.page ├── 2018 Multi-University Training Contest 8.page ├── 2018 USP Try-outs.page ├── 2018, XI Samara Regional Intercollegiate Programming Contest.page ├── 2018-2019 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2018).page ├── 2018-2019 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2018).page ├── 2018中国大学生程序设计竞赛 - 女生专场.page ├── 2018中国大学生程序设计竞赛 - 湖南全国邀请赛.page ├── 2018中国大学生程序设计竞赛 - 网络选拔赛.page ├── ACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018).page ├── ACM-ICPC 2015 上海站.page ├── ACM-ICPC 2015 沈阳站.page ├── ACM-ICPC 2018 北京站.page ├── ACM-ICPC 2018 南京赛区网络预赛.page ├── ACM-ICPC 2018 徐州赛区网络预赛.page ├── ACM-ICPC 2018 青岛站.page ├── Egyptian Collegiate Programming Contest 2017 (ACM ECPC 2017).page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2018.page ├── Nineteenth Russia Open High School Programming Contest Internet Selection.page ├── The 15th Zhejiang Provincial Collegiate Programming Contest.page ├── XIX Open Cup named after E.V. Pankratiev. Grand Prix of Korea.page ├── XVII Open Cup named after E.V. Pankratiev. XXI Ural Championship.page ├── XVIII Open Cup named after E.V. Pankratiev. GP of Romania.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Eurasia.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Peterhof.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Urals.page ├── ZOJ Monthly, February 2016.page ├── 牛客网暑期ACM多校训练营（第一场）.page └── 牛客网暑期ACM多校训练营（第二场）.page ├── buaa-ascender ├── 2013changchun.page ├── 2013changchuno.page ├── 2013chengdu.page ├── 2013chiayi.page ├── 2013hangzhou.page ├── 2013multi_7.page ├── 2013nanjing.page ├── 2013nanjingo.page ├── 2014anshano.page ├── 2015_seerc.page ├── 2015neerc_northern.page ├── 2015nwerc.page ├── 2016_WTC_MRS.page ├── 2016_WTC_MST.page ├── 2016beijingo.page ├── 2016hongkong.page ├── 2017ccpco.page ├── 2017daejeon.page ├── 2017multi_1.page ├── 2017multi_10.page ├── 2017multi_2.page ├── 2017multi_3.page ├── 2017multi_4.page ├── 2017multi_5.page ├── 2017multi_6.page ├── 2017multi_7.page ├── 2017multi_8.page ├── 2017multi_9.page ├── 2017nanning.page ├── 2017qingdaoo.page ├── 2017shenyang.page ├── 2017shenyango.page ├── 2017urumqio.page ├── 2017xiano.page ├── 20180806training.page ├── 2018nanjing.page ├── 2018nc5.page ├── 2018nc6.page ├── 2018nc7.page ├── 2018shenyang.page ├── ASC.page ├── ASC1.page ├── ASC2.page ├── ASC3.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Gomory-Hu tree.page ├── Help.page ├── Linear_basis.page ├── Stoer Wagner.page ├── diary.page ├── final_pratice.page ├── jds-constructivealgorithm.page ├── jds-string.page ├── jds.page ├── wbr-DailySummary.page ├── wbr-geometry.page ├── wbr-numbertheory.page ├── wbr.page ├── xix_eurasia.page ├── xix_spb.page ├── xvii_siberia.page ├── xviii_gomel.page ├── xviii_khamovniki.page ├── xviii_korea.page ├── xviii_romania.page ├── xviii_ukraine.page ├── xviii_urals.page ├── zmy-CF.page ├── zmy-CFhard.page ├── zmy-DailySummary.page ├── zmy-atcoder.page ├── zmy-cfround434.page ├── zmy-cfround435.page ├── zmy.page ├── 多项式乱搞.page ├── 对顶堆.page ├── 最小乘积系列.page └── 灭绝树.page ├── buaa-lip ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page └── jsh.page ├── calabash ├── 2002-2003 Winter Petrozavodsk Camp, Andrew Stankevich Contest 1.page ├── 2003-2004 Summer Petrozavodsk Camp, Andrew Stankevich Contest 2.page ├── 2003-2004 Summer Petrozavodsk Camp, Andrew Stankevich Contest 3.page ├── 2003-2004 Winter Petrozavodsk Camp, Andrew Stankevich Contest 4.page ├── 2003-2004 Winter Petrozavodsk Camp, Andrew Stankevich Contest 5.page ├── 2003-2004 Winter Petrozavodsk Camp, Andrew Stankevich Contest 6.page ├── 2004-2005 Summer Petrozavodsk Camp, Andrew Stankevich Contest 7.page ├── 2004-2005 Summer Petrozavodsk Camp, Andrew Stankevich Contest 8.page ├── 2004-2005 Summer Petrozavodsk Camp, Andrew Stankevich Contest 9.page ├── 2004-2005 Winter Petrozavodsk Camp, Andrew Stankevich Contest 10.page ├── 2004-2005 Winter Petrozavodsk Camp, Andrew Stankevich Contest 11.page ├── 2004-2005 Winter Petrozavodsk Camp, Andrew Stankevich Contest 12.page ├── 2005-2006 Summer Petrozavodsk Camp, Andrew Stankevich Contest 13.page ├── 2005-2006 Summer Petrozavodsk Camp, Andrew Stankevich Contest 14.page ├── 2005-2006 Summer Petrozavodsk Camp, Andrew Stankevich Contest 15.page ├── 2005-2006 Winter Petrozavodsk Camp, Andrew Stankevich Contest 16.page ├── 2005-2006 Winter Petrozavodsk Camp, Andrew Stankevich Contest 17.page ├── 2005-2006 Winter Petrozavodsk Camp, Andrew Stankevich Contest 18.page ├── 2006-2007 Summer Petrozavodsk Camp, Andrew Stankevich Contest 19.page ├── 2011-2012 Summer Petrozavodsk Camp, Warsaw U Contest.page ├── 2013 ACM-ICPC World Finals.page ├── 2015-2016 Petrozavodsk Winter Training Camp, SPb SU Contest.page ├── 2016 ACM-ICPC World Finals.page ├── 2018 China Collegiate Programming Contest Final.page ├── 2018 ICPC Asia Jakarta Regional Contest.page ├── 2018-2019 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2018).page ├── 2018-2019 ACM-ICPC, Asia Seoul Regional Contest.page ├── 2018-2019 ICPC, NEERC, Northern Eurasia Finals.page ├── 2018-2019 ICPC, NEERC, Southern Subregional Contest.page ├── 2018-2019 XIX Open Cup, Grand Prix of Korea.page ├── 2019 China Collegiate Programming Contest, Qinhuangdao Site.page ├── 2019 ICPC Asia Hong Kong Onsite.page ├── 2019 ICPC Asia Xuzhou Onsite.page ├── 2019 ICPC Asia Yinchuan Onsite.page ├── 2019 Multi-University Training Contest 1.page ├── 2019 Multi-University Training Contest 2.page ├── 2019 Multi-University Training Contest 3.page ├── 2019 Multi-University Training Contest 4.page ├── 2019 Multi-University Training Contest 5.page ├── 2019 Multi-University Training Contest 6.page ├── 2019-2020 ACM-ICPC Latin American Regional Programming Contest.page ├── 2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019).page ├── 2019-2020 ICPC, Asia Jakarta Regional Contest.page ├── 2019-2020 ICPC, NERC, Northern Eurasia Finals.page ├── 2019-2020 XX Open Cup, Grand Prix of Korea.page ├── 2019牛客暑期多校训练营(第一场).page ├── 2019牛客暑期多校训练营(第七场).page ├── 2019牛客暑期多校训练营(第三场).page ├── 2019牛客暑期多校训练营(第二场).page ├── 2019牛客暑期多校训练营(第五场).page ├── 2019牛客暑期多校训练营(第八场).page ├── 2019牛客暑期多校训练营(第六场).page ├── 2019牛客暑期多校训练营(第四场).page ├── ACM-ICPC 2018 徐州赛区网络预赛.page ├── ACM-ICPC 2018 焦作赛区网络预赛.page ├── ACM-ICPC 2018 青岛赛区网络预赛.page ├── ACM-ICPC 2019 南京赛区网络预赛.page ├── ACM-ICPC 2019 南昌赛区网络预赛.page ├── ACM-ICPC 2019 徐州赛区网络预赛.page ├── ACM-ICPC 2019 沈阳赛区网络预赛.page ├── Asia Hong Kong Regional Contest 2016.page ├── Asia-Tsukuba 2017.page ├── BAPC 2018.page ├── ByteDance - Moscow Workshops ICPC Programming Camp 2019,Day 1.page ├── ByteDance - Moscow Workshops ICPC Programming Camp 2019,Day 2,Div.A.page ├── ByteDance - Moscow Workshops ICPC Programming Camp 2019,Day 3,Div.A.page ├── ByteDance - Moscow Workshops ICPC Programming Camp 2019,Day 4,Div.A.page ├── ByteDance - Moscow Workshops ICPC Programming Camp 2019,Day 5,Div A,AtCoder Tour Finals Plus.page ├── ByteDance - Moscow Workshops ICPC Programming Camp 2019,Day 7,Blitz Contest.page ├── Discover Vladivostok 2019. Division A Day 1.page ├── Discover Vladivostok 2019. Division A Day 2.page ├── Discover Vladivostok 2019. Division A Day 3.page ├── Discover Vladivostok 2019. Division A Day 4.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Hello Barcelona Autumn 2018 Both Divisions Contest 1.page ├── Hello Barcelona Autumn 2018 Both Divisions Contest 2.page ├── Hello Barcelona Autumn 2018 Both Divisions Contest 3.page ├── Hello Barcelona Autumn 2018 Division A 3D Contest.page ├── Hello Barcelona Autumn 2018 Division A Contest 3.page ├── Hello Barcelona Autumn 2018 Division A Link-Cut Contest.page ├── Help.page ├── ICPC 2017-2018, NEERC, Northern Subregional Contest.page ├── ITMO Winter Training Camp 2019,Day 2.page ├── ITMO Winter Training Camp 2019,Day 3.page ├── ITMO Winter Training Camp 2019,Day 4.page ├── ITMO Winter Training Camp 2019,Day 5.page ├── ITMO Winter Training Camp 2019,Day 6.page ├── MEX Foundation Contest.page ├── Moscow Pre-Finals Workshop 2016. Kent Nikaido Contest 1.page ├── Moscow Pre-Finals Workshop 2016. National Taiwan U Selection.page ├── Moscow Pre-Finals Workshop 2019. KAIST Contest.page ├── Moscow Workshops ICPC Programming Camp 2019,Day 6,The Final Contest.page ├── NWERC 2018.page ├── NWERC 2019.page ├── North American Southeast Regional 2019 (Div 1).page ├── Petrozavodsk Summer-2013. Gennady Korotkevich Contest 1.page ├── Petrozavodsk Summer-2013. Moscow IPT Contest.page ├── Petrozavodsk Summer-2014. Andrew Stankevich Contest 46.page ├── Petrozavodsk Summer-2015. Andrew Stankevich Contest 48.page ├── Petrozavodsk Summer-2015. Moscow IPT Contest.page ├── Petrozavodsk Summer-2015. Xudyh Contest.page ├── Petrozavodsk Summer-2016. Moscow IPT Contest.page ├── Petrozavodsk Summer-2016. Pavel Khaustov Contest 2.page ├── Petrozavodsk Summer-2016. Warsaw U Contest, XVI Open Cup Onsite.page ├── Petrozavodsk Summer-2017. JOI TST 2012 Selection.page ├── Petrozavodsk Summer-2017. MIPT Contest.page ├── Petrozavodsk Summer-2017. Ruyi Li Contest 2.page ├── Petrozavodsk Summer-2017. Songyang Chen Contest 1.page ├── Petrozavodsk Summer-2017. UESTC Selection.page ├── Petrozavodsk Summer-2017. Warsaw U Contest, XVII OpenCup Onsite.page ├── Petrozavodsk Winter-2014. Andrew Stankevich Contest 47.page ├── Petrozavodsk Winter-2014. Warsaw U Contest.page ├── Petrozavodsk Winter-2015. Michael Tikhomirov Contest 1.page ├── Petrozavodsk Winter-2016. JAG Contest.page ├── Petrozavodsk Winter-2016. Moscow SU Trinity Contest.page ├── Petrozavodsk Winter-2016. Xiaoxu Guo Contest 4.page ├── Petrozavodsk Winter-2017. Xiaoxu Guo Contest 5.page ├── Petrozavodsk Winter-2018. Carnegie Mellon U Contest.page ├── Petrozavodsk Winter-2018. ITMO U 1 Contest.page ├── Petrozavodsk Winter-2019, Japanese Contest.page ├── Petrozavodsk Winter-2019. Oleksandr Kulkov Contest.page ├── Petrozavodsk Winter-2019. Petrozavodsk SU Contest.page ├── Petrozavodsk Winter-2019. Yandex Cup 2019.page ├── Roundgod.page ├── The 2018 ICPC Asia Xuzhou Regional Programming Contest.page ├── The 43rd ACM ICPC Asia Jiaozuo Regional Contest.page ├── The 43rd ACM ICPC Asia Nanjing Regional Contest.page ├── The 43rd ACM ICPC Asia Qingdao Regional Contest (Mirror).page ├── The 43rd ACM ICPC Asia Shenyang Regional Contest.page ├── The 43rd ACM ICPC Asia Xuzhou Regional Contest.page ├── The 43rd ACM ICPC Asia-East Continent Final.page ├── The 43rd ICPC Asia Shenyang Regional Contest.page ├── The 44th ICPC Asia Nanjing Regional Contest.page ├── Warsaw U Contest, Urozero 2015 Day 4.page ├── XIV Open Cup named after E.V. Pankratiev. GP of SPb.page ├── XIX Open Cup named after E.V. Pankratiev. Grand Prix of America.page ├── XIX Open Cup named after E.V. Pankratiev. Grand Prix of China.page ├── XIX Open Cup named after E.V. Pankratiev. Grand Prix of Eurasia, Division 1.page ├── XIX Open Cup named after E.V. Pankratiev. Grand Prix of Peterhof.page ├── XIX Open Cup named after E.V. Pankratiev. Grand Prix of SPb, Division 1.page ├── XIX Open Cup named after E.V. Pankratiev. Grand Prix of Siberia.page ├── XV Open Cup named after E.V. Pankratiev. GP of Siberia.page ├── XVII Open Cup named after E.V. Pankratiev. Grand Prix of America (NAIPC-2017).page ├── XVII Open Cup named after E.V. Pankratiev. Grand Prix of Moscow Workshops.page ├── XVII Open Cup named after E.V. Pankratiev. Grand Prix of Two Capitals.page ├── XVII Open Cup named after E.V. Pankratiev. XXI Ural Championship.page ├── XVIII Open Cup named after E.V. Pankratiev. Eastern Grand Prix.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Eurasia.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Gomel.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Khamovniki.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Korea.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Peterhof.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Romania.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of SPb.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Siberia.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Ukraine.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Ural.page ├── XX Open Cup named after E.V. Pankratiev. Grand Prix of Kazan.page ├── XX Open Cup named after E.V. Pankratiev. Grand Prix of SPb.page ├── XX Open Cup named after E.V. Pankratiev. Grand Prix of Siberia.page ├── 字节跳动冬令营网络赛.page └── 第四届CCPC中国大学生程序设计竞赛(吉林).page ├── check-it-out ├── 20170310.page ├── 20170323.page ├── 20170327.page ├── 20170912.page ├── 20171022.page ├── 20171029.page ├── 20171119.page ├── 20180131.page ├── 20180310.page ├── 20180311.page ├── 20180312.page ├── 20180313.page ├── 20180314.page ├── 20180315.page ├── 20180316.page ├── 20180317.page ├── Front Page.page ├── Gitit User’s Guide.page └── Help.page ├── deep-dark-fantasy ├── 20161008.page ├── 20161013.page ├── 20161015.page ├── 20161018.page ├── 20161019.page ├── 20161023.page ├── 20161103.page ├── 20161105.page ├── 20161110.page ├── 20161112.page ├── 20161113.page ├── 20161115.page ├── 20161117.page ├── 20161119.page ├── 20161124.page ├── 20161126.page ├── 20161127.page ├── 20161203.page ├── 20161204.page ├── 20161209.page ├── 20161210.page ├── 20161211.page ├── 20161217.page ├── 20161219.page ├── 20161221.page ├── 20161223.page ├── 20161224.page ├── 20170101.page ├── 20170105.page ├── 20170113.page ├── 20170114.page ├── 20170212.page ├── 20170213.page ├── 20170222.page ├── 20170301.page ├── 20170307.page ├── 20170307b.page ├── 20170308.page ├── 20170310.page ├── 20170312.page ├── 20170314.page ├── 20170314a.page ├── 20170319.page ├── 20170321.page ├── 20170322.page ├── 20170328.page ├── 20170401.page ├── 20170403.page ├── 20170404.page ├── 20170406.page ├── 20170407a.page ├── 20170407b.page ├── 20170409.page ├── 20170410.page ├── 20170411.page ├── 20170412.page ├── 20170413.page ├── 20170415.page ├── 20170416.page ├── 20170417.page ├── 20170420.page ├── 20170425.page ├── 20170427a.page ├── 20170428.page ├── 20170429.page ├── 20170430.page ├── 20170501.page ├── 20170501b.page ├── 20170502.page ├── 20170503.page ├── 20170504clj.page ├── 20170509.page ├── 20170514.page ├── 20170515.page ├── 20170515a.page ├── 20170515b.page ├── 20170516a.page ├── 20170516b.page ├── 20170517.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── cljfault.page ├── clsgeometry.page ├── clsplan.page ├── clspractice.page ├── clszuiba.page ├── dlsbuti.page ├── dyhfault.page ├── jcfault.page ├── moni.page ├── new.page ├── qianzhan.page ├── talkrecord.page └── templaterecord.page ├── dreadnought ├── 1003.1320v4.pdf ├── 2012 JAG Summer.page ├── 2014 ICPC Southeastern Europe Regional(SEERC 2014).page ├── 2015 ACM-ICPC Asia EC-Final.page ├── 2015 ACM-ICPC Asia Regional Beijing.page ├── 2015 ACM-ICPC Asia Regional Changchun.page ├── 2015 ACM-ICPC Asia Regional Hefei.page ├── 2015 ACM-ICPC Asia Regional Shanghai.page ├── 2015 ACM-ICPC Asia Regional Shenyang.page ├── 2015 ACM-ICPC Asia Regional Tsukuba.page ├── 2015 ACM-ICPC NEERC Central Subregional Contest.page ├── 2015 ACM-ICPC NEERC Moscow Subregional Contest.page ├── 2015 ACM-ICPC NEERC Northern Subregional Contest.page ├── 2015 ACM-ICPC NEERC Southern Subregional Contest.page ├── 2015 ACM-ICPC NEERC Western Subregional Contest.page ├── 2015 ACM-ICPC NWERC Northwestern European Regional Contest.page ├── 2015 ACM-ICPC Northeastern European Regional Contest(NEERC 2015).page ├── 2015 ACM │ ├── ICPC Asia Regional Beijing Online.page │ ├── ICPC Asia Regional Changchun Online.page │ ├── ICPC Asia Regional Hefei Online.page │ ├── ICPC Asia Regional Shanghai Online.page │ └── ICPC Asia Regional Shenyang Online.page ├── 2015 AMPPZ.page ├── 2015 China Collegiate Programming Contest Nanyang.page ├── 2015 German Collegiate Programming Contest (GCPC 15) POI 10T3.page ├── 2015 ICPC Southeastern European Regional(SEERC 2015).page ├── 2015 JAG Autumn.page ├── 2015 JAG Spring.page ├── 2015 Multi-University Training Contest 10.page ├── 2015 Multi-University Training Contest 2.page ├── 2015 Multi-University Training Contest 3.page ├── 2015 Multi-University Training Contest 4.page ├── 2015 Multi-University Training Contest 5.page ├── 2015 Multi-University Training Contest 6.page ├── 2015 Multi-University Training Contest 7.page ├── 2015 Multi-University Training Contest 8.page ├── 2015 Multi-University Training Contest 9.page ├── AIM Fund Cup 2015.page ├── ALUALU.page ├── Andrew Stankevich Contest 48.page ├── BaconBacon.page ├── BarrierCycleBasis.pdf ├── Bubble Cup 8 - Finals.page ├── Bug收集整理.page ├── Codeforces Round 318.page ├── Codeforces Round 319.page ├── Dhaka Regional 2014.page ├── Dhaka2014D.cpp ├── Fast Walsh-Hadamard transform.page ├── Front Page.page ├── Grodno 2015.page ├── HDU5320.cpp ├── ICPCCamp 2016 Day 1 - ftiasch’s Contest .page ├── ICPCCamp 2016 Day 2 - ZhejiangU Contest.page ├── ICPCCamp 2016 Day 3 – Grand Prix of China.page ├── ICPCCamp 2016 Day 4 - SJTU Dreadnought Contest.page ├── ICPCCamp 2016 Day 5 - SPb SU and SPb AU Contest.page ├── ICPCCamp 2016 Day 6 - Moscow SU Trinity Contest.page ├── ICPCCamp 2016 Day 7 - Makoto Soejima Contest 4.page ├── IV E.V. Pankratiev Memorial Open Cup. GP of SPb.page ├── IX Open Cup named after E.V. Pankratiev. Grand Prix of Azov Sea.page ├── IX Open Cup named after E.V. Pankratiev. Onsite Round.page ├── Ivan Smirnov Contest 1.page ├── LoliLoli.page ├── MIPTCamp 2016 Day1 - National Taiwan U Contest.page ├── MIPTCamp 2016 Day2 - Worldwide Selection 1.page ├── MIPTCamp 2016 Day3 - Kent Nikaido Contest 1.page ├── MIPTCamp 2016 Day4 - Botan Investment Cup.page ├── MIPTCamp 2016 Day5 - Japanese OI Selection Test 2016.page ├── MIPTCamp 2016 Day6 - Worldwide Selection 2.page ├── Makoto Soejima Contest 3.page ├── Moscow IPT Contest.page ├── Nizhny Novgorod SU Contest.page ├── North American Invitational Programming Contest 2016.page ├── Old Problems from ftiasch.page ├── PKU Campus 2014.page ├── Petr Mitrichev Contest 13.page ├── Screenshot from 2015-09-26 18:39:38.png ├── Secret;Weapon.page ├── Sichuan Province Programming Contest 2012.page ├── TopCoder Open 2015 3A.page ├── TopCoder Open 2015 3B.page ├── TopCoder SRM 668.page ├── Viewer(0.1).py ├── Viewer(beta).page ├── Warsaw U Tasks, XV Open Cup Onsite.page ├── Week of Code 17, Hackerrank.page ├── World Finals 2014.page ├── World Finals 2015.page ├── WorldFinal冲刺训练计划.page ├── XIV Open Cup named after E.V. Pankratiev. GP of Europe.page ├── XVI Open Cup named after E.V. Pankratiev Grand Prix of Baltics.page ├── XVI Open Cup named after E.V. Pankratiev Grand Prix of Saratov.page ├── XVI Open Cup named after E.V. Pankratiev Grand Prix of Southern Caucasus.page ├── XVI Open Cup named after E.V. Pankratiev Grand Prix of Tatarstan.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Bashkortostan.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Ekaterinburg.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Eurasia.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Europe.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Japan.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Peterhof.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Siberia.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of St. Petersburg.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Ukraine.page ├── XX Open Ural Championship Internet tour.page ├── Yandex Cup Day 1.page ├── Yandex Cup Day 2.page ├── ZOJ Monthly, October 2015.page ├── ZOJ Monthly, September 2015.page ├── viewer(0.1).py ├── viewer.py ├── 寒假个人提高.page ├── 日本赛区特训.page └── 浅析一类最小割问题(pty).pdf ├── euler-inversion ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── Petrozavodsk Winter-2015. Moscow SU Tapirs Contest.page └── fsf.page ├── excalibur ├── 2016 Multi-University Training Contest 1.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page └── personal.page ├── gatech ├── 2017 │ └── 9 │ │ ├── 2017 │ │ └── 9 │ │ │ └── 10 Problem A.page │ │ ├── 10 Some Gym Contest.page │ │ └── 9 SWERC14.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page └── img │ └── logo.png ├── giant-angola-rabbit ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── contests │ ├── 2010 BAPC.page │ ├── 2013 ICPC Chengdu Onsite.page │ ├── 2013 ICPC Nanjing Onsite.page │ ├── 2014 ICPC Anshan Onsite.page │ ├── 2014 ICPC Beijing Online.page │ ├── 2014 ICPC Beijing Onsite.page │ ├── 2014 ICPC Shanghai Onsite.page │ ├── 2015 CCPC Nanyang Onsite.page │ ├── 2015 ICPC Beijing Onsite.page │ ├── 2015 ICPC Shenyang Onsite.page │ ├── 2016 ICPC Beijing Onsite.page │ ├── 2016 ICPC Hongkong Online.page │ └── 2016 ICPC Shenyang Onsite.page ├── fzh │ ├── Jaedong.jpg │ └── fzh.page ├── sxj │ └── sxj.page └── wjy │ ├── 2016 ICPC Shenyang Onsite.page │ ├── contests │ ├── 2016 ICPC Shenyang Onsite.page │ └── 2016 Turing Cup.page │ └── wjy.page ├── glevel ├── 1.in ├── 2013 Multi-University Training Contest 1.page ├── 2013 Multi-University Training Contest 2.page ├── 2014 ACM-ICPC Asia Regional Bangkok.page ├── 2014 ACM-ICPC Asia Regional Daejeon.page ├── 2014 ACM-ICPC Asia Regional Dhaka.page ├── 2014 ACM-ICPC Asia Regional Jakarta.page ├── 2014 ACM-ICPC Asia Regional Tokyo.page ├── Codeforces Round 322.page ├── Codeforces Round 324.page ├── Codeforces Round 326.page ├── Codeforces Round 327 && 328.page ├── Codeforces Round 329 && 330.page ├── Educational Codeforces Round 1 && Testing Round .page ├── Educational Codeforces Round 2.page ├── Educational Codeforces Round 4.page ├── Front Page.page ├── Help.page ├── lcy.page ├── lwt.page └── shy.page ├── google10c9ccde2802a602.html ├── grimoire ├── 1-n素数个数.page ├── ARC80 F.page ├── ASC42 C.page ├── ASC42 J && RCC R62 E.page ├── CF830 D.page ├── CF830 E.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── WF2014A.page ├── hdu5823.page ├── hdu6049.page ├── hdu6051.page ├── hdu6091.page ├── hdu6094.page ├── img │ ├── logo.png │ ├── logo2.png │ └── test.png ├── jzh.page ├── kzoacn.page ├── maximum-minimum-idendity.page ├── n数码有解性判定.page ├── poj3235.page ├── test.png ├── zzq.page ├── 代码.page └── 贴上代码.page ├── hope-of-cczu ├── 2017 ACM-ICPC Asia East Continent League Final.page ├── 2018 Jiangsu Collegiate Programming Contest.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page └── The 15th Zhejiang Provincial Collegiate Programming Contest.page ├── lovely-donuts ├── 2014PacificNorthWest.page ├── 2015Amritapuri.page ├── 2015LatinAmerica.page ├── 2015Phuket.page ├── 2015Singapore.page ├── 2015Tsukuba.page ├── 2016Dalian.page ├── 2016beijingonline.page ├── 2016ccpcchangchun.page ├── 2016ccpchangzhou.page ├── 2016ccpchefei.page ├── 2016ccpcol.page ├── 2016dalianonline.page ├── 2016mutc1.page ├── 2016mytc10.page ├── 2016mytc2.page ├── 2016mytc3.page ├── 2016mytc4.page ├── 2016mytc5.page ├── 2016mytc6.page ├── 2016mytc7.page ├── 2016mytc8.page ├── 2016mytc9.page ├── 2016qingdaoonline.page ├── 2016shenyang.page ├── 2016shenyangonline.page ├── Front Page.page ├── Gitit User's Guide.page ├── Help.page ├── gym100507.page ├── gym100633.page ├── gym100886.page ├── gym100917.page ├── gym100923.page ├── gym101124.page ├── gym101137.page ├── gym101138.page ├── rikoizz.page ├── ruclion.page ├── ruclion_CF200.page ├── ruclion_CF302.page ├── skyxuan.page ├── srm659.page ├── srm660.page ├── syx_cf336.page ├── syx_cf339.page ├── syx_cf345.page ├── syx_cf356.page └── topcoder.page ├── milk-candy ├── 2009-2010 Summer Petrozavodsk Camp, Andrew Stankevich Contest 35.page ├── 2009-2010 Summer Petrozavodsk Camp, Andrew Stankevich Contest 36.page ├── 2009-2010 Winter Petrozavodsk Camp, Andrew Stankevich Contest 37.page ├── 2010-2011 Summer Petrozavodsk Camp, Andrew Stankevich Contest 38.page ├── 2014 Benelux Algorithm Programming Contest.page ├── 2014-2015 ACM-ICPC, Central Europe Regional Contest.page ├── 2015 ACM-ICPC Asia Taipei Regional Contest.page ├── 2015-2016 ACM-ICPC Northeastern European Regional Contest.page ├── 2015-2016 Northwestern European Regional Contest.page ├── 2016 ACM-ICPC Asia Hong Kong Regional Contest.page ├── 2016 USP-ICMC.page ├── 2016-2017 ACM-ICPC Asia Tsukuba Regional Contest.page ├── 2016-2017 ACM-ICPC East Central North America Regional Contest.page ├── 2016-2017 ACM-ICPC Nordic Collegiate Programming Contest.page ├── 2016-2017 ACM-ICPC Northeastern European Regional Contest.page ├── 2016-2017 ACM-ICPC Southwestern European Regional Programming Contest.page ├── 2017 ACM Jordanian Collegiate Programming Contest.page ├── 2017 ACM-ICPC Asia Regional Beijing Online.page ├── 2017 ACM-ICPC Asia Regional Nanning Online.page ├── 2017 ACM-ICPC Asia Regional Qingdao Online.page ├── 2017 ACM-ICPC Asia Regional Qingdao Onsite.page ├── 2017 ACM-ICPC Asia Regional Shenyang Online.page ├── 2017 ACM-ICPC Asia Regional Urumqi Online.page ├── 2017 ACM-ICPC Asia Regional Xi'an Online.page ├── 2017 CCPC Harbin Site.page ├── 2017 CCPC Online.page ├── 2017 CCPC Qinhuangdao Site.page ├── 2017 United Kingdom and Ireland Programming Contest.page ├── 2017-2018 ACM-ICPC Nordic Collegiate Programming Contest.page ├── 2017-2018 ACM-ICPC Pacific Northwest Regional Contest (Div. 1).page ├── 2017-2018 ACM-ICPC, NEERC, Moscow Subregional Contest.page ├── 2017-2018 ACM-ICPC, NEERC, Northern Subregional Contest.page ├── 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage.page ├── ACM-ICPC-Swiss-Subregional 2017.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── La Salle-Pui Ching Programming Challenge 2017.page ├── Lesnoe Ozero 2017. BSUIR Open 2017.page ├── Lesnoe Ozero-2016. NAIPC-2016.page ├── XVII Open Cup named after E.V. Pankratiev. Grand Prix of Moscow Workshops.page ├── XVII Open Cup named after E.V. Pankratiev. Grand Prix of Two Capitals.page ├── quailty.page ├── sk.page └── swq.page ├── mit-one ├── 2014 2015 Summer Petrozavodsk Camp Andrew Stankevich Contest 46.page ├── 2014 2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 47.page ├── 2016 ACM ICPC World Finals.page ├── 2016 North American Invitational Programming Contest.page ├── CCPC 2016 Finals.page ├── CEPC 2016.page ├── ECNA 2016.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── ICPCCamp 2017 Day 1 ftiasch’s Contest 5.page ├── ICPCCamp 2017 Day 3 THU DDF Contest.page ├── ICPCCamp 2017 Day 6 U of Tokyo Selection 1.page ├── Moscow Pre Finals Workshop 2016 Japanese School OI Team Selection.page ├── Moscow Pre Finals Workshop 2016 Kent Nikaido Contest 1.page ├── Moscow Pre Finals Workshop 2016 National Taiwan U Selection.page ├── NAIPC 2017.page ├── NEERC 2015 Northern Subregional.page ├── NEERC 2015.page ├── Petrozavodsk Summer 2016 Moscow IPT Contest.page ├── Petrozavodsk Summer 2016 Petr Mitrichev Contest 14.page ├── Petrozavodsk Summer 2016 Ural FU Dandelion Contest.page ├── Petrozavodsk Summer 2016 Warsaw U Contest XVI Open Cup Onsite.page ├── Petrozavodsk Winter 2016 JAG Contest.page ├── Petrozavodsk Winter 2016 Moscow SU Trinity Contest.page ├── Petrozavodsk Winter 2016 SPbSU Contest.page ├── SER 2016 ECNA 2015.page ├── UCF Trainning with rpeng.page ├── XVI Open Cup named after EV Pankratiev GP of Asia.page ├── XVII Open Cup named after EV Pankratiev GP of Eurasia.page ├── XVII Open Cup named after EV Pankratiev Grand Prix of Japan.page ├── XVII Open Cup named after EV Pankratiev Grand Prix of Two Capitals.page ├── bospre.page ├── bosprecode.tar ├── ecna2016-7k+.zip ├── ecna2016-7k+status.txt ├── ecna2016-7k-code.zip ├── ecna2016-7k-status.txt ├── nena regional.page ├── nenacode.tar ├── ser2016ecna2015-status.txt ├── ser2016ecna2015.zip ├── tsukuba 2016.page ├── ucf board.txt ├── ucf folder.zip ├── ucf status.txt └── 任务.page ├── mithril ├── Front Page.page ├── altai-stu-contest-s07.page ├── andrew-stankevich-contest-13.page ├── andrew-stankevich-contest-14.page ├── andrew-stankevich-contest-19.page ├── andrew-stankevich-contest-20.page ├── andrew-stankevich-contest-22.page ├── andrew-stankevich-contest-25.page ├── andrew-stankevich-contest-26.page ├── andrew-stankevich-contest-29.page ├── andrew-stankevich-contest-31.page ├── andrew-stankevich-contest-32.page ├── belarussian-su-and-kazakhstan-contest-s08.page ├── belarussian-su-contest-w07.page ├── bupt-2012.page ├── changchun-2012-preliminary.page ├── changchun-2012.page ├── codechef.page ├── dhaka-2008.page ├── dhaka-2011.page ├── eastern-2012.page ├── fault-list.page ├── hangzhou-2012-preliminary.page ├── harbin-2010.page ├── hard-problems-breaking.page ├── hit-2012.page ├── jag-problems-selection.page ├── jag-summer-camp-2012-day4.page ├── japanese-contest-s07.page ├── jinhua-2012-preliminary.page ├── jinhua-2012.page ├── kazakhstan-and-ukraine-contest-w07.page ├── kazakhstan-contest-s06.page ├── last-contest-w06.page ├── mixed-contest-w08.page ├── moscow-subregion-2012.page ├── msu-se-st-contest-w10.page ├── nnsu-orel-stu-contest-w11.page ├── nordic-2012.page ├── northern-subregion-2012.page ├── odessa-summer-camp-selection-w08.page ├── ontak-2010.page ├── pa-poi.page ├── petr-mitrichev-contest-8.page ├── petr-su-wx-contest.page ├── poi-x-cia.page ├── poi-x.page ├── poi-xi-zaw.page ├── poi-xi.page ├── saratov-su-contest.page ├── scheduled-trainings.page ├── selected-tasks-s07.page ├── southern-2012.page ├── spbsu-contest-s06.page ├── tianjin-2012-preliminary.page ├── todo-list.page ├── warsaw-u-contest-w07.page ├── warsaw-u-contest-w08.page ├── warsaw-u-contest-w11.page ├── western-2012.page ├── western-subregion-2011.page └── xii-opencup-udmurtia-gp.page ├── monster-attacking-crew ├── 2014 ACM-ICPC Asia Regional Dhaka.page ├── BAPC 2017.page ├── BUAA Summer Training 2018.08.21.page ├── BUAA Summer Training 2018.08.23.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── NWERC 2016.page ├── demo page.page ├── nowcoder multi 5.page ├── nowcoder multi 6.page ├── nowcoder multi 7.page ├── nowcoder multi 9.page └── to do list.page ├── ncut-latte ├── Front Page.page ├── Gitit User’s Guide.page └── Help.page ├── new-meta ├── 2015 │ └── 11 │ │ ├── 2015 │ │ └── 11 │ │ │ ├── 22 J.page │ │ │ └── 22 L.page │ │ └── 22 Open Cup Grand Prix of Europe.page ├── 2016 │ ├── 9 │ │ ├── 26 A.page │ │ └── 26 C.page │ ├── 10 │ │ └── 22 Canada Cup 2016.page │ ├── 02 │ │ ├── 04 AGC010.page │ │ ├── AGC010C.page │ │ ├── AGC010D.page │ │ ├── AGC010E.page │ │ └── AGC010F.page │ ├── 07 │ │ ├── 2016 │ │ │ └── 07 │ │ │ │ ├── 24 B.page │ │ │ │ ├── 24 C.page │ │ │ │ ├── 24 D.page │ │ │ │ ├── 24 F.page │ │ │ │ ├── 24 G.page │ │ │ │ ├── 24 H.page │ │ │ │ ├── 24 J.page │ │ │ │ ├── 24 L.page │ │ │ │ ├── 24 M.page │ │ │ │ ├── 25 D.page │ │ │ │ ├── 25 H.page │ │ │ │ ├── 28 J.page │ │ │ │ ├── 28 K.page │ │ │ │ ├── 29 B.page │ │ │ │ ├── 29 D.page │ │ │ │ ├── 29 G.page │ │ │ │ ├── 29 H.page │ │ │ │ ├── 30 E.page │ │ │ │ ├── 30 F.page │ │ │ │ ├── 30 G.page │ │ │ │ ├── 30 H.page │ │ │ │ └── 30 I.page │ │ ├── 24 2010 Asia Hangzhou Regional Contest.page │ │ ├── 24 2016 Multi-University Training Contest 2.page │ │ ├── 25 Chengdu 2010.page │ │ ├── 28 Dhaka 2012.page │ │ ├── 29 2016 Multi-University Training Contest 3.page │ │ └── 29 2016 Multi-University Training Contest 4.page │ ├── 08 │ │ ├── 2016 │ │ │ ├── 8 │ │ │ │ ├── 14 E.page │ │ │ │ ├── 14 I.page │ │ │ │ ├── 15 D.page │ │ │ │ ├── 15 E.page │ │ │ │ ├── 15 I.page │ │ │ │ ├── 16 A.page │ │ │ │ └── 16 D.page │ │ │ └── 08 │ │ │ │ ├── 10 B.page │ │ │ │ └── 12 I.page │ │ ├── 08 CERC 2012.page │ │ ├── 10 JAG Autumn 2012.page │ │ ├── 12 2016 Multi-University Training Contest 5.page │ │ ├── 12 2016 Multi-University Training Contest 6.page │ │ ├── 14 2016中国大学生程序设计竞赛 - 网络选拔赛.page │ │ ├── 16 Andrew Stankevich Contest 34.page │ │ ├── CERC 2012 B.cpp.page │ │ └── CERC 2012 F.cpp.page │ └── 09 │ │ ├── 2016 │ │ └── 9 │ │ │ ├── 20 G.page │ │ │ └── 22 F.page │ │ ├── 15 Bubble Cup 9.page │ │ ├── 20 Japan Alumni Group Spring Contest 2014.page │ │ ├── 20 Japan Alumni Group Spring Contest 2015.page │ │ └── 22 AtCoder Grand Contest 004.page ├── 2017 │ ├── 2 │ │ ├── 23 Petr Mitrichev Contest 14.page │ │ ├── 24 Warsaw U Contest, XVI Open Cup Onsite.page │ │ ├── 26 Grand Prix of Wroclaw.page │ │ ├── 28 Pavel Khaustov Contest 2.page │ │ ├── 9 2013-2014 Wide-Siberian Olympiad: Onsite round.page │ │ ├── Grand Prix of Wroclaw F.cpp.page │ │ ├── Petr_Mitrichev_Contest_14 A.cpp.page │ │ ├── Petr_Mitrichev_Contest_14 B.cpp.page │ │ ├── Petr_Mitrichev_Contest_14 C.cpp.page │ │ ├── Petr_Mitrichev_Contest_14 G.cpp.page │ │ └── Petr_Mitrichev_Contest_14 J.java.page │ ├── 3 │ │ ├── 2017 │ │ │ └── 3 │ │ │ │ ├── 19 WorldFinal2014 B.cpp.page │ │ │ │ ├── 23 AMPPZ-2015 D.cpp.page │ │ │ │ ├── 26 XVII Open Cup named after E.V. Pankratiev GP of Poland D.cpp.page │ │ │ │ ├── 26 XVII Open Cup named after E.V. Pankratiev GP of Poland H.cpp.page │ │ │ │ └── 28 AIM Fund Contest B.cpp.page │ │ ├── 11 Grand Prix of Gomel.page │ │ ├── 13 Petrozavodsk Summer-2015. Andrew Stankevich Contest 48.page │ │ ├── 15 Petrozavodsk Summer-2015 Yandex Cup Stage 2.page │ │ ├── 16 Petrozavodsk Summer-2015. Warsaw U Tasks.page │ │ ├── 19 WorldFinal2014.page │ │ ├── 2 Moscow IPT Contest.page │ │ ├── 22 Petrozavodsk Winter-2015. Michael Tikhomirov Contest 1.page │ │ ├── 23 AMPPZ-2015.page │ │ ├── 24 Makoto Soejima Contest 3.page │ │ ├── 26 XVII Open Cup named after E.V. Pankratiev GP of Poland.page │ │ ├── 28 AIM Fund Contest.page │ │ ├── 3 Kent Nikaido Contest 1.page │ │ ├── 30 XV Open Cup named after E.V. Pankratiev GP of Karelia.page │ │ ├── 4 Japanese OI Team Selection.page │ │ ├── 5 World Final 2012.page │ │ ├── AIM Fund Contest F.cpp.page │ │ ├── Grand Prix of Gomel B.cpp.page │ │ ├── Grand Prix of Gomel C.cpp.page │ │ ├── Grand Prix of Gomel K.cpp.page │ │ ├── H.cpp.page │ │ ├── Japanese OI Team Selection F.cpp.page │ │ ├── Kent Nikaido Contest 1 E.cpp.page │ │ ├── Makoto Soejima Contest 3 F.cpp.page │ │ ├── Makoto Soejima Contest 3 J.cpp.page │ │ ├── Moscow IPT Contest B.cpp.page │ │ ├── Petrozavodsk Summer-2015. Andrew Stankevich Contest 48 H.cpp.page │ │ ├── Petrozavodsk Summer-2015. Warsaw U Tasks A.cpp.page │ │ ├── Petrozavodsk Winter-2015. Michael Tikhomirov Contest 1 C.cpp.page │ │ ├── Petrozavodsk Winter-2015. Michael Tikhomirov Contest 1 D.cpp.page │ │ ├── World Final 2012 A.cpp.page │ │ ├── WorldFinal2014 G.cpp.page │ │ ├── WorldFinal2014 L.cpp.page │ │ ├── XVII Open Cup named after E.V. Pankratiev GP of Poland B.cpp 第二种方法wa的代码.page │ │ └── XVII Open Cup named after E.V. Pankratiev GP of Poland B.cpp.page │ ├── 03 │ │ ├── 31 XV Open Cup named after E.V. Pankratiev. GP of Udmurtia.page │ │ └── XV Open Cup named after E.V. Pankratiev. GP of Udmurtia D.cpp.page │ ├── 04 │ │ ├── 2017 │ │ │ └── 04 │ │ │ │ ├── 04 Moscow Subregional 2015 B.cpp.page │ │ │ │ ├── 22 Petrozavodsk Summer-2014. Warsaw U Contest D.cpp.page │ │ │ │ ├── 22 Petrozavodsk Summer-2014. Warsaw U Contest H.cpp.page │ │ │ │ ├── 22 Petrozavodsk Summer-2014. Warsaw U Contest K.cpp.page │ │ │ │ ├── 24 Petrozavodsk Winter-2014. Ukrainian Contest D.cpp.page │ │ │ │ ├── 25 Petrozavodsk Winter-2014. MIPT Contest.page │ │ │ │ └── 29 浙江省赛2017 M.cpp.page │ │ ├── 01 Petrozavodsk Winter-2015. Wroclaw.page │ │ ├── 02 Grand Prix of Tatarstan.page │ │ ├── 04 Moscow Subregional 2015.page │ │ ├── 07 Petrozavodsk Winter-2014. Warsaw U Contest.page │ │ ├── 08 Petrozavodsk Winter-2014. Moscow SU Tapir Contest.page │ │ ├── 22 Petrozavodsk Summer-2014. Warsaw U Contest.page │ │ ├── 24 Petrozavodsk Winter-2014. Ukrainian Contest.page │ │ ├── 25 Petrozavodsk Winter-2014. MIPT Contest.page │ │ ├── 29 浙江省赛2017.page │ │ ├── Petrozavodsk Winter-2014. Moscow SU Tapir Contest C.cpp.page │ │ └── Petrozavodsk Winter-2015. Wroclaw A.cpp.page │ └── 05 │ │ ├── 2017 │ │ └── 05 │ │ │ ├── 04 Petrozavodsk Summer-2014. Moscow SU SG Contest H.cpp.page │ │ │ ├── 09 Petrozavodsk Summer-2013. Gennady Korotkevich Contest 1 D.cpp.page │ │ │ └── 13 World Final 2010 A.cpp.page │ │ ├── 04 Petrozavodsk Summer-2014. Moscow SU SG Contest.page │ │ ├── 09 Petrozavodsk Summer-2013. Gennady Korotkevich Contest 1.page │ │ └── 13 World Final 2010.page ├── 2011-2012 Summer Petrozavodsk Camp, Warsaw U Contest.page ├── 2013-2014 Petrozavodsk Winter Training Camp, Moscow SU Trinity Contest.page ├── 2014-2015 ACM-ICPC, NEERC, Northern Subregional Contest.page ├── 2014-2015 V BSUIR Open Programming Championship.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 46 C.cpp.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 46 H.cpp.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 46.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 47 B.cpp.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 47 C.cpp.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 47 H.cpp.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 47 I.cpp.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 47 J.cpp.page ├── 2014-2015 Winter Petrozavodsk Camp, Andrew Stankevich Contest 47.page ├── 2015 ACM ICPC Shanghai.page ├── 2015 ShenYang.page ├── 2015-2016 6th BSUIR Open Programming Contest. Final B.cpp.page ├── 2015-2016 6th BSUIR Open Programming Contest. Final F.cpp.page ├── 2015-2016 6th BSUIR Open Programming Contest. Final J.cpp.page ├── 2015-2016 6th BSUIR Open Programming Contest. Final.page ├── 2016 ACM ICPC HongKong.page ├── 2016 ACM │ ├── 2016.10.31 I.cpp.page │ ├── 2016.10.31 M.cpp.page │ ├── ICPC Asia Regional Qingdao Online.page │ ├── ICPC Asia Regional Shenyang Online.page │ └── ICPC亚洲区沈阳.page ├── 2016 CCPC 合肥.page ├── 2016 Multi-University Training Contest 9.page ├── 2016 Prime Contest.page ├── 2016 Qing Dao E.page ├── 2016 Qing Dao M.page ├── 2016 Qing Dao.page ├── 2016-10-23 D.cpp.page ├── 2016-10-23 J.cpp.page ├── 2016-10-25 K.cpp.page ├── 2016-10-25 L.cpp.page ├── 2016-10-26 H.cpp.page ├── 2016-10-26 K.cpp.page ├── 2016-10-30 C.cpp.page ├── 2016-10-30 L.cpp.page ├── 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest.page ├── 2016.11.2 H.cpp.page ├── 2016.11.6 G.cpp.page ├── 2016.11.6 H.cpp.page ├── 2016.11.6 I.cpp.page ├── 51nod16 F.page ├── 8VC Venture Cup 2017 - Final Round D.cpp.page ├── 8VC Venture Cup 2017 - Final Round F.cpp.page ├── 8VC Venture Cup 2017 - Final Round.page ├── A fast suffix array algorithm.page ├── AGC8 F.cpp.page ├── AGC8.page ├── APIO2011方格染色的正确姿势.page ├── ASC44J.page ├── ASC45C.page ├── ASC45H.page ├── ASC45J.page ├── Andrew Stankevich Contest 32.page ├── Andrew Stankevich Contest 44.page ├── Andrew Stankevich Contest 45.page ├── AtCoder Grand Contest 009 E.cpp.page ├── AtCoder Grand Contest 009.page ├── BOI2015p1.cpp.page ├── BOI2015p1.page ├── CERC 2014.page ├── CERC 2016 B.cpp.page ├── CERC 2016 D.cpp.page ├── CERC 2016 E.cpp.page ├── CERC 2016 G_Me.cpp.page ├── CERC 2016 G_Mike.cpp.page ├── CERC 2016 I.cpp.page ├── CERC 2016.page ├── CF395DIV1C.page ├── CF395DIV1D.page ├── CF395DIV1E.page ├── CROC2016G.page ├── Codeforces364.page ├── Czech Grand Prix.page ├── CzechGrandPrixG.page ├── Flip Coins.page ├── IOI2015p1.page ├── IOI2016.page ├── IOI2016p1.page ├── IOI2016p2.page ├── IOI2016p3.page ├── IOI2016p4.page ├── IOI2016p5.page ├── IOI2016p6.page ├── JAG Practice Contest for ACM-ICPC Asia Regional 2014.page ├── KM.page ├── Miceren.page ├── Moscow QF 2016.page ├── NEERC 14.page ├── NEERC 16.page ├── NEERC14 B.cpp.page ├── NEERC14G.page ├── NEERC14H.page ├── NEERC16 B.cpp.page ├── NEERC16 D.cpp.page ├── NEERC16 G.cpp.page ├── NEERC16 I.cpp.page ├── New Meta's Wiki.page ├── Petrozavodsk Summer-2015. Ivan Smirnov Contest 1 C.cpp.page ├── Petrozavodsk Summer-2015. Ivan Smirnov Contest 1 G.cpp.page ├── Petrozavodsk Summer-2015. Ivan Smirnov Contest 1.page ├── Petrozavodsk Summer-2015. Moscow IPT Contest A.cpp.page ├── Petrozavodsk Summer-2015. Moscow IPT Contest D.cpp.page ├── Petrozavodsk Summer-2015. Moscow IPT Contest F.cpp.page ├── Petrozavodsk Summer-2015. Moscow IPT Contest.page ├── Petrozavodsk Summer-2015. Petr Mitrichev Contest 13 C.cpp.page ├── Petrozavodsk Summer-2015. Petr Mitrichev Contest 13.page ├── Petrozavodsk Summer-2015. Warsaw U Tasks A_1.jpg ├── Petrozavodsk Summer-2015. Warsaw U Tasks A_2.jpg ├── Prime Contest 31.cpp.page ├── Prime Contest C.cpp.page ├── Prime Contest D.cpp.page ├── Prime Contest D2.cpp.page ├── Prime Contest F.cpp.page ├── Prime Contest I.cpp.page ├── PrimeContestSolutionForE ├── QQ图片20150702110151.png ├── Suffix Tree.page ├── TCO FINAL 1000.page ├── TCO2016 FINAL 500.cpp.page ├── The Mean Value Property of Harmonic Functions.page ├── Time Complexity of Suffix Automaton.page ├── TopCoder_SRM708_Hard.page ├── Topcoder专题.page ├── UOJ Goodbye Bingshen.page ├── UOJ专题.page ├── URAL Championship 2012.page ├── URAL Championship 2015.page ├── URAL Championship 2016.page ├── URALChampionship2012I.page ├── URALChampionship2012J.page ├── URALChampionship2015_D.cpp.page ├── URALChampionship2016B.page ├── URALChampionship2016F.page ├── URALChampionship2016I.page ├── XVI Open Cup named after E.V. Pankratiev. GP of Japan C.cpp.page ├── XVI Open Cup named after E.V. Pankratiev. GP of Japan.page ├── bzoj2303.cpp.page ├── cf395div1.page ├── codefestival2016quala_D.cpp.page ├── css │ └── custom.css ├── custom.css ├── dot_green.png ├── dot_red.png ├── edi.cpp.page ├── fil.cpp.page ├── flip_coins.page ├── gy.page ├── gym101234.page ├── gym101234E.page ├── gym101234ENLOGN.page ├── gym101237B.page ├── gym101237G.page ├── gym101237H.page ├── gym101237I.page ├── gym101237K.page ├── hac.cpp.page ├── matroid intersection algorithm.page ├── monkey.pdf ├── net.cpp.page ├── ontak2016.page ├── open cup GP of Japan.page ├── pandora_1.png ├── purple.png ├── suo_1.jpg ├── suo_1_ng.png ├── tug.cpp.page ├── 分治fft的正确姿势.page ├── 有限域上度数是$n$的约数的不可约多项式之积.page └── 精妙题.page ├── nightfall ├── 1.page ├── 2011-2012 Petrozavodsk Summer Training Camp, Kyiv Kharkov NU Contest.page ├── 2012 Asia Chengdu Regional Contest.page ├── 2012 Multi-University Training Contest 7 Select (solo).page ├── 2012-2013 ACM-ICPC, Asia Tokyo Regional Contest.page ├── 2012-2013 ACM-ICPC, NEERC, Moscow Subregional Contest.page ├── 2013 Multi-University Training Contest 9.page ├── 2014 ACM-ICPC Beijing Invitational Programming Contest.page ├── 2014-2015 ACM-ICPC East Central North America Regional Contest (ECNA 2014).page ├── 2015 Multi-University Training Contest 2.page ├── 2015-2016 ACM-ICPC East Central North America Regional Contest (ECNA 2015).page ├── 2016-2017 ACM-ICPC Northwestern European Regional Programming Contest (NWERC 2016).page ├── 2016-2017 ACM-ICPC, Central Europe Regional Contest (CERC 16).page ├── 2017 ACM │ ├── ICPC Asia Regional Qingdao Online.page │ └── ICPC Asia Regional Shenyang Online.page ├── 2017 Multi-University Training Contest - Team 2.page ├── 2017 Multi-University Training Contest - Team 4.page ├── 2017 Multi-University Training Contest - Team 5.page ├── 2017 Multi-University Training Contest - Team 6.page ├── 2017 Multi-University Training Contest - Team 8.page ├── 2017 Russian Code Cup (RCC 17), Final Round.page ├── 2017-2018 ACM-ICPC, Asia Daejeon Regional Contest.page ├── 2017-2018 ACM-ICPC, Central Europe Regional Contest (CERC 17).page ├── 2017-2018 ACM-ICPC, NEERC, Northern Subregional Contest.page ├── 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage.page ├── 2017-2018 Northwestern European Regional Contest (NWERC 2017).page ├── 7.page ├── 8.page ├── 9~12.page ├── ASC29.page ├── Asia-Tsukuba 2017.page ├── Atcoder Grand Contest 013.page ├── Belarus I.page ├── CCPC NanYang 2015.page ├── CCPC 杭州.page ├── CCPC-Final.page ├── CF 463 F.page ├── CF 463 G.page ├── CF 467 D.page ├── CF 467 E.page ├── Changchun Online 2015.page ├── Codeforces.page ├── Day 1. JAG2017 plus.page ├── Day 2. Taiwan NTU Contest.page ├── Day 5 Division A. Lviv NU Contest 2.page ├── Day 6 Division A. Mixed Contest.page ├── Day 7. Radewoosh Contest.page ├── Day1.page ├── Day2.page ├── Day3.page ├── Day4.page ├── Day5.page ├── Day6.page ├── EC Final(10 │ └── 12).page ├── ECL-Final.page ├── Front Page.page ├── GYM.page ├── Gitit User’s Guide.page ├── Grand Prix of Baltic Sea.page ├── Grand Prix of Belarus.page ├── Hefei 2015.page ├── Hefei Online 2015.page ├── Help.page ├── ICPC 北京.page ├── ICPC 西安.page ├── JAG Summer Camp 12 Day 4.page ├── Jakarta 2012.page ├── NEERC-2017.page ├── Petrozavodsk Summer-2013. Warsaw U Contest.page ├── Petrozavodsk Summer-2013.page ├── Petrozavodsk Summer-2017. Warsaw U Contest, XVII OpenCup Onsite.page ├── Petrozavodsk Winter-2018. Carnegie Mellon U Contest F.page ├── Petrozavodsk Winter-2018. Carnegie Mellon U Contest.page ├── SEERC 2014.page ├── SJTU ACM 2017 FFT加训.page ├── SJTU ACM 2017 几何题加训.page ├── SJTU ACM 2017 线段树加训.page ├── SJTU ACM Summer Training List .page ├── SRM 717 800.page ├── SRM 724 1000.page ├── SRM 724 250.page ├── SRM 724 500.page ├── SRM 730 1000.page ├── SWERC 2013.page ├── Saratov E DSU.page ├── Saratov E Dinic.page ├── Saratov E Hopcroft.page ├── Shanghai 2014.page ├── Shenyang Online 2014.page ├── Tehran 2010.page ├── Training for Nightfall - 2017.07.21.page ├── VK R2 D1.page ├── World Final 2012.page ├── World Final.page ├── World Finals 2014.page ├── XIII Open Grodno SU Championship.page ├── XIV Open Cup named after E.V. Pankratiev. GP of SPb.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Korea.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Romania.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of SPb.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Saratov.page ├── XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Urals.page ├── agc 021 C.page ├── agc 021 E.page ├── code yandex r2 d.cpp.page ├── git_add_and_commit.sh ├── go.py ├── pe621.cpp.page ├── pe622 code.page ├── static │ └── img │ │ └── logo.png ├── yandex 2018 third qual E.page ├── 中档题.page ├── 北京(7 │ └── 11).page ├── 坑.page ├── 大连.page ├── 学习 (Aki).page ├── 模板暂存.page ├── 水题.page ├── 沈阳.page ├── 算法学习 (lbn187).page ├── 红书.page ├── 练习 (Aki).page ├── 练习 2018 (Aki).page ├── 练习(lbn187).page ├── 练习.page ├── 补题.page ├── 难题.page ├── 青岛.page └── 题目暂存.page ├── null ├── 1.jpeg ├── 1.png ├── 2014-2015 ACM-ICPC Pacific Northwest Regional Contest (Div. 1).page ├── 2014anshan.page ├── 2014xian.page ├── 2015 ACM National Contest Romania - Round 1.page ├── 2015 ACM │ └── ICPC EC-Final.page ├── 2015 ICL, Finals, Div. 1.page ├── 2015 USP Try-outs.page ├── 2015-2016 Petrozavodsk Winter Training Camp, Saratov SU Contest.page ├── 2016 ACM │ ├── ICPC Asia Regional Beijing Online.page │ ├── ICPC Asia Regional Dalian Online.page │ ├── ICPC Asia Regional Qingdao Online.page │ ├── ICPC Asia Regional Qingdao.page │ └── ICPC Asia Regional Shenyang Online.page ├── 2016 CCPC Hefei.page ├── 2016 Multi-University Training Contest 1.page ├── 2016 Multi-University Training Contest 10.page ├── 2016 Multi-University Training Contest 2.page ├── 2016 Multi-University Training Contest 3.page ├── 2016 Multi-University Training Contest 4.page ├── 2016 Multi-University Training Contest 5.page ├── 2016 Multi-University Training Contest 6.page ├── 2016 Multi-University Training Contest 7.page ├── 2016 Multi-University Training Contest 8.page ├── 2016 Multi-University Training Contest 9.page ├── 2016 USP Try-outs.page ├── 2016-2017 ACM-ICPC, NEERC, Moscow Subregional Contest.page ├── 2016-2017 ACM-ICPC, NEERC, Northern Subregional Contest.page ├── 2016-2017 CF S03E06 CF Trainings Season 3 Episode 6.page ├── 2016-2017 CT S03E02 Codeforces Trainings Season 3 Episode 2.page ├── 2016CCPC东北地区大学生程序设计竞赛 - 重现赛.page ├── 2016shenyang.page ├── 2016中国大学生程序设计竞赛 - 网络选拔赛.page ├── 2016四川省赛.page ├── 2016弱校联盟十一专场10.7.page ├── 3.jpg ├── ACM-ICPC Asia Regional Beijing 2015.page ├── ACM-ICPC Asia Regional Changchun 2015.page ├── ACM-ICPC Asia Regional Heifei 2015.page ├── ACM-ICPC Asia Regional Shanghai 2015.page ├── BUAA Summer Training 2016.07.30.page ├── BUAA Summer Training 2016.08.06.page ├── China Collegiate Programming Contest 2016 Changchun.page ├── Front Page.page ├── Gitit User's Guide.page ├── Help.page ├── XVI Open Cup named after E.V. Pankratiev. GP of Ekaterinburg.page ├── XVI Open Cup named after E.V. Pankratiev. GP of Siberia.page ├── codeforces round302&305.page ├── hx.page ├── img │ ├── abc.png │ └── logo.png ├── logo.jpg ├── logo.png ├── lyj.page ├── money.page ├── todo list.page ├── worldfinal2016.page └── 每日总结.page ├── oceanus ├── 2014-2015 ACM-ICPC, NEERC, Eastern Subregional Contest.page ├── 2015 Asia Shanghai Regional Contest.page ├── 2015-2016 Petrozavodsk Winter Training Camp, Saratov SU Contest.page ├── 2016 ACM │ ├── ICPC Asia Regional Beijing Online.page │ ├── ICPC Asia Regional Qingdao Online.page │ └── ICPC Asia Regional Shenyang Online.page ├── 2016 Multi-University Training Contest 1.page ├── 2016 Multi-University Training Contest 10.page ├── 2016 Multi-University Training Contest 2.page ├── 2016 Multi-University Training Contest 3.page ├── 2016 Multi-University Training Contest 4.page ├── 2016 Multi-University Training Contest 5.page ├── 2016 Multi-University Training Contest 6.page ├── 2016 Multi-University Training Contest 7.page ├── 2016 Multi-University Training Contest 8.page ├── 2016 Multi-University Training Contest 9.page ├── 2016 ccpc 网络赛.page ├── 2016 四川省赛.page ├── 2016-2017 ACM-ICPC Northwestern European Regional Programming Contest (NWERC 2016).page ├── 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest.page ├── 2016-2017 CT S03E01 Codeforces Trainings Season 3 Episode 1.page ├── 2016-2017 CT S03E01 Codeforces Trainings Season 3 Episode 2.page ├── 2016-2017 CT S03E05 Codeforces Trainings Season 3 Episode 5.page ├── 2016年湖南省第十二届大学生计算机程序设计竞赛.page ├── 6c224f4a20a44623e163c1ee9a22720e0df3d795.jpg ├── ACM-ICPC 2014 Asia Tokyo Regional Online Open Contest.page ├── ACM-ICPC Asia Regional Dalian 2016.page ├── ACM-ICPC Asia Regional Shenyang 2016.page ├── Asia Hong Kong Online Preliminary.page ├── CCPC 东北.page ├── CCPC 合肥.page ├── CCPC 杭州.page ├── CCPC 长春.page ├── CCPC-FINAL Ningbo 2016.page ├── Front Page.page ├── Help.page ├── IntelCodeElimination.page ├── IntelCodeFinal.page ├── JAG Practice Contest for ACM-ICPC Asia Regional 2016.page ├── aimtech.page ├── cf 368.page ├── cf 369.page ├── cf 371.page ├── cf edu 16.page ├── cf704b.page ├── srm 601.page ├── srm 602.page ├── srm 603.page ├── srm 604.page ├── srm 605.page ├── srm 606.page ├── srm 607.page ├── srm 608.page ├── srm 609.page ├── zsc.page ├── zsctba.page └── 台湾.page ├── post ├── Front Page.page ├── Post 100.page ├── Post 101.page ├── Post 102.page ├── Post 104.page ├── Post 105.page ├── Post 106.page ├── Post 107.page ├── Post 108.page ├── Post 109.page ├── Post 11.page ├── Post 110.page ├── Post 113.page ├── Post 114.page ├── Post 115.page ├── Post 116.page ├── Post 117.page ├── Post 118.page ├── Post 119.page ├── Post 12.page ├── Post 120.page ├── Post 121.page ├── Post 122.page ├── Post 123.page ├── Post 124.page ├── Post 125.page ├── Post 126.page ├── Post 127.page ├── Post 128.page ├── Post 129.page ├── Post 130.page ├── Post 131.page ├── Post 132.page ├── Post 133.page ├── Post 134.page ├── Post 135.page ├── Post 136.page ├── Post 137.page ├── Post 138.page ├── Post 139.page ├── Post 14.page ├── Post 140.page ├── Post 141.page ├── Post 142.page ├── Post 143.page ├── Post 144.page ├── Post 145.page ├── Post 146.page ├── Post 147.page ├── Post 148.page ├── Post 149.page ├── Post 15.page ├── Post 150.page ├── Post 151.page ├── Post 152.page ├── Post 153.page ├── Post 154.page ├── Post 155.page ├── Post 157.page ├── Post 158.page ├── Post 159.page ├── Post 16.page ├── Post 160.page ├── Post 161.page ├── Post 162.page ├── Post 163.page ├── Post 164.page ├── Post 165.page ├── Post 166.page ├── Post 167.page ├── Post 168.page ├── Post 169.page ├── Post 17.page ├── Post 170.page ├── Post 171.page ├── Post 172.page ├── Post 173.page ├── Post 174.page ├── Post 175.page ├── Post 176.page ├── Post 177.page ├── Post 178.page ├── Post 18.page ├── Post 180.page ├── Post 181.page ├── Post 182.page ├── Post 183.page ├── Post 185.page ├── Post 186.page ├── Post 187.page ├── Post 188.page ├── Post 189.page ├── Post 190.page ├── Post 192.page ├── Post 193.page ├── Post 194.page ├── Post 195.page ├── Post 196.page ├── Post 197.page ├── Post 198.page ├── Post 199.page ├── Post 2.page ├── Post 20.page ├── Post 200.page ├── Post 201.page ├── Post 202.page ├── Post 203.page ├── Post 204.page ├── Post 205.page ├── Post 206.page ├── Post 207.page ├── Post 208.page ├── Post 209.page ├── Post 21.page ├── Post 210.page ├── Post 211.page ├── Post 212.page ├── Post 213.page ├── Post 214.page ├── Post 215.page ├── Post 216.page ├── Post 217.page ├── Post 218.page ├── Post 219.page ├── Post 22.page ├── Post 220.page ├── Post 221.page ├── Post 222.page ├── Post 223.page ├── Post 224.page ├── Post 225.page ├── Post 227.page ├── Post 228.page ├── Post 229.page ├── Post 23.page ├── Post 230.page ├── Post 231.page ├── Post 232.page ├── Post 233.page ├── Post 234.page ├── Post 235.page ├── Post 236.page ├── Post 237.page ├── Post 238.page ├── Post 239.page ├── Post 24.page ├── Post 240.page ├── Post 241.page ├── Post 242.page ├── Post 243.page ├── Post 244.page ├── Post 245.page ├── Post 246.page ├── Post 247.page ├── Post 248.page ├── Post 249.page ├── Post 25.page ├── Post 250.page ├── Post 251.page ├── Post 252.page ├── Post 253.page ├── Post 254.page ├── Post 255.page ├── Post 256.page ├── Post 257.page ├── Post 258.page ├── Post 259.page ├── Post 26.page ├── Post 260.page ├── Post 261.page ├── Post 262.page ├── Post 263.page ├── Post 264.page ├── Post 265.page ├── Post 266.page ├── Post 267.page ├── Post 268.page ├── Post 269.page ├── Post 27.page ├── Post 270.page ├── Post 271.page ├── Post 272.page ├── Post 273.page ├── Post 274.page ├── Post 275.page ├── Post 276.page ├── Post 277.page ├── Post 278.page ├── Post 279.page ├── Post 28.page ├── Post 280.page ├── Post 281.page ├── Post 282.page ├── Post 283.page ├── Post 284.page ├── Post 285.page ├── Post 286.page ├── Post 287.page ├── Post 288.page ├── Post 289.page ├── Post 290.page ├── Post 291.page ├── Post 292.page ├── Post 293.page ├── Post 294.page ├── Post 295.page ├── Post 296.page ├── Post 297.page ├── Post 298.page ├── Post 3.page ├── Post 30.page ├── Post 300.page ├── Post 301.page ├── Post 302.page ├── Post 303.page ├── Post 304.page ├── Post 305.page ├── Post 306.page ├── Post 307.page ├── Post 308.page ├── Post 309.page ├── Post 31.page ├── Post 310.page ├── Post 311.page ├── Post 312.page ├── Post 313.page ├── Post 314.page ├── Post 315.page ├── Post 316.page ├── Post 317.page ├── Post 318.page ├── Post 319.page ├── Post 32.page ├── Post 320.page ├── Post 321.page ├── Post 322.page ├── Post 323.page ├── Post 324.page ├── Post 325.page ├── Post 326.page ├── Post 327.page ├── Post 328.page ├── Post 329.page ├── Post 33.page ├── Post 330.page ├── Post 331.page ├── Post 332.page ├── Post 333.page ├── Post 334.page ├── Post 335.page ├── Post 336.page ├── Post 337.page ├── Post 338.page ├── Post 339.page ├── Post 34.page ├── Post 340.page ├── Post 341.page ├── Post 342.page ├── Post 343.page ├── Post 344.page ├── Post 345.page ├── Post 346.page ├── Post 347.page ├── Post 348.page ├── Post 349.page ├── Post 35.page ├── Post 350.page ├── Post 351.page ├── Post 353.page ├── Post 354.page ├── Post 355.page ├── Post 356.page ├── Post 357.page ├── Post 358.page ├── Post 359.page ├── Post 36.page ├── Post 360.page ├── Post 361.page ├── Post 362.page ├── Post 363.page ├── Post 364.page ├── Post 365.page ├── Post 366.page ├── Post 367.page ├── Post 368.page ├── Post 369.page ├── Post 37.page ├── Post 370.page ├── Post 371.page ├── Post 372.page ├── Post 373.page ├── Post 374.page ├── Post 375.page ├── Post 376.page ├── Post 377.page ├── Post 378.page ├── Post 379.page ├── Post 38.page ├── Post 380.page ├── Post 381.page ├── Post 382.page ├── Post 383.page ├── Post 384.page ├── Post 385.page ├── Post 386.page ├── Post 387.page ├── Post 388.page ├── Post 389.page ├── Post 39.page ├── Post 390.page ├── Post 391.page ├── Post 392.page ├── Post 393.page ├── Post 394.page ├── Post 395.page ├── Post 396.page ├── Post 397.page ├── Post 399.page ├── Post 40.page ├── Post 400.page ├── Post 401.page ├── Post 402.page ├── Post 403.page ├── Post 404.page ├── Post 405.page ├── Post 406.page ├── Post 407.page ├── Post 408.page ├── Post 409.page ├── Post 41.page ├── Post 410.page ├── Post 411.page ├── Post 412.page ├── Post 413.page ├── Post 414.page ├── Post 415.page ├── Post 416.page ├── Post 417.page ├── Post 418.page ├── Post 419.page ├── Post 42.page ├── Post 420.page ├── Post 421.page ├── Post 422.page ├── Post 423.page ├── Post 424.page ├── Post 425.page ├── Post 426.page ├── Post 427.page ├── Post 428.page ├── Post 429.page ├── Post 43.page ├── Post 430.page ├── Post 431.page ├── Post 432.page ├── Post 433.page ├── Post 434.page ├── Post 435.page ├── Post 436.page ├── Post 439.page ├── Post 44.page ├── Post 440.page ├── Post 441.page ├── Post 442.page ├── Post 443.page ├── Post 444.page ├── Post 445.page ├── Post 446.page ├── Post 447.page ├── Post 448.page ├── Post 449.page ├── Post 45.page ├── Post 451.page ├── Post 452.page ├── Post 453.page ├── Post 454.page ├── Post 455.page ├── Post 456.page ├── Post 457.page ├── Post 458.page ├── Post 459.page ├── Post 46.page ├── Post 460.page ├── Post 461.page ├── Post 462.page ├── Post 463.page ├── Post 464.page ├── Post 465.page ├── Post 466.page ├── Post 467.page ├── Post 468.page ├── Post 469.page ├── Post 47.page ├── Post 471.page ├── Post 472.page ├── Post 473.page ├── Post 474.page ├── Post 475.page ├── Post 476.page ├── Post 477.page ├── Post 478.page ├── Post 479.page ├── Post 48.page ├── Post 481.page ├── Post 482.page ├── Post 483.page ├── Post 484.page ├── Post 486.page ├── Post 488.page ├── Post 489.page ├── Post 49.page ├── Post 491.page ├── Post 492.page ├── Post 493.page ├── Post 494.page ├── Post 495.page ├── Post 496.page ├── Post 497.page ├── Post 498.page ├── Post 499.page ├── Post 5.page ├── Post 50.page ├── Post 500.page ├── Post 501.page ├── Post 502.page ├── Post 503.page ├── Post 504.page ├── Post 505.page ├── Post 506.page ├── Post 507.page ├── Post 509.page ├── Post 51.page ├── Post 510.page ├── Post 511.page ├── Post 512.page ├── Post 513.page ├── Post 514.page ├── Post 515.page ├── Post 516.page ├── Post 517.page ├── Post 518.page ├── Post 519.page ├── Post 52.page ├── Post 520.page ├── Post 522.page ├── Post 523.page ├── Post 524.page ├── Post 525.page ├── Post 526.page ├── Post 527.page ├── Post 528.page ├── Post 529.page ├── Post 53.page ├── Post 530.page ├── Post 531.page ├── Post 532.page ├── Post 533.page ├── Post 534.page ├── Post 535.page ├── Post 536.page ├── Post 537.page ├── Post 538.page ├── Post 539.page ├── Post 54.page ├── Post 540.page ├── Post 541.page ├── Post 542.page ├── Post 543.page ├── Post 544.page ├── Post 545.page ├── Post 546.page ├── Post 547.page ├── Post 548.page ├── Post 549.page ├── Post 55.page ├── Post 551.page ├── Post 552.page ├── Post 553.page ├── Post 554.page ├── Post 555.page ├── Post 556.page ├── Post 557.page ├── Post 558.page ├── Post 559.page ├── Post 56.page ├── Post 560.page ├── Post 561.page ├── Post 562.page ├── Post 563.page ├── Post 564.page ├── Post 565.page ├── Post 566.page ├── Post 567.page ├── Post 568.page ├── Post 569.page ├── Post 57.page ├── Post 570.page ├── Post 571.page ├── Post 572.page ├── Post 573.page ├── Post 574.page ├── Post 575.page ├── Post 576.page ├── Post 577.page ├── Post 578.page ├── Post 579.page ├── Post 58.page ├── Post 580.page ├── Post 581.page ├── Post 582.page ├── Post 583.page ├── Post 584.page ├── Post 585.page ├── Post 586.page ├── Post 587.page ├── Post 588.page ├── Post 589.page ├── Post 59.page ├── Post 590.page ├── Post 591.page ├── Post 592.page ├── Post 593.page ├── Post 594.page ├── Post 595.page ├── Post 596.page ├── Post 597.page ├── Post 598.page ├── Post 599.page ├── Post 6.page ├── Post 600.page ├── Post 601.page ├── Post 602.page ├── Post 603.page ├── Post 604.page ├── Post 605.page ├── Post 606.page ├── Post 607.page ├── Post 608.page ├── Post 61.page ├── Post 614.page ├── Post 615.page ├── Post 616.page ├── Post 617.page ├── Post 618.page ├── Post 619.page ├── Post 62.page ├── Post 620.page ├── Post 621.page ├── Post 622.page ├── Post 623.page ├── Post 624.page ├── Post 625.page ├── Post 626.page ├── Post 627.page ├── Post 628.page ├── Post 629.page ├── Post 63.page ├── Post 630.page ├── Post 631.page ├── Post 632.page ├── Post 633.page ├── Post 634.page ├── Post 635.page ├── Post 636.page ├── Post 637.page ├── Post 638.page ├── Post 639.page ├── Post 64.page ├── Post 640.page ├── Post 641.page ├── Post 642.page ├── Post 643.page ├── Post 644.page ├── Post 645.page ├── Post 646.page ├── Post 647.page ├── Post 648.page ├── Post 649.page ├── Post 65.page ├── Post 650.page ├── Post 651.page ├── Post 652.page ├── Post 653.page ├── Post 654.page ├── Post 655.page ├── Post 656.page ├── Post 657.page ├── Post 658.page ├── Post 659.page ├── Post 660.page ├── Post 662.page ├── Post 663.page ├── Post 664.page ├── Post 665.page ├── Post 666.page ├── Post 667.page ├── Post 668.page ├── Post 669.page ├── Post 67.page ├── Post 670.page ├── Post 671.page ├── Post 672.page ├── Post 673.page ├── Post 674.page ├── Post 675.page ├── Post 676.page ├── Post 677.page ├── Post 678.page ├── Post 679.page ├── Post 68.page ├── Post 680.page ├── Post 681.page ├── Post 682.page ├── Post 683.page ├── Post 684.page ├── Post 685.page ├── Post 686.page ├── Post 687.page ├── Post 688.page ├── Post 689.page ├── Post 69.page ├── Post 690.page ├── Post 691.page ├── Post 692.page ├── Post 693.page ├── Post 694.page ├── Post 695.page ├── Post 696.page ├── Post 697.page ├── Post 698.page ├── Post 699.page ├── Post 7.page ├── Post 70.page ├── Post 700.page ├── Post 701.page ├── Post 702.page ├── Post 703.page ├── Post 704.page ├── Post 705.page ├── Post 706.page ├── Post 707.page ├── Post 708.page ├── Post 709.page ├── Post 71.page ├── Post 710.page ├── Post 711.page ├── Post 712.page ├── Post 713.page ├── Post 714.page ├── Post 715.page ├── Post 716.page ├── Post 717.page ├── Post 718.page ├── Post 719.page ├── Post 72.page ├── Post 720.page ├── Post 721.page ├── Post 722.page ├── Post 723.page ├── Post 724.page ├── Post 725.page ├── Post 726.page ├── Post 727.page ├── Post 728.page ├── Post 729.page ├── Post 73.page ├── Post 730.page ├── Post 731.page ├── Post 732.page ├── Post 736.page ├── Post 738.page ├── Post 739.page ├── Post 74.page ├── Post 740.page ├── Post 741.page ├── Post 742.page ├── Post 743.page ├── Post 744.page ├── Post 745.page ├── Post 746.page ├── Post 747.page ├── Post 748.page ├── Post 749.page ├── Post 75.page ├── Post 750.page ├── Post 751.page ├── Post 752.page ├── Post 753.page ├── Post 754.page ├── Post 755.page ├── Post 756.page ├── Post 757.page ├── Post 758.page ├── Post 759.page ├── Post 76.page ├── Post 760.page ├── Post 761.page ├── Post 762.page ├── Post 763.page ├── Post 764.page ├── Post 765.page ├── Post 766.page ├── Post 767.page ├── Post 768.page ├── Post 769.page ├── Post 77.page ├── Post 770.page ├── Post 771.page ├── Post 772.page ├── Post 773.page ├── Post 774.page ├── Post 775.page ├── Post 778.page ├── Post 779.page ├── Post 78.page ├── Post 780.page ├── Post 781.page ├── Post 782.page ├── Post 783.page ├── Post 784.page ├── Post 785.page ├── Post 786.page ├── Post 787.page ├── Post 788.page ├── Post 789.page ├── Post 79.page ├── Post 790.page ├── Post 791.page ├── Post 792.page ├── Post 793.page ├── Post 794.page ├── Post 795.page ├── Post 796.page ├── Post 797.page ├── Post 798.page ├── Post 799.page ├── Post 8.page ├── Post 80.page ├── Post 800.page ├── Post 801.page ├── Post 802.page ├── Post 803.page ├── Post 804.page ├── Post 805.page ├── Post 806.page ├── Post 807.page ├── Post 808.page ├── Post 809.page ├── Post 81.page ├── Post 810.page ├── Post 811.page ├── Post 812.page ├── Post 813.page ├── Post 814.page ├── Post 815.page ├── Post 816.page ├── Post 817.page ├── Post 818.page ├── Post 819.page ├── Post 82.page ├── Post 821.page ├── Post 83.page ├── Post 84.page ├── Post 85.page ├── Post 86.page ├── Post 87.page ├── Post 88.page ├── Post 89.page ├── Post 9.page ├── Post 90.page ├── Post 91.page ├── Post 92.page ├── Post 93.page ├── Post 94.page ├── Post 95.page ├── Post 96.page ├── Post 97.page ├── Post 98.page └── Post 99.page ├── red-queen ├── 20161022.page ├── 20161022.page.backup ├── 20161023.page ├── 20161023.page.backup ├── 20161109.page ├── 20161109.page.backup ├── 20161111.page ├── 20161111.page.backup ├── 20161112.page ├── 20161112.page.backup ├── 20161127.page ├── 20161127.page.backup ├── 20161204.page ├── 20161204.page.backup ├── 20161212.page ├── 20161212.page.backup ├── 20170221.page ├── 20170221.page.backup ├── 20170224.page ├── 20170224.page.backup ├── 20170228.page ├── 20170228.page.backup ├── 20170303.page ├── 20170303.page.backup ├── 20170501.page ├── 20170501.page.backup ├── 20170506.page ├── 20170506.page.backup ├── Front Page.page ├── Front Page.page.backup ├── Gitit User’s Guide.page └── Help.page ├── resuscitated-hope ├── 2013 ACM │ ├── ICPC Asia Regional Changchun Online.page │ └── ICPC Asia Regional Nanjing Online.page ├── 2013 Asia Changchun Regional Contest.page ├── 2013 Asia Chengdu Regional Contest.page ├── 2013 Asia Hangzhou Regional Contest.page ├── 2013 Asia Nanjing Regional Contest.page ├── 2013 Multi-University Training Contest 7.page ├── 2014 ACM │ └── ICPC Asia Regional Anshan Online.page ├── 2015-2016 ACM-ICPC, NEERC, Northern Subregional Contest.page ├── 2015-2016 Northwestern European Regional Contest.page ├── 2015-2016 Petrozavodsk Winter Training Camp, Makoto rng_58 Soejima Contest 4.page ├── 2015-2016 Petrozavodsk Winter Training Camp, Makoto rng_58 Soejima Сontest 4.page ├── 2015-2016 Petrozavodsk Winter Training Camp, Moscow SU Trinity Contest.page ├── 2016-2017 ACM-ICPC Northeastern European Regional Contest (NEERC 16).page ├── 2016-2017 ACM-ICPC Pacific Northwest Regional Contest (Div. 1).page ├── 2016-2017 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2016).page ├── 2016-2017 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2016).page ├── 2016-2017 ACM-ICPC, NEERC, Central Subregional Contest.page ├── 2016-2017 ACM-ICPC, NEERC, Moscow Subregional Contest.page ├── 2016-2017 ACM-ICPC, NEERC, Northern Subregional Contest.page ├── 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest.page ├── 2016-2017 CT S03E05 Codeforces Trainings Season 3 Episode 5.page ├── 2017 ACM │ ├── ICPC Asia Regional Beijing Online.page │ ├── ICPC Asia Regional Nanning Online.page │ ├── ICPC Asia Regional Qingdao Online.page │ ├── ICPC Asia Regional Shenyang Online.page │ ├── ICPC Asia Regional Urumqi Online.page │ ├── ICPC Asia Regional Xian Online.page │ └── ICPC Asia Regional Xian Onsite.page ├── 2017 CCPC Harbin Onsite.page ├── 2017 Multi-University Training Contest - Team 1.page ├── 2017 Multi-University Training Contest - Team 2.page ├── 2017 Multi-University Training Contest - Team 3.page ├── 2017 Multi-University Training Contest - Team 4.page ├── 2017 Multi-University Training Contest - Team 5.page ├── 2017 Multi-University Training Contest - Team 6.page ├── 2017 Multi-University Training Contest - Team 7.page ├── 2017 Multi-University Training Contest - Team 8.page ├── 2017 Multi-University Training Contest - Team 9.page ├── 2017ACM │ └── ICPC广西邀请赛-重现赛.page ├── 2017中国大学生程序设计竞赛 - 网络选拔赛.page ├── Asia Hong Kong Regional Contest 2016.page ├── BUAA Summer Practice 2017 .page ├── Cabinfever │ ├── FFT小结.page │ ├── jyb.page │ ├── 最大权闭合图和最大密度子图.page │ └── 网络流相关.page ├── ConnorZhong │ ├── 2017 Winter.page │ ├── CF 泛做计划.page │ ├── Codeforces Round 384.page │ ├── Contest Record.page │ ├── ICPCCamp.page │ ├── Winter Daily Training.page │ ├── zjc.page │ ├── 反演魔术.page │ └── 每日CF计划.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── Nontraining day.page ├── OpenCupXVIII Grand Prix of Eurasia.page ├── The 2013 ACM-ICPC Asia Chia-Yi Regional Contest.page ├── YOULLNEVERWA │ └── hzh.page └── “Citadel杯“ 2017 清华大学学生程序设计竞赛暨高校邀请赛.page ├── saltyfish ├── 2008-2009 Summer Petrozavodsk Camp, Andrew Stankevich Contest 31 (ASC 31).page ├── 2008-2009 Winter Petrozavodsk Camp, Andrew Stankevich Contest 33 (ASC 33).page ├── 2008-2009 Winter Petrozavodsk Camp, Andrew Stankevich Contest 34 (ASC 34).page ├── 2010 USP Try-outs.page ├── 2011 USP Try-outs.page ├── 2015 ICL, Finals, Div. 1.page ├── 2016 ACM │ ├── ICPC Asia China-Final.page │ ├── ICPC Asia Regional Dalian Online.page │ ├── ICPC Asia Regional Dalian Onsite.page │ ├── ICPC Asia Regional Qingdao Online.page │ ├── ICPC Asia Regional Qingdao Onsite.page │ └── ICPC Asia Regional Shenyang Online.page ├── 2016 Multi-University Training Contest 10.page ├── 2016 Multi-University Training Contest 5.page ├── 2016 Multi-University Training Contest 6.page ├── 2016 Multi-University Training Contest 7.page ├── 2016 Multi-University Training Contest 8.page ├── 2016 Multi-University Training Contest 9.page ├── 2016 USP Try-outs.page ├── 2016-2017 ACM-ICPC Asia-Bangkok Regional Contest.page ├── 2016-2017 ACM-ICPC Northwestern European Regional Programming Contest (NWERC 2016).page ├── 2016-2017 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2016).page ├── 2016-2017 ACM-ICPC, Central Europe Regional Contest (CERC 16).page ├── 2016-2017 ACM-ICPC, Egyptian Collegiate Programming Contest (ECPC 16).page ├── 2016-2017 ACM-ICPC, NEERC, Central Subregional Contest.page ├── 2016-2017 ACM-ICPC, NEERC, Moscow Subregional Contest.page ├── 2016-2017 ACM-ICPC, NEERC, Northern Subregional Contest.page ├── 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest.page ├── 2016-2017 CT S03E01: Codeforces Trainings Season 3 Episode 1.page ├── 2016-2017 CT S03E02: Codeforces Trainings Season 3 Episode 2.page ├── 2016-2017 CT S03E04: Codeforces Trainings Season 3 Episode 4.page ├── 2016-2017 CT S03E05: Codeforces Trainings Season 3 Episode 5.page ├── 2016-2017 CT S03E06: Codeforces Trainings Season 3 Episode 6.page ├── 2016-2017 National Taiwan University World Final Team Selection Contest.page ├── 2016CCPC东北地区大学生程序设计竞赛 - 重现赛.page ├── 2016中国大学生程序设计竞赛 - 网络选拔赛.page ├── 2016中国大学生程序设计竞赛总决赛.page ├── 2016中国大学生程序设计竞赛（长春）.page ├── 2016四川省赛.page ├── 2016年湖南省第十二届大学生计算机程序设计竞赛.page ├── 2016弱校联盟十一专场10.7 PKU Campus selection.page ├── 2017 清华大学学生程序设计竞赛暨高校邀请赛.page ├── 2017- BUPT Collegiate Programming Contest.page ├── ACM-ICPC国际大学生程序设计竞赛北京赛区(2016)网络赛.page ├── Front Page.page ├── Gitit User's Guide.page ├── Hard_Cuts.png ├── Help.page ├── ICPCCamp 2017 Day 1: ftiasch's Contest 5.page ├── ICPCCamp 2017 Day 2: zimpha's Contest 3.page ├── ICPCCamp 2017 Day 3: THU DDF Contest.page ├── ICPCCamp 2017 Day 4 Jagiellonian U Contest.page ├── ICPCCamp 2017 Day 5 Yandex Cup 2017.page ├── ICPCCamp 2017 Day 6 U of Tokyo Selection 1.page ├── JAG Practice Contest for ACM-ICPC Asia Regional 2016.page ├── MIPT-2016 Pre-Finals Workshop, Taiwan NTU Contest.page ├── Xiangtan Invitation Contest 2017.page ├── girlish_number.jpg ├── human2016_K.png ├── hunan2016_K2.png ├── quailty.page └── srm_699_hard.png ├── seven-underscores ├── 2015 USP Try-outs.page ├── 2016 Multi-University Training Contest │ ├── 2016 Multi-University Training Contest 1.page │ ├── 2016 Multi-University Training Contest 2.page │ ├── 2016 Multi-University Training Contest 3.page │ ├── 2016 Multi-University Training Contest 5.page │ ├── 2016 Multi-University Training Contest 6.page │ ├── 2016 Multi-University Training Contest 7.page │ ├── 2016 Multi-University Training Contest 8.page │ ├── 2016 Multi-University Training Contest.page │ └── canti.page ├── 2016 USP Try-outs.page ├── 2016-11.page ├── 2016-12.page ├── ACM-ICPC 2016 Shenyang.page ├── Bubble Cup 9 - Finals Online Mirror.page ├── CCPC 2016 Final.page ├── CCPC 2016 Hangzhou.page ├── CCPC长春赛 & 东北四省赛.page ├── Codeforces Dp.page ├── Contests.page ├── Daily.page ├── Front Page.page ├── Gitit User's Guide.page ├── Help.page ├── Hunan Province Programming Contest 2016.page ├── ICPC 2014 Shanghai.page ├── ICPC 2016 Beijing.page ├── ICPC 2016 China-Final.page ├── MIPT Kent Nikado Contest 1.page ├── Multi-University Training Contest 2016 1.page ├── Multi-University Training Contest 2016 2.page ├── Multi-University Training Contest 2016 3.page ├── Multi-University Training Contest 2016 5.page ├── Multi-University Training Contest 2016 6.page ├── Multi-University Training Contest 2016 7.page ├── Multi-University Training Contest 2016 8.page ├── New Skills.page ├── UOJ Progress.page ├── World Final 2013.page ├── World Final 2014.page ├── World Final 2016.page ├── XD.page ├── Y_UME's cf.page ├── Y_UME.page ├── caodadi │ ├── SRM 342 DIV1.page │ ├── SRM 379 DIV1.page │ ├── SRM 380 DIV1.page │ ├── SRM 381 DIV1.page │ ├── SRM 382 DIV1.page │ ├── SRM 383 DIV1.page │ ├── SRM 384 DIV1.page │ ├── SRM 386 DIV1.page │ ├── SRM 387 DIV1.page │ ├── SRM 388 DIV1.page │ ├── SRM 389 DIV1.page │ ├── SRM 390 DIV1.page │ ├── SRM 391 DIV1.page │ ├── SRM 392 DIV1.page │ ├── SRM 393 DIV1.page │ ├── SRM 394 DIV1.page │ ├── SRM 395 DIV1.page │ ├── SRM 396 DIV1.page │ ├── SRM 397 DIV1.page │ ├── SRM 398 DIV1.page │ ├── SRM 399 DIV1.page │ ├── caodadi.page │ └── 题解.page ├── full version.page ├── joyfun's cf.page └── 弱校联盟.page ├── sjtu-2018 ├── 18-07-18 2017-2018 Petrozavodsk Winter Training Camp, Saratov SU Contest.page ├── 18-07-19 NWERC 16.page ├── 18-07-20 2018 KAIST RUN Spring Contest.page ├── 18-07-23 Phuket 2015.page ├── 18-07-24 Tokyo 2012.page ├── 18-07-25 Andrew Stankevich Contest 30.page ├── 18-07-27 JAG Practice Contest 2015.page ├── 18-07-28 2016-2017 ACM-ICPC, Central Europe Regional Contest (CERC 16).page ├── 18-07-29 Changsha 2013.page ├── 18-07-31 2015 German Collegiate Programming Contest.page ├── 18-08-01 AMPPZ 2012.page ├── 18-08-02 ECNA2013.page ├── 18-08-04 Dalian 2016.page ├── 18-08-05 JAG Practice Contest for ACM-ICPC Asia Regional 2012.page ├── 18-08-10 JAG Regional 2017.page ├── 18-08-11 2017-2018 CTU Open Contest.page ├── 18-09-12 2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest.page ├── 18-09-19 2018 Multi-University Training Contest 8.page ├── 18-09-24 Changchun2016.page ├── 18-09-25 Haerbin2017.page ├── 2016 Multi-University Training Contest 10.page ├── 2016-2017 ACM-ICPC, Central Europe Regional Contest (CERC 16).page ├── 2016-2017 National Taiwan University World Final Team Selection Contest.page ├── 2017-2018 CTU Open Contest.page ├── 2017-2018 Petrozavodsk Winter Training Camp, Saratov SU Contest.page ├── AMPPZ 2012.page ├── Andrew Stankevich Contest 30.page ├── CERC 16.page ├── Changsha 2013.page ├── Dalian 2016.page ├── ECNA 2013.page ├── Front Page.page ├── GCPC 2015.page ├── Gitit User’s Guide.page ├── Hangzhou 2016 (CCPC).page ├── Help.page ├── JAG Practice Contest 2015.page ├── JAG Regional 2017.page ├── JAGPC 2012.page ├── Lagran.page ├── Manual Intelligence.page ├── NEERC 2011.page ├── Phuket 2015.page ├── Platelet.page ├── Quasar.page ├── Quasar │ └── bonus.page ├── SJTUGO data.page ├── SJTUGO.page ├── Tokyo 2012.page ├── a.page ├── b.page ├── lbn187.page ├── 奖励.page ├── 奖励与罚款.page ├── 奖励与罚款公示.page ├── 模板练习.page ├── 比赛.page ├── 训练罚款.page └── 违纪罚款.page ├── so-hard-so-brilliant ├── 2011-2012 2012 ICPC Chengdu Onsite.page ├── 2011-2012 2013 ICPC Hangzhou Onsite.page ├── 2012-2013 2013 ICPC Chengdu Onsite.page ├── 2015-2016 2015 ICPC Shenyang Onsite.page ├── 2015-2016 2015 ICPC shanghai EC-Final.page ├── 2017-2018 2017 CCPC Qinhuangdao Onsite.page ├── 2017-2018 2017 ICPC Xian Onsite.page ├── 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── cyh个人.page ├── wwh个人.page └── 总结.page ├── speak-study-stay-sing ├── 2014 Benelux Algorithm Programming Contest (BAPC 14).page ├── 2015EC-Final.page ├── 2017 USP-ICMC.page ├── 2017-2018 ACM-ICPC, NEERC, Moscow Subregional Contest.page ├── ACM-ICPC NWERC 2017.page ├── ACM-ICPC-Swiss-Subregional 2017.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── lizi_lzy.page ├── nike0good.page └── zbh2047.page ├── spfa ├── 2006-2007 Winter Petrozavodsk Camp, Andrew Stankevich Contest 24 (ASC 24).page ├── 2007-2008 Winter Petrozavodsk Camp, Andrew Stankevich Contest 29 (ASC 29).page ├── 2008-2009 Winter Petrozavodsk Camp, Andrew Stankevich Contest 33 (ASC 33).page ├── 2008-2009 Winter Petrozavodsk Camp, Andrew Stankevich Contest 34 (ASC 34).page ├── 2009-2010 Summer Petrozavodsk Camp, Andrew Stankevich Contest 35 (ASC 35).page ├── 2009-2010 Winter Petrozavodsk Camp, Andrew Stankevich Contest 37 (ASC 37).page ├── 2012 Asia Dhaka Regional Contest.page ├── 2012 Asia Tianjin Regional Contest.page ├── 2012-2013 Summer Petrozavodsk Camp, Andrew Stankevich Contest 42 (ASC 42).page ├── 2013 Asia Chia-Yi Regional Contest.page ├── 2014 Asia Guangzhou Regional Contest.page ├── 2015-2016 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2015).page ├── 2015-2016 ACM-ICPC, NEERC, Moscow Subregional Contest.page ├── 2015ACM │ └── ICPC亚洲区上海站.page ├── Bobo.page ├── Front Page.page ├── Gitit User's Guide.page ├── Help.page ├── JayYe' │ ├── Codeforces Round 290 (Div. 1).page │ ├── Codeforces Round 311 (Div. 2).page │ ├── Codeforces Round 333 (Div. 1).page │ ├── Educational Codeforces Round 1.page │ └── VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only).page ├── JayYe.page ├── Nero's │ ├── 2015 Africa Egyptian Regional Contest.page │ ├── Codeforces Round 311.page │ ├── Codeforces Round 324.page │ ├── Codeforces Round 329.page │ ├── Codeforces Round 333.page │ ├── Codeforces Round 334.page │ └── Educational Codeforces Round 1.page └── Nero.page ├── stay-real ├── 2017 Multi-University Training Contest 4.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── Roooooo.page ├── ZJCPC.page ├── zsc.page └── 分锅大会.page ├── suibian ├── 2014ACM │ └── ICPC亚洲区广州站.page ├── 2015 ACM │ ├── ICPC Asia Regional Hefei Online.page │ └── ICPC Asia Regional Shanghai Online.page ├── 2015 ACM多校训练第一场.page ├── 2015beijingonline.page ├── 2015shenyangonline.page ├── Front Page.page ├── Japan Alumni Group Summer Camp 2011 Day 3.page ├── beforetest.page ├── icpc2014 │ └── mdjnu_onsite.page ├── single │ ├── qscqesze.page │ └── qscqesze │ │ ├── BestCoder Round .page │ │ └── Codeforces Round .page ├── uestc_suibian │ └── 2014beijing.page └── 日常训练.page ├── tdl ├── 2012 Multi-University Training Contest 4.page ├── 2014-2015 ACM-ICPC Pacific Northwest Regional Contest (Div. 1).page ├── 2014-2015 ACM-ICPC, NEERC, Eastern Subregional Contest.page ├── 2015 ACM-ICPC Asia Amritapuri Regional Contest.page ├── 2015 ACM-ICPC Asia Beijing Regional Contest.page ├── 2015 ACM-ICPC Asia Daejeon Regional Contest.page ├── 2015 ACM-ICPC Asia Dhaka Regional Contest.page ├── 2015 ACM-ICPC Asia Jakarta Regional Contest.page ├── 2015 ACM-ICPC Asia Phuket Regional Contest.page ├── 2015 ACM-ICPC Asia Tehran Regional Contest.page ├── 2015-2016 ACM-ICPC Northeastern European Regional Contest.page ├── 2015-2016 Petrozavodsk Winter Training Camp, Saratov SU Contest.page ├── 2016 ACM-ICPC Asia China-Final Regional Contest.page ├── 2016 ACM-ICPC Asia Daejeon Regional Contest.page ├── 2016 ACM-ICPC Asia Dalian Regional Contest.page ├── 2016 ACM-ICPC Asia Qingdao Regional Contest.page ├── 2016 ACM-ICPC Asia Regional Beijing Online.page ├── 2016 ACM-ICPC Asia Regional Dalian Online.page ├── 2016 ACM-ICPC Asia Regional Qingdao Online.page ├── 2016 ACM-ICPC Asia Regional Shenyang Online.page ├── 2016 ACM-ICPC Asia Shenyang Regional Contest.page ├── 2016 BUAA Summer Practice 1.page ├── 2016 BUAA Summer Practice 2.page ├── 2016 BUAA Summer Practice 3.page ├── 2016 BUPT Collegiate Programming Contest.page ├── 2016 Chinese Collegiate Programming Contest Changchun Onsite.page ├── 2016 Chinese Collegiate Programming Contest Final Onsite.page ├── 2016 Chinese Collegiate Programming Contest Online Preliminary.page ├── 2016 Multi-University Training Contest 1.page ├── 2016 Multi-University Training Contest 10.page ├── 2016 Multi-University Training Contest 2.page ├── 2016 Multi-University Training Contest 3.page ├── 2016 Multi-University Training Contest 4.page ├── 2016 Multi-University Training Contest 5.page ├── 2016 Multi-University Training Contest 6.page ├── 2016 Multi-University Training Contest 7.page ├── 2016 Multi-University Training Contest 8.page ├── 2016 Multi-University Training Contest 9.page ├── 2016 National Taiwan University World Final Selection.page ├── 2016 Sichuan Province Contest.page ├── 2016 USP Try-outs.page ├── 2016-Sichuan-C.png ├── 2017 ACM-ICPC World Finals.page ├── Bug收集整理.page ├── Constroy │ ├── .log.page │ ├── 经验.page │ ├── 进度.page │ └── 题解.page ├── Front Page.page ├── Gitit User's Guide.page ├── Help.page ├── ICPCCamp 2016 Day8 Makoto Soejima's Contest 4.page ├── ICPCCamp 2017 Day1 ftiasch's Contest 5.page ├── ICPCCamp 2017 Day2 zimpha's Contest 3.page ├── ICPCCamp 2017 Day3 Deep Dark Fantasy's Contest.page ├── ICPCCamp 2017 Day4 Jagiellonian U Contest.page ├── ICPCCamp 2017 Day5 Yandex Cup 2017.page ├── ICPCCamp 2017 Day6 Japanese Contest.page ├── PKU Campus 2016.page ├── ProofOfD.jpg ├── Skywalkert │ ├── 2011 USP Try-outs.page │ ├── 2012 ACM-ICPC Asia Tokyo Regional Contest.page │ ├── 2012Tokyo-J.png │ ├── 2014-2015 CT S02E11 Codeforces Trainings Season 2 Episode 11.page │ ├── 2015 ACM-ICPC East Central North America Regional Contest.page │ ├── Daily Practice.page │ ├── Internet Problem Solving Contest 2016.page │ ├── Mutual Training for Wannafly Union 1.page │ ├── Practice 1.page │ ├── Self-Training 2015.page │ ├── tjz.page │ └── 基础几何.page ├── THU Campus 2016.page ├── Team Training 2015.page ├── XVI Open Cup Grand Prix of Baltics.page ├── XVI Open Cup Grand Prix of Bashkortostan.page ├── XVI Open Cup Grand Prix of Ekaterinburg.page ├── XVI Open Cup Grand Prix of Eurasia.page ├── XVI Open Cup Grand Prix of Japan.page ├── XVI Open Cup Grand Prix of SPB.page ├── XVI Open Cup Grand Prix of Siberia.page ├── XVI Open Cup Grand Prix of Southern Caucasus.page ├── XVI Open Cup Grand Prix of Tatarstan.page ├── XVI Open Cup Grand Prix of Ukraine.page ├── XVII Open Cup Grand Prix of Eurasia.page ├── braveTester │ ├── AIM Tech Round 3 (Div. 1).page │ ├── CF367.page │ ├── CF368.page │ ├── CF369.page │ ├── Educational Codeforces Round 16.page │ ├── 做题列表.page │ ├── 字典序.page │ ├── 字符串.page │ ├── 概率论.page │ └── 计算几何.page ├── 专项训练.page └── 技能缺失内容.page ├── three-investigators ├── 2009-2010 Summer Petrozavodsk Camp, Andrew Stankevich Contest 35, F Graph Factorization.png ├── 2009-2010 Summer Petrozavodsk Camp, Andrew Stankevich Contest 35.page ├── 2012 ACM-ICPC World Finals.page ├── 2013 ACM-ICPC Asia Changchun Regional Contest.page ├── 2013 ACM-ICPC Asia Chengdu Regional Contest.page ├── 2013 ACM-ICPC Asia Regional Changchun Online.page ├── 2013 ACM-ICPC Asia Regional Nanjing Online.page ├── 2013 ACM-ICPC Southwestern Europe Regional Contest.page ├── 2013 Multi-University Training Contest 7.page ├── 2013-2014 ACM-ICPC, NEERC, Eastern Subregional Contest.page ├── 2014 ACM-ICPC Arab Collegiate Programming Contest.page ├── 2014 ACM-ICPC Asia Regional Anshan Online.page ├── 2014-2015 Summer Petrozavodsk Camp, Petr Mitrichev Contest 12.page ├── 2015 ACM-ICPC Northwestern European Regional Contest.page ├── 2015 ACM-ICPC Southwestern Europe Regional Contest.page ├── 2015-2016 Petrozavodsk Winter Training Camp, Saratov SU Contest.page ├── 2016 ACM-ICPC Pacific Northwest Regional Contest.page ├── 2016-2017 ACM-ICPC, Asia Tsukuba Regional Contest.page ├── 2017 ACM-ICPC Asia Beijing Regional Contest.page ├── 2017 ACM-ICPC Asia East Continent League Final.page ├── 2017 ACM-ICPC Asia Regional Beijing Online.page ├── 2017 ACM-ICPC Asia Regional Nanning Online.page ├── 2017 ACM-ICPC Asia Regional Qingdao Online.page ├── 2017 ACM-ICPC Asia Regional Shenyang Online.page ├── 2017 ACM-ICPC Asia Regional Urumqi Online.page ├── 2017 ACM-ICPC Asia Regional Xi’an Online.page ├── 2017 ACM-ICPC Asia Shenyang Regional Contest.page ├── 2017 ACM-ICPC Asia Xi’an Regional Contest.page ├── 2017 ACM-ICPC China Guangxi Invitational Programming Contest.page ├── 2017 ACM-ICPC World Finals.page ├── 2017 BUPT Collegiate Programming Contest.page ├── 2017 Multi-University Training Contest - Team 10.page ├── 2017 Multi-University Training Contest - Team 2.page ├── 2017 Multi-University Training Contest - Team 3.page ├── 2017 Multi-University Training Contest - Team 4.page ├── 2017 Multi-University Training Contest - Team 5.page ├── 2017 Multi-University Training Contest - Team 6.page ├── 2017 Multi-University Training Contest - Team 7.page ├── 2017 Multi-University Training Contest - Team 8.page ├── 2017 Multi-University Training Contest - Team 9.page ├── 2017 中国大学生程序设计竞赛 - 总决赛.page ├── 2017 中国大学生程序设计竞赛 - 杭州站.page ├── 2017 中国大学生程序设计竞赛 - 网络选拔赛.page ├── 2017-2018 Summer Petrozavodsk Camp, Warsaw U Contest.page ├── 2017.07.17 meeting.page ├── 2017.09.09 meeting.page ├── 2017.10.16 meeting.page ├── 2018 ACM-ICPC World Finals.page ├── 2018 BUPT Collegiate Programming Contest.page ├── 2018 North American Invitational Programming Contest.page ├── 2018.03.31 meeting.page ├── BUAA Summer Practice 2017 Data Structure.page ├── BUAA Summer Practice 2017 Dynamic Programming.page ├── BUAA Summer Practice 2017 Graph Theory.page ├── BUAA Summer Practice 2017 String Theory.page ├── Bubble Cup X - Finals.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── Russian Code Cup 2017 - Finals.page ├── XVII Open Cup named after E.V. Pankratiev, Eastern Grand Prix.page ├── XVII Open Cup named after E.V. Pankratiev. GP of Tatarstan.page ├── XVII Open Cup named after E.V. Pankratiev. Grand Prix of Two Capitals.page ├── XXT.page ├── braveTester │ ├── Codeforces Round 438.page │ ├── Codeforces Round 439.page │ ├── Codeforces Round 440 and Technocup 2018 Elimination Round 2.page │ ├── Codeforces Round 441.page │ ├── Educational Codeforces Round 30.page │ ├── Front Page.page │ └── 莫比乌斯反演.page ├── chitanda │ ├── CF.page │ ├── Codeforces Round .page │ ├── Codeforces Round 290 (Div. 1).page │ ├── Codeforces Round 292 (Div. 1).page │ ├── Front Page.page │ ├── SRM591.page │ ├── SRM648.page │ ├── SRM651.page │ ├── SRM652.page │ ├── SRM653.page │ ├── SRM654.page │ ├── SRM655.page │ ├── SRM656.page │ ├── SRM657.page │ ├── SRM658.page │ ├── SRM659.page │ ├── SRM675.page │ ├── SRM676.page │ ├── SRM680.page │ ├── SRM681.page │ ├── SRM682.page │ ├── SRM684.page │ ├── SRM685.page │ ├── SRM686.page │ ├── SRM687.page │ ├── SRM688.page │ ├── SRM690.page │ ├── SRM691.page │ ├── SRM692.page │ ├── SRM693.page │ ├── SRM694.page │ ├── SRM696.page │ ├── SRM697.page │ ├── SRM698.page │ ├── SRM699.page │ ├── SRM700.page │ ├── SRM701.page │ ├── SRM702.page │ ├── TC.page │ ├── TCO2015 R1B.page │ ├── TCO2016 Beijing.page │ ├── TCO2016 R1A.page │ ├── TCO2016 R2A.page │ ├── TCO2016 R2B.page │ └── delaunay三角剖分.page ├── code library.page ├── recommendation episode 1.page ├── skywalkert │ ├── Front Page.page │ └── XVI Open Cup named after E.V. Pankratiev.page ├── tips and tricks.page ├── 临时 │ └── 翻新计划.page ├── 网络流.page └── 计算几何.page ├── toofartooclose ├── 2014-2015 Summer Petrozavodsk Camp, Andrew Stankevich Contest 46 (ASC 46).page ├── 2016-2017 ACM-ICPC, NEERC, Central Subregional Contest.page ├── 2016-2017 ACM-ICPC, NEERC, Northern Subregional Contes.page ├── ACM国际大学生程序设计竞赛全国邀请赛（陕西）.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page ├── dh个人.page ├── wjy │ ├── Front Page.page │ └── 个人每日做题记录.page ├── zlc1114 │ ├── CF补题计划.page │ ├── Front Page.page │ └── ccpc2017杭州补题.page ├── 牛客网暑期ACM多校训练营（第一场）.page ├── 牛客网暑期ACM多校训练营（第三场）.page ├── 牛客网暑期ACM多校训练营（第二场）.page └── 牛客网暑期ACM多校训练营（第四场）.page ├── twsf ├── 0x11 Ural Championship Battle of Giants.page ├── 0x12 Ural Championship.page ├── 0x13 Ural Championship.page ├── 2006-2007 Winter Petrozavodsk Camp, Belarussian SU Contest.page ├── 2012-2013 ACM-ICPC, NEERC, Moscow Subregional Contest.page ├── 2014 Asia Guangzhou Regional Contest.page ├── 2014-2015 ACM-ICPC Northeastern European Regional Contest (NEERC 14).page ├── 2015 ACM-ICPC Asia EC-Final Contest.page ├── 2015 ACM-ICPC NEERC Central Subregional Contest.page ├── 2015 ACM-ICPC NEERC Moscow Subregional Contest.page ├── 2015 ACM-ICPC NEERC Northern Subregional Contest.page ├── 2015 ACM-ICPC NEERC Western Subregional Contest.page ├── 2015 ACM-ICPC Northeastern European Regional Contest (NEERC 15).page ├── 2015 ACM │ ├── ICPC Asia Regional Beijing Online.page │ ├── ICPC Asia Regional Hefei Online.page │ ├── ICPC Asia Regional Shanghai Online.page │ └── ICPC Asia Regional Shenyang Online.page ├── 2015 Asia Changchun Regional Contest.page ├── 2015 Asia Hefei Regional Contest.page ├── 2015 Asia Shanghai Regional Contest.page ├── 2015 Asia Shenyang Regional Contest.page ├── 2015 China Collegiate Programming Contest Nanyang.page ├── 2015 Multi-University Training Contest 1.page ├── 2015 Multi-University Training Contest 2.page ├── 2015 Multi-University Training Contest.page ├── 2015-2016 ACM-ICPC Southeastern European Regional Contest(SEERC 15).page ├── 2015-2016 Petrozavodsk Winter Training Camp, Nizhny Novgorod SU Contest.page ├── ACM-ICPC Asia Regional Contest, Tsukuba, 2015.page ├── ACM-ICPC Japan Alumni Group Summer Camp , Day 4.page ├── AIM Fund Cup 2015.page ├── AMPPZ-2015.page ├── Andrew Stankevich Contest 19.page ├── Andrew Stankevich Contest 22.page ├── Andrew Stankevich Contest 47.page ├── Andrew Stankevich Contest 48.page ├── Codeforces Round 272.page ├── Codeforces Round 274.page ├── Codeforces Round 275.page ├── Codeforces Round 276.page ├── Codeforces Round 284.page ├── Codeforces Round 285.page ├── Codeforces Round 290.page ├── Codeforces Round 295.page ├── Codeforces Round 302.page ├── Codeforces Round 309.page ├── Codeforces Round 310.page ├── Codeforces Round 326.page ├── Codeforces Round 327.page ├── Fast Walsh Transform.page ├── Front Page.page ├── Gomory–Hu tree.page ├── Google code jam.page ├── Grodno 2015.page ├── ICPCCamp 2016 Day1 ftiasch’s Contest .page ├── ICPCCamp 2016 Day2 ZhejiangU Contest.page ├── ICPCCamp 2016 Day3 Grand Prix of China.page ├── ICPCCamp 2016 Day4 SJTU Dreadnought Contest.page ├── ICPCCamp 2016 Day6 SPb SU and SPb AU Contest.page ├── ICPCCamp 2016 Day7 Moscow SU Trinity Contest.page ├── ICPCCamp 2016 Day8 Makoto Soejima Contest 4.page ├── Ivan Smirnov Contest 1.page ├── KTU Programming Camp.page ├── Makoto Soejima Contest 3.page ├── NWERC-2015.page ├── Petrozavodsk Summer-2015. JAG Spring 2015.page ├── Petrozavodsk Summer-2015. Moscow IPT Contest.page ├── Petrozavodsk Summer-2015. Petr Mitrichev Contest 13.page ├── Petrozavodsk Summer-2015. Warsaw U Tasks, XV Open Cup Onsite.page ├── Petrozavodsk Summer-2015. Yandex Cup Stage 1.page ├── Petrozavodsk Summer-2015. Yandex Cup Stage 2.page ├── Petrozavodsk Winter-2015. Michael Tikhomirov Contest 1.page ├── Plug-DP.page ├── SWERC-2015.page ├── Sichuan Province 2015.page ├── Sichuan State Programming Contest 2012.page ├── Ural Championship-2016.page ├── Warsaw U Contest, Urozero 2015 Day 4.page ├── XV Open Cup named after E.V. Pankratiev. GP of America.page ├── XVI Open Cup named after E.V. Pankratiev Grand Prix of Baltics.page ├── XVI Open Cup named after E.V. Pankratiev Grand Prix of Bashkortostan.page ├── XVI Open Cup named after E.V. Pankratiev Grand Prix of Saratov.page ├── XVI Open Cup named after E.V. Pankratiev Grand Prix of Southern Caucasus.page ├── XVI Open Cup named after E.V. Pankratiev, Grand Prix of Ekaterinburg.page ├── XVI Open Cup named after E.V. Pankratiev. GP of Europe (CEPC-2015).page ├── XVI Open Cup named after E.V. Pankratiev. GP of Peterhof.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Eurasia.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Japan.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Moscow.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of SPB.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Siberia.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Tatarstan.page ├── XVI Open Cup named after E.V. Pankratiev. Grand Prix of Ukraine.page ├── ZOJ Monthly, October 2015.page ├── dominator tree.page ├── help.page ├── jsy.page ├── logo.jpg ├── zhy.page ├── zxa.page └── 压位最长公共子序列.page ├── wizards ├── 2012-2013 NEERC, Moscow Subregional Contest.page ├── 2013 Multi-University Training Contest 9.page ├── 2013 多校第九场.page ├── 2017 Russian Code Cup (RCC 17), 3rd qualification round.page ├── 2017 Yandex.Algorithm - Elimination Stage, Online Round 1.page ├── 2017 Yandex.Algorithm - Elimination Stage, Online Round 2.page ├── 2017 Yandex.Algorithm - Qualification Round.page ├── ECNA 2014.page ├── ECNA 2015.page ├── Front Page.page ├── Gitit User’s Guide.page ├── Help.page └── SJTU ACM 2017 线段树加训.page └── wood-cube ├── 0x12 Ural Championship.page ├── 0x13 Ural Championship.page ├── 2016多校.page ├── 2017 NTU WF Team Selection.page ├── AIM Fund Contest.page ├── AMPPZ-2015.page ├── ASC 45.page ├── Asia Bangkok Regional 2016.page ├── Asia Beijing Regional 2016.page ├── Asia Beijing Regional 2017 Online.page ├── Asia CHINA-Final 2016.page ├── Asia Hong Kong Regional 2016 Online.page ├── Asia Hong Kong Regional 2016.page ├── Asia Nanning Regional 2017.page ├── Asia Qingdao Regional 2016.page ├── Asia Shenyang Regional 2015.page ├── Asia Shenyang Regional 2016.page ├── Asia Tsukuba Regional 2015.page ├── Asia Tsukuba Regional 2016.page ├── Asia Tsukuba Regional 2017.page ├── Asia Xi'an Regional 2017 Online.page ├── Asia Xi'an Regional 2017.page ├── BSUIR Open 2016 Finals.page ├── Bubble Cup X Finals.page ├── Bug收集整理.page ├── CCPC 2016 Online.page ├── CCPC Final 2016.page ├── CCPC Finals 2016.page ├── CERC 2016.page ├── CERC 2017.page ├── Chinese Bootcamp 2018 AtCoder.page ├── Chinese Bootcamp 2018 GP of Gomel.page ├── Chinese Bootcamp 2018 GP of Khamovniki.page ├── Chinese Bootcamp 2018 ITMO U.page ├── Chinese Bootcamp 2018 Polish 1.page ├── Chinese Bootcamp 2018 Polish 2.page ├── ECNA 2015.page ├── ECNA 2017.page ├── Front Page.page ├── GX个人.page ├── Gitit User's Guide.page ├── Grodno 2015.page ├── Help.page ├── ICPCCamp 2016 GP of China.page ├── ICPCCamp 2016 Moscow SU Trinity.page ├── ICPCCamp 2016 SJTU Dreadnought.page ├── ICPCCamp 2016 SPb SU and SPb AU.page ├── ICPCCamp 2016 Zhejiang U.page ├── ICPCCamp 2016 ftiasch.page ├── ICPCCamp 2017 Jagiellonian U.page ├── ICPCCamp 2017 THU DDF.page ├── ICPCCamp 2017 U of Tokyo Selection 1.page ├── ICPCCamp 2017 Yandex Cup 2017.page ├── ICPCCamp 2017 ftiasch.page ├── ICPCCamp 2017 zimpha.page ├── JAG 2013.page ├── JAG Autumn 2014.page ├── JAG Spring 2014.page ├── Kent Nikaido 1.page ├── MIPT Workshop 2016 Japanese OI Selection.page ├── MIPT Workshop 2017 GP of Moscow Workshop.page ├── MIPT Workshop 2017 Korean Selection 1.page ├── MIPT Workshop 2017 Latin America Selection.page ├── MIPT Workshop 2017 NAIPC-2017.page ├── MIPT Workshop 2017 Worldwide Selection.page ├── MIPT Workshop 2017 Zagreb U Selection 1.page ├── MIPT Workshop 2018 JAG 2017.page ├── MIPT Workshop 2018 Moscow SU.page ├── MIPT Workshop 2018 NAIPC.page ├── MIPT Workshop 2018 Taiwan NTU.page ├── MZH个人.page ├── Makoto Soejima 3.page ├── MosCode Fest 2018.page ├── NAIPC 2016.page ├── NEERC 2009 Northern Subregional.page ├── NEERC 2015.page ├── NEERC 2016 Moscow Subregional.page ├── NEERC 2016 Southern Subregional.page ├── NEERC 2016.page ├── NEERC 2017 Northern Subregional.page ├── NEERC 2017 Southern Subregional.page ├── NEERC 2017.page ├── National Taiwan U Selection.page ├── Open Ural FU Personal Contest 2013.page ├── Osipovsky Cup 2014.page ├── PNRC 2017.page ├── Petrozavodsk Summer-2013 Gennady Korotkevich.page ├── Petrozavodsk Summer-2013 Japanese.page ├── Petrozavodsk Summer-2014 Ivan Kazmenko.page ├── Petrozavodsk Summer-2014 Moscow IPT.page ├── Petrozavodsk Summer-2014 Moscow SU SG.page ├── Petrozavodsk Summer-2014 Petr Mitrichev 12.page ├── Petrozavodsk Summer-2014 Warsaw U.page ├── Petrozavodsk Summer-2014 Xiaoxu Guo 2.page ├── Petrozavodsk Summer-2014 Yandex.page ├── Petrozavodsk Summer-2015 ASC 48.page ├── Petrozavodsk Summer-2015 Ivan Smirnov.page ├── Petrozavodsk Summer-2015 JAG.page ├── Petrozavodsk Summer-2015 Moscow IPT.page ├── Petrozavodsk Summer-2015 Petr Mitrichev.page ├── Petrozavodsk Summer-2015 Warsaw U.page ├── Petrozavodsk Summer-2015 Xudyh.page ├── Petrozavodsk Summer-2015 Yandex Cup Stage 1.page ├── Petrozavodsk Summer-2015 Yandex Cup Stage 2.page ├── Petrozavodsk Summer-2016 Ce Jin and Jiry Ru.page ├── Petrozavodsk Summer-2016 DPRK.page ├── Petrozavodsk Summer-2016 Moscow IPT.page ├── Petrozavodsk Summer-2016 Pavel Khaustov 2.page ├── Petrozavodsk Summer-2016 Ural FU Dandelion.page ├── Petrozavodsk Summer-2016 Warsaw U.page ├── Petrozavodsk Summer-2016 Zhejiang U 2.page ├── Petrozavodsk Summer-2017 JOI TST 2012 Selection.page ├── Petrozavodsk Summer-2017 Moscow IPT.page ├── Petrozavodsk Summer-2017 Ruyi Li 2.page ├── Petrozavodsk Summer-2017 Songyang Chen 1.page ├── Petrozavodsk Summer-2017 UESTC Selection.page ├── Petrozavodsk Summer-2017 Warsaw U.page ├── Petrozavodsk Winter-2009 Moscow SU.page ├── Petrozavodsk Winter-2012 Tokyo Kroliki.page ├── Petrozavodsk Winter-2013 JAG 1.page ├── Petrozavodsk Winter-2013 JAG 2.page ├── Petrozavodsk Winter-2013 Jagiellonian U.page ├── Petrozavodsk Winter-2013 SPb SU.page ├── Petrozavodsk Winter-2014 Chinese.page ├── Petrozavodsk Winter-2014 Jagiellonian U.page ├── Petrozavodsk Winter-2014 Moscow SU Tapir.page ├── Petrozavodsk Winter-2014 Moscow SU Trinity.page ├── Petrozavodsk Winter-2014 Saratov SU.page ├── Petrozavodsk Winter-2014 U of Latvia.page ├── Petrozavodsk Winter-2014 Ukrainian.page ├── Petrozavodsk Winter-2014 Warsaw U.page ├── Petrozavodsk Winter-2015 Chinese Camp 2.page ├── Petrozavodsk Winter-2015 Jagiellonian U.page ├── Petrozavodsk Winter-2015 Michael Tikhomirov.page ├── Petrozavodsk Winter-2015 Moscow SU Tapirs.page ├── Petrozavodsk Winter-2015 Nizhny Novgorod SU.page ├── Petrozavodsk Winter-2015 Saratov SU.page ├── Petrozavodsk Winter-2015 Wroclaw U.page ├── Petrozavodsk Winter-2015 Xiaoxu Guo 3.page ├── Petrozavodsk Winter-2016 JAG.page ├── Petrozavodsk Winter-2018 CMU.page ├── Rocky Mountain Regional 2015.page ├── TDJ个人.page ├── THUPC 2016.page ├── Urozero 2015 Warsaw U.page ├── World Finals 2010.page ├── World Finals 2012.page ├── World Finals 2013.page ├── World Finals 2014.page ├── World Finals 2015.page ├── World Finals 2016.page ├── World Finals 2017.page ├── XIV Open Cup GP of Azov Sea.page ├── XIV Open Cup GP of Tatarstan.page ├── XV Open Cup GP of America.page ├── XV Open Cup GP of Central Europe.page ├── XV Open Cup GP of Japan.page ├── XV Open Cup GP of Karelia.page ├── XV Open Cup GP of Peterhof.page ├── XV Open Cup GP of SPb.page ├── XV Open Cup GP of Tatarstan.page ├── XV Open Cup GP of Three Capitals.page ├── XV Open Cup GP of Udmurtia.page ├── XVI Open Cup GP of Bashkortostan.page ├── XVI Open Cup GP of Ekaterinburg.page ├── XVI Open Cup GP of Eurasia.page ├── XVI Open Cup GP of Europe.page ├── XVI Open Cup GP of Japan.page ├── XVI Open Cup GP of Peterhof.page ├── XVI Open Cup GP of SPB.page ├── XVI Open Cup GP of Siberia.page ├── XVI Open Cup GP of Southern Caucasus.page ├── XVI Open Cup GP of Ukraine.page ├── XVII Open Cup GP of Dolgoprudny.page ├── XVII Open Cup GP of Eurasia.page ├── XVII Open Cup GP of Gomel.page ├── XVII Open Cup GP of Japan.page ├── XVII Open Cup GP of Poland.page ├── XVII Open Cup GP of SPb.page ├── XVII Open Cup GP of Siberia.page ├── XVII Open Cup GP of Tatarstan.page ├── XVII Open Cup GP of Two Capitals.page ├── XVII Open Cup GP of Ural.page ├── XVII Open Cup GP of Wroclaw.page ├── XVIII Open Cup GP of Baltic Sea.page ├── XVIII Open Cup GP of Belarus.page ├── XVIII Open Cup GP of Eurasia.page ├── XVIII Open Cup GP of Korea.page ├── XVIII Open Cup GP of Poland.page ├── XVIII Open Cup GP of Romania.page ├── XVIII Open Cup GP of SPb.page ├── XVIII Open Cup GP of Saratov.page ├── XVIII Open Cup GP of Ukraine.page ├── XVIII Open Cup GP of Ural.page ├── red.png ├── 训练环境.page └── 黑魔法备忘录.page /animism/Petrozavodsk Summer-2015. Moscow IPT Contest.page: -------------------------------------------------------------------------------- 1 | A 2 | = 3 | 4 | B 5 | = 6 | 7 | 随机，以2\^0 到 2\^12 的size随机询问某size个洞穴，每种size问10次。 8 | 9 | C 10 | = 11 | 12 | D 13 | = 14 | 15 | E 16 | = 17 | 18 | F 19 | = 20 | 21 | G 22 | = 23 | 24 | H 25 | = 26 | 27 | I 28 | = 29 | 30 | 分类讨论，根据重心分成的子树大小讨论，答案大概有三种:1.1种局面 2.2种局面 31 | 3.子树个数个局面。 32 | 33 | J 34 | = 35 | -------------------------------------------------------------------------------- /animism/WP个人.page: -------------------------------------------------------------------------------- 1 | [简单总结]() 2 | ============ 3 | 4 | [题目总结]() 5 | ============ 6 | 7 | [stackqueue]() 8 | ============== 9 | -------------------------------------------------------------------------------- /animism/XVII Open Cup EV Pankratiev GP of SPb.page: -------------------------------------------------------------------------------- 1 | A 2 | = 3 | 4 | B 5 | = 6 | 7 | C 8 | = 9 | 10 | D 11 | = 12 | 13 | E 14 | = 15 | 16 | F 17 | = 18 | 19 | G 20 | = 21 | 22 | H 23 | = 24 | 25 | I 26 | = 27 | 28 | J 29 | = 30 | 31 | K 32 | = 33 | -------------------------------------------------------------------------------- /animism/XVII Open Cup Grand Prix of Japan.page: -------------------------------------------------------------------------------- 1 | A 2 | = 3 | 4 | B 5 | = 6 | 7 | C 8 | = 9 | 10 | D 11 | = 12 | 13 | E 14 | = 15 | 16 | F 17 | = 18 | 19 | G 20 | = 21 | 22 | H 23 | = 24 | 25 | I 26 | = 27 | 28 | J 29 | = 30 | 31 | K 32 | = 33 | -------------------------------------------------------------------------------- /animism/stackqueue.page: -------------------------------------------------------------------------------- 1 | Mujin Programming Challenge 2017 2 | 3 | 小乌龟博弈题 DONE 每个位置是个独立的sg函数，dp出来 4 | -------------------------------------------------------------------------------- /beat-yiquan/2017 ACM-ICPC Asia Regional Nanning Onsite.page: -------------------------------------------------------------------------------- 1 | [Front Page]() 2 | 3 | A. 4 | == 5 | 6 | B. 7 | == 8 | 9 | C. 10 | == 11 | 12 | D. 13 | == 14 | 15 | E. 16 | == 17 | 18 | F. 19 | == 20 | 21 | G. 22 | == 23 | 24 | H. 25 | == 26 | 27 | I. 28 | == 29 | 30 | J. 31 | == 32 | 33 | K. 34 | == 35 | 36 | L. 37 | == 38 | 39 | M. 40 | == 41 | -------------------------------------------------------------------------------- /beat-yiquan/Kyle.page: -------------------------------------------------------------------------------- 1 | [Front Page]() 2 | 3 | Kyle Personal Training 4 | ====================== 5 | -------------------------------------------------------------------------------- /beat-yiquan/UST Weekly Training.page: -------------------------------------------------------------------------------- 1 | Schedule : Every Sunday 18:00 - 23:00 2 | -------------------------------------------------------------------------------- /beat-yiquan/zls/Yandex 2018 Qualification Round.page: -------------------------------------------------------------------------------- 1 | Back to [../zls]() 2 | 3 | A. 4 | == 5 | 6 | 签到题 7 | 8 | B. 9 | == 10 | 11 | 签到题 12 | 13 | C. 14 | == 15 | 16 | 签到题 17 | 18 | D. 19 | == 20 | 21 | 注意到不构成三角形最坏情况为Fibonacci数列,最多87项.对每个询问,取前88个数排序,询问复杂度O(1) 22 | 23 | E. 24 | == 25 | 26 | Trie匹配单词,转化为整数序列问题,滑动窗口 27 | 28 | F. 29 | == 30 | 31 | 二分答案,构造方法为取直径上距离两端距离为d的点,可证明最优性 32 | -------------------------------------------------------------------------------- /beat-yiquan/分块.page: -------------------------------------------------------------------------------- 1 | [Front Page]() 2 | 3 | - 分块\ 4 | - 莫队 5 | - 普通莫队\ 6 | - 树上莫队\ 7 | - 树上带修改莫队\ 8 | - 块状链表\ 9 | - 块状树 10 | 11 | -------------------------------------------------------------------------------- /beat-yiquan/白书字符串.page: -------------------------------------------------------------------------------- 1 | - **cate1** 2 | - p1\ 3 | - p2 4 | - **cate2** 5 | 6 | -------------------------------------------------------------------------------- /beat-yiquan/错题.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /beat-yiquan/队内训练.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /buaa-ascender/ASC.page: -------------------------------------------------------------------------------- 1 | [ASC 1](ASC1) (8/8)**done** 2 | 3 | [ASC 2](ASC2) (8/8)**done** 4 | 5 | [ASC 3](ASC3) 6 | -------------------------------------------------------------------------------- /buaa-ascender/Gomory-Hu tree.page: -------------------------------------------------------------------------------- 1 | 每次对于当前点集选定两个顶点分别作为源点和汇点，然后求解最小割。这样所有点就被划分成了两个集合：与S相连、不与S相连。递归下去建树即可。 2 | 3 | - `bzoj2229` 模板题 4 | - `bzoj4519` 模板题 5 | - `bzoj4435` 6 | 如果使用之前的方式暴力更新点对间最小割$O(n^3)$是不行的，所以这里用hash来记录点被分割的情况。计算答案的时候，枚举点对，然后先判断被$0$分割的情况，如果情况不同则最小割为$0$，否则再判断被$1$分割的情况，以此类推。 7 | 8 | -------------------------------------------------------------------------------- /buaa-ascender/Stoer Wagner.page: -------------------------------------------------------------------------------- 1 | 写一棵“苦力怕树”，在写的过程中，不断缩最后进来的两个点并用dis\[u\]来更新ans。 2 | 时间复杂度 $O(n^3)$ 3 | 4 | - `bzoj3345` 模板题 5 | 6 | -------------------------------------------------------------------------------- /buaa-ascender/final_pratice.page: -------------------------------------------------------------------------------- 1 | 12.3 2 | ==== 3 | 4 | 【2018-2019 ICPC, NEERC, Northern Eurasia Finals】 C 5 | 6 | 12.4 7 | ==== 8 | 9 | 【CTSC2018 暴力写挂】 边分治+虚树dp 10 | -------------------------------------------------------------------------------- /buaa-ascender/jds-constructivealgorithm.page: -------------------------------------------------------------------------------- 1 | 2018.10.11 2 | ========== 3 | 4 | [2016 HongKong onsite](https://open.kattis.com/problems/specialtour) 5 | -------------------------------------------------------------------------------- /buaa-ascender/jds-string.page: -------------------------------------------------------------------------------- 1 | 2018.10.11 2 | ========== 3 | 4 | [2017 Beijing Onsite A](https://cn.vjudge.net/contest/260437#problem) 5 | -------------------------------------------------------------------------------- /buaa-ascender/jds.page: -------------------------------------------------------------------------------- 1 | Todo List 2 | ========= 3 | 4 | - 插头DP 5 | - 斯坦纳树 6 | - 字符串 7 | 8 | Daily Summary 9 | ============= 10 | 11 | [Daily Summary](jds-DailySummary) 12 | 13 | [String](jds-string) 14 | 15 | [Constructive Algorithm](jds-constructivealgorithm) 16 | -------------------------------------------------------------------------------- /buaa-ascender/wbr-DailySummary.page: -------------------------------------------------------------------------------- 1 | 2017-9-11 2 | --------- 3 | 4 | - HDU5809 Ants 5 | 6 | 可以证明最后每个蚂蚁一定会在两点间无限往返。使用KD-tree计算出每个点最近的点，把这些点用并查集处理。 7 | 8 | - HDU5784 How Many Triangles 9 | 10 | 总三角形个数=三元点对数量-三点共线点对数量 11 | 12 | 锐角三角型数量=总三角形个数-直角三角形个数-钝角三角形个数 13 | 14 | 每个锐角三角形贡献三个锐角，每个直角三角形和钝角三角形贡献两个锐角，也就是说只要计算锐角的数量。 15 | 16 | 以每个点为极点按极角排序，是一个双指针模型。 17 | 18 | 2017-9-28/29 19 | ------------ 20 | 21 | 矩阵并，圆并 22 | -------------------------------------------------------------------------------- /buaa-ascender/wbr-geometry.page: -------------------------------------------------------------------------------- 1 | 2018.10.11 2 | ========== 3 | 4 | [2016 China Final K](http://codeforces.com/gym/101194) 5 | -------------------------------------------------------------------------------- /buaa-ascender/wbr-numbertheory.page: -------------------------------------------------------------------------------- 1 | 2018.10.11 2 | ========== 3 | 4 | [2016 China Final I](http://codeforces.com/gym/101194) 5 | -------------------------------------------------------------------------------- /buaa-ascender/wbr.page: -------------------------------------------------------------------------------- 1 | Todo List 2 | ========= 3 | 4 | - 带花树开花 5 | - 计算几何 6 | 7 | Daily Summary 8 | ============= 9 | 10 | [Daily Summary](wbr-DailySummary) 11 | 12 | [Number Theory](wbr-numbertheory) 13 | 14 | [Geometry](wbr-geometry) 15 | -------------------------------------------------------------------------------- /buaa-ascender/zmy-CF.page: -------------------------------------------------------------------------------- 1 | [Codeforces Round \#434 (Div. 1, based on Technocup 2018 Elimination 2 | Round 1)](zmy-cfround434) 3 | 4 | [Codeforces Round \#435 (Div. 2)](zmy-cfround435) 5 | -------------------------------------------------------------------------------- /buaa-ascender/zmy-cfround434.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /buaa-ascender/对顶堆.page: -------------------------------------------------------------------------------- 1 | 维护一个大根堆，一个小根堆 2 | 3 | - `poj3784` 动态求当前的中位数。模板题。 4 | 5 | -------------------------------------------------------------------------------- /buaa-ascender/最小乘积系列.page: -------------------------------------------------------------------------------- 1 | 考虑二维的情况 2 | 对于每种生成的方案，假设$\sum a=x$，$\sum b=y$，这样我们可以得到平面上一系列的点。我们先求一次$mina$，在平面上标为$A$，再求一次$minb$作为初始解。连接$A$和$B$，显然最优解应该距离$AB$最远。我们假设这个点为$C$，即三角形$ABC$面积最大 3 | $$(B.x-A.x)*(C.y-A.y)-(C.x-A.x)*(B.y-A.y)$$最大，整理可得 4 | $$-(B.x-A.x)*A.y+(B.y-A.y)*A.x+C.x*(A.y-B.y)+C.y*(B.x-A.x)$$ 5 | 其中前面两项为常数，我们按照后面两项来改写权值，得到新的边权。用相应的算法得到最小值即可。这样我们得到了点$C$，然后再递归处理$AC$和$BC$，直到线段左侧没有点为止。 6 | 7 | - `bzoj2395` 最小乘积生成树模板 8 | - `bzoj3571` 最小乘积匹配模板 9 | - `hdu5697` 最小乘积背包 10 | 11 | -------------------------------------------------------------------------------- /buaa-ascender/灭绝树.page: -------------------------------------------------------------------------------- 1 | 给定一个DAG，问删除一个节点以后，会有多少个节点被割开。 2 | 拓扑排序。然后按顺序处理，每个点放在其所有pre结点的lca下。 3 | 4 | - `bzoj2815` 模板题 5 | - `CF757F` 先求出最短路径的DAG，然后再用灭绝树 6 | 7 | -------------------------------------------------------------------------------- /buaa-lip/jsh.page: -------------------------------------------------------------------------------- 1 | 复习中…… 2 | 3 | 2017/10/22 4 | ========== 5 | 6 | [Atcoder CODE FESTIVAL 2017 qual 7 | C](http://code-festival-2017-qualc.contest.atcoder.jp) 4/6 8 | E已补，F未补。 9 | 10 | 2017/10/16 11 | ========== 12 | 13 | [Codeforces Round \#441 (Div. 2, by Moscow Team 14 | Olympiad)](http://codeforces.com/contest/876) 5/6 已补完 15 | -------------------------------------------------------------------------------- /check-it-out/20170323.page: -------------------------------------------------------------------------------- 1 | - CCPC2016Final 2 | K：直接爆搜所有方块的放法，然后模拟，其实挺好写的，一个小时就写完交了。最后因为写了puts(“No 3 | solution!”)WA了半小时 4 | 5 | - WF2015M：按题意模拟即可 6 | 7 | 8 | -------------------------------------------------------------------------------- /check-it-out/20171022.page: -------------------------------------------------------------------------------- 1 | 2017 ACM-ICPC Asia Shenyang Regional Contest 2 | ============================================ 3 | 4 | TakanashiRikka 5 | -------------- 6 | 7 | Skydec 8 | ------ 9 | 10 | 在梦游 11 | 12 | shanquan2 13 | --------- 14 | 15 | 没上机 16 | -------------------------------------------------------------------------------- /check-it-out/20171029.page: -------------------------------------------------------------------------------- 1 | The 2017 China Collegiate Programming Contest, Qinhuangdao Site 2 | =============================================================== 3 | 4 | TakanashiRikka 5 | -------------- 6 | 7 | Skydec 8 | ------ 9 | 10 | 梦游 11 | 12 | shanquan2 13 | --------- 14 | 15 | 日常没上机 16 | -------------------------------------------------------------------------------- /check-it-out/20171119.page: -------------------------------------------------------------------------------- 1 | 2017 ACM-ICPC Asia Beijing Regional Contest 2 | =========================================== 3 | 4 | TakanashiRikka 5 | -------------- 6 | 7 | 在梦游 8 | 9 | Skydec 10 | ------ 11 | 12 | 在梦游 13 | 14 | shanquan2 15 | --------- 16 | 17 | 没上机 18 | -------------------------------------------------------------------------------- /check-it-out/20180310.page: -------------------------------------------------------------------------------- 1 | 2018.3.10 XVIII Open Cup named after E.V. Pankratiev. GP of SPb. 2 | ================================================================ 3 | 4 | Syloviaely 5 | ---------- 6 | 7 | SkyDec 8 | ------ 9 | 10 | shanquan2 11 | --------- 12 | 13 | 补题 14 | ---- 15 | -------------------------------------------------------------------------------- /check-it-out/20180311.page: -------------------------------------------------------------------------------- 1 | 2018.3.11 XVII Open Cup named after E.V. Pankratiev. Grand Prix of America (NAIPC-2017) 2 | ======================================================================================= 3 | 4 | Syloviaely 5 | ---------- 6 | 7 | SkyDec 8 | ------ 9 | 10 | shanquan2 11 | --------- 12 | 13 | 补题 14 | ---- 15 | -------------------------------------------------------------------------------- /check-it-out/20180312.page: -------------------------------------------------------------------------------- 1 | 2018.3.12 Petrozavodsk Winter-2018. Carnegie Mellon U Contest) 2 | ============================================================== 3 | 4 | Syloviaely 5 | ---------- 6 | 7 | SkyDec 8 | ------ 9 | 10 | shanquan2 11 | --------- 12 | 13 | 补题 14 | ---- 15 | -------------------------------------------------------------------------------- /check-it-out/20180313.page: -------------------------------------------------------------------------------- 1 | 2018.3.13 Petrozavodsk Summer-2017. Warsaw U Contest, XVII OpenCup Onsite) 2 | ========================================================================== 3 | 4 | Syloviaely 5 | ---------- 6 | 7 | SkyDec 8 | ------ 9 | 10 | shanquan2 11 | --------- 12 | 13 | 补题 14 | ---- 15 | -------------------------------------------------------------------------------- /check-it-out/20180314.page: -------------------------------------------------------------------------------- 1 | 2018.3.14 XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Korea) 2 | ========================================================================== 3 | 4 | Syloviaely 5 | ---------- 6 | 7 | Weak just like a dog 8 | 9 | SkyDec 10 | ------ 11 | 12 | shanquan2 13 | --------- 14 | 15 | Weak just like a dog 16 | 17 | 补题 18 | ---- 19 | -------------------------------------------------------------------------------- /check-it-out/20180315.page: -------------------------------------------------------------------------------- 1 | 2018.3.15 NEERC-2017 2 | ==================== 3 | 4 | Syloviaely 5 | ---------- 6 | 7 | SkyDec 8 | ------ 9 | 10 | shanquan2 11 | --------- 12 | 13 | 补题 14 | ---- 15 | -------------------------------------------------------------------------------- /check-it-out/20180316.page: -------------------------------------------------------------------------------- 1 | 2018.3.16 Petrozavodsk Winter-2009. Belarusian SU+ Contest 2 | ========================================================== 3 | 4 | 被itmo1按在地上摩擦 5 | 6 | Syloviaely 7 | ---------- 8 | 9 | 计算几何水平有点贼鸡儿弱小啊..有点难受啊..还他妈的得训练啊.. 10 | 11 | SkyDec 12 | ------ 13 | 14 | shanquan2 15 | --------- 16 | 17 | 补题 18 | ---- 19 | -------------------------------------------------------------------------------- /check-it-out/20180317.page: -------------------------------------------------------------------------------- 1 | 2018.3.17 XVIII Open Cup named after E.V. Pankratiev. Ukrainian Grand Prix. 2 | ============================================================================ 3 | 4 | Syloviaely 5 | ---------- 6 | 7 | SkyDec 8 | ------ 9 | 10 | shanquan2 11 | --------- 12 | 13 | Weaker than a dog 14 | 15 | 补题 16 | ---- 17 | -------------------------------------------------------------------------------- /check-it-out/Gitit User’s Guide.page: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/check-it-out/Gitit User’s Guide.page -------------------------------------------------------------------------------- /check-it-out/Help.page: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/check-it-out/Help.page -------------------------------------------------------------------------------- /deep-dark-fantasy/20161018.page: -------------------------------------------------------------------------------- 1 | dls开场先过了sb题A和B。D是个KM模板题。然后dls随手过了C。 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161023.page: -------------------------------------------------------------------------------- 1 | 今天和dls两人两机打了一下cf上的mirror 2 | 3 | 开场先随手切完了ABCD四个sb题。同时dls切完了EGHIJ。这时还剩3个半小时左右，我开始弄F，dls开始弄K。都没做出来嗯狗带了。 4 | 5 | 总结 6 | ---- 7 | 8 | 人弱没办法 9 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161103.page: -------------------------------------------------------------------------------- 1 | 训练小结 2 | 3 | 今天和dls打了一下沈阳现场赛 4 | 5 | A和B是签到题，很快就过了。 6 | 7 | C可以矩乘，也过了 8 | 9 | E是个暴力题，一开始写的太暴力T了一发，改成稍微不暴力一点的写法就过了。然后dls觉得F是个sb特征值，爆了若干发没过. 10 | 11 | H是个AC自动机再解方程，写错了几个地方调了很久才过 12 | 13 | 然后dls过了G，是个积分题，dls推错了一个地方，但最后还是过了 14 | 15 | I是个noi2014最后一题差不多的题，点分治弄凸包就过了。(写完发现看错题意了，不过能fix） 16 | 17 | 然后K是转成圆根再FFT，然后TLE了若干发，卡不进去，最后狗带了。 18 | 19 | 展望： 20 | 21 | D可能是个DP 22 | 23 | J是个数据结构题 24 | 25 | L是插头dp 26 | 27 | M是个k短路 28 | 29 | 总结： 吉丽爸爸太强了 30 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161105.page: -------------------------------------------------------------------------------- 1 | 今天准备和cls打一下开火车上的Northern Subregional 2 | 2015，但是cls带dls去东操跑步了，一直没有出现。 3 | 4 | 开场先过了sb题abce，e题sb了一下wa了一发。然后过了sb题lh，h随机搞搞就行了。 5 | 6 | d也不是太难，每次把2和3的因子除完，然后找最大的3的次幂减掉，就好了。 7 | 8 | j是个sb题，但是一开始看错题意坑了很久。（wa了一发，漏一处long long） 9 | 10 | f是个模拟他执行然后插值。（也wa了一发，忘记长度《=100） 11 | 12 | K按斜率排序转一圈，n\^2 log n, 13 | 写完发现wa了。拍了很久没发现错。后来发现题目是distance to 14 | segment而不是to line。 最后改了一下，然而TLE了 GG。 15 | 16 | dls最后写了一下I的乱搞，居然过了。后来发现这个做法其实很对。 17 | 18 | 总结： 19 | 20 | 读题要仔细 21 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161112.page: -------------------------------------------------------------------------------- 1 | jc 2 | == 3 | 4 | a是个随机输出题 5 | 6 | b是个高精度题，数据一开始出错了， 7 | 8 | c是个1e6的题还不能压位，一开始不敢写，但最后还是上了FFT 9 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161117.page: -------------------------------------------------------------------------------- 1 | dls单挑。。。 2 | 3 | 。。。dls像切菜一样地2h过了FJAIDBH。。。D。。。因为dls不会求凸包。。。WA了两发卡了很久。。。 4 | 5 | 然后又过了E。。。 6 | 7 | 30min之后本机过了C。。。交上去一直WA样例。。。到bnu上交一下过了。。。就弃疗了。。。 8 | 9 | G是个几何题。。。看上去不太难。。。dls不会就是了= = 10 | 11 | UPD: 12 | 。。。草泥马这个C。。。WA的原因。。。居然是。。。行末空格。。。他的spj。。。是用。。。脚写的么？？？ 13 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161124.page: -------------------------------------------------------------------------------- 1 | dls开场写J。。。一直TLE on test 19。。。然后dls就弃疗了。。。 2 | 3 | 鏼爷写I。。。一直WA on test 53。。。然后鏼爷就弃疗了。。。 4 | 5 | 。。。cls写A。。。一直WA on test 2。。。然后cls就弃疗了。。。 6 | 7 | wori。。。然后就爆炸了。。。 8 | 9 | 事后发现WA A是因为cls的垃圾windows的random\_shuffle太垃圾了。。。 10 | 11 | 有毒。。。 12 | 13 | dls应该不能开场写J。。。而且也没有想清楚。。。最坑爹的是被。。。卡常数。。。 14 | 15 | 宇宙5km线段树之王吉司机教了dls 16 | B题。。。然后就过了。。。吉司机线段树水平宇宙第一！。。。（复杂度坑待填。。。 17 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161126.page: -------------------------------------------------------------------------------- 1 | 不错啊 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161127.page: -------------------------------------------------------------------------------- 1 | cls的总结 2 | ========= 3 | 4 | 惨。。。cls不仅竞赛经验不足，强行否决了dls直接xjb爆搜棋盘的（事后发现是）正确意见，一意孤行要写自己自以为是的牛逼搜索，而且实力不济，水平垃圾，悲惨狗带。。。背了大锅。。。 5 | 6 | dls的总结 7 | ========= 8 | 9 | 相声讲究说学逗唱 10 | 11 | 开场看L的气球好好看。。。然后准备开场无论L是什么题准备肝L拿fb。。。 12 | 13 | 扫了一眼。。。觉得没有Zeller公式。。。直接模拟不太好肝。。。 14 | 15 | 然后扫了眼A。。。打错了三次pc\^2密码没fb了。。。然后过了J。。。这个时候L的fb被抢了。。。 16 | 17 | dls觉得很难过。。。然后就弃疗了。。。 18 | 19 | jc的总结 20 | ======== 21 | 22 | 写G的时候用了之前的快速读入但是忘记判负数了。 23 | 24 | 写C写的太暴力了，在cls和dls的指导下去掉了map改成三进制，优化了取模，然后就过了 25 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161203.page: -------------------------------------------------------------------------------- 1 | dls 单挑爽一下。。。 2 | 3 | simplex好爽啊。。。 4 | 5 | 暴力好爽啊。。。 6 | 7 | 然后就AK了。。。 8 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161204.page: -------------------------------------------------------------------------------- 1 | 优秀的dls。。用高超的simplex技术。。大理茶包了tourist粑粑的牛逼网络流题。。。 2 | 3 | cls打到一半就跑去看。。。你的名字了。。。不过好像本来就没啥作用？ 4 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161210.page: -------------------------------------------------------------------------------- 1 | cls很牛逼啊？。。。我夸夸他啊？ 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20161223.page: -------------------------------------------------------------------------------- 1 | 我怎么和shit一样啊。。。打开题看到一堆PA题。。。然后打出了gg啊。。。 2 | 3 | 一开始过了G J D。。。感觉很爽啊。。。然后尼玛没有题会做了啊。。。 4 | 5 | 想了会儿B。。。不会做。。。然后大力上H。。。代码里面各种bug。。。最后对拍拍了一下才过啊？。。。 6 | 7 | 然后E又WA了啊。。。。调了很久才过。。。 8 | 9 | 然后大力写A。。。写的意识模糊了啊。。。。不懂这个A有啥简单的写法= 10 | =最后还是对拍了才过。。。 11 | 12 | 后来想了想B。。。会做了= = 13 | 14 | 然后最后瞎鸡巴贪心过了I。。。一开始写了个莫名其妙的东西= =。。。。 15 | 16 | 不知道是波兰题太毒了。。。还是dls身体不健康强行训练的锅啊？。。。 17 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170105.page: -------------------------------------------------------------------------------- 1 | 先过了FDG签到题。。。然后K。。哈希卡卡常数。。直接模int就过了。。H是个简单的小构造。。每次搞掉一个凸包就好。。 2 | 3 | I。。。大暴搜剪枝一下。。。wa了好几发是变量名i和id打错了。。 4 | 5 | C也是个。。签到题。。一开始没看到 6 | 7 | A。。稍微想一下 二分之后也很简单 8 | 9 | J。。经典的。。链表维护一下顺序。。把事件扔进优先队列的。。题目。。1a了。。 10 | 11 | 最后rush了一下E的ac自动机。。没写完。。。赛后写完交了一下发现T了。。。辣鸡卡常数题。。 12 | 13 | B。。判子串大概ac自动机离线一下。。。求前后重叠长度。。大概可以用波兰人的方法大力搞一下。。 14 | 15 | 总结 16 | ---- 17 | 18 | 手速不够。。各种sb错误。。导致。。没有ak啊。。 19 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170113.page: -------------------------------------------------------------------------------- 1 | 1h后dls和cls嘴巴完了所有题目。。。大家身体都不太健康。。。于是决定dls过个C。。。然后大家洗洗睡了。。。 2 | 3 | dls发现其实也不是很会做C。。。于是努力了很久才过= = 4 | 5 | UW怎么强的和开了挂一样啊？。。。 6 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170213.page: -------------------------------------------------------------------------------- 1 | 比赛过程： 2 | ========== 3 | 4 | 这场比赛感觉打的也不怎么样啊。。。主要是cls坑大发了啊。。。 5 | 开场策爷光速A掉了E。。。直接上了一发最短路。。。 6 | 然后dls和我说G可以贪心。。。我说这不是直接dp吗。。。于是策爷又过了。。。 7 | 然后J是个构造。。。直接丢给dls做。。dls快速做了一下就丢给策爷写。。。然后WA了一次就过了。。。 8 | 然后dls看了I。。。觉得是个直接做的裸题。。。就让策爷写了一下。。结果一开始WA了。。。后来发现是因为不满足交换律所以不能直接从小到大除。。。。 9 | 然后cls一直不会做B。。。dls想了一下发现是个判二分图的傻逼题。。。cls很狼狈啊。。。 10 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170308.page: -------------------------------------------------------------------------------- 1 | 不错啊。。大力。。茶包了。。300行大模拟啊？？ 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170314a.page: -------------------------------------------------------------------------------- 1 | 打了场稍微简单点的round。。。 2 | 3 | a是个比较显然的。。dp题。。。写了会儿交上去T了。。发现有个地方dp初值没设 4 | 5 | 然后1y了EFHICBJ。。。 6 | 7 | 然后D是个一眼题。。。但是重构树的时候写挂了。。。。没看出错。。只能大力对拍。。花了比较多的时间。。。最后是发现替换一个结点的时候要把指向它的父亲边全改掉。。。。 8 | 9 | 。。最后K想了一个明显不对的做法。。。吃了shit。。。没来得及看G。。。不知道难不难 10 | 11 | 总结： 12 | 13 | 手速以及肉眼差错的能力都要提高啊？？？？ 14 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170407a.page: -------------------------------------------------------------------------------- 1 | 不错啊。。只被吉老师艹了3h罚时。。。 2 | 3 | 都是。。手速题。。 4 | 5 | e一开始不会做。。。卡了很久。。。后来发现。。输入格式里藏着重要条件！！。。 6 | 7 | G wa了一发。。。事件队列里当前可能一堆同时的事件要一起拿出来搞。。。 8 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170417.page: -------------------------------------------------------------------------------- 1 | 策爷上课去了。。。cls失了智。。。 2 | 3 | dls努力地单挑。。。最后\#4。。。不错啊？ 4 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170420.page: -------------------------------------------------------------------------------- 1 | 尼玛。。。H看了。。。假题啊？？？结果想了2个半小时也不会做啊？？？ 2 | 3 | 染多次是变成a blend of these 4 | color。。。不是最后一个的颜色啊。。。感觉可能想当然了啊。。。 5 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170427a.page: -------------------------------------------------------------------------------- 1 | 今天单挑了一下ASC43。。 2 | 3 | 开场就一直在跟榜。。 切了sb题b。。和一个单调性dp。。I 4 | （好像是可以斜率优化的 没仔细看直接抄板了 5 | 6 | 然后H是个裸最小割。。j是个sb构造 7 | 。。k是个sb简单计算几何。。re了一发。。（凸包点集复制一遍数组忘记开两倍了 8 | 9 | l是个sb小模拟。。。。wa了好久发现一处变量名打错了。。 10 | 11 | d是个大模拟+打表。。 12 | 13 | c是个。。sb生成函数题。。怎么过的人如此少啊？？ 14 | 15 | g是个垃圾模拟。。。 16 | 17 | f好像是。。按轮换分解等价的放一起搞。。。然而好像要高精度啊。。这个分母好像爆炸了啊。。。不太懂怎么弄啊 18 | 19 | 总结： 20 | 21 | 写了一堆无脑题。。。剩下几个题还没看过啊。。 22 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170501b.page: -------------------------------------------------------------------------------- 1 | 感觉这就可能就是个充斥着各种玄学的。。。奇怪比赛啊。。。 2 | 3 | 总结 4 | ==== 5 | 6 | 感觉我们最近已经开始三开乱打了啊。。。然后三开乱打都可以像艹垃圾一样地艹opentrain上的比赛啊。。。 7 | 8 | 但不太懂为什么中俄对抗赛就表现的和垃圾一样啊。。。有点难过啊。。。 9 | 10 | 感觉一个问题是可能这场比赛的后期我可能已经放弃作为队长的作用了啊。。。这是不是也不太行啊。。。 11 | 12 | 队长得应该在。。。2小时左右就把握比赛大概动向。。。做出如何才能夺冠的判断。。。在3小时作为就开始合理安排封榜后的动向啊。。。 13 | 14 | 另外。。。不知道为什么感觉最近的dirt奇高无比。。。。怎么回事啊。。。 15 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170503.page: -------------------------------------------------------------------------------- 1 | 总结 2 | ==== 3 | 4 | 开场。。。我们快速闪电地过了8个傻逼题。。。 5 | 6 | 然后策爷决定写1。。。cls决定写11。。。 7 | 8 | dls放弃了。。。治疗。。。在后面睡觉。。。 9 | 10 | 策爷努力了半天。。。通过了1。。。 11 | 12 | cls 11好像。。。把x和y搞反了。。。非常狼狈。。半天看不出错。。。 13 | 14 | 然后cls一通乱改。。。发现TLE了。。。 15 | 胡乱加了点卡时和优化。。。就霸道地通过了。。。怎么回事啊。。。 16 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170504clj.page: -------------------------------------------------------------------------------- 1 | 好像。。。G的数组开小WA了一次。。。 2 | 3 | E因为三个数相乘没有取模WA了一次。。。又因为数组开小WA了一次。。。 4 | 5 | J写了个过于白痴的建图结果SPFA TLE了。。。改成Johnson才过。。。 6 | 7 | 然后L。。。我失了智一样地。。。写dfs。。。 8 | 9 | 这显然是个。。。bfs吧？WA了一堆。。。 10 | 11 | 最后xjb写B。。。过于慌张搞出了假算法。。。结果就滚粗了。。。 12 | 13 | 怎么这么狼狈啊。。 14 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170514.page: -------------------------------------------------------------------------------- 1 | 总结 2 | ==== 3 | 4 | 感觉。。。完全打崩了啊。。。 5 | 6 | cls猜出了E的结论。。。但是dls觉得不make 7 | sense。。。然后cls写J结果滚粗了。。。 8 | 9 | 策爷搞了个强行3个log的F的做法。。。然而cls和dls都不清楚全部的细节。。。结果最后就没过了。。。 10 | 11 | 感觉。。。这次打的很混乱啊。。。 12 | 13 | 首先策爷I好像板子抄错了。。。抄完版之后要立刻打印出来检查一下啊。。。这样也不占机时。。。 14 | 15 | 然后cls在上题的时候。。。dls拒绝管F。。。导致F就没人管了啊。。。好像。。。 16 | 17 | 感觉cls开始上题的结果就是变得不够稳了啊。。。。这咋办啊。。。 18 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170515.page: -------------------------------------------------------------------------------- 1 | 强行AK了啊。。。可能有点牛逼啊？ 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170515a.page: -------------------------------------------------------------------------------- 1 | dls特么怎么就。。。lovelove去了啊？ 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170515b.page: -------------------------------------------------------------------------------- 1 | 怎么就。。。强行AK了啊？ 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170516a.page: -------------------------------------------------------------------------------- 1 | dls。。。怎么根本不来训练啊？？？ 2 | 3 | 疼痛啊。。。 4 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170516b.page: -------------------------------------------------------------------------------- 1 | dls怎么。。。打到一半就。。。消失了啊。。。。 2 | 3 | cls疯狂地插计算几何题。。。。很棒棒啊？ 4 | 5 | 总结 6 | ==== 7 | 8 | 感觉开场有点。。。萎靡。。。dls和cls写题都很缓慢。。。 9 | 10 | 然后这个I好像。。。强行考虑了。。。根本不存在的情况？导致过的非常慢。。。？是不是这也不太对劲啊。。。 11 | 12 | 然后。。。这个H我们提前就抄起了板。。。所以过的非常快速闪电。。。好像这种看起来像是后期计算几何的题。。。对我们其实都是前期题啊。。。？ 13 | 14 | 这个J。。。dls好像给了cls一个。。。假的求凸包算法啊。。。。cls有点疼痛啊。。。 15 | -------------------------------------------------------------------------------- /deep-dark-fantasy/20170517.page: -------------------------------------------------------------------------------- 1 | 感觉我们队是不是已经放弃写总结了啊。。。 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/cljfault.page: -------------------------------------------------------------------------------- 1 | 发现题目看错一个地方之后瞎改了一下结果没有改完。。。(ICPC China-Final)、 2 | 3 | resize和assign的意思是不一样的，assign会让整个vector都变成那样，resize只是添加的时候会添加那个东西。。。不能乱用（20170101）。 4 | -------------------------------------------------------------------------------- /deep-dark-fantasy/clsplan.page: -------------------------------------------------------------------------------- 1 | 锻炼相声水平 2 | -------------------------------------------------------------------------------- /deep-dark-fantasy/clspractice.page: -------------------------------------------------------------------------------- 1 | 2013/3/20 cls嘴巴了一下 \#SRM 600 - \#SRM 608 2 | 3 | 模拟题比赛 4 | ========== 5 | 6 | CCPC 2016-2017, Finals K 7 | -------------------------------------------------------------------------------- /deep-dark-fantasy/dyhfault.page: -------------------------------------------------------------------------------- 1 | 。。。对string stream了解不够深刻。。。 2 | 3 | 不会转二进制。。。 4 | 5 | 数组没有清空（CCPC China-Final） 6 | 7 | continue打成break（CCPC China-Final） 8 | 9 | 。。。完全不会字符串parser 10 | 11 | \_\_gcd()好像会谜之RE。。。 12 | 13 | Impossible后面没打回车 (China-Final) 14 | 15 | 两个题的数据范围看混了 (China-Final) 16 | 17 | 写parser。。。不会找配对的括号啊？ 18 | 19 | 线段树。。。初始化写到了修改完之后。。。 20 | 21 | 线段树。。。push之后没压标记。。。 22 | 23 | dx\[4\],dy\[4\]打错 24 | 25 | 大inf和小inf 26 | -------------------------------------------------------------------------------- /deep-dark-fantasy/new.page: -------------------------------------------------------------------------------- 1 | test 2 | ==== 3 | 4 | test test 5 | -------------------------------------------------------------------------------- /deep-dark-fantasy/qianzhan.page: -------------------------------------------------------------------------------- 1 | 准备分析一下主要对手的实力。。。 2 | 3 | Eagles ： 很强 4 | 5 | Base ：去年冠军，实力不俗 6 | 7 | ITMO 1：感觉挺牛逼的 8 | 9 | MIPT ：去年第四 10 | 11 | MIT ONE ：7老师的队伍 12 | 13 | Seoul：有两个LGM。。。但看不出他们的实力啊。。。他们从来不训练吗 14 | 15 | NTU：AK了Battle of Giants。。。有点牛逼。。。 16 | -------------------------------------------------------------------------------- /dreadnought/1003.1320v4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/dreadnought/1003.1320v4.pdf -------------------------------------------------------------------------------- /dreadnought/ALUALU.page: -------------------------------------------------------------------------------- 1 | Russian Contests 2 | ================ 3 | 4 | Codechef 5 | ======== 6 | 7 | Hackerrank 8 | ========== 9 | -------------------------------------------------------------------------------- /dreadnought/BarrierCycleBasis.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/dreadnought/BarrierCycleBasis.pdf -------------------------------------------------------------------------------- /dreadnought/Old Problems from ftiasch.page: -------------------------------------------------------------------------------- 1 | 这个页面整理我觉得有(bu)意(hui)思(zuo)的题。 2 | 3 | TopCoder 4 | ======== 5 | 6 | SRM 662 MultiplicationTable 7 | 8 | SRM 673 BearGirls 9 | 10 | Codeforces 11 | ========== 12 | 13 | [MemSQL Start\[c\]UP 2.0 - Round 2 Problem F An easy problem about 14 | trees](http://codeforces.com/contest/457/problem/F) 15 | 16 | [Abbyy Cup 2.0 - Final Problem C Game with Two 17 | Trees](http://codeforces.com/problemset/problem/207/C2) 18 | -------------------------------------------------------------------------------- /dreadnought/Screenshot from 2015-09-26 18:39:38.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/dreadnought/Screenshot from 2015-09-26 18:39:38.png -------------------------------------------------------------------------------- /dreadnought/TopCoder Open 2015 3A.page: -------------------------------------------------------------------------------- 1 | TopCoder Open 2015 3A 2 | 3 | 程序可以看Practise Room的提交…… 4 | 5 | 300 BearCharges 6 | =============== 7 | 8 | 题解：dp\[i\]\[st\]表示从i出发，连接st这些点的完成时间。枚举st的子集stb和子集中的根j，认为第一次从i扩展出j再从j扩展出了stb，于是用max(dp\[j\]\[stb\], 9 | dp\[i\]\[st\^stb\])+dist(i,j)更新解。记忆化的写法会比较好写。 10 | 11 | 700 LuckyGrid 12 | ============= 13 | 14 | 题解：除了n=11的情况以外均只有两种填法，于是可以用上下界的最大流（因为单位流量的费用都一样）搞。对于11要枚举每行和每列是4多还是7多。注意只有0-11，1-10两种case，可以计算4和7的数量证明。然后再做最大流。 15 | 16 | 1000 SubRectangles 17 | ================== 18 | -------------------------------------------------------------------------------- /dreadnought/Viewer(beta).page: -------------------------------------------------------------------------------- 1 | Viewer 2 | 3 | Version 4 | ======= 5 | 6 | Version 0.1 7 | ----------- 8 | 9 | [Download Link](viewer(0.1).py) 10 | 11 | Log 12 | === 13 | 14 | Version 0.1 15 | ----------- 16 | 17 | 暴力对比和存储程序变化，每分钟记录一次。 18 | -------------------------------------------------------------------------------- /dreadnought/浅析一类最小割问题(pty).pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/dreadnought/浅析一类最小割问题(pty).pdf -------------------------------------------------------------------------------- /euler-inversion/Petrozavodsk Winter-2015. Moscow SU Tapirs Contest.page: -------------------------------------------------------------------------------- 1 | ### A Aho\[fsf\] 2 | 3 | 跑 KMP 4 | ，容易发现答案不增加的话就不用急着做。记个i,j作为状态每次进去做几步就行了。 5 | 6 | ### K Kolmogorov\[fsf\] 7 | 8 | 令 $E[v]$ 表示点 $v$ 到终点的期望步数。 9 | 10 | 假设在点 $v$ 时的决策是如果 $(v,v_i) (1\leq i\leq k)$ 当前可用的话就跑去 11 | $v_i$ ，那么 $E[v]=(E[v_1]+E[v_2]+\ldots E[v_k])/k + m/k$ 。 12 | 13 | 应该只要满足 $E[u] 3 | using namespace std; 4 | int main() { 5 | } 6 | ``` 7 | -------------------------------------------------------------------------------- /gatech/img/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/gatech/img/logo.png -------------------------------------------------------------------------------- /giant-angola-rabbit/fzh/Jaedong.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/giant-angola-rabbit/fzh/Jaedong.jpg -------------------------------------------------------------------------------- /glevel/Codeforces Round 322.page: -------------------------------------------------------------------------------- 1 | **Codeforces Round 322** 2 | ======================== 3 | 4 | ### **D** 5 | 6 | 题意：给三个矩形ABC的长和宽，问能否恰好拼成一个正方形，如果能，输出拼成的正方形 7 | 8 | 思路： 9 | 10 | 拼成的只有两种情况，一种是三个矩形的长都相等， 11 | 12 | 另一种是一个矩形的长和正方形相等，另外两个的边加起来等于正方形的长 13 | 14 | 先swap长和宽 15 | 16 | 第一种显然，第二种枚举拼起来等于正方形的长的两条边 17 | 18 | ### **F 树形dp** 暂时不会 19 | -------------------------------------------------------------------------------- /glevel/Codeforces Round 326.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /glevel/Codeforces Round 329 && 330.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /glevel/Educational Codeforces Round 4.page: -------------------------------------------------------------------------------- 1 | [题目链接](http://codeforces.com/contest/612) 2 | 3 | A B C 水题 4 | 5 | D 6 | 7 | 题意：给出n<=1e6个闭区间，区间顶点的范围为\[-1e9,1e9\]，求出区间重叠数>=k的所有区间 8 | 9 | 思路： 10 | 11 | 把端点从小到大排序，并记录是左还是右 12 | 13 | 然后遇到左端点+1，右端点-1，sum==k时就入选 14 | 15 | E 16 | -------------------------------------------------------------------------------- /glevel/lcy.page: -------------------------------------------------------------------------------- 1 | 明年 金金金金金金金 2 | -------------------------------------------------------------------------------- /glevel/lwt.page: -------------------------------------------------------------------------------- 1 | cqu未来教主 2 | 3 | 史上最强 没有之一 4 | 5 | 博客已被强校新人收藏 6 | -------------------------------------------------------------------------------- /glevel/shy.page: -------------------------------------------------------------------------------- 1 | cqu铁牌选手 2 | 3 | 史上最弱没有之一 4 | 5 | 感谢lwt与lcy给我一次坑人的机会 6 | -------------------------------------------------------------------------------- /google10c9ccde2802a602.html: -------------------------------------------------------------------------------- 1 | google-site-verification: google10c9ccde2802a602.html -------------------------------------------------------------------------------- /grimoire/1-n素数个数.page: -------------------------------------------------------------------------------- 1 | [CF665 F](http://codeforces.com/contest/665/problem/F) 2 | 3 | [hdu5901](http://acm.hdu.edu.cn/showproblem.php?pid=5901) 4 | 5 | count 1-n中素数个数($n \leq 1e11$) 6 | 7 | sol: 8 | 先来一个简单易写的$\frac{n^{\frac{3}{4}}}{\log{n}}$算法，思想参见[wiki](https://zh.wikipedia.org/wiki/素数计数函数)，就是记f\[i\]\[j\]表示前i个数字中去除前j个数字的倍数剩下的个数。 9 | 10 | 现在设m是不超过$n^{0.5}$的最大数，考虑到每个合数都有一个不超过m的约数，我们枚举每个合数的最小约数i,并记f\[j\]为当前1-i中质数已经筛外之后1-$\frac{n}{j}$中剩余数字个数，g\[j\]为当前1-i中质数已经筛外之后1-j中剩余数字个数，然后Dp 11 | 12 | [贴上代码]() 13 | -------------------------------------------------------------------------------- /grimoire/ARC80 F.page: -------------------------------------------------------------------------------- 1 | [题目链接](http://arc080.contest.atcoder.jp/tasks/arc080_d) 2 | 3 | sol： 4 | 首先可以做差分将改段变成改点（令$b_0=a_0, b_{n+1}=a_n\oplus a_{n+1}$）。这样至多199个1，每次操作是同时对两个1去反。如果两个下标差是偶数，由哥德巴赫猜想，只要2步；如果两个下标差为奇质数，1步；除此之外，由哥德巴赫猜想的等价表述，只需3步。于是只要跑一个带权匹配。 5 | 6 | 　　考虑到边权只有1、2、3，而且按照同奇偶之间的边只可能是2。于是可以建成二分图（只建1的边），跑匹配，剩下的点贪心同奇偶，最后连3。 7 | -------------------------------------------------------------------------------- /grimoire/ASC42 C.page: -------------------------------------------------------------------------------- 1 | [题目链接](http://codeforces.com/gym/100512/attachments/download/2773/20122013-summer-petrozavodsk-camp-andrew-stankevich-contest-42-asc-42-en.pdf) 2 | 3 | sol:首先初始顺序无解。考虑题目给定的序列，找出最晚出现的０和最早出现的１，让这个０的位置和所有０的位置cmp并且１的位置和所有１的位置cmp，结果是只有所给序列的这两个位置变换后仍然为1,0。然后随意 4 | -------------------------------------------------------------------------------- /grimoire/ASC42 J && RCC R62 E.page: -------------------------------------------------------------------------------- 1 | [ASC42 2 | J](http://codeforces.com/gym/100512/attachments/download/2773/20122013-summer-petrozavodsk-camp-andrew-stankevich-contest-42-asc-42-en.pdf) 3 | 4 | [RCC R62 E](http://www.russiancodecup.ru/en/tasks/round/62/E/) 5 | 6 | 题目大意：给一张有向图中每个点的后继数目一个合理化估计。 7 | 8 | sol:考虑在n个0-1中的随机变量，它们最小值的期望为$\frac{1}{n+1}$。于是给每个点随机一个权重，然后Ｄｐ出每个点后继中最小权值。 9 | 10 | attention: 11 | 12 | 1.CF(Windows)rand()返回一个short 13 | 14 | 2.随即次数不能少 15 | -------------------------------------------------------------------------------- /grimoire/CF830 D.page: -------------------------------------------------------------------------------- 1 | 给定n层满二叉树，每个点与其每个祖先之间额外有各一条边，问有多少不同的路径。 2 | $n \leq 400$ 3 | 4 | sol：考虑到若是直接dp方案数，则难以知道一颗子树内两条不交路径的方案数，故dp\[n\]\[k\]表示n层树中k条不想交路径的方案数。写出方程，发现dp\[n\]\[k\]最多由dp\[n 5 | - 1\]\[k + 1\]转移，于是第二维O(n)。 6 | -------------------------------------------------------------------------------- /grimoire/CF830 E.page: -------------------------------------------------------------------------------- 1 | [题目链接](http://codeforces.com/contest/830/problem/E) 2 | 3 | sol：首先，只要有一个联通快成立，就可以了（其他填0）。 4 | 5 | case 1：$m \geq n$ 全填1 6 | 7 | case 2：有一个点的度数大于3，这个点填2，其他填1 8 | 9 | case 3：由两个点的度数等于3，这两个点及其最短路径上的点填2，其他填1 10 | 11 | case 4：只有一个点的度数等于3,记三条链的长度分别为p、q、r 12 | ，当且仅当$\frac{1}{p}+\frac{1}{q}+\frac{1}{r} \leq 1$有解 13 | 14 | otherwise：无解 15 | -------------------------------------------------------------------------------- /grimoire/WF2014A.page: -------------------------------------------------------------------------------- 1 | [题目链接](https://vjudge.net/problem/UVALive-6770) 2 | 3 | sol: \[ \]\[ \]BABABABA$\cdots$BABABABA 4 | 5 | $\rightarrow$ ABBABABABA$\cdots$BABAB\[ \]\[ \]A 6 | 7 | $\rightarrow$ ABBA\[ \]\[ \]BABA$\cdots$BABABBAA 8 | 9 | 然后对除去前四个和最后四个的区间递归处理，还剩４，５，６，７对的时候手动打表。 10 | 11 | 具体形式是\[ \]\[ \]BABABABA$\cdots$BABABABA $\rightarrow$ 12 | AA$\cdots$ABB$\cdots$B\[ \]\[ \] 13 | -------------------------------------------------------------------------------- /grimoire/hdu5823.page: -------------------------------------------------------------------------------- 1 | 给定不超过18个点的无向图，求每个点的子集($1 \leq i \leq 2^{n} - 1$)能被最小颜色染色。 2 | 3 | sol： 1.dp\[mask\]直接枚举子集 4 | 2.预处理独立集，dp\[i\]\[mask\]表示用i种颜色染mask的方案数，$dp[i][mask] = \sum_{u or v == mask}dp[1][u] * dp[i-1][v]$，快速沃尔什变换 5 | -------------------------------------------------------------------------------- /grimoire/hdu6049.page: -------------------------------------------------------------------------------- 1 | [题目链接](http://acm.hdu.edu.cn/showproblem.php?pid=6049) 2 | 3 | sol： 4 | 首先考虑把原序列分成若干段，使得每段的max-min与个数相同并且最小值递增（扫一遍）。 5 | 6 | 其次可以发现选择用来交换的区间不会将第一步得到的区间分裂。 7 | 8 | 然后考虑分裂一个“元区间”，在其中找出若干断点，使得断点之前的数字sort之后为该区间的一个后缀，这样这个断点后面的数字sort之后也是该区间的一个前缀。 9 | 10 | 于是可以发现最优方案肯定是将某个断点之前的所有数字和一个断点之后的所有数字交换，并且这两个断点要么是一个点要么相邻。 11 | 12 | 之后O(n)暴力，总复杂度O（n）。 13 | 14 | 另外，O（$n^{2}$）算法,枚举右边的待交换区间，算出左边的区间的l，左边的区间的r取能取的最大的r 15 | -------------------------------------------------------------------------------- /grimoire/hdu6051.page: -------------------------------------------------------------------------------- 1 | [题目链接](http://acm.hdu.edu.cn/showproblem.php?pid=6051) 2 | 3 | sol: 利用原根，并且注意到ｍ没什么卵用 4 | -------------------------------------------------------------------------------- /grimoire/hdu6091.page: -------------------------------------------------------------------------------- 1 | [题目链接](http://acm.hdu.edu.cn/showproblem.php?pid=6091) 2 | 3 | sol: F\[i\]\[j\]\[0/1\]表示i为根的子树，match数目为j（mod 4 | m)，i是否已经匹配 5 | 6 | match的背包暴力转移，单次是min($size_{i}$,m) \* 7 | min($size_{j}$,m)，总复杂度为n\*m 8 | 9 | 考虑每个点算贡献：每个点作为size不超过200的子树的时候贡献最多200，在合并之后恰好超过200的那一次贡献200，之后剩下的情况设每次合并上去的size为$s_{1},s_{2}\cdots s_{k}=n$，那么每次的总代价是$(s_{2}-s_{1})*200+(s_{3}-s_{2})*200+\cdots+(s_{k}-s_{k-1})*200$，即为n\*m 10 | -------------------------------------------------------------------------------- /grimoire/img/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/grimoire/img/logo.png -------------------------------------------------------------------------------- /grimoire/img/logo2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/grimoire/img/logo2.png -------------------------------------------------------------------------------- /grimoire/img/test.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/grimoire/img/test.png -------------------------------------------------------------------------------- /grimoire/maximum-minimum-idendity.page: -------------------------------------------------------------------------------- 1 | [链接](https://en.wikipedia.org/wiki/Maximum-minimums_identity) 2 | -------------------------------------------------------------------------------- /grimoire/n数码有解性判定.page: -------------------------------------------------------------------------------- 1 | 经典八数码问题推广到n\*m 2 | 3 | sol:把空格移动到同一个位置，判断逆序对的奇偶性 4 | -------------------------------------------------------------------------------- /grimoire/poj3235.page: -------------------------------------------------------------------------------- 1 | 题意：给出ｍ个ｎ维整数向量$\vec a_1,\vec a_2, \cdots, \vec a_m$，定义一个点A可以被另一个点B走到为$\exists k_1, k_2, \cdots, k_m \in \mathbb N, s.t. \vec B = \vec A + k_1\cdot \vec a_1, \cdots, k_m\cdot \vec a_m$，试找出ｎ个整数向量等价于这ｍ个向量 2 | 3 | sol：gauss消元＋辗转相减 4 | -------------------------------------------------------------------------------- /grimoire/test.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/grimoire/test.png -------------------------------------------------------------------------------- /hope-of-cczu/2018 Jiangsu Collegiate Programming Contest.page: -------------------------------------------------------------------------------- 1 | Contest Info 2 | ============ 3 | 4 | date: 2018.5.14 10:00-15:00 5 | 6 | practice link: **onsite** 7 | 8 | Solutions 9 | ========= 10 | 11 | https://post.icpc.camp/ 12 | 13 | vacantxin 14 | --------- 15 | 16 | 开场三人分锅了 AFK 17 | 18 | 队友WA-3 了签到题A 19 | 20 | 我写了F 21 | 22 | K 队友写出锅wa几发 我思考了下告诉他做法 写出锅又wa几发 23 | 24 | 队友写了B 我写了G 25 | 26 | 队友写C 我写J 27 | 28 | J读错题 于是凉了。 29 | -------------------------------------------------------------------------------- /lovely-donuts/rikoizz.page: -------------------------------------------------------------------------------- 1 | hello there 2 | =========== 3 | 4 | [TC](topcoder) 5 | 6 | [return](Front Page) 7 | -------------------------------------------------------------------------------- /lovely-donuts/srm659.page: -------------------------------------------------------------------------------- 1 | 500 2 | === 3 | 4 | dp\[i\]\[mask\] 当前mask位为1的人需要采用方案3 5 | -------------------------------------------------------------------------------- /lovely-donuts/srm660.page: -------------------------------------------------------------------------------- 1 | 500 2 | --- 3 | 4 | 1.考虑第i个人被邀请的位置，利用容斥即可。$\sum_{i=1}^{i<=k}(-1)^{i+1} * \frac{1}{i!}$ 5 | 其中k是这个人的关系链深度 6 | 7 | 2.第二种方法未看懂。。 8 | -------------------------------------------------------------------------------- /milk-candy/sk.page: -------------------------------------------------------------------------------- 1 | Todolist 2 | ======== 3 | 4 | - 争取rating上2200 5 | 6 | -------------------------------------------------------------------------------- /mit-one/2016 North American Invitational Programming Contest.page: -------------------------------------------------------------------------------- 1 | 7k+: 2 | 3 | 开场秒过EIFC。D是个2000平方log精度的题，可能有精度问题，不过写了交了一发就过了。G是个辣鸡几何，一开始少考虑情况WA了一发。想了会儿就过了。中间柠檬爷写了一会儿J。思路很清晰，不过有一些细节。叉老爷写了下B的DP过了。柠檬爷J交了一发T，过一会儿发现long 4 | long的问题。gen了个数据死循环，发现是因为C++整除是向0取整而不是向下取整。 5 | A是个辣鸡分两半的题，很快过了。 6 | 7 | 然后还剩H和K。H柠檬爷很早就会，不过一直在写J所以没空写。柠檬爷写了一下交了一发WA。想了想发现是凸性优化反了。写了个对拍。 8 | K是个点分二分凸包题。叉老爷迅速写完了非凸包的部分，然后我写了一下凸包。写了个对拍发现cmp写错了而且扫反了。改完就过了。 9 | 10 | 三个半小时AK，碾压全场（以及opentrains），帅啊？ 11 | 12 | 感觉J花的时间有点长。可能想清楚会快一些吧。（H写之前柠檬爷写了伪代码，所以速度就快得多。） 13 | -------------------------------------------------------------------------------- /mit-one/ICPCCamp 2017 Day 3 THU DDF Contest.page: -------------------------------------------------------------------------------- 1 | 7k+: 2 | 3 | 惨不忍睹。。。 4 | 5 | 开场时看了一堆题都不太会。D想了一会儿感觉能直接构造，不过想不清楚。 6 | 想了想C，和柠檬爷讨论了下感觉是个挺标准的题，不过不太好写。叉老爷A看错题了交了两发WA。 7 | 8 | 柠檬爷看了下H说是傻逼线段树。我上去写，但是。。。。没传标记。。。。。。对拍了下才意识到。 9 | 10 | 这时候一堆队过F和G。我觉得F适合叉老爷做，于是他一会儿就过了。G我想了很久，不是很懂。写了一个暴力+优化T了。 11 | 12 | 柠檬爷和叉老爷又想了想A，发现需要高精。然后叉老爷就想去写。一会儿就过了。 13 | 14 | 然后我写了点G的靠谱做法，因为一些傻逼错误RE了，交上去WA了。 15 | 16 | 柠檬爷写了两百多行C，最后套公式部分我写，卡了一会儿，就结束了。赛后公式搞对了还是WA。不太懂。 17 | 18 | 另外BEI感觉都不太可做。 19 | 20 | 这题目有毒啊？ 21 | -------------------------------------------------------------------------------- /mit-one/bospre.page: -------------------------------------------------------------------------------- 1 | 比赛过程基本忘了 随便写点 2 | 3 | 1. oneboggle傻逼错误导致WA一次（<=写成<） 4 | 2. economy叉爷准备了很久，但是快开始写的时候柠檬爷突然发现可以裸上LP 5 | 3. gaudy因为计算几何部分的各种错误WA了很多次 6 | 4. gaudy范围只有40，可以折半，也可以直接搜索，然而之前一直没提，导致柠檬爷写了复杂算法 7 | 5. hulldiame没有一个人能手写旋转卡壳。。。还是叉爷推了一会儿 8 | 6. exsort柠檬爷说非常快（代码也很短），但是我感觉写了很久 9 | 7. substring是非常裸的SAM，但是xyz忘记了SAM，导致七爷写了复杂算法。（7k+：其实我感觉hash还挺好写的。SAM太容易错。） 10 | 11 | [scoreboard](http://hc3.seas.harvard.edu/hc3/bospre/2016/scoreboard.web) 12 | [code](bosprecode.tar) 13 | -------------------------------------------------------------------------------- /mit-one/ecna2016-7k+.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/mit-one/ecna2016-7k+.zip -------------------------------------------------------------------------------- /mit-one/ecna2016-7k-code.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/mit-one/ecna2016-7k-code.zip -------------------------------------------------------------------------------- /mit-one/nenacode.tar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/mit-one/nenacode.tar -------------------------------------------------------------------------------- /mit-one/ser2016ecna2015.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/mit-one/ser2016ecna2015.zip -------------------------------------------------------------------------------- /mit-one/ucf folder.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/mit-one/ucf folder.zip -------------------------------------------------------------------------------- /mithril/codechef.page: -------------------------------------------------------------------------------- 1 | # Codechef 2 | 3 | ## January 2011 -------------------------------------------------------------------------------- /mithril/poi-xi.page: -------------------------------------------------------------------------------- 1 | # POI XI 2 | 3 | ## ~~Strings(szn)~~ 4 | 5 | Problem 6 | : 用最少路径覆盖每条树恰好一次，使得最长路径最短。 7 | Solution 8 | : 二分答案，从叶子往上贪心，每次先试着把两条路径合并，否则把路径扔掉。时间复杂度是$O(N \log^2 N)$。 9 | 10 | ## ~~The Tournament(tur)~~ 11 | 12 | Problem 13 | : $N$个选手进行淘汰赛，其中$M$对选手的胜负关系已知，确定最后可能的冠军。 14 | Solution 15 | : 注意到如果两个选手胜负关系未知，则两个选手的最后结果一样（同时可能或者不可能）。进一步地，同一个环上的所有选手最后结果一样。收缩强联通分量之后，最后可能的冠军就是没有入度的强联通分量。考虑基图的补图中度最小的顶点，与该点不直接相连的点构成一个联通分量，于是直接收缩即可。 16 | -------------------------------------------------------------------------------- /mithril/saratov-su-contest.page: -------------------------------------------------------------------------------- 1 | # Saratov State U Contest (Winter 2012) 2 | 3 | ## A. Codecircles 4 | ## B. Language AZ [Solved, Bin Jin] 5 | ## C. Mines and Czech Hedgehogs [Solved, Xiaoxu Guo] 6 | ## D. The Longest Palindrome 7 | ## E. Pouring Liquid [Solved, Bin Jin] 8 | ## F. Sapsan 9 | ## G. Second Division 10 | ## H. Lanterns [Solved, Xiaoxu Guo] 11 | ## I. Shoe Issue [Solved, Xiaoxu Guo] 12 | ## J. Annihilate the Beetles [Solved, Xiaoxu Guo] 13 | ## K. TV Tower [Solved, Bin Jin] 14 | -------------------------------------------------------------------------------- /mithril/todo-list.page: -------------------------------------------------------------------------------- 1 | # Todo List 2 | 3 | ## Mithril 4 | 5 | ## Xiaoxu Guo 6 | 7 | - 2012-07-26, ~~[Runes](petr-su-wx-contest#h.-runes)~~, 精度有些问题，搁置 8 | 9 | - 2012-07-20, ~~C题精度问题~~ 10 | 11 | - 2012-07-19, ~~圆弧如何排序？~~ 12 | 13 | - 2012-07-19, ~~后缀自动机~~ 14 | 15 | ## Bin Jin 16 | 17 | ## Jingbo Shang 18 | -------------------------------------------------------------------------------- /mithril/xii-opencup-udmurtia-gp.page: -------------------------------------------------------------------------------- 1 | # XII Open Cup - Udmurt Grand Prix 2 | 3 | ## A. Guess String [Solved, Xiaoxu Guo] 4 | 5 | 先用36次问出每个字母的出现次数。再用二分法，用大约30次，得到具体序列。 6 | 7 | ## B. Mine Field 8 | ## C. Resistance 9 | ## D. Robot [Solved, Bin Jin] 10 | 11 | 尽量走小飞，堵住robot，使他走的步长不能超过2。 12 | 13 | ## E. Elevators 14 | ## F. Maze 15 | ## G. Reflections 16 | ## H. Shooting 17 | ## I. Conveyor 18 | ## J. Test [Solved, Xiaoxu Guo] 19 | 20 | 每个gen出一个符合所有当前已知条件的串，问一下，大概10几次就能出解。 21 | 22 | -------------------------------------------------------------------------------- /monster-attacking-crew/2014 ACM-ICPC Asia Regional Dhaka.page: -------------------------------------------------------------------------------- 1 | Contest Info 2 | ------------ 3 | 4 | date: 2018.08.05 12:00-17:00 5 | 6 | Solutions 7 | --------- 8 | 9 | ### I. Volume of Revolution 10 | 11 | **题目大意：**求一个多项式旋转体的体积（stacks是x轴的分段，slices是将旋转的圆弧分成多少节） 12 | 13 | **题解：**实际上使用正棱台来逼近的，正棱台体积为$\frac{1}{3}h(S_1+S_2+\sqrt{S_1S_2})​$。曲线的旋转体积为$\lmoustache \pi f(x)^2dx​$。 14 | -------------------------------------------------------------------------------- /monster-attacking-crew/BAPC 2017.page: -------------------------------------------------------------------------------- 1 | Contest Info 2 | ------------ 3 | 4 | date: 2018.08.06 12:00-17:00 5 | 6 | Solutions 7 | --------- 8 | 9 | ### I. Irrational Division 10 | 11 | **题目大意：**$p \times q$黑白相间的方块，左上角是黑块，先手从左往右取，后手从下往上取，每取一个黑块获得1快乐值，每取一个白块失去1快乐值，问先手最多比后手多多少快乐值？ 12 | 13 | **题解：**自己画一下$5 \times 5$的格子找一下规律 14 | 15 | - p是偶数，答案为0 16 | - p是奇数，q是奇数，答案为1 17 | - p是奇数，q是偶数，**需要根据p与q的大小讨论一下**。当$p < q$时，先手总是可以使$p < q$，这样右上角的白块会属于后手；当$p > q​$时，后手总是可以使$p > q$，这样右上角的白块会属于先手。所以$p < q$，答案为2；$p > q$，答案为0 18 | 19 | -------------------------------------------------------------------------------- /monster-attacking-crew/NWERC 2016.page: -------------------------------------------------------------------------------- 1 | Contest Info 2 | ------------ 3 | 4 | date: 2018.08.012 12:00-17:00 5 | 6 | Solutions 7 | --------- 8 | 9 | ### K. Kiwi Trees 10 | 11 | **题目大意：**在一个多边形中能否放下两个半径4000的圆。边长以及角度有限制。 12 | 13 | **题解：**wjj说由于边长以及角度的限制，每个凸角必能卡住一个圆。这个没有看出来，但是贪心的想的话放在凸角是最优的。所以对于每个凸角，找到角平分线，二分查找圆心的位置，然后检查这个圆是否不会超出其他的边。最后$O(n^2)​$两两枚举圆心。 14 | -------------------------------------------------------------------------------- /monster-attacking-crew/nowcoder multi 5.page: -------------------------------------------------------------------------------- 1 | Contest Info 2 | ------------ 3 | 4 | date: 2018.08.02 12:00-17:00 5 | 6 | Solutions 7 | --------- 8 | 9 | ### I. vcd 10 | 11 | **题目大意：**n($n < 10^5$)个点，询问点集S的个数，S满足任意子集T，都存在$x, y_1, y_2 \in R, y1 <= y2, [x, ∞ ) \times [y_1, y_2] \cap S = T$。 12 | 13 | **题解：**自己画一下就可以知道点集大小大于3的集合一定不满足条件，只需要对1,2,3分别讨论一下。1个点的点集一定是满足的；**2个点的点集需要考虑到$x_1 \neq x_2$**；3个点的点集只有3个点的位置类似"<"时才满足条件，即$y_1 < y_2 < y_3, x_1 > x_2 < x_3$，3个点的情况可以树状数组统计，即这个点右上侧的点与右下侧的点的乘积，**但是注意要把x相同的点一起修改**。 14 | -------------------------------------------------------------------------------- /monster-attacking-crew/nowcoder multi 6.page: -------------------------------------------------------------------------------- 1 | ### Contest Info 2 | 3 | date: 2018.08.04 12:00-17:00 4 | -------------------------------------------------------------------------------- /monster-attacking-crew/to do list.page: -------------------------------------------------------------------------------- 1 | 补所有A题数量大于等于五只队伍的题目 8.23 2 | 3 | tzh G 4 | 5 | 待补：AH 6 | 7 | 8.21 8 | 9 | 待补：EF 10 | -------------------------------------------------------------------------------- /new-meta/2014-2015 ACM-ICPC, NEERC, Northern Subregional Contest.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /new-meta/2016/07/24 2010 Asia Hangzhou Regional Contest.page: -------------------------------------------------------------------------------- 1 | ### A. 2 | 3 | ### G. 4 | 5 | ### I. 6 | -------------------------------------------------------------------------------- /new-meta/2016/07/25 Chengdu 2010.page: -------------------------------------------------------------------------------- 1 | D. Detector Placement \[Akigeor\] 2 | ================================= 3 | 4 | 简单几何，模拟。 [code](2016/07/25 D) 5 | 6 | H. Jenga \[Akigeor\] 7 | ==================== 8 | 9 | dp。 [code](2016/07/25 H) 10 | 11 | B.K. 12 | ==== 13 | -------------------------------------------------------------------------------- /new-meta/2016/07/28 Dhaka 2012.page: -------------------------------------------------------------------------------- 1 | J. Guards II \[Akigeor\] 2 | ======================== 3 | 4 | [code](2016/07/28 J) 5 | 6 | K. Beauty of Regular Polyhedron \[Akigeor\] 7 | =========================================== 8 | 9 | [code](2016/07/28 K) 10 | 11 | A. 12 | == 13 | -------------------------------------------------------------------------------- /new-meta/2016/07/29 2016 Multi-University Training Contest 4.page: -------------------------------------------------------------------------------- 1 | B. After a Sleepless Night \[Akigeor\] 2 | ====================================== 3 | 4 | [code](2016/07/29 B) 5 | 6 | D. Filling \[Akigeor\] 7 | ====================== 8 | 9 | [code](2016/07/29 D) 10 | 11 | G. Treasure \[Akigeor\] 12 | ======================= 13 | 14 | [code](2016/07/29 G) 15 | 16 | H. Turn Game \[Akigeor\] 17 | ======================== 18 | 19 | [code](2016/07/29 H) 20 | -------------------------------------------------------------------------------- /new-meta/2016/08/10 JAG Autumn 2012.page: -------------------------------------------------------------------------------- 1 | B. Texas hold 'em \[Akigeor\] 2 | ============================= 3 | 4 | 德州扑克。 [code](2016/08/10 B) 5 | 6 | F.G.H.I.J. 7 | ========== 8 | -------------------------------------------------------------------------------- /new-meta/2016/08/12 2016 Multi-University Training Contest 5.page: -------------------------------------------------------------------------------- 1 | I. Permutation \[Yuzuriha Inori\] 2 | ================================= 3 | 4 | 树DP. [code](2016/08/12 I) 5 | -------------------------------------------------------------------------------- /new-meta/2017/05/13 World Final 2010.page: -------------------------------------------------------------------------------- 1 | A. APL Lives! 2 | ============= 3 | 4 | **题意：** 5 | 6 | 表达式求值。 7 | 8 | **做法：** 9 | 10 | 模拟。 11 | 12 | [A.cpp](2017/05/13 World Final 2010 A.cpp) 13 | -------------------------------------------------------------------------------- /new-meta/2017/2/24 Warsaw U Contest, XVI Open Cup Onsite.page: -------------------------------------------------------------------------------- 1 | C. Counter-manifestation 2 | ======================== 3 | 4 | **题意: ** 问你一个有向图中所有环的必经点有哪些. 5 | 6 | **做法: ** 搜个dfs树. 先求所有返祖边的交. 答案只能在这个交里面. 7 | 然后考虑用一条逆返祖边或者一条树边从树上跳出去, 再经过横叉边和树边回来, 8 | 最后用一个返祖边这种环, 可能跳过一些在交里面的点. 具体情况就是, 9 | (1)所有逆返祖边, 10 | 如果终点或终点能到的点(树边和横叉边)能用一条返祖边跳到起点上面去, 11 | 那么起点到终点的开区间里面的点都可以被跳过; (2)所有树边, 12 | 尝试跳到返祖边的交里面的尽量深的一个点$v$(用横叉边和树边). 13 | 如果还能用返祖边跳回这条树边起点的上方, 那么$v$上面的点都可以被跳过; 14 | (3)所有树边, 尝试跳到返祖边的交下面尽量浅的一个点. 如果能用返祖边回来, 15 | 那么这条树边下面的点都可以被跳过. 16 | -------------------------------------------------------------------------------- /new-meta/2017/2/9 2013-2014 Wide-Siberian Olympiad: Onsite round.page: -------------------------------------------------------------------------------- 1 | 9. Deep field 2 | ============= 3 | 4 | **题意: ** 有个球体星球, 在北极有个冰盖. 5 | 即纬度$\ge a$以上都是冰盖($0\le a\le 89$). 6 | 现在有个人在无穷远处观察这个星球, 7 | 他相对于星球在纬度$b$($-90\le b\le 90$)上. 他能看到恰好半个星球, 8 | 问在他的视野中, 冰盖占星球多少比例. (注意这里的视野中意思是投影面积占比, 9 | 不是球面面积占比.) 10 | 11 | **做法: ** 可以发现, 冰盖边界在视野中的投影是星球投影里面的一个椭圆, 12 | 且与星球投影相切. 想象有个人在这个人对面观察星球, 他们一个人看到的多, 13 | 一个人看到的少. 14 | 看到的少的人看到的轮廓其实是由椭圆在两个切点之间的劣弧和圆在两个切点之间的劣弧围成的, 15 | 看到的多的那个人就是把椭圆的劣弧替换成优弧. 这样很容易算面积. 16 | -------------------------------------------------------------------------------- /new-meta/2017/3/13 Petrozavodsk Summer-2015. Andrew Stankevich Contest 48.page: -------------------------------------------------------------------------------- 1 | H. Hardware Hashing 2 | =================== 3 | 4 | **题意：** 5 | 6 | 你有一个长度为$n\leq 1e5$的数组$a$。你需要生成一个汇编（大小限制4M），这个汇编读入一个$a$中的数，要在$30$个指令内返回一个范围在$[0,2n-1)$内的哈希值$x$，不能有哈希冲突。 7 | 8 | **做法：** 9 | 10 | 发现$30$步太少了，所以只能打表。由于数字很多，一次取模哈希不够，两层取模就可以了。具体来说，就是先模一个$1w$左右的质数，把$a$分成很多组，然后每组分别枚举一个小质数，使得这一组内的数模了这个小质数能被分开就行了。先打一张表记录每大组之后的模数，以及小表的位置在哪里。然后再打许多小表就行了。 11 | 12 | [H.cpp](Petrozavodsk Summer-2015. Andrew Stankevich Contest 48 H.cpp) 13 | -------------------------------------------------------------------------------- /new-meta/2017/3/23 AMPPZ-2015.page: -------------------------------------------------------------------------------- 1 | D. Accurate Shots (8M ML!) 2 | ========================== 3 | 4 | **题意：** 5 | 6 | 给你$n,m\leq 1e15$。现在想通过flip$n$的某些二进制位，使它变成一个$m$的倍数，问你(1)最少步数(2)最少步数下的方案数(3)这些方案中最小的数。 7 | 8 | **做法：** 9 | 10 | 把$n$切成高位和低位。枚举高位的余数，低位的余数可以唯一确定。两边分别遍历所有该余数的数，可以各自得到三个问题的答案，然后合并（步数相加，方案数相乘，最小值移位相加）就能更新总的答案了。 11 | 12 | 注意到高位的余数和低位是11对应的，所以上述方法恰好不重不漏（除去某些$m$特别大的特例）地遍历了全部$2\sqrt{n}$个数，所以时间复杂度$O(\sqrt{n})$，空间复杂度$O(1)$。 13 | 14 | [D.cpp](2017/3/23 AMPPZ-2015 D.cpp) 15 | -------------------------------------------------------------------------------- /new-meta/CERC 2014.page: -------------------------------------------------------------------------------- 1 | B. Mountainous landscape \[Yuzuriha Inori\] 2 | =========================================== 3 | 4 | 题意: 有一二维平面上的简单折线, 横坐标沿折线不减. 5 | 现在问若沿着折线中的某一条向前看去, 看到的是折线中的哪一条. 6 | 输出每条折线的问题的答案. 7 | 8 | 做法: 可以做的判定问题是, 沿着一条视线看去, 能否看到一段给定的折线. 9 | 这个问题只要求出折线上所有点的凸包(即折线所有端点的凸包), 10 | 判断视线是否与凸包有交即可. 求出了凸包, 这个判断可以对数时间完成. 11 | 那么现在, 由于折线横坐标单调, 我们用线段树的方式求出若干区间的凸包, 12 | 之后在树上二分即可. 13 | -------------------------------------------------------------------------------- /new-meta/CROC2016G.page: -------------------------------------------------------------------------------- 1 | **题意: ** 给定两个点$P=(a,0),Q=(-a,0)$. 2 | 定义一条直线的距离为他上面所有点到$P$和$Q$的距离的差的绝对值的最大值(可以证明最大值存在). 3 | 现在要你从给定的$n$个点中选两个连一条直线, 使得这条直线的距离尽量小. 4 | 5 | **做法: ** 做法1: 第一步(简单): 容易知道二分答案后我们有个双曲线. 6 | 就是想让这条直线和双曲线没交. 第二步(困难): 做两个坐标变换. 7 | 先拉伸一下把双曲线变正. 即变成$x^2-y^2=1$. 8 | 然后把坐标系$x^2-y^2=1$变成$x^2=1+y^2$再变成$1=\frac{1}{x^2}+\frac{y^2}{x^2}$. 9 | 这两步变换都是可逆的, 所以有交点还是没交点是不会变的! 待更新! 10 | -------------------------------------------------------------------------------- /new-meta/Codeforces364.page: -------------------------------------------------------------------------------- 1 | Solution For E 2 | 定义好的串为，要么是一个字符，要么是前缀后缀是某个好串x，且这个x在当前串中出现次数恰好为2. 3 | 所以这道题本质相当于要我们求最长好串链. 4 | 5 | 一个非常厉害的性质，这样的本质不同的好串个数只有恰好n个. 6 | 7 | 对于每个位置i，我们考虑找到一个好串，他从i开始，并且在后面没有出现过，且满足我们对好串的定义。 8 | 9 | 考虑从右往左枚举i，假如我们知道了从i开始的好串为s，如何更新更小的i的好串信息. 10 | 11 | 使用后缀数组，查看s是哪些后缀的前缀. 这个在后缀数组的sa数组中是一个区间. 12 | 我们就对这个区间打个标记，标记为我们可能可以从i转移到那些位置. 13 | 14 | 假如对于某个左端点i，我们知道可能可以从j这个地方转移过去，也就是说，我们知道从i开始的这个好串的前后缀是某个字符串s的情况下，如何求得i的右端点？ 15 | 16 | 也同样使用后缀树组加线段树维护一下 17 | 18 | 最后代码长度也就140行. 19 | -------------------------------------------------------------------------------- /new-meta/Czech Grand Prix.page: -------------------------------------------------------------------------------- 1 | G. Gregor's Vacations 2 | ===================== 3 | 4 | **题意: ** 给若干简单多边形, 问平面上一直线最多与多少个严格相交. 5 | 6 | **做法: ** 注意是严格. 那么扫描线不是绕着某个点转一圈, 7 | 而是绕着某个点周围的一个小圆圈转一圈. 同时这个扫描线就必须扫描一整圈, 8 | 而不是像不严格那样扫描半个平面就行了. 9 | 扫描的时候要注意与一条线段相交的角度区间的左右是开还是闭. 同时, 10 | 扫描开始时在哪些线段里也要考虑清楚. 11 | 12 | [code](CzechGrandPrixG) 13 | -------------------------------------------------------------------------------- /new-meta/IOI2015p1.page: -------------------------------------------------------------------------------- 1 | **题意: ** 在长度$1e9$的圆圈上的整点上分布着一些胡地, 最多有$1e7$只. 2 | 现在莉莉艾为他们分发弯曲汤勺, 每只胡地一个. 弯曲汤勺有无限多个, 3 | 都放在圆圈上的$0$点. 莉莉艾每次做多携带$k$个弯曲汤勺, 4 | 他经过每只没有汤勺的胡地的时候, 就可以给他一个汤勺. 5 | 但是莉莉艾不能把汤勺暂存在除$0$以外的位置. 6 | 现在给你胡地的位置(一个坐标上可能有多个胡地, 也可能没有, 7 | 胡地按照位置从小到大给出), 求分发所有汤勺的最短时间. 8 | 9 | **做法: ** 可以发现, 只有3中策略, 即左边走, 发完返回; 右边走; 绕场一周. 10 | 如果要绕场一周, 那么这一次一定要发满$k$只胡地(如果有的话). 如果绕场两周, 11 | 显然不优. 所以只要考虑不绕场一周, 或者只绕一次. 如果不绕, 12 | 左边和右边的代价都是一个序列的第$1$大, 第$k+1$大, ..., 容易维护. 13 | 如果绕一周, 只是中间隔着$k$只胡地而已, 也一样维护. 14 | -------------------------------------------------------------------------------- /new-meta/NEERC14 B.cpp.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /new-meta/Petrozavodsk Summer-2015. Warsaw U Tasks A_1.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/Petrozavodsk Summer-2015. Warsaw U Tasks A_1.jpg -------------------------------------------------------------------------------- /new-meta/Petrozavodsk Summer-2015. Warsaw U Tasks A_2.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/Petrozavodsk Summer-2015. Warsaw U Tasks A_2.jpg -------------------------------------------------------------------------------- /new-meta/PrimeContestSolutionForE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/PrimeContestSolutionForE -------------------------------------------------------------------------------- /new-meta/QQ图片20150702110151.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/QQ图片20150702110151.png -------------------------------------------------------------------------------- /new-meta/css/custom.css: -------------------------------------------------------------------------------- 1 | @import url("screen.css"); /* default gitit screen styles */ 2 | @import url("hk-pyg.css"); /* for syntax highlighting */ 3 | 4 | /* Put your custom style modifications here: */ 5 | 6 | #logo img { 7 | width: 100%; 8 | } 9 | h1 {font-size : 50pt; text-decoration : overline;} 10 | -------------------------------------------------------------------------------- /new-meta/custom.css: -------------------------------------------------------------------------------- 1 | @import url("screen.css"); /* default gitit screen styles */ 2 | @import url("hk-pyg.css"); /* for syntax highlighting */ 3 | 4 | /* Put your custom style modifications here: */ 5 | 6 | #logo img { 7 | width: 100%; 8 | } -------------------------------------------------------------------------------- /new-meta/dot_green.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/dot_green.png -------------------------------------------------------------------------------- /new-meta/dot_red.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/dot_red.png -------------------------------------------------------------------------------- /new-meta/gy.page: -------------------------------------------------------------------------------- 1 | Done List 2 | ========= 3 | 4 | [IOI2016]() 5 | 6 | [Time Complexity of Suffix 7 | Automaton](Time Complexity of Suffix Automaton) 8 | 9 | [The Mean Value Property of Harmonic 10 | Functions](The Mean Value Property of Harmonic Functions) 11 | 12 | BOI 2015([■■◆■■■](BOI2015p1)) 13 | 14 | ONTAK 2016(■■■■■■■■■■■■[■■■■■■■■■题意和做法](ontak2016)) 15 | 16 | 101234: National Taiwan University World Final Team Selection 17 | Contest([◎◎◎◎◎◎◎◎◎◎](gym101234)) 18 | -------------------------------------------------------------------------------- /new-meta/monkey.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/monkey.pdf -------------------------------------------------------------------------------- /new-meta/pandora_1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/pandora_1.png -------------------------------------------------------------------------------- /new-meta/purple.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/purple.png -------------------------------------------------------------------------------- /new-meta/suo_1.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/suo_1.jpg -------------------------------------------------------------------------------- /new-meta/suo_1_ng.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/new-meta/suo_1_ng.png -------------------------------------------------------------------------------- /nightfall/2012 Multi-University Training Contest 7 Select (solo).page: -------------------------------------------------------------------------------- 1 | aki神志恍惚，被打包了。 2 | -------------------------------------------------------------------------------- /nightfall/2014 ACM-ICPC Beijing Invitational Programming Contest.page: -------------------------------------------------------------------------------- 1 | OJ坏了 2 | 3 | A Matrix 4 | ======== 5 | 6 | Champions League 7 | ================ 8 | 9 | Great Escape 10 | ============ 11 | 12 | In A Maze 13 | ========= 14 | -------------------------------------------------------------------------------- /nightfall/2017 Russian Code Cup (RCC 17), Final Round.page: -------------------------------------------------------------------------------- 1 | 过了ABCD四道题，C过得略慢，主要是想了比较久，而且有一个trick 2 | 3 | E是一道看上去挺难的题，$n$个操作，加一个点，删除一个点，问两个点是否可达。如果两个点可达，则存在一点，这两个点都看得到，别的点都看不到。每个点看到的点是这个点和两个端点的三角形去掉三角形在半圆内部的部分。$n\leq500000$ 4 | -------------------------------------------------------------------------------- /nightfall/2017-2018 ACM-ICPC, Asia Daejeon Regional Contest.page: -------------------------------------------------------------------------------- 1 | 过了11题，只剩下一道J不会 2 | 3 | J - 4 | 给你一个$n$个点$m$条边的图，判断是否任取两个$\frac{n}{2}$的点集做二分图的匹配数都是$\frac{n}{2}$，$n\leq100$ 5 | -------------------------------------------------------------------------------- /nightfall/CCPC NanYang 2015.page: -------------------------------------------------------------------------------- 1 | [Mahjong](http://acm.hdu.edu.cn/showproblem.php?pid=5548) 2 | ========================================================= 3 | -------------------------------------------------------------------------------- /nightfall/CCPC-Final.page: -------------------------------------------------------------------------------- 1 | 结果 2 | ==== 3 | 4 | Solve : 9/11 5 | 6 | Rank : 4 7 | -------------------------------------------------------------------------------- /nightfall/ECL-Final.page: -------------------------------------------------------------------------------- 1 | Result 2 | ====== 3 | 4 | Rank: 7(8) 5 | 6 | Comments 7 | ======== 8 | 9 | Akigeor 10 | ------- 11 | 12 | 感觉智商不够用。 13 | 14 | lbn187 15 | ------ 16 | 17 | 毫无输出，全程划水，傻逼题不会做，会做的题写不出 18 | -------------------------------------------------------------------------------- /nightfall/Grand Prix of Belarus.page: -------------------------------------------------------------------------------- 1 | I. Permutations again 2 | ===================== 3 | 4 | 比赛的时候使用线段树维护段数卡时卡过了。 5 | 6 | 哈希做法：枚举中心的1，枚举最大值在哪一边。然后就是问另外一边存不存在一个位置到1的子串构成了一个挖掉某些位置的集合。可以使用集合哈希。 7 | 8 | 然后使用unordered\_map，集合hash用了1次方和，2次方和，3次方和，模1e9+7，然后揉成一个long 9 | long。 10 | 11 | [code](Belarus I) 12 | -------------------------------------------------------------------------------- /nightfall/ICPC 西安.page: -------------------------------------------------------------------------------- 1 | 结果 2 | ==== 3 | 4 | Solve: 8/12 5 | 6 | Rank(All) : 7(9) 7 | 8 | 过程 9 | ==== 10 | 11 | 赛前可以动键盘打Vim，手速不够没抢到B的FB 12 | 13 | 前期线段树大作战曾短暂登顶，过了7道签到题后卡题 14 | 15 | 冲了I的$O(k^2n\sqrt{n})$的做法被卡飞 16 | 17 | 排名一路下跌，封榜前跌倒10名左右 18 | 19 | E题一堆队过了，冲了发贪心竟然过了 20 | 21 | 最后出了I的正确做法，lbn下剧毒15分钟都没查出来GG 22 | 23 | 表现 24 | ==== 25 | 26 | lbn187 27 | ------ 28 | 29 | 2小时后一直在梦游 30 | 31 | Akigeor 32 | ------- 33 | 34 | 最后没有把毒查出来。不过就算查出来了也很大可能过不了，因为当时读入优化板子是错的。所以这道题注定过不了的。 35 | -------------------------------------------------------------------------------- /nightfall/Jakarta 2012.page: -------------------------------------------------------------------------------- 1 | [Bee Tower](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4053) 2 | ------------------------------------------------------------------------------------------------------------------------ 3 | 4 | Aki 5 | === 6 | 7 | 两个人re代码同时下了不同的毒，怀疑dp错了查到结束。最后是dp越界了。 8 | -------------------------------------------------------------------------------- /nightfall/Petrozavodsk Summer-2013.page: -------------------------------------------------------------------------------- 1 | D 2 | = 3 | 4 | POI2013原题，很难不会 5 | 6 | E 7 | = 8 | 9 | 建图还是比较简单的，拆点，流量为颜色数，有连边的边之间连。但是构造方案不太会构，一直构不出来 10 | 11 | H 12 | = 13 | 14 | 曼哈顿距离最小生成树，Prim卡了过去，正解是对于每个点分成8个45度角，每个45度角中找一个最近的点 15 | 16 | K 17 | = 18 | -------------------------------------------------------------------------------- /nightfall/Petrozavodsk Winter-2018. Carnegie Mellon U Contest.page: -------------------------------------------------------------------------------- 1 | E. Tree Paths 2 | ============= 3 | 4 | 考虑序列上的问题可以这样做：从左往右扫，维护每个点最为左端点，到当前右端点的段数，那么新加一个数$x$，前面所有人加1，跨过$x+1$或者$x-1$都可以减1，询问线段树里1的个数。这里1一定是最小值，所以很好维护。 5 | 6 | 树上也是一样的。按照dfs序，线段树维护之前每个点到当前dfs到的点的段数，那么加减一操作可以看作是一段dfs序的操作。注意dfs中return的时候要还原现场。 7 | 8 | [code](Petrozavodsk Winter-2018. Carnegie Mellon U Contest F) 9 | -------------------------------------------------------------------------------- /nightfall/World Final.page: -------------------------------------------------------------------------------- 1 | 结果 2 | ==== 3 | 4 | Solve : 7/11 5 | 6 | Rank : 8 7 | 8 | Silver Medal! 9 | -------------------------------------------------------------------------------- /nightfall/XIII Open Grodno SU Championship.page: -------------------------------------------------------------------------------- 1 | MIPT Campus 2 | =========== 3 | -------------------------------------------------------------------------------- /nightfall/git_add_and_commit.sh: -------------------------------------------------------------------------------- 1 | !/bin/bash -x 2 | ============= 3 | 4 | set -o errexit 5 | 6 | pandoc -i "\$1" -t markdown -o "\$1" 7 | ==================================== 8 | 9 | git add "\$1" git commit -uno -m "added \$1" 10 | -------------------------------------------------------------------------------- /nightfall/go.py: -------------------------------------------------------------------------------- 1 | import subprocess as sp 2 | 3 | with open('../order', 'r') as of: for ff in of.readlines(): f = 4 | ff.rstrip() print(f) sp.run(\['git', 'add', f\]) sp.run(\['git', 5 | 'commit', '-m', f\]) input() 6 | -------------------------------------------------------------------------------- /nightfall/static/img/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/nightfall/static/img/logo.png -------------------------------------------------------------------------------- /nightfall/坑.page: -------------------------------------------------------------------------------- 1 | 2017沈阳B 2 | ========= 3 | 4 | $2*n$连通图，每次删去一条边或者删去一条边，问桥边数量 5 | 6 | 2017西安 7 | ======== 8 | 9 | E网络流做法 C DP 10 | 11 | 2017杭州 12 | ======== 13 | 14 | G NTT I网络流 H莫队 L扩欧 15 | 16 | 2017北京 17 | ======== 18 | 19 | A暴力 I 20 | 21 | BZOJ 22 | ==== 23 | 24 | 4820 AC自动机高斯消元优化 25 | 26 | 4825 离线线段树 27 | 28 | 4826 矩形加矩形求和 29 | 30 | 要加强的算法 31 | ============ 32 | 33 | 网络流 34 | 35 | 可持久化 36 | 37 | 字符串 38 | -------------------------------------------------------------------------------- /nightfall/水题.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /nightfall/红书.page: -------------------------------------------------------------------------------- 1 | [水题]() 2 | ======== 3 | 4 | [中档题]() 5 | ========== 6 | 7 | [难题]() 8 | ======== 9 | -------------------------------------------------------------------------------- /nightfall/练习(lbn187).page: -------------------------------------------------------------------------------- 1 | [坑]() 2 | ====== 3 | 4 | 2016 5 | ==== 6 | 7 | [北京(7/11)]() 8 | -------------- 9 | 10 | [EC Final(10/12)]() 11 | ------------------- 12 | 13 | [大连]() 14 | -------- 15 | 16 | [青岛]() 17 | -------- 18 | 19 | [沈阳]() 20 | -------- 21 | 22 | [GYM]() 23 | ======= 24 | 25 | [红书]() 26 | ======== 27 | 28 | [补题]() 29 | ======== 30 | 31 | [Codeforces]() 32 | ============== 33 | -------------------------------------------------------------------------------- /nightfall/难题.page: -------------------------------------------------------------------------------- 1 | Alphabet 2 | ======== 3 | -------------------------------------------------------------------------------- /null/1.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/null/1.jpeg -------------------------------------------------------------------------------- /null/1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/null/1.png -------------------------------------------------------------------------------- /null/2014xian.page: -------------------------------------------------------------------------------- 1 | [题目](http://vjudge.net/contest/125597#overview) 2 | 3 | G.The Problem to Slow Down You\[hx\] 4 | ==================================== 5 | 6 | > 题意：给两个串，询问这两个串相同的回文子串对数 7 | 8 | 回文自动机裸题，对两个串分别建立回文自动机，然后分别对奇数长度和偶数长度的回文串DFS一遍求答案 9 | -------------------------------------------------------------------------------- /null/3.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/null/3.jpg -------------------------------------------------------------------------------- /null/img/abc.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/null/img/abc.png -------------------------------------------------------------------------------- /null/img/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/null/img/logo.png -------------------------------------------------------------------------------- /null/logo.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/null/logo.jpg -------------------------------------------------------------------------------- /null/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/null/logo.png -------------------------------------------------------------------------------- /null/money.page: -------------------------------------------------------------------------------- 1 | - 车票 2 | - 鬼君 490 + 600(ccpc-final高铁) + 538(ccpc-final飞机) + 304(CF) 3 | - lisa 535 + 100 + 726 + 1200(ccpc-final高铁) + 304(CF) + 1106(CF) 4 | - 浪 455 + 742 + 942 + 949 + 600(ccpc-final高铁) 5 | - 600(ccpc-final高铁，刘子渊帮付) + 315.5(CF,刘子渊帮付) 6 | - 553(CF) 7 | - 住宿 8 | - lisa 570(ccpc-final) 9 | - lisa 179(CF) 10 | - 总计 11 | - 鬼君 1932 12 | - lisa 4720 13 | - 浪 5156.5 14 | 15 | -------------------------------------------------------------------------------- /null/todo list.page: -------------------------------------------------------------------------------- 1 | - TC 2 | - SRM684 Medium 3 | - SRM696 Medium 4 | - CF 5 | - \#378 div2 E 6 | - regional 7 | - 2016沈阳 8 | - G 9 | - L 10 | - other 11 | 12 | -------------------------------------------------------------------------------- /oceanus/6c224f4a20a44623e163c1ee9a22720e0df3d795.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/oceanus/6c224f4a20a44623e163c1ee9a22720e0df3d795.jpg -------------------------------------------------------------------------------- /oceanus/cf 368.page: -------------------------------------------------------------------------------- 1 | D: Persistent Bookcase 2 | ====================== 3 | 4 | 实际上可以离线读入所有数据 然后可以发现操作构成了一个树状 5 | dfs一遍就可以了 6 | -------------------------------------------------------------------------------- /oceanus/srm 601.page: -------------------------------------------------------------------------------- 1 | 250 2 | === 3 | 4 | 枚举X 就可以算出来每袋子苹果拿出来的下限和上限 5 | 求个和就是所有苹果的上限下限 方案数也就算出来了 6 | 7 | 500 8 | === 9 | 10 | 我们枚举两个xor和的最高不同位 设为high 11 | 12 | 那么考虑dp dp\[i\]\[j\]\[p\]\[q\]表示前i个数 两个xor和的 13 | 高于high位的位置的xor为j 14 | 15 | 第一个数high位为p 0/1 第二个数high位为q 0/1 时候的方案数 16 | 17 | 那么枚举i+1放在第一个 第二个 不放三种情况 转移一下 18 | 答案就是dp\[max(n,m)\]\[0\]\[0\]\[1\] 19 | 20 | 求个sum就是最后答案 21 | -------------------------------------------------------------------------------- /oceanus/srm 603.page: -------------------------------------------------------------------------------- 1 | 250 2 | === 3 | 4 | 可以发现除了叶子之外的每个点 后手总有办法让你拿不到 5 | 所以答案就是叶子的最大值 6 | 7 | 500 8 | === 9 | 10 | 考虑A和B 如果C的长度大于等于A的长度 那么C肯定是A重复了好多次 11 | 若A!=B那不存在这样的C 12 | 13 | 如果c长度小于a的长度 那么问题就变成了C是A的一个前缀B的一个后缀 14 | A的后缀还等于B的前缀 那么这就是A B循环相等了 15 | 16 | 所以对于N 考虑N的长度为I的循环表示 他就有I个与之配对的串 17 | 18 | 至于有多少 容斥一下就可以了 19 | -------------------------------------------------------------------------------- /oceanus/srm 605.page: -------------------------------------------------------------------------------- 1 | 250 2 | === 3 | 4 | 考虑选了几个种类的汉堡 然后贪心取每种汉堡最大的几个 5 | 枚举种类数再贪心就可以了 6 | 7 | 500 8 | === 9 | 10 | 发现K只有10 那么考虑dp\[i\]\[j\]\[mask\] 11 | 12 | 表示第一个集合放了i个数 第二个集合放了j个数 之前k-1个数放的状态为mask 13 | 1表示在集合1 0表示在集合2 14 | 15 | 那么考虑当前数放的位置 16 | 17 | 若i>=j 则可以放在i+1 18 | 19 | 若ii才可以放在i+1 20 | 21 | j与之同理 dp\[n\]\[n\]\[mask\]即为答案 22 | -------------------------------------------------------------------------------- /oceanus/srm 606.page: -------------------------------------------------------------------------------- 1 | 250 2 | === 3 | 4 | 每个pair可以确定两个值 求个交就可以了 5 | 6 | 450 7 | === 8 | 9 | 考虑每个数出现次数 要是都<=n/2 那么可以完美配对 10 | 11 | 如果有>n/2 答案就是n-最大次数 12 | 13 | 问题在于空间很小 那么我们记录当前编号 每次来了不一样的-1 减到0就换 14 | 一样就+1 15 | 16 | 最后剩下的 17 | 18 | (1)不是最大值 那么显然最大值被减到0了 那么显然最大值<=n/2 无所谓 19 | 20 | (2)是最大值 跑一次找出来最大值出现次数就可以了 21 | -------------------------------------------------------------------------------- /oceanus/srm 607.page: -------------------------------------------------------------------------------- 1 | 250 2 | === 3 | 4 | dp\[i\]\[j\]表示从i\~j的子串为回文串的概率 5 | 6 | 若i==j dp\[i\]\[j\]=1 7 | 8 | 若i j中有? 那么dp\[i\]\[j\]=dp\[i+1\]\[j-1\]/26 9 | 10 | 若没有 判断是否a\[i\]=a\[j\] 如果是dp\[i\]\[j\]=dp\[i+1\]\[j-1\] 否则为0 11 | 12 | sum就是答案 13 | 14 | 500 15 | === 16 | 17 | 考虑每个位置还要顺时针转多少次 18 | 19 | 记录f\[i\]为第i位比第i-1位要多转几次 20 | 21 | 因为+-实际上都是在10进制下不进位做的 所以每次找这个差的最小值和最大值 22 | 一次操作可以把最小-1 最大+1 23 | 24 | 直到所有的f\[i\]不是0就是10就可以了 25 | -------------------------------------------------------------------------------- /oceanus/srm 608.page: -------------------------------------------------------------------------------- 1 | 250 2 | === 3 | 4 | (1)取下限最高的凑C 5 | 6 | (2)取上限最小的凑X-C 7 | 8 | 两种答案最优值即为答案 9 | 10 | 500 11 | === 12 | 13 | 考虑如果一个点在两个环中 必然是a\^L这样的无解情况 返回-1 14 | 15 | 现在每个点最多在一个环里面 那么我们tarjan缩一下点就是个DAG 16 | 17 | 那么这个DAG里面环的最长路即为答案+1 于是跑个拓扑排序就可以啦！ 18 | -------------------------------------------------------------------------------- /oceanus/srm 609.page: -------------------------------------------------------------------------------- 1 | 250 2 | === 3 | 4 | 枚举分界点然后取min得max就可以了 5 | 6 | 500 7 | === 8 | 9 | 发现一种东西如果>=K那么直接取走K个就好 因为否则也要K个包才放得下 10 | 不如直接取走 11 | 12 | 于是现在都<K 13 | 14 | 那么发现一个东西如果要单独放 那么就都单独放最好 15 | 16 | 于是从大到小枚举 每次枚举这个是都分着放还是单独一个就可以了 17 | -------------------------------------------------------------------------------- /post/Post 101.page: -------------------------------------------------------------------------------- 1 | # 「锁定话题」 2 | 3 | 弱菜求教D题怎么写 4 | 5 | [MCYY wrote on 2015-09-29T12:46:24] 6 | 7 | --- 8 | 9 | 请移步 [另一帖](http://talk.icpc-camp.org/d/81)。 10 | 11 | [ftiasch wrote on 2015-09-29T12:47:55] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 102.page: -------------------------------------------------------------------------------- 1 | # 2015 沈阳赛区网络赛 M Manors 2 | 3 | 据说是什么半平面交 求各位菊苣给讲一下思路 先谢过了~ 4 | 5 | [GLSilence wrote on 2015-09-29T12:58:27] 6 | 7 | --- 8 | 9 | 话说搜索功能是不是不好用=。= @叉姐 10 | 11 | [GLSilence wrote on 2015-09-29T12:59:17] 12 | 13 | --- 14 | 15 | 是不好用，暂时修不好。 16 | 17 | 就是裸半平面交 …… 你可以先学会半平面交，之后自然而然地就会做这题了。 18 | 19 | [ftiasch wrote on 2015-09-29T13:00:43] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 110.page: -------------------------------------------------------------------------------- 1 | # 2015 四川省赛 B Carries 2 | 3 | 先水为敬。 4 | 顺带问一下，赛后题目会加入bnu题库吗 5 | 6 | [danagi wrote on 2015-10-01T06:05:59] 7 | 8 | --- 9 | 10 | @danagi#1082 题库这事，可能需要先征求一下同意…… 11 | 12 | 然而在可以继续在比赛里面交的(我猜是这个意思？ 13 | 14 | [xiaojudou wrote on 2015-10-01T06:09:53] 15 | 16 | --- 17 | 18 | @danagi#1082 震惊，原来是四川省赛的题，然后百度一搜所有题解都出来了 19 | 20 | [danagi wrote on 2015-10-01T06:16:46] 21 | 22 | --- 23 | 24 | -------------------------------------------------------------------------------- /post/Post 12.page: -------------------------------------------------------------------------------- 1 | # 「Past」Codeforces Round #319 2 | 3 | 回复什么... 4 | 5 | [xiaojudou wrote on 2015-09-09T06:16:19] 6 | 7 | --- 8 | 9 | RT 10 | 11 | [ftiasch wrote on 2015-09-09T04:44:19] 12 | 13 | --- 14 | 15 | 10号24:30 16 | 17 | [sd_invol wrote on 2015-09-09T08:02:01] 18 | 19 | --- 20 | 21 | @Sd_Invol#78 那听昂神的！ 22 | 23 | [ftiasch wrote on 2015-09-09T11:37:46] 24 | 25 | --- 26 | 27 | -------------------------------------------------------------------------------- /post/Post 136.page: -------------------------------------------------------------------------------- 1 | # 现场赛中用VIM的选手怎么调试啊 2 | 3 | 都是输出调试或者打印下来肉眼调试的么 4 | 5 | [douyuTV wrote on 2015-10-03T07:18:29] 6 | 7 | --- 8 | 9 | @douyuTV#1351 你说得对。 10 | 11 | [ftiasch wrote on 2015-10-03T07:19:28] 12 | 13 | --- 14 | 15 | @douyuTV#1351 如果你gdb用得好，该用的时候穿插一点gdb我觉得也是行的。 16 | 17 | [AngryBacon wrote on 2015-10-03T10:12:46] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 144.page: -------------------------------------------------------------------------------- 1 | # NEERC 2012 Moscow Subregional A Ariel 2 | 3 | 这道题怎么去维护每轮的可行集合啊？ 4 | 5 | [Voil wrote on 2015-10-05T04:47:51] 6 | 7 | --- 8 | 9 | 我领会了一下[这个代码](http://git.icpc-camp.org/ftiasch/mithril/blob/master/2012-10-21/A.cpp)的精神，感觉就是维护 $3\^m$ 个列表，每次询问的时候进去二分。 10 | 11 | 每个列表形如「?0101??」，其中 ? 表示 $01$ 皆可。 12 | 13 | [ftiasch wrote on 2015-10-05T05:13:51] 14 | 15 | --- 16 | 17 | 暴力一发，时间复杂度１ｅ９也过了 18 | 19 | [pojianshi wrote on 2015-10-06T05:22:26] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 145.page: -------------------------------------------------------------------------------- 1 | # NEERC 2012 Moscow Subregional K Key to Magica's diary 2 | 3 | 这题怎么做？ 4 | 5 | [ltwy wrote on 2015-10-05T05:09:03] 6 | 7 | --- 8 | 9 | 看[这个代码](http://git.icpc-camp.org/ftiasch/mithril/blob/master/2012-10-21/K.cpp)像是直接模拟…… 10 | 11 | [ftiasch wrote on 2015-10-05T05:16:53] 12 | 13 | --- 14 | 15 | 谢谢叉姐～ 16 | 17 | [ltwy wrote on 2015-10-05T05:46:01] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 150.page: -------------------------------------------------------------------------------- 1 | # NEERC 2007 H Hanoi Tower 2 | 3 | http://www.2cto.com/kf/201403/286240.html 求指点 4 | 5 | 6 | [life4711 wrote on 2015-10-05T12:24:28] 7 | 8 | --- 9 | 10 | 可以参考一下[这个](http://blog.sina.com.cn/s/blog_76f6777d0101b8l1.html) 11 | 12 | [quailty wrote on 2015-10-05T12:29:30] 13 | 14 | --- 15 | 16 | 窝来教泥一个简单粗暴的做法。枚举$6!=720$种操作排列，然后打印暴力$n=1 \dots 10$的解，然后发现只有三种数列。然后暴力$n=2,n=3$的解就能知道是哪个数列辣，然后就能直接计算结果辣。完（逃 17 | 18 | [y761823 wrote on 2015-10-05T12:36:56] 19 | 20 | --- 21 | 22 | -------------------------------------------------------------------------------- /post/Post 154.page: -------------------------------------------------------------------------------- 1 | # Dhaka 2009 K Integer Game 2 | 3 | 请问达卡2009的K题，不知道为什么达卡2009年没有题解看...并不知道怎么做 4 | https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2504 5 | 6 | [mayf3 wrote on 2015-10-06T14:37:29] 7 | 8 | --- 9 | 10 | 有一股浓浓的双向广搜的味道呀…… 11 | 12 | [ftiasch wrote on 2015-10-06T14:53:18] 13 | 14 | --- 15 | 16 | @Varona#1535 好有道理。。我想歪了，而且题目有20步限制。。两边分别搜10层。。。。不过不知道状态多不多。。 17 | 18 | [mayf3 wrote on 2015-10-06T15:04:46] 19 | 20 | --- 21 | 22 | -------------------------------------------------------------------------------- /post/Post 157.page: -------------------------------------------------------------------------------- 1 | # CTU Open 2014 H Self-Intersecting Path 2 | 3 | [题目链接](http://acm.hnu.cn/online/?action=problem&type=show&id=13457) 4 | 请教 该如何下手？ 5 | 6 | [sadf wrote on 2015-10-07T09:23:09] 7 | 8 | --- 9 | 10 | 大概跟前几条判一判是否相交就行了…… 11 | 12 | [ftiasch wrote on 2015-10-07T09:28:43] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 161.page: -------------------------------------------------------------------------------- 1 | # 「锁定话题」 2 | 3 | 求思路。 4 | 5 | [gmc wrote on 2015-10-07T11:53:15] 6 | 7 | --- 8 | 9 | @gmc#1572 烦请移步 [另一个帖子](http://talk.icpc-camp.org/d/160-sichuan-province-2012-f-fold-the-paper)。 10 | 11 | [ftiasch wrote on 2015-10-07T11:54:46] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 162.page: -------------------------------------------------------------------------------- 1 | # Sichuan Province 2012 D Divide 2 | 3 | 给定N<=10^5 的质量为2^{c_i} 的物品, 每个有x_i个, 问全部划分成两半, 求最小的差值 4 | 啊 - - 0.0 这个类似多重背包的题肿么做啊 5 | 6 | [TaoSama wrote on 2015-10-07T14:02:54] 7 | 8 | --- 9 | 10 | 引用一发我队大爷的一句话题解 11 | 12 | >贪心，从size最大的物品开始考虑。如果能平分则平分，不能平分就找size比它小的物品凑出和它相同的size。如果能凑出来则接着做，不能凑出来则把剩下所有物品都给另外一个人。 13 | 14 | [sd_invol wrote on 2015-10-07T14:14:28] 15 | 16 | --- 17 | 18 | @Sd_Invol#1582 0.0 thx 听起来好简单，我写写 19 | 20 | [TaoSama wrote on 2015-10-07T14:52:29] 21 | 22 | --- 23 | 24 | -------------------------------------------------------------------------------- /post/Post 163.page: -------------------------------------------------------------------------------- 1 | # JAG Summer 2012 Day 4 H Repairing 2 | 3 | 求教，这道题怎么做。 4 | 5 | [top628LJ wrote on 2015-10-08T03:55:12] 6 | 7 | --- 8 | 9 | >所有的开关，交点，起点，终点都是关键点，在同一条线段上相邻的关键点之间连边。 10 | 建好图后，从终点出发，将碰到的开关关掉。然后从起点出发，计算所有能到达的线段长度总和就做完了。 11 | 这题关键在于建图，建好图后就是bfs的事情了。 12 | 13 | [sd_invol wrote on 2015-10-08T04:51:34] 14 | 15 | --- 16 | 17 | 哦。原来bfs就好了 18 | 19 | [top628LJ wrote on 2015-10-09T01:48:48] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 165.page: -------------------------------------------------------------------------------- 1 | # 平面图判定 2 | 3 | 如何判定一个无向图是不是平面图。。 4 | http://codevs.cn/problem/2965/ 5 | 6 | [czk wrote on 2015-10-08T14:25:56] 7 | 8 | --- 9 | 10 | 就是个无聊的论文题。。。John Hopcroft 拿图灵奖的工作。。 11 | 12 | [ftiasch wrote on 2015-10-08T14:35:41] 13 | 14 | --- 15 | 16 | 233333。。。请问有论文吗。。。 17 | 18 | [czk wrote on 2015-10-08T14:50:15] 19 | 20 | --- 21 | 22 | @czk#1615 [链接](http://lmgtfy.com/?q=planarity+testing+algorithm) 23 | 24 | [sevenkplus wrote on 2015-10-08T15:30:16] 25 | 26 | --- 27 | 28 | -------------------------------------------------------------------------------- /post/Post 174.page: -------------------------------------------------------------------------------- 1 | # SEERC 2014 A Banks 2 | 3 | 题意是N个数首尾相连，保证N个数的和为正数，每次操作是选择一个负数，然后把它变为相反数，然后相邻的两个数减去这个数的绝对值。问最少多少步使得所有数都大于等于0。 4 | 5 | [serenade wrote on 2015-10-11T10:00:33] 6 | 7 | --- 8 | 9 | 基本上是结论题。 10 | 11 | 考虑「和为负的区间」数量，这个值每次操作都会恰好减少 $1$。 12 | 13 | [ftiasch wrote on 2015-10-11T10:19:16] 14 | 15 | --- 16 | 17 | @Varona#1694 谢叉姐 18 | 19 | [serenade wrote on 2015-10-11T16:19:18] 20 | 21 | --- 22 | 23 | 有模板，或者教程吗，我想学一下 :D 24 | 25 | [Voil wrote on 2015-10-14T04:20:58] 26 | 27 | --- 28 | 29 | -------------------------------------------------------------------------------- /post/Post 185.page: -------------------------------------------------------------------------------- 1 | # HDOJ 4624 Endless Spin 2 | 3 | 题目大意： 4 | 有n个白色的球，每一次随机的让一段[L,R]球变黑，求把所有球变黑的期望次数。(n <= 50) 5 | 我做了答案=sum{多余k次后完全覆盖的概率}k = 1..n这一步，但是后面不知道该怎么算了。。求教0.0 6 | 7 | [keepit wrote on 2015-10-14T09:48:59] 8 | 9 | --- 10 | 11 | [倒数第二个](http://talk.icpc-camp.org/d/14-icpccamp-2015) 12 | 13 | [sd_invol wrote on 2015-10-14T09:57:06] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 190.page: -------------------------------------------------------------------------------- 1 | # 好像是2013广东省赛的某道几何 2 | 3 | 2012年集训队互测梁盾《最远点》。 4 | 5 | [sevenkplus wrote on 2015-10-17T01:09:26] 6 | 7 | --- 8 | 9 | 给一个凸包，$n \leq 10^ 5$，求每个点的最远点。求教姿势。 10 | 11 | [vainman wrote on 2015-10-17T00:36:00] 12 | 13 | --- 14 | 15 | 题解：http://www.tsinsen.com/resources/Train2012-test-ld-points.pdf 16 | 17 | [sevenkplus wrote on 2015-10-17T01:10:34] 18 | 19 | --- 20 | 21 | @sevenkplus#1870 谢谢！ 22 | 23 | [vainman wrote on 2015-10-17T23:56:08] 24 | 25 | --- 26 | 27 | -------------------------------------------------------------------------------- /post/Post 201.page: -------------------------------------------------------------------------------- 1 | # 数据都是怎么出的？ 2 | 3 | 最近在帮小朋友出题。。。我觉得自己的做法很乱搞啊 4 | 比如对于树，我可以让每个点i连1..i-1之间的某个点 5 | 对于图，我先生成一棵树，然后往里面胡乱加边 6 | 还有种生成方法是先搞个邻接矩阵，然后对于每条边我rand个值，然后这个值如果小于某个数我就加边。。 7 | 对于随机数据都是No的题目是先构造正解，然后对于这个正解构造出所有输出No的情况和输出Yes的情况(这个做法是不是特别偷懒。。) 8 | 9 | [不会写诗的诗人 wrote on 2015-10-19T01:53:40] 10 | 11 | --- 12 | 13 | [quote]比如对于树，我可以让每个点i连1..i-1之间的某个点[/quote] 14 | 15 | 这是错误的生成方式，得出来的图期望直径不对。正确的生成方式是使用并查集，每次随机一条边。 16 | 17 | [sevenkplus wrote on 2015-10-19T02:34:00] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 206.page: -------------------------------------------------------------------------------- 1 | # 51nod 1203 JZPLCM 2 | 3 | 求区间的LCM ，N ,M Ai 都是50000以内的数 4 | 5 | [bigship wrote on 2015-10-20T05:00:17] 6 | 7 | --- 8 | 9 | http://www.tsinsen.com/resources/Train2012-sol-gyz.pdf 10 | 11 | [KuribohG wrote on 2015-10-20T05:23:23] 12 | 13 | --- 14 | 15 | @KuribohG#2001 thx 16 | 17 | [bigship wrote on 2015-10-20T05:28:12] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 224.page: -------------------------------------------------------------------------------- 1 | # Chengdu 2013 A Assignment For Princess 2 | 3 | 网上的思路：首先我们可以将点1到n连成一条链，边的权值分别是1到n-1，然后点n到点1连一条边。 4 | 我不理解的是为什么边的权值依次是1->n-1，因为构造时边上权值的不同，那么生成权值余数为0，1，2的可用点对的个数是不同的，那么对之后的构造是有影响的，为什么可以这样呢。 5 | 6 | [qaz69328922 wrote on 2015-10-26T08:19:16] 7 | 8 | --- 9 | 10 | 但是你要看到 $n \geq 10$ 和 $m \leq n\^\frac{2}{7}$ 而你大概是有 $O(n\^2)$ 个槽位放剩下的边的 11 | 所以我猜这两个条件想说的就是槽位足够这一句话 12 | 13 | [yuzuriha_inori wrote on 2015-10-27T01:46:01] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 23.page: -------------------------------------------------------------------------------- 1 | # 2015 长春赛区网络赛 K Good Numbers 2 | 3 | 占坑？ 4 | 5 | [xiaojudou wrote on 2015-09-13T06:11:26] 6 | 7 | --- 8 | 9 | 需要手写一下函数。 10 | 11 | 开根号 12 | 开三次根号 13 | 判断一个小于1012的数是否是质数 14 | 15 | 等等… 16 | 17 | [sd_invol wrote on 2015-09-13T06:47:05] 18 | 19 | --- 20 | 21 | 只需要分解幂次>1的质数, 可以gcd乱搞把数尽量分解开, 然后用rho 22 | 23 | [zimpha wrote on 2015-09-13T06:52:19] 24 | 25 | --- 26 | 27 | 我们先筛了$< 10^6$的质数，除掉之后只有$\leq 3$个质数。之后$\gcd$讨论一下…… 28 | 29 | [ftiasch wrote on 2015-09-13T07:06:40] 30 | 31 | --- 32 | 33 | -------------------------------------------------------------------------------- /post/Post 233.page: -------------------------------------------------------------------------------- 1 | # POJ 3109 Inner Vertices 2 | 3 | 题目会给N个黑点的坐标。。然后如果有一个点的上、下、左、右方向都有黑点的话，这个点也会变成黑点。。问最终有多少个黑点。。求菊苣解答一下具体做法，网上搜到了扫描线但是没有看太懂的说（捂脸 4 | 5 | [传道者 wrote on 2015-10-29T08:31:32] 6 | 7 | --- 8 | 9 | 就是很多横线。。很多竖线。。求一下交点嘛。。 10 | 11 | [ftiasch wrote on 2015-10-29T08:43:32] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 242.page: -------------------------------------------------------------------------------- 1 | # Shenyang 2015 E Efficient Tree 2 | 3 | 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5513 4 | 需要怎么描述状态转移呢？ 5 | 6 | [zyeric wrote on 2015-11-03T08:57:14] 7 | 8 | --- 9 | 10 | 只要做了 NOI2007 生成树计数 就会了。 11 | 12 | [sd_invol wrote on 2015-11-03T09:14:50] 13 | 14 | --- 15 | 16 | @Sd_Invol#2403 谢谢昂神。（感觉每次自己写的程序都在statistic的最后，真是忧伤T_T 17 | 18 | [zyeric wrote on 2015-11-04T03:11:41] 19 | 20 | --- 21 | 22 | -------------------------------------------------------------------------------- /post/Post 243.page: -------------------------------------------------------------------------------- 1 | # [转载] NBHEXT — Know Your Rating 2 | 3 | http://codeforces.com/blog/entry/21302 4 | 5 | 似乎是个 Chrome 插件，帮助大家早点睡觉…… 6 | 7 | [ftiasch wrote on 2015-11-03T14:40:12] 8 | 9 | --- 10 | 11 | 太粗暴了 12 | 13 | [sd_invol wrote on 2015-11-03T17:16:31] 14 | 15 | --- 16 | 17 | 前排，赞一个 18 | 19 | [whai362 wrote on 2015-11-04T02:29:46] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 246.page: -------------------------------------------------------------------------------- 1 | # Changchun 2015 C Play a game 2 | 3 | 题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=5529 4 | 题意是一个删字符游戏，两位玩家轮流玩，每次只能删左边或者右边的一个字符，如果串为空或者串出现在给出的字符串集合中则算输，给个串T以及m个串和q个查询[l, r]，问用T串的[l, r]子串做游戏谁会赢。1≤n,q≤40000，1≤m≤10000。 5 | 弱没能想出什么好的思路，求各大神指教。 6 | 7 | [takio wrote on 2015-11-04T05:21:21] 8 | 9 | --- 10 | 11 | http://async.icpc-camp.org/d/223-changchun-2015-c-play-a-game 12 | 13 | [sd_invol wrote on 2015-11-04T05:28:45] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 250.page: -------------------------------------------------------------------------------- 1 | # PA 2011 Round 5A Trail 2 | 3 | http://main.edu.pl/en/archive/pa/2011/szl 4 | 求教正确姿势 5 | 6 | 目前会做~~萝莉控向~~简单版本的： 7 | http://main.edu.pl/en/archive/pa/2011/plo 8 | 9 | [TankEngineer wrote on 2015-11-06T11:09:15] 10 | 11 | --- 12 | 13 | -------------------------------------------------------------------------------- /post/Post 252.page: -------------------------------------------------------------------------------- 1 | # Codeforces Round #320 F The Mirror Box 2 | 3 | 求教各位大牛，这题该怎么做？基尔霍夫定律（从没学过）又和这有什么关系？ 4 | 5 | [linyuzhou wrote on 2015-11-07T13:43:38] 6 | 7 | --- 8 | 9 | @linyuzhou#2476 关键结论是镜子的摆放满足题目条件当且仅当把格点对角同色地黑白染色，把镜子看成边，构成一棵黑点或白点的生成树。所以这题的做法就是先对于已经确定的镜子用并查集缩好，对于不确定的边，用matrix-tree算生成树个数。 10 | 11 | [TankEngineer wrote on 2015-11-07T14:07:35] 12 | 13 | --- 14 | 15 | @TankEngineer#2477 16 | 大概明白了。请问有关于这个结论的证明吗？ 17 | 18 | [linyuzhou wrote on 2015-11-07T17:03:42] 19 | 20 | --- 21 | 22 | -------------------------------------------------------------------------------- /post/Post 254.page: -------------------------------------------------------------------------------- 1 | # Opencup XV GP of Japan H Distance Sum 2 | 3 | 求这题怎么做。。。不太懂opentrain给的solution里func()函数的意思。。。 4 | 5 | [winoros wrote on 2015-11-08T08:12:37] 6 | 7 | --- 8 | 9 | 能不能来个题意啊。。 10 | 11 | [ftiasch wrote on 2015-11-08T09:51:32] 12 | 13 | --- 14 | 15 | @Varona#2486 16 | 给一个有边权的树，$n \leq 2 \times 10\^{5}$。 17 | 对与$k \in [1,n]$ 的每一个k。依次输出 18 | $\min\_{1 \leq v \leq n}{\\{\sum_{i=1}\^{k}{dist(i, v)}\\}}$ 19 | QWQ 20 | 21 | [winoros wrote on 2015-11-08T10:37:29] 22 | 23 | --- 24 | 25 | -------------------------------------------------------------------------------- /post/Post 255.page: -------------------------------------------------------------------------------- 1 | # CERC 2015 Warmup I Inquiry 2 | 3 | 给出两个字符串$a$和$b$, 询问$a$的所有本质不同的排列中, 有多少个包含$b$作为一个连续子串. 4 | 5 | 数据规模: $1 \le |b| \le |a| \le 500$ 6 | 7 | 这个题要如何搞啊? 8 | 9 | [zimpha wrote on 2015-11-08T12:01:50] 10 | 11 | --- 12 | 13 | 求题目链接。。。= = 14 | 15 | [ftiasch wrote on 2015-11-08T13:16:31] 16 | 17 | --- 18 | 19 | @Varona#2491 只有题目可以看, 昨晚比完赛就关闭了提交...[题目链接](http://pan.baidu.com/s/1pJvNHeN) 20 | 21 | [zimpha wrote on 2015-11-08T14:49:09] 22 | 23 | --- 24 | 25 | -------------------------------------------------------------------------------- /post/Post 258.page: -------------------------------------------------------------------------------- 1 | # 「锁定主题」 2 | 3 | 求助：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1190 4 | 5w组数据，每组数据一个a，b，要求lcm(a,b)+lcm(a+1,b)+...+lcm(b,b)%1000000007,1<=a<=b<=1000000000 5 | 6 | [czk wrote on 2015-11-11T04:57:17] 7 | 8 | --- 9 | 10 | sqrt的做法好像不行，分解质因子的时候就直接T了。。 11 | 12 | [czk wrote on 2015-11-11T04:57:56] 13 | 14 | --- 15 | 16 | Duplicated http://async.icpc-camp.org/d/97-51nod-1190-v2 17 | 18 | [ftiasch wrote on 2015-11-11T05:21:24] 19 | 20 | --- 21 | 22 | -------------------------------------------------------------------------------- /post/Post 260.page: -------------------------------------------------------------------------------- 1 | # 2015 Multi-University Training Contest 10 J CRB and Substrings 2 | 3 | 求s的长度为k的子串，该串的不同子串个数最多，1 ≤ |s| ≤ 100000。 4 | http://acm.hdu.edu.cn/showproblem.php?pid=5415 5 | 6 | [ephxyscj wrote on 2015-11-12T14:37:02] 7 | 8 | --- 9 | 10 | 丢题解跑 https://discuss.codechef.com/questions/23739/tmp01-editorial 11 | 12 | [ftiasch wrote on 2015-11-12T14:41:44] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 266.page: -------------------------------------------------------------------------------- 1 | # 「锁定话题」 2 | 3 | 题目链接：http://codeforces.com/gym/100792/problem/E 4 | 5 | 题意：$2^k$个人进行淘汰赛，每场比赛精彩程度定义为两个选手的权值之积，然后编号小的选手获胜进入下一轮，考虑所以排列作为初始的对决安排，问所有比赛的精彩程度之和的期望. 6 | 7 | 这个题要怎么入手啊？我只会枚举两个人，然后算在哪一层对决的概率. 肯定就超时了…… 求教！ 8 | 9 | [yuzhou627 wrote on 2015-11-14T14:33:57] 10 | 11 | --- 12 | 13 | Duplicated 「http://async.icpc-camp.org/d/217-neerc-2015-moscow-subregional-e-entertainment/3」 14 | 15 | [ftiasch wrote on 2015-11-14T14:37:59] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 271.page: -------------------------------------------------------------------------------- 1 | # TopCoder SRM 672 1000pts 2 | 3 | 题意是要玩一个侦探游戏，一共有n个人编号为0到n - 1，每个人都会对其它人有一个怀疑度（侦探不包含在这n个人内），一开始侦探对每个人的怀疑度都是0，从0号人开始（0号人一定不是犯人），侦探会用如下方式询问下一个人： 4 | 1、找到所有还没有询问过的人； 5 | 2、如果有多个，找那个怀疑度最高的； 6 | 3、如果还有多个，随便找一个； 7 | 按照这样的规则找到下一个要询问的人k，如果k是犯人，那么游戏结束，否则侦探对每个人i的怀疑度都会对k和i的怀疑度取最大值。 8 | 现在对于每个k，询问最少要经过要询问多少个人游戏才会结束 9 | 10 | [Jirachi wrote on 2015-11-15T15:52:53] 11 | 12 | --- 13 | 14 | 可以看下「http://codeforces.com/blog/entry/21112」。 15 | 16 | [ftiasch wrote on 2015-11-15T16:23:14] 17 | 18 | --- 19 | 20 | -------------------------------------------------------------------------------- /post/Post 273.page: -------------------------------------------------------------------------------- 1 | # 蒟蒻求一个北京站的题解 2 | 3 | RT 4 | 5 | [我是来膜拜大神的 wrote on 2015-11-16T15:10:25] 6 | 7 | --- 8 | 9 | @我是来膜拜大神的#2628 有需要的还是挨个问吧……感觉没人会有闲心给你回复个全套题解。 10 | 11 | [ftiasch wrote on 2015-11-17T00:25:49] 12 | 13 | --- 14 | 15 | @Varona#2632 叉姐教我下北京站C题。我是枚举第二种操作的情况，就是把某一种数变成另一种数，差不多有6^6 种，然后就t了.... 16 | 17 | [我是来膜拜大神的 wrote on 2015-11-17T01:07:46] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 284.page: -------------------------------------------------------------------------------- 1 | # 「锁定话题」 2 | 3 | 能不能用ac自动机找出所有长度为i的开始位置为j的非合法初始字符子串，然后根据长度做dp，用bitset优化？ 4 | wa了，求解。。。 5 | 6 | [alpc_wt wrote on 2015-11-19T01:08:11] 7 | 8 | --- 9 | 10 | Duplicated 「http://async.icpc-camp.org/d/223-changchun-2015-c-play-a-game」 11 | 12 | [ftiasch wrote on 2015-11-19T01:11:50] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 291.page: -------------------------------------------------------------------------------- 1 | # 2015 NEERC Moscow Subregional Contest J Jealousy 2 | 3 | 这个题我不是不会做，建图大家都懂，但这个代码↓是什么鬼？ 4 | http://paste.ubuntu.com/13347363/ 5 | 作者是KUTteam2，CF上显示的是bnuvjudge5。 6 | 7 | [rowdark wrote on 2015-11-19T15:41:52] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 303.page: -------------------------------------------------------------------------------- 1 | # HDOJ 5354 Bipartite Graph 2 | 3 | http://acm.hdu.edu.cn/showproblem.php?pid=5354 4 | 题意是n个点，m条边(10w),问哪些点删除之后是二分图(n个回答，第i个回答是单独删除第i个点之后是不是二分图)。 5 | 6 | 标解是可复原的并查集+分治。 7 | 可是那个分治当左右端点在mid两边的时候两个区间都要加。如果端点都是1，n的话复杂度不就变成nmlogn了么？ 8 | 9 | [VincentLDL wrote on 2015-11-24T12:09:16] 10 | 11 | --- 12 | 13 | -------------------------------------------------------------------------------- /post/Post 305.page: -------------------------------------------------------------------------------- 1 | # Shanghai 2014 L Top ACMers 2 | 3 | http://7xjob4.com1.z0.glb.clouddn.com/bd1ef1b832e5c75e5e66ccbf75d3a2c0 4 | 题意：有n个ACMers，已经进行了m场比赛，每场比赛可以确定两个选手的排名，问最少还需要进行多少场比赛能确定所有选手的排名，怎么做。。 5 | 6 | [czk wrote on 2015-11-25T10:34:01] 7 | 8 | --- 9 | 10 | 错题。以及好像重复了。 11 | 12 | [ftiasch wrote on 2015-11-25T11:47:41] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 314.page: -------------------------------------------------------------------------------- 1 | # LightOJ 1018 Brush (IV) 2 | 3 | 这题是给了N个点，问最少要多少条直线把这些点全部覆盖。。N是小于等于16的所以可以暴力。。不过如果N比较大的话，请问有什么好的方法么。。 4 | 5 | [传道者 wrote on 2015-12-01T07:26:49] 6 | 7 | --- 8 | 9 | 这个叫做 Point Line Cover Problem，有兴趣可以看[「Point Line Cover: The Easy Kernel is Essentially Tight」](http://arxiv.org/abs/1307.2521)，给了一个 FPT。 10 | 11 | [ftiasch wrote on 2015-12-01T09:02:26] 12 | 13 | --- 14 | 15 | @Varona#2942 好的，谢谢叉姐。∩ω∩ 16 | 17 | [传道者 wrote on 2015-12-01T09:15:52] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 317.page: -------------------------------------------------------------------------------- 1 | # NEERC 2013 Moscow Subregional L Liar, Liar! 2 | 3 | http://codeforces.com/gym/100257/attachments 4 | 题意：给一个每个点入度$\leq 1$的有向图，每次询问$A$，$B$两个点集，判断集合$A$中的点能否与集合$B$中的点其中某点联通。 5 | $N \leq 50000, Q \leq 50000 $ 6 | 7 | [yzq986 wrote on 2015-12-04T16:22:55] 8 | 9 | --- 10 | 11 | 就是基环外向🌲嘛。🌲上反正也不难搞，就把 $B$ 里面的点 dfs 序排一下，就能快速地判断 $A$ 的子树里面是不是有一个 $B$ 了。 12 | 13 | [ftiasch wrote on 2015-12-05T04:44:57] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 320.page: -------------------------------------------------------------------------------- 1 | # NEERC 2015 Central Subregional F Land Division 2 | 3 | 给定一个$N$个点简单多边形($N \leq 200$)，可以连接任意两个端点形成线段，要求线段之间不能在非端点处相交，求最少的线段数使得多边形被线段划分的每一块都是凸的。 4 | 5 | [sd_invol wrote on 2015-12-05T10:41:38] 6 | 7 | --- 8 | 9 | 是不是可以打牌啊？ 10 | 11 | [ftiasch wrote on 2015-12-05T12:34:42] 12 | 13 | --- 14 | 15 | 想法大概是把所有凹点拿出来乱搞搞，目前完全没什么思路。 16 | 17 | [sd_invol wrote on 2015-12-05T12:51:21] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 322.page: -------------------------------------------------------------------------------- 1 | # Camp 15 题目与视频流出！ 2 | 3 | 详见 [ICPCCamp 2015 DVD「ECFinal 专享」](http://icpc-camp.youhaovip.com/products/p000001) 4 | 5 | [xiaojudou wrote on 2015-12-07T14:02:50] 6 | 7 | --- 8 | 9 | -------------------------------------------------------------------------------- /post/Post 326.page: -------------------------------------------------------------------------------- 1 | # 关于TC不能提交 2 | 3 | 也不知道该发在哪，就先放这吧...最近TC为什么submit的时候总说Error on copying blob data？？ 4 | 好像有的人能交，有的人不能...不知道怎么fix这个问题？？急！！求帮助！！ 5 | 6 | [mirai wrote on 2015-12-09T15:31:35] 7 | 8 | --- 9 | 10 | 窝感觉是网络问题？有的时候确实不好使，等它不抽风就好了吧QvQ 11 | 12 | [mlz000 wrote on 2015-12-10T06:02:04] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 329.page: -------------------------------------------------------------------------------- 1 | # 做某一道题一直想不通该怎么办？ 2 | 3 | 请问如果一道题花了3、4个小时都想不清楚（已经看了网上的题解），这个时候该采取什么办法？ 4 | 是继续寻找在网上寻找解决办法？还是应该扔在一边，如果以后遇到再说？ 5 | 谢谢。 6 | 7 | [小菜鸟 wrote on 2015-12-12T17:23:03] 8 | 9 | --- 10 | 11 | 可以找一些相对这个问题弱一些的题， 12 | 有的时候看不懂时因为用的知识超过自己太多，看不懂不奇怪。 13 | 当然你也可以向vfk那样死磕94了 14 | 15 | [nike0good wrote on 2015-12-13T15:13:15] 16 | 17 | --- 18 | 19 | @nike0good#3012 20 | 嗯，谢谢。我知道的知识太少了。。。 21 | 22 | [小菜鸟 wrote on 2015-12-14T11:47:34] 23 | 24 | --- 25 | 26 | -------------------------------------------------------------------------------- /post/Post 333.page: -------------------------------------------------------------------------------- 1 | # SRM 676 Div1 450 2 | 3 | https://community.topcoder.com/stat?c=problem_statement&pm=14085&rd=16626 4 | 450这个SG模拟步数的上限是怎么算出来的？ 5 | 有的人直接把k变成了4 + k % 4，请问是为什么呢 6 | 7 | [mirai wrote on 2015-12-19T05:20:31] 8 | 9 | --- 10 | 11 | 咱实在是没做过。。。= = 12 | 13 | 但是我感觉这种事情不都是找找规律么。。。 14 | 15 | 16 | [ftiasch wrote on 2015-12-19T12:19:08] 17 | 18 | --- 19 | 20 | -------------------------------------------------------------------------------- /post/Post 336.page: -------------------------------------------------------------------------------- 1 | # UVALive 6836 Automotive Navigation 2 | 3 | [题目链接戳这里](http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=79055) 4 | 由于题目细节比较多，不太好解释题意 5 | 求解这个题该怎么做呢 6 | 7 | [TaoSama wrote on 2015-12-21T16:56:59] 8 | 9 | --- 10 | 11 | 打牌。$f(t, x, y)$ 表示 $t$ 时刻，车是不是可能在 $(x, y)$ 这个点。注意每次只会走 $10$，走 $100$ 次也就走 $1000$。但是只有 $50$ 条线段，所以 $(x, y)$ 的可能取值只有 $50 \times 1000$ 个（实际上肯定更少）。 12 | 13 | [ftiasch wrote on 2015-12-22T02:38:15] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 34.page: -------------------------------------------------------------------------------- 1 | # ZOJ Monthly,September 2015 D Sign Every Day 2 | 3 | 给出了n段不相交的连续时间和K张卡片，求最多能获得的分数 4 | 5 | [14184134 wrote on 2015-09-16T08:37:14] 6 | 7 | --- 8 | 9 | 参见[链接](http://dreadnought.icpc-camp.org/ZOJ%20Monthly,%20September%202015)。 10 | 11 | 建议问题应该把题意写明白，光看你这个描述，根本不能明白卡片、时间之间的关系，连必要的数据范围都没有，很难让人好好回答问题呢。 12 | 13 | [ftiasch wrote on 2015-09-16T09:07:13] 14 | 15 | --- 16 | 17 | 谢谢叉姐， 18 | 19 | [14184134 wrote on 2015-09-16T10:58:04] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 347.page: -------------------------------------------------------------------------------- 1 | # ICPCCamp 2016 Board 2 | 3 | http://board.icpc-camp.org/2016-01.html 4 | http://board.icpc-camp.org/2016-02.html 5 | http://board.icpc-camp.org/2016-03.html 6 | ... 7 | http://board.icpc-camp.org/2016-08.html 8 | 欢迎围观！ 9 | 10 | [ftiasch wrote on 2016-01-25T05:11:45] 11 | 12 | --- 13 | 14 | 这个board上的按钮按得真是爽啊！ 15 | 16 | [Neroysq wrote on 2016-01-26T02:08:35] 17 | 18 | --- 19 | 20 | 有队伍介绍吗 21 | 22 | [douyuTV wrote on 2016-01-26T10:47:20] 23 | 24 | --- 25 | 26 | -------------------------------------------------------------------------------- /post/Post 350.page: -------------------------------------------------------------------------------- 1 | # KaTeX 和 图片上传 2 | 3 | 沉寂很久啦！值此猴年新春之际，论坛有两个更新： 4 | 5 | 1. 使用 KaTeX 替代 MathJax 处理数学公式。主要的优点是 $a^2$ 中的 ^ 再也不需要转义啦！ 6 | 2. 发表新帖时左下角可以上传图片。 7 | 8 | [ftiasch wrote on 2016-02-07T17:55:25] 9 | 10 | --- 11 | 12 | -------------------------------------------------------------------------------- /post/Post 360.page: -------------------------------------------------------------------------------- 1 | # 关于左偏树的树高 2 | 3 | 对于一个左偏树，可以构造一条很长的链，每个节点的儿子都是左儿子，这样高度是O(n)的，并且满足左偏性质。但是如果一开始有n个树，每个树都只有一个节点，这样进行合并的时候，因为合并的时候都是选择一个节点的右儿子进行合并，所以树高不会太高，可以证明树高是O(logn)或者是其他复杂度吗？ 4 | 5 | [czk wrote on 2016-02-24T06:36:46] 6 | 7 | --- 8 | 9 | 不能 10 | 11 | [yuzuriha_inori wrote on 2016-02-24T09:23:26] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 37.page: -------------------------------------------------------------------------------- 1 | # Topcoder SRM 668 Solutions 2 | 3 | [Solutions](http://dreadnought.icpc-camp.org/TopCoder%20SRM%20668) 4 | 5 | [TankEngineer wrote on 2015-09-16T14:40:11] 6 | 7 | --- 8 | 9 | -------------------------------------------------------------------------------- /post/Post 370.page: -------------------------------------------------------------------------------- 1 | # 如何判断任意多边形相似呢？ 2 | 3 | HDU2826 http://acm.hdu.edu.cn/showproblem.php?pid=2826 4 | 5 | [alphaway wrote on 2016-03-08T12:34:19] 6 | 7 | --- 8 | 9 | 多边形相邻两条边的比值啊, 相邻两边的夹角提取出来, 然后就是做个匹配咯. 10 | 11 | [zimpha wrote on 2016-03-08T12:43:41] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 373.page: -------------------------------------------------------------------------------- 1 | # 「重复主题」 2 | 3 | 题目 连接http://codeforces.com/contest/583/problem/D 4 | 官方 题解是用矩阵快速幂 做得。请问怎么想到矩阵快速幂的。中间的思路是怎么样的。我一直不太懂其中的道理，请教各位了。 5 | 6 | 7 | [sadf wrote on 2016-03-11T05:16:17] 8 | 9 | --- 10 | 11 | Duplicated. 参见「http://async.icpc-camp.org/d/143-codeforces-round-323-d-once-again/2」 12 | 13 | [ftiasch wrote on 2016-03-11T06:16:57] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 382.page: -------------------------------------------------------------------------------- 1 | # 将形如4k+1型的素数表示成两个整数的平方和 2 | 3 | 如题，$p$是质数，且$4|p-1$，求一对整数$(x,y)$，使得$x^2+y^2=p$，其中$0\leq x\leq y$。 4 | $p\leq 10^{18}$。 5 | 6 | [skywalkert wrote on 2016-03-18T10:06:11] 7 | 8 | --- 9 | 10 | @skywalkert#3377 参考这个[回答](http://math.stackexchange.com/a/1925) 11 | 12 | 先求出$x^2 \equiv -1 \text{ mod } p$的最小整数解$x_0$, 然后用$x_0$和$p$做辗转相除法, 记录每次的余数$r$, 直到$r \le \sqrt{p}$, 那么这个$r$作为$x$, $y=\sqrt{p-x^2}$. 13 | 14 | [zimpha wrote on 2016-03-18T12:26:29] 15 | 16 | --- 17 | 18 | -------------------------------------------------------------------------------- /post/Post 385.page: -------------------------------------------------------------------------------- 1 | # 线段树的标记永久化 2 | 3 | 最近看到这个东西。感觉很妙啊。 4 | 能不能推荐一些相关的题目，或者应用。thx... 5 | 6 | [prime21 wrote on 2016-03-21T14:38:43] 7 | 8 | --- 9 | 10 | 感觉我也就知道 POI tet 。。 11 | 12 | [ftiasch wrote on 2016-03-22T01:38:40] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 394.page: -------------------------------------------------------------------------------- 1 | # 51nod 1075 约瑟夫环 V3 2 | 3 | [题目链接](http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1075) 4 | 假设有$2n(1\leq n\leq 40)$个人围成一个圆圈，前面$n$个人是”好伙计“，而后面$n$个人是”坏家伙“，找到最小的一个正整数$q$，使得若在绕圆圈走时每隔$q-1$个人处死一人，那么所有的坏家伙就会是首先出局者。 5 | 例如，当$n=3$时$q=5$，而当$n=4$时$q=30$。 6 | 题目中还给出了$n=51$时的答案$q=24459555519370421049600$。 7 | 8 | [skywalkert wrote on 2016-04-05T04:23:05] 9 | 10 | --- 11 | 12 | -------------------------------------------------------------------------------- /post/Post 406.page: -------------------------------------------------------------------------------- 1 | # 算法疑惑 2 | 3 | 算法太多了，应该怎么入门呢？ 4 | 5 | [CrazyCodess wrote on 2016-04-23T15:53:23] 6 | 7 | --- 8 | 9 | 是时候…… 10 | 11 | https://www.zhihu.com/question/36013894 12 | 13 | 了。 14 | 15 | [ftiasch wrote on 2016-04-23T16:06:43] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 417.page: -------------------------------------------------------------------------------- 1 | # PKU Campus 2016 I Zealots 2 | 3 | 传送门： http://poj.openjudge.cn/practice/C16I/ 4 | 题意： 从一个矩阵中识别字母p k u的个数，字母不相交 5 | 6 | [TreeDiagram wrote on 2016-05-10T05:26:26] 7 | 8 | --- 9 | 10 | 搬运： 11 | 12 | > @quailty 点到重心距离max/min，<7.0判U否则K 13 | 14 | --- 15 | 16 | 17 | > @zimpha 我是用个最小矩形把U框起来, 然后抠出白色联通块, 找出最大的和次大的, 算了下占整体的比例, 如果他们的差超过0.3那么就是U否则是P或者K 18 | 19 | --- 20 | 21 | > P随意,KU找所有点的平均点,以平均点为圆心,sqrt(总点数/5)为半径内如果有点就是K不然是U 22 | 23 | [ftiasch wrote on 2016-05-10T05:34:35] 24 | 25 | --- 26 | 27 | -------------------------------------------------------------------------------- /post/Post 440.page: -------------------------------------------------------------------------------- 1 | # Hefei 2015 A Bus Routes 2 | 3 | 请问A题的递推式是怎么算的……推了好久推不出…… 4 | 5 | [mssjtxwd wrote on 2016-05-26T16:58:55] 6 | 7 | --- 8 | 9 | 先数 $n$ 个点，边有 $m$ 种颜色的连通图数量 $G_n$，再减掉 $n$ 个点的树的数量。 10 | 11 | 后者简单，就是 $n^{n - 2} \times m^{n - 1}$ （via Cayley's formula）。 12 | 13 | 后者，就是常见的 $G_n = F_n - \sum_{i = 1}^{n - 1} \binom{n - 1}{i - 1} F_{n - i} G_i$. 其中 $F_n$ 表示 $n$ 个点的图的数量，也就是 $(m + 1)^{n(n - 1) / 2}$. 14 | 15 | [ftiasch wrote on 2016-05-27T01:46:08] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 445.page: -------------------------------------------------------------------------------- 1 | # 有关k次方前缀和的问题 2 | 3 | 对于这种类型的，有哪些实践上还不错的算法来求解？ 4 | 5 | 听过矩阵快速幂和插值法，然而都不懂，求讲解 6 | 7 | [NanoApe wrote on 2016-05-29T01:51:30] 8 | 9 | --- 10 | 11 | 杜瑜皓：多项式及求和 12 | 13 | 感觉非常详细…… 14 | 15 | [ftiasch wrote on 2016-05-29T04:44:57] 16 | 17 | --- 18 | 19 | 也可以参考[这个题](http://codeforces.com/contest/622/problem/F)的editorial 20 | 21 | [quailty wrote on 2016-05-29T05:20:29] 22 | 23 | --- 24 | 25 | -------------------------------------------------------------------------------- /post/Post 446.page: -------------------------------------------------------------------------------- 1 | # 北京赛区2015 E Stamps 2 | 3 | 请问这道题应该怎么解决呢QAQ 4 | 5 | [ed7bc1a3-0d72-4bbd-b5fd-3a82ed0f6dfb wrote on 2016-05-30T01:05:35] 6 | 7 | --- 8 | 9 | https://async.icpc-camp.org/d/280-beijing-2015-e-stamps 10 | 11 | [ftiasch wrote on 2016-05-30T04:48:50] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 458.page: -------------------------------------------------------------------------------- 1 | # Search Forum怎么用啊? 2 | 3 | 搜标题，搜内容都没有。 4 | (每次都自己在Google上site.. 5 | 6 | [prime21 wrote on 2016-06-15T09:06:20] 7 | 8 | --- 9 | 10 | @prme21#3792 你的方法很对嘛 11 | 12 | 另外可以通过主页左侧标签辅助浏览 13 | 14 | [xiaojudou wrote on 2016-06-15T09:15:24] 15 | 16 | --- 17 | 18 | -------------------------------------------------------------------------------- /post/Post 46.page: -------------------------------------------------------------------------------- 1 | # 2015 沈阳赛区网络赛 H Hold Your Hand 2 | 3 | 我们造一个前缀的字典树 A，和一个后缀的字典树 B，那么给出的 $n$ 个数字都是字典树的叶子，我们把这些叶子连起来。 4 | 5 | 同时，我们对于前缀的代价写在 A 上，后缀的代价写在 B 上。那么题目要求就是说，从 A 的根到 B 的根，至少要被割一次。所以就是最小割咯。 6 | 7 | [ftiasch wrote on 2015-09-19T09:33:14] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 468.page: -------------------------------------------------------------------------------- 1 | # codejam 2012 world final Shifting Paths 2 | 3 | 一个图有 $n$ 个节点,编号为 $1$ 到 $n$ 4 | 除了$n$ 号节点以外,每个节点有两条边,第 $i$ 号节点的两条边分别走到$ L[i]$节点,$R[i]$节点 5 | 若第 $i$ 号节点是第奇数次被到达,那么走到 $L[i]$,若是偶数次被到达,那么走到 $R[i]$ 6 | 现在你刚刚到达 $1$ 号节点，问是否可以走到$n$号节点，需要多少步? 7 | $n \leq 40$ 8 | 看到了Analysis里面的做法，但是不知道为什么复杂度是对的？ 9 | 10 | [prime21 wrote on 2016-06-26T12:45:12] 11 | 12 | --- 13 | 14 | -------------------------------------------------------------------------------- /post/Post 475.page: -------------------------------------------------------------------------------- 1 | # 0x13 Ural Championship I Astronomy 2 | 3 | 给出地球自转公转的模型求某个时间点太阳光线角度什么的。。 4 | 写出来样例差了几度也不知道错在哪里，有人做过这个题吗。。 5 | 6 | [702ca781-5d12-47ec-86c6-976f99ae215f wrote on 2016-07-06T07:45:34] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 477.page: -------------------------------------------------------------------------------- 1 | # 有关概率(期望) dp的疑问 2 | 3 | 一般来说概率正着推，期望逆着推。 4 | 为什么 期望要逆向推？？？？ 5 | 6 | [zhaohao wrote on 2016-07-09T02:04:38] 7 | 8 | --- 9 | 10 | 终于感觉到 async 的作用了！这问题我在不同的地方回答过好多次…… 11 | 12 | in short，你本事你正着推给我看看？ 13 | 14 | --- 15 | 16 | 合理一点的答案：一般我们处理的概率/期望问题本质都是一个 markov chain，假设 $t$ 是 markov chain 的一个状态，那么 $f(t)$ 只能定义成从 $t$ 开始的期望，而**不能**定义成从 $t$ 结束的期望，后者不 well-defined. 这个定义上的问题决定了只能倒着做。 17 | 18 | [ftiasch wrote on 2016-07-09T05:00:43] 19 | 20 | --- 21 | 22 | -------------------------------------------------------------------------------- /post/Post 478.page: -------------------------------------------------------------------------------- 1 | # 计蒜之道复赛 微软项目经理的挑选方案 2 | 3 | 题解的公式是n方的的该如何实现 4 | 5 | [huantwofat wrote on 2016-07-10T02:44:43] 6 | 7 | --- 8 | 9 | 已解决 10 | 11 | [huantwofat wrote on 2016-07-10T05:23:43] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 481.page: -------------------------------------------------------------------------------- 1 | # 2012 North America East Central NA I Town Square 2 | 3 | [题目链接](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=573&page=show_problem&problem=4141) 4 | 题目大意： 5 | 给出4个半径均为5的可能相交但不重合的圆，求一个正方形框住它们，并且每个圆恰好和一条边相切，每条边恰好和一个圆相切，如果有解则最大化正方形的周长，答案保留到小数点后两位。 6 | 圆心坐标绝对值不超过100。 7 | 8 | [skywalkert wrote on 2016-07-12T11:18:47] 9 | 10 | --- 11 | 12 | 数据范围比较小，也许小角度差枚举就可以过了，想请教一下分类讨论大师们应该如何做这道题。 13 | 14 | [skywalkert wrote on 2016-07-12T11:21:18] 15 | 16 | --- 17 | 18 | -------------------------------------------------------------------------------- /post/Post 495.page: -------------------------------------------------------------------------------- 1 | # Codeforces Round #363 F Coprime Permutation 2 | 3 | [题目链接](http://codeforces.com/contest/698/problem/F) 4 | 题目大意： 5 | 一个排列$p_1,p_2,\cdots,p_n$是Coprime Permutation，当且仅当$\forall_{1 \leq i < j \leq n}{coprime(i,j)\Leftrightarrow coprime(p_i,p_j)}$。 6 | 给出$n$和排列中的一部分位置的值，问有多少种方案填补排列中剩下的位置能使得排列变成Coprime Permutation，答案对$(10^9+7)$取模。 7 | 数据范围： 8 | $2 \leq n \leq 10^6$，排列中给出的值均为不超过$n$的正整数，且两两不同。 9 | 10 | 11 | [skywalkert wrote on 2016-07-22T14:50:46] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 503.page: -------------------------------------------------------------------------------- 1 | # Petrozavodsk Winter 2015 Saratov SU Contest J Sockets 2 | 3 | 链接：http://codeforces.com/gym/100886/problem/J 4 | 题意：n个拖线板，m个用电器。现在仅有一个插座；每个拖线板可以分出$a_i$个插口；每个用电器有个阈值$b_i$表示其到总插座长度不能超过$b_i$，求满足条件用电器最大数量。 5 | 6 | 7 | [yzq986 wrote on 2016-08-01T16:56:36] 8 | 9 | --- 10 | 11 | https://wiki.icpc-camp.org/dreadnought/XVI%20Open%20Cup%20named%20after%20E.V.%20Pankratiev%20Grand%20Prix%20of%20Saratov.html 12 | 13 | [ftiasch wrote on 2016-08-03T10:12:26] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 504.page: -------------------------------------------------------------------------------- 1 | # 关于网络流的一些疑问... 2 | 3 | 在网络流建图过程中，如何判定一个图建出来是正确的，一般通过什么方式证明它。。 4 | 例如，poj 3469这个最小割的题，拆点建图是不对的。。 5 | 6 | [yzq986 wrote on 2016-08-01T17:02:36] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 517.page: -------------------------------------------------------------------------------- 1 | # SWERC 2015 I Text Processor 2 | 3 | 题意：给一个1e5长的字符串，求所有长度为w的区间的不同的子串数 4 | 5 | 想办法维护了一下连续w个后缀对答案的贡献，发现姿势不对错了，求各位大大指点一波 6 | 7 | [asdfghj wrote on 2016-08-14T02:58:39] 8 | 9 | --- 10 | 11 | 不是太好做的题。。。需要后缀树，每次扩展一下，删掉最深的叶子。 12 | 13 | 具体可以看 https://discuss.codechef.com/questions/23739/tmp01-editorial 这里的题解。 14 | 15 | 下面评论还有一个杜教（？）给的线段树做法。 16 | 17 | [ftiasch wrote on 2016-08-14T03:22:00] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 519.page: -------------------------------------------------------------------------------- 1 | # Petrozavodsk Summer Training Camp 2015 Day 4 E 2 | 3 | n个队员， m个敌人， 每个人有个能力值x， （1 <= x <= 2, x为浮点数）。 能力值为x的人和能力值为y的人战斗的获胜概率为x/(x+y). 现在让n个人都分别和m个敌人对战， （一共是n*m场对战）， 求每个队员的获胜场数的期望。 4 | 5 | 6 | 因为每场比赛的贡献是独立的， 所以第i个队员的获胜的期望: dp[i] = $\sum_{j=1}^{m} {x_i/(x_i+y_j)}$. 7 | 怎么算这个公式？ 8 | 9 | [续一秒 wrote on 2016-08-15T10:57:29] 10 | 11 | --- 12 | 13 | 泰勒展开之后可以变成卷积的形式，然后FFT。 14 | 15 | [twilight wrote on 2016-08-15T14:47:22] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 568.page: -------------------------------------------------------------------------------- 1 | # 665F的一种解法的复杂度如何分析 2 | 3 | 除了官方题解外 adkroxx 也在讨论区提供了一种思路 然后声称复杂度为$O(n^{3/4})$ 4 | 然而这种思路的复杂度是如何分析出来的呢 5 | http://codeforces.com/blog/entry/44466#comment-316932 6 | 7 | 8 | [sagitta wrote on 2016-09-26T00:55:41] 9 | 10 | --- 11 | 12 | http://codeforces.com/blog/entry/44466?#comment-317276 13 | 14 | just for ref 15 | 16 | [ftiasch wrote on 2016-09-27T01:36:30] 17 | 18 | --- 19 | 20 | -------------------------------------------------------------------------------- /post/Post 575.page: -------------------------------------------------------------------------------- 1 | # 东北四省赛G题 2 | 3 | 题意：给定平面上 $n$ 个点，一个人一秒钟可以跑单位距离，给定他可以跑的最长时间 $t$，他想跑一条闭合曲线，尽可能多的包围点，请问最多能包围几个点？ 4 | 数据范围： $n \leq 80, t \leq 5000, |x_i|, |y_i| \leq 600$ 5 | 这个该怎么做＝＝ 6 | 7 | [evilgeek wrote on 2016-10-01T23:58:52] 8 | 9 | --- 10 | 11 | 枚举起点 $s$，把点按照极角序排，按照极角序转移。 12 | $dp(x, k)$ 表示它现在在 $x$ 点，曲线包含了 $k$ 个点的最短距离，转移时枚举下一个点 $y$，那么 $sxy$ 组成的三角形里面的点就是你的了。 13 | 14 | 可能要预处理所有 $xy$ 下方的点的数目，这样才能 $O(1)$ 算出每个三角形里面点的数目。 15 | 16 | [ftiasch wrote on 2016-10-02T00:15:24] 17 | 18 | --- 19 | 20 | -------------------------------------------------------------------------------- /post/Post 578.page: -------------------------------------------------------------------------------- 1 | # XIII Open Cup GP of Azov Sea E. Land in Krasnaya Polyana 2 | 3 | 给定一个$N\times M$的矩阵$c[i][j]$，要求选择$N$个A类点，每个A类点位于不同行，另外选择$M$个B类点，每个B类点位于不同列，一个点只能被选择一次。最小化这些点的代价之和。 4 | $N\times M\leq 10^6$。 5 | 6 | [Claris wrote on 2016-10-02T10:43:50] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 585.page: -------------------------------------------------------------------------------- 1 | # 2016 ICPC 大连网赛 C题 2 | 3 | 给定一个无向图，可以选两个点添加一条原本不存在的边，使得从$1$号点到$N$号点的最短路数量$ \geq X$.问有多少加边方案。 4 | $1 \leq N \leq 20000$, $1 \leq M \leq 100000$ 5 | 6 | [xietutu wrote on 2016-10-05T16:25:28] 7 | 8 | --- 9 | 10 | https://async.icpc-camp.org/d/546-2016-icpc/ 11 | https://async.icpc-camp.org/d/553-2016 12 | 13 | 就是计算出从起点出发到每个点的与从每个点出发到终点的最短路与最短路条数，然后发现满足要求的加边要满足两个式子。用数据结构算出来再把已经存在边的点对斥掉就好了。 14 | 15 | [sd_invol wrote on 2016-10-05T16:36:45] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 590.page: -------------------------------------------------------------------------------- 1 | # 【广告】北大ACM金牌得主、微软实习生谈编程、算法和面试 2 | 3 | 今晚八点准时开始　手机端／ＰＣ端均可　欢迎各位大大打脸小蒟蒻 4 | 戳这里：http://m.quzhiboapp.com/?liveId=106&t=1476239356456 5 | 6 | 7 | 8 | [fancycoder wrote on 2016-10-12T06:15:53] 9 | 10 | --- 11 | 12 | 只能通过微信端注册哦！ 13 | 14 | [fancycoder wrote on 2016-10-12T06:47:47] 15 | 16 | --- 17 | 18 | 挽尊 19 | 20 | [fotile96 wrote on 2016-10-13T11:12:34] 21 | 22 | --- 23 | 24 | -------------------------------------------------------------------------------- /post/Post 597.page: -------------------------------------------------------------------------------- 1 | # CCPC 2016合肥G Phone 2 | 3 | 500000个点和操作，每个点有一个后继。有两种操作：1.将x的后继修改为y；2.查询x的距离最远的后继，若没有（出现环）则输出-1。 4 | 5 | [ephxyscj wrote on 2016-10-18T14:29:35] 6 | 7 | --- 8 | 9 | 直接 LCT 就好。。。出现环就把当前连通分量标记一下。。。 10 | 11 | [ftiasch wrote on 2016-10-18T14:41:56] 12 | 13 | --- 14 | 15 | @ftiasch#4592 学习了，谢叉姐。 16 | 17 | [ephxyscj wrote on 2016-10-18T14:45:34] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 598.page: -------------------------------------------------------------------------------- 1 | # 关于2-SAT的疑问 2 | 3 | 为什么必须在反图上染色啊... 4 | 5 | 原图中A->B说明 ``选A一定选B``。 6 | 7 | 反过来的话应该是 ``如果不选B，则不选A``。 8 | 9 | 这两种有什么区别吗？还是说我理解有问题... 10 | 11 | [sd197555 wrote on 2016-10-19T04:53:17] 12 | 13 | --- 14 | 15 | 没有区别啊 16 | 17 | [ftiasch wrote on 2016-10-19T07:38:23] 18 | 19 | --- 20 | 21 | @ftiasch#4596 22 | 那我在原图上染色也可以嘛？ 23 | 24 | [sd197555 wrote on 2016-10-19T07:45:01] 25 | 26 | --- 27 | 28 | @sd197555#4597 可以吧 29 | 30 | [ftiasch wrote on 2016-10-19T14:08:40] 31 | 32 | --- 33 | 34 | -------------------------------------------------------------------------------- /post/Post 604.page: -------------------------------------------------------------------------------- 1 | # 2015 Asia Tehran E Billboard 2 | 3 | [题目链接](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=695&page=show_problem&problem=5548) 4 | 5 | 题目大意： 6 | 给定一个 $m$ 行 $n$ 列的 01 矩阵，有 $r$ 次机会使整行变成 1，有 $s$ 次机会使一个位置变成 1，问操作后全 1 子矩阵的最大面积。$m, n \le 300$。用 $O(n^2m\log m)$ 的算法卡过了，不知道有没有更精妙的算法。 7 | 8 | [braveTester wrote on 2016-10-20T16:52:05] 9 | 10 | --- 11 | 12 | -------------------------------------------------------------------------------- /post/Post 614.page: -------------------------------------------------------------------------------- 1 | # 请问基环树是什么？有什么相关资料吗？ 2 | 3 | 求解QAQ 4 | 5 | [Fancy wrote on 2016-10-25T10:01:02] 6 | 7 | --- 8 | 9 | 就是 $n$ 个点 $n$ 条边的连通图…… 10 | 11 | 要说什么专门的资料，好像没有诶= = 12 | 13 | [ftiasch wrote on 2016-10-25T10:21:08] 14 | 15 | --- 16 | 17 | 哦，谢谢啦 18 | 19 | [Fancy wrote on 2016-10-25T10:23:27] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 618.page: -------------------------------------------------------------------------------- 1 | # SPOJ XYYHHTT Catch Sheep 2 | 3 | 题目大意：一颗树，$K$个机器人从某点出发，需要走完所有边，问$N$个点，对于每个点，机器人走的距离和最小是多少。 4 | $N \leq 15000,K \leq 30$ 5 | 易想到一个$O(NK^2)$的树形dp，但这道题时限0.1s,看到discuss里有人$O(NK)$被卡常数了。求问$O(NK)$的思路。 6 | 7 | [xietutu wrote on 2016-10-27T13:07:07] 8 | 9 | --- 10 | 11 | http://www.docin.com/p-567721869.html 12 | 13 | [ftiasch wrote on 2016-10-27T14:23:38] 14 | 15 | --- 16 | 17 | @ftiasch#4681 多谢叉姐。 18 | 19 | [xietutu wrote on 2016-10-27T15:44:13] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 619.page: -------------------------------------------------------------------------------- 1 | # 10月30日(周日)19:00 hihoCoder Challenge 24欢迎大家参加 2 | 3 | 本次排名第1名、2-3名、4-8名将分别获得200元、100元、50元的亚马逊礼品卡。 4 | 链接： [https://hihocoder.com/contest/challenge24](https://hihocoder.com/contest/challenge24) 5 | 6 | [gtdzx wrote on 2016-10-28T07:02:36] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 625.page: -------------------------------------------------------------------------------- 1 | # hdu上某题的题号 2 | 3 | 记得在hdu看到过一题，求因子数为d的第k小数。 4 | 现在完全找不到了= =求一下这题的题号。 5 | 6 | [hoccz wrote on 2016-11-02T08:56:01] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 63.page: -------------------------------------------------------------------------------- 1 | # 2010 World Final F Contour Mapping 2 | 3 | http://www.bnuoj.com/v3/contest_show.php?cid=3627#problem/F 4 | 5 | 给定一个等高线图。。。求出图中是某个数倍数的等高线的长度和。。 6 | 这枚怎么做比较简单呀！ 7 | 8 | 9 | 10 | [xiaodao wrote on 2015-09-22T07:41:29] 11 | 12 | --- 13 | 14 | 这个题目难点在哪里呀？ 15 | 16 | 我感觉一个三角一个三角算就很好算啊。 17 | 18 | [ftiasch wrote on 2015-09-22T14:23:32] 19 | 20 | --- 21 | 22 | -------------------------------------------------------------------------------- /post/Post 633.page: -------------------------------------------------------------------------------- 1 | # Andrew Stankevich's Contest #41 B Bicoloring of a tree 2 | 3 | 题意：$2n$ 个点的树，每个点染 $n+1$ 种颜色，一条边上两个点颜色不相同，并且每条边上两个点组成的颜色对与其他的点都不相同，每个点度数最多为 $n$ ，求一种染色方案 ($n \leq 10^5$) 4 | 虽说我暴力搜过了这题QAQ但还是想知道有没有正常的构造方法 5 | （样例输入： 6 | 6 7 | 1 2 8 | 3 2 9 | 4 3 10 | 5 3 11 | 5 6 12 | 样例输出： 13 | 2 3 4 1 2 1) 14 | 15 | [fizzydavid wrote on 2016-11-17T12:24:38] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 635.page: -------------------------------------------------------------------------------- 1 | # Beijing 2016 A 2 | 3 | 题意：一个和谐的n \* m的01矩阵定义为对于每一个(x, y), a[x][y] \^ a[x-1][y] \^ a[x][y-1] \^ a[x+1][y] \^ a[x][y+1] = 0 4 | 问字典序为K的n \* m和谐矩阵的(x, y)元素是0还是1？ 5 | 6 | [hccz95 wrote on 2016-11-20T03:10:25] 7 | 8 | --- 9 | 10 | 在群里问了Claris大神，知道怎么做了 11 | 首先如果第一行确定之后，所有元素都确定了，每一个元素都可以表示成第一行元素的线性组合 12 | 所以将最后一行的元素表示为第一行元素的线性组合，并且最后一行的元素必须为0 13 | 然后进行高斯消元，找出编号最小的一组线性基，将k对应到某个线性基上即可 14 | 15 | [hccz95 wrote on 2016-11-21T00:09:17] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 636.page: -------------------------------------------------------------------------------- 1 | # Open Cup XVI Grand Prix of Ekaterinburg H Heimdall 2 | 3 | 给出$R$个长度为$N$的置换，从中选择一些置换（每个置换可以选择若干个）合并为一个新的置换，问可以生成出多少置换？ 4 | $R \leq 1000, N \leq 15 $ 5 | 6 | [xietutu wrote on 2016-11-22T12:47:34] 7 | 8 | --- 9 | 10 | 当时比赛时贴贴板子就过了。。 11 | 12 | 可以看 http://roosephu.github.io/attachment/AbsAlg.pdf 或者 http://codeforces.com/blog/entry/21335?locale=ru#comment-260437 13 | 14 | [ftiasch wrote on 2016-11-22T15:48:04] 15 | 16 | --- 17 | 18 | -------------------------------------------------------------------------------- /post/Post 637.page: -------------------------------------------------------------------------------- 1 | # 2014上海区域赛H题 Uvalive7145 Lawn Mower 2 | 3 | 题目大意：农场主有一个用N条(1<=N<=100)栅栏围成的农场（简单多边形，坐标范围-1e3<=xi,yi<=1e3），一个半径为R(0<=R<=1e3)的草坪修剪机，修剪机不能修剪到农场以外的地方，问能修剪到的农场面积多少。 4 | 5 | [luras_oil wrote on 2016-11-23T13:08:30] 6 | 7 | --- 8 | 9 | -------------------------------------------------------------------------------- /post/Post 639.page: -------------------------------------------------------------------------------- 1 | # CCPC-Finals 2016 热身赛 C 2 | 3 | 题目大意，给定一个n的排列和一个$\leq 3$的常量p，现在让你求一个最大的k，使得可以通过下面的操作使原排列变得有序： 4 | step1:将排列划分成k个区间，每个区间内部从小到大排序。 5 | step2:选择p个区间，可以任意交换这p个区间的位置。 6 | $n \leq 5000$ 7 | 8 | [totoro wrote on 2016-11-26T08:41:09] 9 | 10 | --- 11 | 12 | 据说就是 [这个题](https://code.google.com/codejam/contest/5264487/dashboard#s=p3) 13 | 14 | [ftiasch wrote on 2016-11-26T11:08:14] 15 | 16 | --- 17 | 18 | -------------------------------------------------------------------------------- /post/Post 646.page: -------------------------------------------------------------------------------- 1 | # Dhaka 2016 H - Harmonic Matrix 2 | 3 | https://uva.onlinejudge.org/external/131/13155.pdf 4 | 5 | 交换相邻元素，使得行顺序和列顺序在相同的行或列上相同 6 | 限制为 < $2.5 \times R \times C$总交换次数 7 | 看起来像从角落贪心或DP？ 8 | 似乎很难实现这个约束. 9 | 10 | 11 | 12 | [baodog wrote on 2016-12-06T17:03:25] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 647.page: -------------------------------------------------------------------------------- 1 | # 线段树合并复杂度 2 | 3 | 请问如何证明呢？ 4 | 5 | [samzhang wrote on 2016-12-08T06:08:07] 6 | 7 | --- 8 | 9 | 每个节点一块钱，合并两个节点用掉一块，一开始只花了 $O(n \log n)$ 块钱啊？ 10 | 11 | [ftiasch wrote on 2016-12-08T12:32:59] 12 | 13 | --- 14 | 15 | @ftiasch#4862 Orz好有道理 16 | 17 | [samzhang wrote on 2016-12-08T20:45:49] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 650.page: -------------------------------------------------------------------------------- 1 | # ICPCCamp 2017 报名系统❀关闭❀通知 2 | 3 | 大家好！ 4 | 5 | 由于报名人数已远超场地容量，请已报名的同学尽快于报名网站 https://icpc.camp 补充获奖信息。 6 | 7 | 请其他有意向的同学尽快报名。 8 | 9 | 报名系统将于 2016 年 12 月 16 日 0:00 关闭。 10 | 逾期除新确认的晋级世界总决赛的队伍外，不再接受报名。 11 | 12 | 再次感谢大家的热情！ 13 | 14 | [xiaojudou wrote on 2016-12-14T11:43:06] 15 | 16 | --- 17 | 18 | -------------------------------------------------------------------------------- /post/Post 655.page: -------------------------------------------------------------------------------- 1 | # 2016 Asia Daejeon J Room 2 | 3 | [题目链接](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=731&page=show_problem&problem=5631) 4 | 题目大意： 5 | 定义简单多边形是不自交的多边形（可以是凹的）。 6 | 定义简单多边形是正交的当且仅当它的边是水平的或垂直的。 7 | 定义简单多边形是单调的当且仅当任何一条垂直线与它的交是至多一条线段。 8 | 给出一个正交且单调的简单多边形的边数 $n$ ，以及每条边上的一个非端点的点坐标、每条边是水平或垂直的，如果这个多边形存在则求这个多边形的周长，否则输出 -1 。 9 | 数据范围：$4 \leq n \leq 500000$，给出的点都是整点且坐标 $\in [-2^{30},2^{30}-1)$ 。 10 | 11 | [skywalkert wrote on 2016-12-19T12:22:14] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 658.page: -------------------------------------------------------------------------------- 1 | # 维护树的形态的计数问题 2 | 3 | 给定一棵树，支持link/cut，并每次询问当前形态的树是第几次出现，无标号的形态 4 | 5 | [yanQval wrote on 2016-12-26T07:56:01] 6 | 7 | --- 8 | 9 | 维护一下重心，维护一下树 Hash，你看有没有希望呢= = 10 | 11 | [ftiasch wrote on 2016-12-26T16:36:40] 12 | 13 | --- 14 | 15 | @ftiasch#4939 感觉hash并不能降低复杂度啊，每次断叶子的话，向上的hash都要变？ 16 | 17 | [yanQval wrote on 2016-12-27T00:35:32] 18 | 19 | --- 20 | 21 | @yanQval#4940 数据多大？ 22 | 23 | [CookiC wrote on 2017-02-22T07:14:15] 24 | 25 | --- 26 | 27 | -------------------------------------------------------------------------------- /post/Post 659.page: -------------------------------------------------------------------------------- 1 | # Topcoder SRM 688 Hard 2 | 3 | 题意: 给一个括号序列s，要求你把这个序列划分成恰好两个括号子序列a, b, 使得在a, b都是合法括号序列的情况下cost(a) + cost(b)尽量小。 4 | 5 | cost(s)计算方法如下：对于每一个match的括号对，我们定义它的深度为在这个括号内部，括号嵌套最深的层数。比如对于"(()(()))"，最外层的括号的层数为3。对于每一个括号对，对cost(s)的贡献为d^2 ，其中d为它的层数。 6 | 7 | 限制为|s| < 150。 8 | 9 | 我使用了一种简单的贪心方法过了此题（从左到右for这个括号序列，贪心分配当前括号给s1 还是s2）。我看到很多人也用了DP或者其他类似的方法。但这些方法都无一例外使用了一个性质：原本在s中match的括号对一定会被分配到同一个子序列。 10 | 11 | 我想了很久感觉不是那么好证明啊？有没有大佬给点思路！ 12 | 13 | [Miceren wrote on 2017-01-31T08:24:54] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 663.page: -------------------------------------------------------------------------------- 1 | # git.icpc-camp.org 停服公告 2 | 3 | 大家晚上好，git.icpc-camp.org，因为不符合 camp 服务都是 4 个字符的规定，永久性停止服务。 4 | 5 | 之前在上面存放了重要资料的同学，可以邮件我 ftiasch@icpc-camp.org 领取，谢谢大家。 6 | 7 | [ftiasch wrote on 2017-03-01T14:10:21] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 665.page: -------------------------------------------------------------------------------- 1 | # 二维平面点集最近邻Batch Query 2 | 3 | 平面上有n个点(1K量级, 范围 0.0<=x<=640.0, 0.0<=y<=480.0 精度取在小数点后两位), 4 | 作m次最近点对询问(10量级), 每次询问给定一个坐标(x, y)求其最近邻 5 | kd-tree 不行, 因为询问次数少所有建树开销过大 6 | 可以离线, 有没有什么可以近似线性的搞法.......工程用...... 7 | 8 | [jki14 wrote on 2017-03-03T05:35:52] 9 | 10 | --- 11 | 12 | 随机转一个角度，直接暴力 for 相邻的 x 就行，break 一下超快的。 13 | 14 | [ftiasch wrote on 2017-03-03T05:52:37] 15 | 16 | --- 17 | 18 | @ftiasch#4983 19 | 似乎这样搞一搞会挺快的样子; 20 | 21 | [jki14 wrote on 2017-03-03T06:00:41] 22 | 23 | --- 24 | 25 | -------------------------------------------------------------------------------- /post/Post 668.page: -------------------------------------------------------------------------------- 1 | # Hangzhou 2017 K Kingdom of Obsession 2 | 3 | 想请问一下n稍大一点的数据是怎么构造出来的，我试了一下n>100就输出No的话，会WA。 4 | 枚举复杂度GG 5 | 6 | [Cabinfever wrote on 2017-03-13T08:34:11] 7 | 8 | --- 9 | 10 | 丢题解 https://post.icpc-camp.org/d/621-2016 11 | 12 | [zimpha wrote on 2017-03-16T14:12:11] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 672.page: -------------------------------------------------------------------------------- 1 | # MegCup ERROR++ 2 | 3 | [传送门](https://2017.megcup.com/problems/6) 4 | 题目大意：输入一个2000*2000的目标矩阵，只有0，和1两种值。初始矩阵为全0，每次选矩阵中的一个点画十字架，将该点和以该点为中心的左、右、上、下，3个长度范围内的格点的值与1异或，超过矩阵范围的部分不用处理，问最少需要多少次可以将初始矩阵变为目标矩阵。 5 | （报导可能存在偏差，原题意最好看链接！） 6 | 7 | [douyuTV wrote on 2017-03-26T16:06:37] 8 | 9 | --- 10 | 11 | （道听途说）听说就是对前 3 行设变量，一行一行往下推，对于后 3 行列方程。消元后自由变量很少。。。暴力枚举就行。 12 | 13 | [ftiasch wrote on 2017-03-27T05:46:29] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 675.page: -------------------------------------------------------------------------------- 1 | # AtCoder Grand Contest 012 C Tautonym Puzzle 2 | 3 | AGC012 的C题check程序怎么实现的啊orz 4 | 5 | 题目链接：http://agc012.contest.atcoder.jp/tasks/agc012_c 6 | 7 | [clatisus wrote on 2017-04-01T14:13:25] 8 | 9 | --- 10 | 11 | DP 12 | 13 | [sevenkplus wrote on 2017-04-01T14:46:17] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 677.page: -------------------------------------------------------------------------------- 1 | # 叉姐 200 题 2 | 3 | [链接](http://sevenkplus.com/data/ftiasch200.txt) 4 | 5 | 格式：两题之间用一个空行分开。同一题内没有空行。 6 | 7 | 来源是叉姐[这里](https://gist.github.com/ftiasch/007a7732456cc8f88ba6)贴出来的题。 8 | 9 | 去掉了一些非题目的部分，去掉了重题。计算几何部分好像多删了几题，不过数一下现在刚好是200题，所以就不加回来了。修改了一些我注意到的错误。应该还有不少错误，不过大概不影响使用。 10 | 11 | [sevenkplus wrote on 2017-04-09T05:48:37] 12 | 13 | --- 14 | 15 | 这是啥。。。原 po 是我以前给小朋友上课用的 outline，有一天清空 evernote 就都贴到一起了。。 16 | 17 | [ftiasch wrote on 2017-04-09T07:08:55] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 68.page: -------------------------------------------------------------------------------- 1 | # 2013 成都赛区 D Dinner Coming Soon 2 | 3 | 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4784 4 | 感觉这个题用DP[X][_S][N][T],第一维是点的位置，第二维是空间，第三维是盐的袋数，第四维是时间，感觉这样构造状态就可以构成一个DAG，直接记忆化搜索就行了，结果总是wa，看的网上题解，也没有用记忆化搜索过的，想问一下叉姐这个思路的正确性。。。 5 | 6 | [alpc_wcq wrote on 2015-09-24T08:28:17] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 680.page: -------------------------------------------------------------------------------- 1 | # 【偶尔更新】日经问题整理 2 | 3 | Q：ejudge（opentrains）使用的评测系统上 Wall time-limit exceeded 是什么意思？ 4 | A：（我猜测）ejudge 的评测器有（至少）两层 timer，内层 timer 卡 user time，外层 timer 卡 real time. 在交互题中，在 perform 一个 block read 的时候，是不在 user space block 的，所以这时候只会触发外层的 timer，造成 Wall time-limit exceeded. 5 | 6 | [ftiasch wrote on 2017-04-30T03:15:03] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 682.page: -------------------------------------------------------------------------------- 1 | # VK Cup 2017 Round 2 C Vulnerable Kerbals 2 | 3 | 这题建图时候如何从 ix 与 j 关于 m 同余的要求推导出的 gcd(m,i) | gcd(m,j)　啊，　想不明白…… 4 | 5 | [zzhzz wrote on 2017-05-14T09:09:53] 6 | 7 | --- 8 | 9 | 想出来了，此贴终结 10 | 11 | [zzhzz wrote on 2017-05-14T09:25:02] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 687.page: -------------------------------------------------------------------------------- 1 | # jobs.icpc-camp.org 停服公告 2 | 3 | 大家上午好，jobs.icpc-camp.org，因为被[竞争对手](https://careers.google.com/jobs)打败，暂时停止服务。 4 | 5 | 如有相关需求，可直接与我们联系。祝大家求职与工作顺利，每个人都有光明的未来。谢谢大家。 6 | 7 | [xiaojudou wrote on 2017-05-23T01:49:19] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 689.page: -------------------------------------------------------------------------------- 1 | # PKU Campus 2017 2 | 3 | 给出N（1 <= N <= 100,000）个点的有向完全图，每对点a,b之间是由两条边组成，a->b和b->a，给出M（1 <= M <= 300,000）个要求,每个格式为s, t, k，表示走s->t这条路至少k次，起点任意，问至少经过多少条边，并给出该方案经过的城市序列。 4 | 如： 5 | input： 6 | 4 3（4个点3个要求） 7 | 1 2 3 8 | 3 4 2 9 | 4 3 2 10 | output： 11 | 10 12 | 1 2 3 4 3 4 3 1 2 1 2 13 | 14 | 15 | [Sole wrote on 2017-05-26T04:17:42] 16 | 17 | --- 18 | 19 | 数一下度的奇偶，总可以补一下使得最多剩下 $2$ 个奇点，之后跑欧拉回路就好。 20 | 21 | [ftiasch wrote on 2017-05-26T12:32:14] 22 | 23 | --- 24 | 25 | -------------------------------------------------------------------------------- /post/Post 692.page: -------------------------------------------------------------------------------- 1 | # 线段树区间求和 2 | 3 | 原题链接 https://www.e-olymp.com/en/contests/8374/problems/71121 。。题目意思就是单点更新和求区间交替和。 4 | 我主要是卡在求交替和这里。。不知道用线段树怎么做。。求指点QaQ 5 | 6 | [说了窝最菜辣 wrote on 2017-06-10T03:53:33] 7 | 8 | --- 9 | 10 | $\sum_{i=l}^{r}(-1)^{i-l}a_i=(-1)^l\sum_{i=l}^{r}(-1)^ia_i$ 11 | 12 | [quailty wrote on 2017-06-10T04:54:59] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 693.page: -------------------------------------------------------------------------------- 1 | # 6月25日(周日)19:00 hihoCoder Challenge 29欢迎大家参加 2 | 3 | 本次挑战赛由Hulu赞助。 4 | 5 | 奖品 6 | ---- 7 | 第一名： FILCO「87圣手二代」机械键盘 8 | 第二名： 铁三角ATH IM70入耳耳机 9 | 第三名： 罗技G502鼠标 10 | 前二十名： Hulu纪念T恤 11 | 注：奖品只对在校学生发放。 12 | 13 | 比赛链接： [https://hihocoder.com/contest/challenge29](https://hihocoder.com/contest/challenge29) 14 | 15 | [gtdzx wrote on 2017-06-20T13:54:57] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 698.page: -------------------------------------------------------------------------------- 1 | # 关于Splay树数据没更新 2 | 3 | 怎么找啊，，一顿操作总是有数据没pushdown下去，如果把所有点拉到根上，就更新 。。。但是我不知道怎么确定哪些点需要拉一遍，求教。。 4 | 5 | [tak_fate wrote on 2017-07-13T04:32:09] 6 | 7 | --- 8 | 9 | 其实就是两个过程，一个是从根到叶子的递归，另一个是叶子到根的回溯。 10 | 11 | 前一个，经过的点都 push down。后一个，转到的两个点都要 push down。 12 | 13 | [ftiasch wrote on 2017-07-13T11:32:05] 14 | 15 | --- 16 | 17 | @ftiasch#5159 叉姐求个模板0.0 18 | 19 | [tak_fate wrote on 2017-07-14T03:30:32] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 7.page: -------------------------------------------------------------------------------- 1 | # 可以换头像啦！ 2 | 3 | RT 4 | 5 | [ftiasch wrote on 2015-09-06T15:10:22] 6 | 7 | --- 8 | 9 | -------------------------------------------------------------------------------- /post/Post 702.page: -------------------------------------------------------------------------------- 1 | # 最小费用最大流 2 | 3 | 假设s是起点，t为终点。 4 | 咱们平常的最小费用最大流是在流最大情况下使所有流的费用最小，那么如果要得到最大流的同时使得每条s-t的流的费用的最大值最小化，此时应该怎么做？ 5 | 6 | 7 | [Fancy wrote on 2017-07-30T08:13:37] 8 | 9 | --- 10 | 11 | 按照原来的算法跑就是对的。 12 | 13 | 最小费用增广路算法有个性质，每次增广的路费用是单调不减的。 14 | 15 | [ftiasch wrote on 2017-07-30T12:22:58] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 706.page: -------------------------------------------------------------------------------- 1 | # 为啥多校这么多counting problem啊 2 | 3 | 好难啊。QAQ 4 | 为什么你们都会，为什么脑洞都这么大。 5 | 6 | [tak_fate wrote on 2017-08-04T04:50:46] 7 | 8 | --- 9 | 10 | 好像都没啥难的 counting。。。都是套路凑一凑就差不多了啊 11 | 12 | [ftiasch wrote on 2017-08-04T06:12:11] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 709.page: -------------------------------------------------------------------------------- 1 | # 一道与最短路有关的计数题 2 | 3 | 给一个n<=1000的有向图，问从s到t的最短路径的条数。不同的最短路径定义为经过的点集不同。 4 | 边权$w_i$满足$0 \leq w_i \leq 10^9$。 5 | 注意边权可能为0。 6 | 7 | [yzq986 wrote on 2017-08-09T16:20:57] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 711.page: -------------------------------------------------------------------------------- 1 | # 动态约瑟夫问题(?) 2 | 3 | 给定序列a_1, a_2, ..., a_N-1，考虑N个人的约瑟夫问题，第i次报数到a_i的人被淘汰。要求支援两种操作，总操作数量M： 4 | 1. 改变a_k之值 5 | 2. 询问第k个被淘汰的人 6 | N<=10^5, M<=10^4 7 | 8 | [rsabcmoi wrote on 2017-08-12T13:24:20] 9 | 10 | --- 11 | 12 | -------------------------------------------------------------------------------- /post/Post 712.page: -------------------------------------------------------------------------------- 1 | # 8月20日(周日)19:00 hihoCoder Challenge 30欢迎大家参加 2 | 3 | 本场挑战赛排名第1名、2-3名、4-8名将分别获得200元、100元、50元的亚马逊礼品卡。 4 | 比赛链接： [https://hihocoder.com/contest/challenge30](https://hihocoder.com/contest/challenge30) 5 | 6 | [gtdzx wrote on 2017-08-17T07:09:31] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 72.page: -------------------------------------------------------------------------------- 1 | # 2015 Multi-University Training Contest 7 C Hotaru's problem 2 | 3 | 题目: [LINK](http://acm.hdu.edu.cn/showproblem.php?pid=5371). 4 | 这个题, Manacher处理好了之后, 感觉正确姿势是要加个set维护, 或者二分一下之类的, 但是网上好多二维枚举过的, 例如这个代码: [LINK](http://www.cnblogs.com/chengsheng/p/4726693.html). 我在想, 这个暴力枚举可以叉掉么? 还是说其实复杂度是有保证的呢? 5 | 6 | [yuzhou627 wrote on 2015-09-25T06:20:19] 7 | 8 | --- 9 | 10 | 多校题总该有解的？ 11 | 12 | [xiaojudou wrote on 2016-02-24T17:29:05] 13 | 14 | --- 15 | 16 | -------------------------------------------------------------------------------- /post/Post 725.page: -------------------------------------------------------------------------------- 1 | # 2017 Shenyang Online C happy happy happy 2 | 3 | 写了个 dp + bitset 的水过了，感觉可以被卡掉啊orz。 4 | 5 | [clatisus wrote on 2017-09-12T03:56:14] 6 | 7 | --- 8 | 9 | 只要数列满足某种奇妙的大小关系，就可以造成我取左边，傻子就取右；我取右边，傻子就取左的戏剧效果。 10 | 11 | 在这种情形下，这就等价于有 $n/2$ 个数，每个数可以是 $+a[i]$ 或者 $-a[i]$，使得和非负且最小，也就是一个常见的背包。。。 12 | 13 | in short，这个题只能搜。。。 14 | 15 | [ftiasch wrote on 2017-09-12T05:04:06] 16 | 17 | --- 18 | 19 | -------------------------------------------------------------------------------- /post/Post 727.page: -------------------------------------------------------------------------------- 1 | # HDOJ 6159 Graph Of Zhuper 2 | 3 | 就是CCPC网络赛1010，我是照着CAMP给的题解写的，是不是对于n的每个因子d都要构造长度为n/d的多项式进行一次多项式exp，我这样写一直到超时。还有这题要求对任意素数取模，我网上看别人对这种题的做法是用中国剩余定理，请问这道题应该是最终结果取一次中国剩余定理就好，还是只要是用到FFT的地方都要用一次 4 | 5 | [J_X wrote on 2017-09-14T09:25:30] 6 | 7 | --- 8 | 9 | 任意 mod 的问题应该抄 https://code.icpc-camp.org/ftiasch/dreadnought-code-library/src/master/improve/FFT.cpp. 10 | 11 | [ftiasch wrote on 2017-09-14T12:13:35] 12 | 13 | --- 14 | 15 | -------------------------------------------------------------------------------- /post/Post 736.page: -------------------------------------------------------------------------------- 1 | # 2017 Beijing Onsite B Reverse Suffix Array 2 | 3 | 由rank[sa[i-1]+1]>rank[sa[i]+1]可以推出，charAt(sa[i-1]) 现在有一个三柱汉诺塔，一共 $n \le 15$个圆盘，以及 $Q \le 20000$个状态。初始时所有圆盘都在第一个柱子，现在需要输出一系列操作使得所有状态都被遍历到。允许经过同一个状态多次，但操作数需要在 $2 \times 10^6$以内。 5 | 6 | ## [官方题解](https://dmoj.ca/problem/year2018p5/editorial): 7 | 8 | > 求每个状态在哈密顿路径上的编号，然后按照这个顺序遍历。 9 | 10 | 不是很懂具体怎么求，求解。 11 | 12 | 13 | [samzhang wrote on 2018-01-06T07:29:57] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 783.page: -------------------------------------------------------------------------------- 1 | # 【已结束】icpc-camp.org 计划于 2018 年 2 月 10 日 -- 13 日停服维护 2 | 3 | RT 4 | 5 | [ftiasch wrote on 2018-02-06T03:16:47] 6 | 7 | --- 8 | 9 | 好奇会有哪些更新! 10 | 11 | [douyuTV wrote on 2018-02-06T05:53:07] 12 | 13 | --- 14 | 15 | @douyuTV#5582 只是服务器物理上要移动而已…… 16 | 17 | [ftiasch wrote on 2018-02-06T08:32:29] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 787.page: -------------------------------------------------------------------------------- 1 | # 因为pastebin最近很反人类，所以自己搭了一个 2 | 3 | 网址:dailypaste.com 4 | 原则上每日清空，没强制要求，自觉别传太大的文件，盘一共就20g，每个月一共就500g流量。。传个代码还是足够了。别上传同名字的文件否则老的会被顶掉。如果有兴趣帮我点个star就更好了。 5 | 6 | [XENO_AMESS wrote on 2018-03-05T02:49:28] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 789.page: -------------------------------------------------------------------------------- 1 | # BZOJ 2334 [SCOI2011]镜像拆分 2 | 3 | [题目链接](http://www.lydsy.com/JudgeOnline/problem.php?id=2334) 4 | 5 | 题目大意：对于任意正整数 $x$ 定义 $\mathrm{rev}_K(x)$ 是将 $x$ 的 $K$ 进制表示（不含前导 0）翻转后得到的数字。给定 $K, A, B$，对于 $x = A, A + 1, \cdots, B$ 统计有多少 $y$ 满足 $x = y + \mathrm{rev}_K(y)$，输出方案数之和对 $20110521$ 取模的值。由于 $A, B$ 可能很大，输入将给出它们的 $K$ 进制表示，其中 $A$ 的长度为 $n$，$B$ 的长度为 $m$。 6 | 7 | 数据范围：$2 \leq K \leq 10^5, 1 \leq n, m \leq 10^5$ 8 | 9 | [skywalkert wrote on 2018-03-09T19:37:52] 10 | 11 | --- 12 | 13 | -------------------------------------------------------------------------------- /post/Post 790.page: -------------------------------------------------------------------------------- 1 | # 历史上关于最小费用可行流（存在负环）的题有吗？ 2 | 3 | 找来找去只发现了 POJ 2175 的消圈算法，请问还有别的吗？ 4 | 5 | [14rj134 wrote on 2018-03-15T14:15:59] 6 | 7 | --- 8 | 9 | 最小费用可行流的题不少啊，[Project Euler 355](https://projecteuler.net/problem=355) 就可以用最小费用可行流做~~，然而并没有负环~~。 10 | 11 | 依稀记得 Topcoder 也有一道有消负圈的题。 12 | 13 | [skywalkert wrote on 2018-03-15T15:22:36] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 798.page: -------------------------------------------------------------------------------- 1 | # 喜迎 https://icpc.camp 重新开始评测 2 | 3 | RT 4 | 5 | 感谢 @nanometer 老师 6 | 7 | [ftiasch wrote on 2018-04-25T14:12:42] 8 | 9 | --- 10 | 11 | %%% 12 | 13 | [foreverhighness wrote on 2018-04-25T14:15:44] 14 | 15 | --- 16 | 17 | -------------------------------------------------------------------------------- /post/Post 799.page: -------------------------------------------------------------------------------- 1 | # Petrozavodsk Summer 2017 Warsaw U Contest B. Hotter-colder 2 | 3 | 题目大意：这是一道交互式题目。有一个 $d$ 维空间，每一维坐标是 $[0, r]$ 的整数。定义该空间里两个点 $p, q$ 的距离是 $\max_{i = 1, 2, \cdots, d}{|p_i - q_i|}$，其中 $p_i$ 是 $p$ 的第 $i$ 维坐标，$q_i$ 同理。空间里有一个定点，你需要找到它，你可以询问某个点到这个定点的距离是否比上一次你询问的点到这个定点的距离**更近**。你可以询问不超过 $100 d$ 次，并且你的第一次询问会得到"不是更近"的回应。 4 | 5 | 数据范围：$1 \leq d \leq 100, 2 \leq r \leq 10^9$。 6 | 7 | [skywalkert wrote on 2018-04-27T20:51:09] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 802.page: -------------------------------------------------------------------------------- 1 | # 2017 Asia Xi'an C Naomi with Array 2 | 3 | 题目大意：初始有一个长度为 $n$ 的序列 $A_1, A_2, \cdots, A_n$，序列中的数两两不同，现在要通过循环移位操作将序列排成降序。每次操作可以选择两个下标 $i$ 和 $j$ ($i \neq j$)，如果 $i < j$ 则将 $A_i, A_{i + 1}, \cdots, A_j$ 变成 $A_{i + 1}, \cdots, A_j, A_i$，如果 $i > j$ 则将 $A_j, \cdots, A_{i - 1}, A_i$ 变成 $A_i, A_j, \cdots, A_{i - 1}$。这样一次操作的代价是 $i + j$。请你最小化将序列排成降序所需的操作总代价，在总代价最小的情况下最小化操作次数。 4 | 5 | 数据范围：$1 \leq n \leq 1000$。 6 | 7 | [skywalkert wrote on 2018-04-28T12:27:58] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 805.page: -------------------------------------------------------------------------------- 1 | # 2017 ECfinal J题 Straight Master 2 | 3 | http://codeforces.com/gym/101775/problem/J 4 | 题目大意：给出1-N的每个数字的个数。问能否将所有数字都分成连续的长度为3-5的序列。 5 | 6 | [kkaly wrote on 2018-05-13T14:24:50] 7 | 8 | --- 9 | 10 | -------------------------------------------------------------------------------- /post/Post 807.page: -------------------------------------------------------------------------------- 1 | # ZOJ 4031 Game on a Tree 2 | 3 | 题意： 4 | 给定一棵n个点边带权有根树，一开始Bob站在根节点上，每次可以 5 | 1.走向某个儿子，代价为边权 6 | 2.跳转到根节点，无代价 7 | 3.在当前节点设置传送门，之前设置的传送门会失效，无代价 8 | 4.跳转到传送门，无代价 9 | 要求遍历所有叶子节点，求最小代价 10 | $n\leq 200,0\leq w\leq 10^9$ 11 | vjudge上的dp都没有看懂 = =、 12 | 13 | 14 | [kzoacn wrote on 2018-05-14T11:25:54] 15 | 16 | --- 17 | 18 | https://blog.csdn.net/lifelikes/article/details/80209422 19 | 20 | [ftiasch wrote on 2018-05-14T13:45:06] 21 | 22 | --- 23 | 24 | -------------------------------------------------------------------------------- /post/Post 809.page: -------------------------------------------------------------------------------- 1 | # 网站某些内容显示不正确的问题修复 2 | 3 | 原因：某一天我手贱把域名从 *.icpc-camp.org 换到了 *.icpc.camp，导致 CDN 的回源出错…… 4 | 5 | 仍然遇到问题的同学可以清空浏览器缓存试试~再有问题欢迎留言指出！ 6 | 7 | [ftiasch wrote on 2018-05-29T04:51:46] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 810.page: -------------------------------------------------------------------------------- 1 | # 求平面点集费马点的函数凸性严格证明 2 | 3 | 即求证明平面点集费马点是可以三分的。 4 | 如果证明过程复杂，求传送门：中文，英文，日文皆可。 5 | 6 | 注：平面点集费马典即求平面上一点到指定点集欧氏距离总和最小的一点 7 | 8 | 跪谢。 9 | 10 | [jki14 wrote on 2018-05-31T04:33:06] 11 | 12 | --- 13 | 14 | 熟知（？）到任意一个点的距离都是凸函数，那么只需要证明 [凸函数之和还是凸的](https://www.quora.com/Is-the-sum-of-convex-functions-convex)。 15 | 16 | [quailty wrote on 2018-05-31T07:08:03] 17 | 18 | --- 19 | 20 | @quailty#5684 THX :) 21 | 22 | [jki14 wrote on 2018-06-01T10:16:30] 23 | 24 | --- 25 | 26 | -------------------------------------------------------------------------------- /post/Post 811.page: -------------------------------------------------------------------------------- 1 | # 计蒜客 贝壳找房户外扩展 kdtree 2 | 3 | 看到网上题解做法是加上t轴之后离线按y排序做。最后需要一个数据结构。 4 | 题解给的是kdtree，但这个kdtree需要动态地插入、删除，不知道这样的kdtree怎么实现，希望dalao们可以分享一些相关资料。 5 | 以及弱弱地问下，有没有别的数据结构可以解决这个题目啊？ 6 | 7 | [YaoBIG wrote on 2018-06-08T00:19:09] 8 | 9 | --- 10 | 11 | 替罪羊 kd-tree. 12 | 13 | [ftiasch wrote on 2018-06-08T04:41:07] 14 | 15 | --- 16 | 17 | @ftiasch#5691 多谢叉姐！我去学习一下！ 18 | 19 | [YaoBIG wrote on 2018-06-08T13:15:09] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 814.page: -------------------------------------------------------------------------------- 1 | # 求助一下叉姐的魔法训练 2 | 3 | 请问一下哪里还能找到叉姐的魔法训练全套的题目，之前好像放在voj上的，但是挂了，谢谢 4 | 5 | [gzgywh wrote on 2018-07-03T09:06:05] 6 | 7 | --- 8 | 9 | https://vjudge.net/contest#category=all&running=3&title=&owner=dafashi 10 | 11 | 是在说这个吗？ 12 | 13 | [ftiasch wrote on 2018-07-04T03:06:18] 14 | 15 | --- 16 | 17 | @ftiasch#5709 嗯嗯，谢谢叉姐 18 | 19 | [gzgywh wrote on 2018-07-10T07:31:51] 20 | 21 | --- 22 | 23 | -------------------------------------------------------------------------------- /post/Post 817.page: -------------------------------------------------------------------------------- 1 | # ACM-ICPC 2018 南京赛区网络预赛 F 2 | 3 | https://nanti.jisuanke.com/t/30995 4 | 初始给定一棵树大小n，m次询问，包含三种操作。 5 | 1 x y ：如果x, y不属于同一棵树，则连边 6 | 2 x y ：如果x, y属于同一棵树，则将这个树以x做根，删除y和y父亲这条边。 7 | 3 x ：初始从x出发，等概率向相邻点移动，求走回x点的期望步数。 8 | 9 | n、m <= 1e5 10 | 11 | [994495jj wrote on 2018-09-01T14:31:25] 12 | 13 | --- 14 | 15 | 基本上就是 LCT 吧…… 16 | 17 | [ftiasch wrote on 2018-09-05T15:09:46] 18 | 19 | --- 20 | 21 | -------------------------------------------------------------------------------- /post/Post 818.page: -------------------------------------------------------------------------------- 1 | # ICPC2016青岛现场赛G 2 | 3 | link:http://acm.hdu.edu.cn/showproblem.php?pid=5988 4 | Q1:这道题做费用流的时候如果选择汇点为起点跑最短路会MLE，选择源点跑最短路才能AC。测试了一下，MLE应该是因为跑dijkstra的时候堆的size太大导致的爆空间，这是因为可能有负环的问题吗？(浮点数比较部分都加了eps，所以应该不是精度问题) 5 | Q2:费用流里的最短路以源点或汇点为起点有区别吗，如果有，哪一种会更优？ 6 | 7 | [Akatsuki wrote on 2018-09-13T02:14:42] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /post/Post 819.page: -------------------------------------------------------------------------------- 1 | # 国庆训练 2 | 3 | 请问一下今年国庆有人组织训练嘛？牛客、CF或者计蒜客 4 | 5 | [gzgywh wrote on 2018-09-19T13:28:32] 6 | 7 | --- 8 | 9 | -------------------------------------------------------------------------------- /post/Post 821.page: -------------------------------------------------------------------------------- 1 | # 送君千里，终须一别 2 | 3 | 谢谢大家w 4 | 5 | 2018.09.20 6 | 7 | [ftiasch wrote on 2018-09-20T05:33:33] 8 | 9 | --- 10 | 11 | -------------------------------------------------------------------------------- /red-queen/20161109.page: -------------------------------------------------------------------------------- 1 | 嗯可能是1106训练的，懒得改了标题。 2 | 3 | CCPC2016 杭州赛区 4 | ================= 5 | 6 | 开始顺利的过了ABCDEFIJ（可能也不是非常顺利）。 7 | 8 | 可怜写K题把匈牙利写错了，调了一辈子。 9 | 10 | G题好难写啊没写完，H题好难想啊想不出来，然后GG了。 11 | 12 | 总结 13 | ==== 14 | 15 | 鏼老师太强了。 16 | -------------------------------------------------------------------------------- /red-queen/20161109.page.backup: -------------------------------------------------------------------------------- 1 | 嗯可能是1106训练的，懒得改了标题。 2 | 3 | \section{CCPC2016 杭州赛区} 4 | 开始顺利的过了ABCDEFIJ（可能也不是非常顺利）。 5 | 6 | 可怜写K题把匈牙利写错了，调了一辈子。 7 | 8 | G题好难写啊没写完，H题好难想啊想不出来，然后GG了。 9 | 10 | \section{总结} 11 | 鏼老师太强了。 12 | -------------------------------------------------------------------------------- /red-queen/20161111.page: -------------------------------------------------------------------------------- 1 | 泰国赛区热身赛 2 | ============== 3 | 4 | CD都是傻逼题涛老师和西老师帅气1A了。 5 | 6 | AB题意毒性有点大，愉快的猜题意之后过了。 7 | 8 | 帅气打银滚粗了。 9 | 10 | cajgeg 11 | -------------------------------------------------------------------------------- /red-queen/20161111.page.backup: -------------------------------------------------------------------------------- 1 | \section{泰国赛区热身赛} 2 | CD都是傻逼题涛老师和西老师帅气1A了。 3 | 4 | AB题意毒性有点大，愉快的猜题意之后过了。 5 | 6 | 帅气打银滚粗了。 7 | 8 | cajgeg 9 | -------------------------------------------------------------------------------- /red-queen/20161127.page: -------------------------------------------------------------------------------- 1 | ICPC2016 大连赛区 2 | ================= 3 | 4 | 西老师沉迷DDL，可怜中午有事，上午就和涛老师双人双机打了一下大连赛区。 5 | 6 | 运气比较好题意基本都猜对了，涛老师带可怜顺利的AK之后大家喜大普奔的吃饭去了。 7 | 8 | 感觉C题还是挺有趣的，其他几道可怜做的题感觉都挺一般.. 9 | 10 | 开场比较浪没有跟榜做签到题沉迷抢一血，爆了几发OJ然后罚时狗带了。 11 | 12 | 双人双机的罚时被qls按在地上摩擦QwQ 13 | 14 | $$upd$$ 15 | 16 | 百度了一下发现C题怎么有公式啊.. 17 | 18 | 可怜好像打了个表找了个规律然后变成分形然后瞎逼递归做了一年.. 19 | 20 | 有点僵硬.. 21 | 22 | $$upd$$ 23 | 24 | 大连青岛傻傻分不清楚..cajgeg 25 | -------------------------------------------------------------------------------- /red-queen/20161127.page.backup: -------------------------------------------------------------------------------- 1 | \section{ICPC2016 大连赛区} 2 | 西老师沉迷DDL，可怜中午有事，上午就和涛老师双人双机打了一下大连赛区。 3 | 4 | 运气比较好题意基本都猜对了，涛老师带可怜顺利的AK之后大家喜大普奔的吃饭去了。 5 | 6 | 感觉C题还是挺有趣的，其他几道可怜做的题感觉都挺一般.. 7 | 8 | 开场比较浪没有跟榜做签到题沉迷抢一血，爆了几发OJ然后罚时狗带了。 9 | 10 | 双人双机的罚时被qls按在地上摩擦QwQ 11 | 12 | \[upd\] 13 | 14 | 百度了一下发现C题怎么有公式啊.. 15 | 16 | 可怜好像打了个表找了个规律然后变成分形然后瞎逼递归做了一年.. 17 | 18 | 有点僵硬.. 19 | 20 | \[upd\] 21 | 22 | 大连青岛傻傻分不清楚..cajgeg 23 | -------------------------------------------------------------------------------- /red-queen/20161212.page.backup: -------------------------------------------------------------------------------- 1 | \section{沈阳区域赛} 2 | \subsection{可怜的总结} 3 | 全场梦游，菜的一比。 4 | 5 | F题傻逼题 WA 6 | 了两发有点智障，以后字符串题应该别无脑后缀数组后缀自动机，多想想hash，性价比还是挺高的。 7 | 8 | 场上换题的情况有点多..手速和代码能力硬伤啊.. 9 | 10 | 最近训练的太少了..感觉现阶段与其三人三机练合作还不如各自训练把个人实力提上去。 11 | 12 | 惨..再不练 WF 要刷新最大排名了啊.. 13 | 14 | \subsection{西老师的总结} 15 | 那天不知道为什么特别累。。。感觉也不是没睡够。。。 16 | 17 | 背锅。。。签到题都能因为没看清题目WA一次。。。B题开场就会做但是不知道怎么就是写不出来，最后还强行让吉老师来重码才过。。。E很显然可以卡精度，但看DDF是1A就直接交了double，然后还交了各种eps，浪费了很多时间。。。蠢成狗了。。。 18 | 19 | 回来补了I题，虽然写了1h，但是1A了。。。 20 | -------------------------------------------------------------------------------- /red-queen/20170228.page.backup: -------------------------------------------------------------------------------- 1 | \section{XVI Open Cup named after E.V. Pankratiev. GP of SP} 2 | 读题小能手西老师身败名裂之日\[鼓掌\]。 3 | 4 | 开场快速过了AEHIJ，J题三子棋看了半天才发现另外一方三个连一起不算赢。之后西老师告诉了我假的D题，我开始想假题，涛老师开始写L。想了一半发现很多队伍过了，感觉事情没有那么简单，重新看了一下题果然做了假题，然后就会做了，之后和涛老师轮流上机过了D和L。K是个傻逼题，涛老师秒了G。 5 | 6 | 之后西老师开始写F，同时告诉了我假的C题，我又开始想假题，涛老师过了G之后来陪我一起想假题，想了半天涛老师决定看一下题面，重新看了一下果然做了假题。正常的题可做多了，想了一会儿感觉可以拆分数爆艹。然后西老师被卡常数了我开始写C，过了会儿两题都过了。 7 | 8 | 还剩下B题码农提，大家都不想写，涛老师自告奋勇开始码，然后涛老师上机码shit题西老师练计算几何我在旁边看小漫画，然后就gg了。 9 | -------------------------------------------------------------------------------- /red-queen/20170303.page: -------------------------------------------------------------------------------- 1 | 2014-2015 Petrozavodsk Winter Training Camp, Contest.58 (Makoto rng\_58 Soejima contest) 2 | ======================================================================================== 3 | 4 | 惨 5 | -------------------------------------------------------------------------------- /red-queen/20170303.page.backup: -------------------------------------------------------------------------------- 1 | \section{2014-2015 Petrozavodsk Winter Training Camp, Contest.58 (Makoto rng_58 Soejima contest)} 2 | 惨 3 | -------------------------------------------------------------------------------- /resuscitated-hope/2016-2017 CT S03E05 Codeforces Trainings Season 3 Episode 5.page: -------------------------------------------------------------------------------- 1 | Summary 2 | ======= 3 | 4 | **zjc:** 5 | 吃屎吃了一一晚上，躺在地上，被水淹没，不知所措，听着机下的队友不断嘴巴题，自己却下不来机，本来可以在有限时间内过更多题的（？）。上题前应该想清楚，E题没有想清楚map对char\*的使用方法，没有把题目读懂就上题导致了占用大量机时，K题应该跟队友好好交流一下再上，托大直接搞弄得自己蛮狼狈的，在jyb在F题上疯狂吃屎的时候应该上去帮一下。总结一下，上题前多做做准备，~~唱唱歌跳跳舞做做大保健~~。训练赛打不出Onsite的紧张感怎么办呢，这个问题思考一下？ 6 | -------------------------------------------------------------------------------- /resuscitated-hope/2017 ACM/ICPC Asia Regional Beijing Online.page: -------------------------------------------------------------------------------- 1 | Summary 2 | ------- 3 | 4 | 本场钦定背锅——zjc 5 | 6 | ### Replay 7 | 8 | 上来日常分开看题，读了一会后hzh和jyb发现A是个傻逼题，然后jyb慢吞吞地做掉了。zjc读了09不想写，又由jyb来写(背)题(锅)，写错两发大小符号后，勉强过了09。途中hzh发现了07的规律，顺利A了。然后zjc和jyb讨论05，hzh过了03。zjc信誓旦旦告诉jyb除了三点共线就是凸四边形了，jyb就姑且相信了，然后jyb就陷入了无尽的debug。最后幸好发现了没考虑到的情况。hzh手写高精度搞掉02后，zjc一个人默默地奋战10，jyb帮忙debug了一会后，hzh又去帮忙，最终GG。 9 | 10 | **jyb** 11 | 开始读了05觉得很傻逼，大家劝我先别写，然后签了01，慢吞吞地签了09，最后又重新搞05，然后被zjc的“充分条件——凸四边形”先入为主，漏了情况。。时间浪费很多，提都没看完，捂脸 12 | -------------------------------------------------------------------------------- /resuscitated-hope/2017 ACM/ICPC Asia Regional Nanning Online.page: -------------------------------------------------------------------------------- 1 | Summary 2 | ------- 3 | 4 | Replay 5 | ------ 6 | 7 | 这套题竟然出到了 M？ 8 | 9 | 11 道阅读题，2 道几何题....三个人几乎是分开单挑... 10 | 11 | 中间 zjc 和 hzh 失乐智.. 还好 jyb hold 住了... 12 | 13 | 虽然题垃圾，也是第一次正式比赛 AK 了呀\~！ 14 | -------------------------------------------------------------------------------- /resuscitated-hope/Asia Hong Kong Regional Contest 2016.page: -------------------------------------------------------------------------------- 1 | Replay 2 | ------ 3 | 4 | 开场切成了只有现场的榜。Hzh看了前面第一道时限1s的c，说感觉可做，jyb读EFG,zjc读KJIH（读一道看一次榜，发现榜并没有变化\~）。HZH写C的时候，jyb和zjc交换了一波题意，发现没什么好想好写的题。hzh顺利1A 5 | C后，大家一起讨论了一下G、J，然后说了一个J的假算法，而大家都没发现。zjc用假算法wa了两发后，发现了问题。hzh上K，jyb想了想G后放弃，跟榜看了B。hzh写完K后，jyb上B，hzh和zjc讨论出了J的正确姿势。jyb过B后，hzh重新上J，zjc读了A后发现是个傻X题，和jyb商量后得到了做法。接着J 6 | A都跪了，两边疯狂debug，jyb看了看D没想出来，然后去帮着看J 7 | A，最后20min，hzh先过了J，然后jyb发现了zjc的bug，还剩5min的时候A掉。。最后5题滚粗，J贡献了很多很多罚时，GG。 8 | 9 | Summary 10 | ------- 11 | -------------------------------------------------------------------------------- /resuscitated-hope/ConnorZhong/Codeforces Round 384.page: -------------------------------------------------------------------------------- 1 | A. Vladik and flights 2 | ===================== 3 | 4 | B. Chloe and the sequence 5 | ========================= 6 | 7 | C. Vladik and fractions 8 | ======================= 9 | 10 | D. Chloe and pleasant prizes 11 | ============================ 12 | 13 | E. Vladik and cards 14 | =================== 15 | 16 | 这个题还有可以做到1e6的做法 17 | -------------------------------------------------------------------------------- /resuscitated-hope/Nontraining day.page: -------------------------------------------------------------------------------- 1 | 8-16 2 | ==== 3 | 4 | zjc 5 | --- 6 | 7 | 多校 \#7 1009 8 | 9 | 学习二次剩余，整理二次剩余模板 10 | 11 | 学习叉老师完全单调性课件（和.avi)，整理模板 12 | 13 | jyb 14 | --- 15 | 16 | 网络流练习 17 | 18 | 总结一下做过的[FFT](Cabinfever/FFT小结) 19 | 20 | hzh 21 | --- 22 | 23 | 补题多校1006、1007、1009 24 | 25 | 8-11 26 | ==== 27 | 28 | zjc 29 | --- 30 | 31 | 多校 \#6 1004 1009 1012 32 | 33 | 数位 dp 练习。 34 | 35 | hzh 36 | --- 37 | 38 | 多校 \#6 1001 1007 39 | 40 | jyb 41 | --- 42 | 43 | 多校 \#6 1002 1012 44 | 45 | dp 练习。 46 | -------------------------------------------------------------------------------- /resuscitated-hope/OpenCupXVIII Grand Prix of Eurasia.page: -------------------------------------------------------------------------------- 1 | Replay 2 | ------ 3 | 4 | 1, 2 签到题。hzh 上去莽交互 8，jyb 也过了 10， zjc 读了一辈子 5 | 12，还读了假题。 hzh 过了 4。接着 zjc 听 hzh 讲了 11 一起哈啤，hzh 6 | 上去写了很久后又读了假题..赛后 3 min 后过.。zjc 和 jyb 最后嘴巴了 7 | 5，没时间尝试了。 8 | 9 | **zjc** 国庆训练 Day 1. 这一场题面好长啊... 状态不太好... 最近 hzh 10 | 输出好高啊... 11 | -------------------------------------------------------------------------------- /resuscitated-hope/“Citadel杯“ 2017 清华大学学生程序设计竞赛暨高校邀请赛.page: -------------------------------------------------------------------------------- 1 | Summary 2 | ======= 3 | 4 | **比赛记录：** 很快的定位到了 C 题和彩蛋 M 题，之后讨论了一下一个区间第 5 | K 大带走了 H 题。然后就是 jyb 的四小时大模拟。有希望过 D 6 | 但是不会证明没敢上。按照敝队网络流能力 A 7 | 目前够呛啊。然后就是看着昂老师往前飙啊～好劲啊～ 8 | 9 | **ConnorZhong：** zjc这个彩笔全程就是划水。多校前好好补一补网络流啊！ 10 | -------------------------------------------------------------------------------- /saltyfish/Hard_Cuts.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/saltyfish/Hard_Cuts.png -------------------------------------------------------------------------------- /saltyfish/ICPCCamp 2017 Day 3: THU DDF Contest.page: -------------------------------------------------------------------------------- 1 | A Random Numbers 2 | ================ 3 | 4 | B Defense Tower 5 | =============== 6 | 7 | C Eulerian Orientation 8 | ====================== 9 | 10 | D Tube Master II 11 | ================ 12 | 13 | E Palindrome 14 | ============ 15 | 16 | F Median on Binary Tree 17 | ======================= 18 | 19 | G Card Shuffling 20 | ================ 21 | 22 | H Independent Events 23 | ==================== 24 | 25 | I Territory Game 26 | ================ 27 | -------------------------------------------------------------------------------- /saltyfish/ICPCCamp 2017 Day 5 Yandex Cup 2017.page: -------------------------------------------------------------------------------- 1 | A Bicycle Race 2 | ============== 3 | 4 | B Those Russian Hackers 5 | ======================= 6 | 7 | C Cyclic Shift 8 | ============== 9 | 10 | D Frogs 11 | ======= 12 | 13 | E HDRF 14 | ====== 15 | 16 | F Counting Orders 17 | ================= 18 | 19 | G UFO Rectangles 20 | ================ 21 | 22 | H Test For An Intern 23 | ==================== 24 | 25 | I Coprime Queries 26 | ================= 27 | 28 | J 2084 29 | ====== 30 | -------------------------------------------------------------------------------- /saltyfish/girlish_number.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/saltyfish/girlish_number.jpg -------------------------------------------------------------------------------- /saltyfish/human2016_K.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/saltyfish/human2016_K.png -------------------------------------------------------------------------------- /saltyfish/hunan2016_K2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/saltyfish/hunan2016_K2.png -------------------------------------------------------------------------------- /saltyfish/srm_699_hard.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/saltyfish/srm_699_hard.png -------------------------------------------------------------------------------- /seven-underscores/CCPC长春赛 & 东北四省赛.page: -------------------------------------------------------------------------------- 1 | [Backpack on Tree](http://acm.hdu.edu.cn/showproblem.php?pid=5932) 2 | 3 | ~~[GCD](http://acm.hdu.edu.cn/showproblem.php?pid=5930)~~ done 4 | 5 | ~~[Birthday Gift](http://acm.hdu.edu.cn/showproblem.php?pid=5928)~~ done 6 | 7 | [Rotate String](http://acm.hdu.edu.cn/showproblem.php?pid=5913) 8 | 9 | [Hanzo vs. Genji](http://acm.hdu.edu.cn/showproblem.php?pid=5911) 10 | -------------------------------------------------------------------------------- /seven-underscores/Daily.page: -------------------------------------------------------------------------------- 1 | `Date` `Doing` 2 | -------------- ------------------------------- 3 | `2017-01-15` `AtCoder Regular Contest 067` 4 | `2016-12---` [`2016-12`]() 5 | `2016-11---` [`2016-11`]() 6 | 7 | [`back`](Y_UME) 8 | -------------------------------------------------------------------------------- /seven-underscores/ICPC 2014 Shanghai.page: -------------------------------------------------------------------------------- 1 | 曹大地总结 2 | ========== 3 | 4 | 不会树分治 5 | -------------------------------------------------------------------------------- /seven-underscores/MIPT Kent Nikado Contest 1.page: -------------------------------------------------------------------------------- 1 | I 2 | - 3 | 4 | 钩子公式 (不会啊 5 | 6 | F 7 | - 8 | 9 | 每个$2*2$的格子会有两个不等号，把格子看作一些点按照奇偶性建图，相邻的$2*2$会有一条$1*2$的矩形，可以让不等号流过去。 10 | 边上的不等号直接流S和T。如果S和T均满流，则存在解。充分性证明可以按照不等号构造解的角度考虑。 11 | -------------------------------------------------------------------------------- /seven-underscores/New Skills.page: -------------------------------------------------------------------------------- 1 | `LCT` `三角剖分` `生成函数` ~~`Dominator Tree`~~ ~~`后缀树`~~ 2 | [`斜率优化`](http://vjudge.net/contest/125126#overview) 3 | [`连通分量`](http://acm.hust.edu.cn/vjudge/contest/127252#overview) 4 | [`网络流`](http://acm.hust.edu.cn/vjudge/contest/129950#overview) 5 | 6 | `具体数学` `11/603` `挂掉中` 7 | 8 | [`back`](Y_UME) 9 | -------------------------------------------------------------------------------- /seven-underscores/World Final 2013.page: -------------------------------------------------------------------------------- 1 | 曹大地 2 | ------ 3 | 4 | 不会读题，不会英语 5 | 6 | E 7 | - 8 | 9 | 暴力枚举进入第一个寄存器的数据，处理出每个点前一个点，状态压缩dp求出最小花费。 10 | 11 | K 12 | - 13 | 14 | 7维dp,记录每个的起始位置，目前函数，以及字符串长度。 15 | -------------------------------------------------------------------------------- /seven-underscores/World Final 2014.page: -------------------------------------------------------------------------------- 1 | 曹大地 2 | ====== 3 | 4 | 我好菜啊 5 | -------------------------------------------------------------------------------- /seven-underscores/World Final 2016.page: -------------------------------------------------------------------------------- 1 | 好像有7题魔咒啊。 2 | -------------------------------------------------------------------------------- /seven-underscores/XD.page: -------------------------------------------------------------------------------- 1 | **[2016 USP Try-outs](2016 USP Try-outs)** 2 | 3 | **[2015 USP Try-outs](2015 USP Try-outs)** 4 | -------------------------------------------------------------------------------- /seven-underscores/Y_UME.page: -------------------------------------------------------------------------------- 1 | > > 始めましょう 2 | 3 | > > Daily[\~](Daily) 4 | 5 | > > Codeforces Dp[\~](Codeforces Dp) 6 | 7 | > > UOJ Progress[\~](UOJ Progress) 8 | 9 | > > New Skills[\~](New Skills) 10 | 11 | > > Contests[\~](Contests) 12 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 342 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：ng变成z，排序完，在把z变成ng 2 | 3 | 500：$dp_{l,\ r}$表示组成$(l, r)$的答案，然后dp过程中枚举用那个串去匹配当前区间，那么对于%s的位置可能匹配掉一段区间，在套一层DP，$dp_{l,\ r}$表示匹配到i位置，串用到j位置的方案数。 4 | 5 | 1000：$dp_{i,\ j}$表示走了长度$i$，位置在$j$的方案数，那么由于转移只会在5步内转移，5步内状态一共就$5n$种，可以把状态之间的转移用矩阵快速幂加速。 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 379 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：枚举价格，维护最小值即可 2 | 3 | 500：先进行一次dfs，每次按照块最大的开始放，放完分为3部分继续dfs下去，处理出每种最大块需要几个，然后在暴力判断一下块能否构成 4 | 5 | 1000：问题的本质就是求解行列式 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 380 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：4步以内暴力，如果h >= 3 && w >= 2 | 5，就可以先走两步，然后上下来回走w - 5步 3 | 4 | 500：二分答案，每次判定的时候，判断一下鬼排是否足够，以及每次鬼牌是否有足够的牌去和它构成方案 5 | 6 | 1000：留坑 7 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 381 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：倒着做一次期望DP 2 | 3 | 500：分类讨论，n <= 4 | m时候，每次肯定尽量翻倍直到n不小于m，然后如果序列中不合法的位置个数不能一步删光，或者不能一步替换，答案就多+2，否则+1，n 5 | > 6 | m的时候，同样的n不断减半直到m，判断答案是否要+1，+2，此外还有一种特殊情况，就是n 7 | > m的时候，可以先增加一步，把对应m的数字都匹配上，在进行删除 8 | 9 | 1000：把正方形按照长度再按照名字排序，先dp\[i\]表示i往后最多能匹配几个，然后去构造方案，构造的过程中，枚举一个位置如果满足后面能补到k个，并且能够被之前的位置包含在里面，这个位置就是可以选的，不断贪心直到选了k个数字 10 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 382 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：枚举每个位置做一次bfs，就能求出到所有骑士的最短步数，维护最小值即可 2 | 3 | 500：枚举间隔，然后把所有这个间隔的循环抠出来，每个循环能选一半，维护最大值即可 4 | 5 | 1000：考虑容斥，用满足1 + 满足2 - 6 | 同时满足1，2，前两个做个背包很容易计算，同时满足的情况，推个式子会发现前半部分奇数等于后半部分偶数和，前半部分偶数等于后半部分奇数和，因此可以考虑在做一半的背包，枚举一下个数就能统计方案了 7 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 383 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：枚举长度，维护最小值即可 2 | 3 | 500：状压dp，dp\[i\]\[j\]表示到第i行状态为j的最小值，然后每次转移，如果上一行某个位置为0且这个位置就必须放1，表示竖着填满，因此不能有障碍。 4 | 5 | 1000：模拟搞出所有置换的循环节，然后求个公倍数即可 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 384 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：看不懂留坑 2 | 3 | 500：由于概率是10%-100%，所以至少平均十步杀一人，所以做1000步杀不光的概率趋近于0，进行状压dp，$dp_{i,j,k}$表示最后i步，人剩余状态为j，扔球人为k，进行转移即可。 4 | 5 | 1000：博弈，如果有棋子一开始就能走到(0,0)，那么先手就赢了，如果没有这样的棋子，那么这些点就是不能走的点，走到就输了，所以可以考虑做sg函数，把这些点标记成不能走的点，用sg判定胜负 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 386 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：看不懂留坑 2 | 3 | 500：状压dp，每次枚举3个点构成的三角形进行转移 4 | 5 | 1000：可以估计最短路的条数不会超过1W条，所以可以枚举所有最短路，每次进行dp，$dp_{i,j,2}$表示走了i步，走到j结点，是否被守卫挡过了的方案数，求完就可以得到被挡住的概率，维护最小值即可 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 387 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：枚举小丑盒子，然后枚举剩下的盒子，如果颜色大于2的话，这个盒子就必须移动，如果颜色等于1，这个颜色没有另一个盒子占掉，答案不加，如果被占掉，答案加1。 2 | 3 | 500：按区间按右再按左优先级排序，考虑dp,dp\[i\]表示到i个区间之前全覆盖了的方案数，对于每个区间，往前找到第一个不被这个区间覆盖的区间，然后往后扫过去更新直到第一个覆盖不了的区间的dp值。 4 | 5 | 1000：枚举i % (n \* 6 | m)的值，对于每个i值而言，后面的一段相当于一个等比数列求和，直接计算即可 7 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 388 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：筛一下质数，记录最大质因子即可 2 | 3 | 500：先预处理出所有覆盖集，然后状压dp一下 4 | 5 | 1000：步数1直接输出，步数2的话就从小到大枚举然后把距离为1的标记掉，步数为3，同样标记，只是判断能否取的时候，要距离为1的都没被标记过才能选，由于数字最大能到2\^28，可以用个bitset优化空间 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 389 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：直接按照题意计算即可 2 | 3 | 500：没看懂，留坑 4 | 5 | 1000：可以两行两行进行考虑，处理出两行的所有状态sg值，就可以直接判定了 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 390 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：模数不大，直接不断做到余数为0或者重复位置 2 | 3 | 500：二分时间，然后处理出$ed_{i,j}$表示每个工人从i开始最多能刷到j的位置，然后状压dp,$dp_s$表示状态s的工人最多能刷多少墙，二分判断答案是否不小于m即可 4 | 5 | 1000：双向搜索，从起点搜8步把状态丢进set，从终点逆操作搜8步，在set里面查找判断是否有解 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 391 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：两两枚举判断，判断的时候对字符做个映射即可 2 | 3 | 500：如果置换循环个数不大于M就是可以得到所有钥匙，令$dp_{i,j}$表示第i个数字，循环个数为j的方案，转移为$dp_{i,j} = dp_{i-1,j-1} + dp_{i-1,j} * (i-1)$，然后不大于M的方案除总方案即可 4 | 5 | 1000：如果能分解质因数，那么就是从后往前贪心，遇到一个数字它的某个质因数个数是最多，就把这个质因数放到这个位置，但是由于数字很大，不能直接分解，可以先处理掉100W以内的质因数，然后剩下质因数在把表示成p\^2的处理掉，那么就剩下pq和p两种情况的质因数，由于数字不多，可以从后往前贪心的时候，枚举前面的数字，取一下gcd，就可以知道前面数字的哪个质因数应该被消除掉。 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 392 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：枚举串长，把第一个串和第二个串不够的补\*，然后去匹配一下判断 2 | 3 | 500：每个点只连向一个点，所以对于一个联通块，肯定是一个DAG套个环，那么可以先把环缩掉，然后就是拓扑序上做个dp即可 4 | 5 | 1000：枚举和原数字开头匹配了几位，下一个数字的大小，需要哪一些数字，那么就可以统计出每一种需要的数字还缺几个，贪心的往后填即可 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 393 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：按照题意模拟即可 2 | 3 | 500：所有亮的位置肯定是Y，那么对于每个亮灯的表示，如果存在一种数字可能可以表示出来，如果它要表示这些数字，那么多余的那些亮灯位置必然要是N，所以在所有可以表示的数字中的交集位置，必然是N，剩下的位置都是？ 4 | 5 | 1000：把所有机场和航班，航班和航班之间的第一次相交和第一次不相交时间处理出来，这些时间作为关键点，判断每个关键时间点是否都是联通即可 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 394 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：枚举下界和上界判断即可 2 | 3 | 500：把所有斜率一样的直线处理出来，相同的斜率的直线，去他们的中心直线，判断是否对称，如果不对称就是无解，否则就取中心直线，如果所有的中心直线不交在一个点，就是无解，如果只有一种斜率的直线，并且中心对称答案就是无穷 4 | 5 | 1000：树形DP，$dp_{i,j}$表示在i结点，以i出发最长路径为j的概率，然后树形dp合并的时候，枚举新的边的权值转移即可 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 395 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：分类讨论，一种是完全直走，一种是先斜走，某一轴到了之后直走，一种是完全斜走，这种注意最后可能需要多一步直走 2 | 3 | 500：人从大到小进行DP，$dp_{i,j,k}$表示第i大的人，左边能看到j个，右边能看到k个，如果把当前人放在最左边，左边能看到就+1，放在最右边，右边能看到就+1，其它放在中间的情况左右不变。 4 | 5 | 1000：$dp_{i,2}$，表示到第i个问题，最后一个问题是答对还是答错，一种是正常从$i - 1$转移过来，一种是$i - m$，并且最后答错转移过来 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 396 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：枚举长度，然后判断的时候，把要相同的每个位置，枚举放哪种字符，维护最小值即可 2 | 3 | 500：暴力，每次处理出每个空位上下左右的‘\#’的位置，然后如果一个空位上下或者左右的‘\#’属于一个连通块，那么之间的空位都要变成‘\#’，暴力做到不能变化为止 4 | 5 | 1000：把权值排序，从大到小贪心插入线性基，能插入的就是能保留的石头，最后整个线性基是没有一个子集异或和为0的 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 397 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：最多$8!$种状态，直接bfs即可 2 | 3 | 500：求出伯努利数，就可以$O(k)$计算，模板题 4 | 5 | 1000：半径越大越可能相交，那么每次相交情况改变最多发生n \* 6 | m次，把这些关键半径处理出来，然后枚举半径，计算最大独立集就可以求出最大面积 7 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 398 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：暴力枚举即可 2 | 3 | 500：$dp_{i, j, k, l}$表示在位置$(i, j)$，最后一次访问的为k，访问个数为l的方案数，转移就往右下两个方向转移即可 4 | 5 | 1000：所有点的总度数为$sum / (n - 2)$，那么对于每个置换循环可以列出方程$x1 + x2 = s1, ..., xn + x1 == sn$，那么由于个数是奇数个，所以方程可以相邻两项相消，求出$x1$，进而求出每项的值，即每个点的度数，得到每个点的度数就转换为一个经典问题，给定每个点的度数判断能否构成一个无向图，贪心即可 6 | -------------------------------------------------------------------------------- /seven-underscores/caodadi/SRM 399 DIV1.page: -------------------------------------------------------------------------------- 1 | 250：暴力枚举剪枝即可 2 | 3 | 500：3个数的二进制位个数处理出来，$dp_{i, an, bn, cn, f}$，表示到第i为，a用了an位，b用了bn位，c用了cn位，f表示是否进位，状态表示最小值。转移就枚举当前位的两个数字放0还是1即可 4 | 5 | 1000：网络流，对于每个男孩和女孩拆点，拆成3排点，一排表示派对数容量x，一排表示喜欢容量无穷，一排表示不喜欢容量k，枚举派对数同时对第一排点进行扩容直到最大流小于派对数\*人数 6 | -------------------------------------------------------------------------------- /sjtu-2018/18-07-19 NWERC 16.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [Codeforces](http://codeforces.com/gym/101170) 5 | 6 | D. Driving in Optimistan 7 | ======================== 8 | 9 | **G. Gotta Nudge 'Em All** 10 | ========================== 11 | -------------------------------------------------------------------------------- /sjtu-2018/18-07-23 Phuket 2015.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [UVALive](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5321) 5 | 6 | **J. Sunlight on a Tree** 7 | ========================= 8 | -------------------------------------------------------------------------------- /sjtu-2018/18-07-24 Tokyo 2012.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [Aizu](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1334) 5 | 6 | **J. Cubic Colonies** 7 | ===================== 8 | -------------------------------------------------------------------------------- /sjtu-2018/18-07-27 JAG Practice Contest 2015.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [Aizu 5 | 2728-2737](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2728) 6 | 7 | 解体原因 8 | ======== 9 | 10 | 前期签到梦游 11 | 12 | G题不会做 13 | 14 | J题出假算法 15 | 16 | G. Cube Dividing 17 | ================ 18 | 19 | I. Shortest Bridge 20 | ================== 21 | 22 | J. Longest Shortest Path 23 | ======================== 24 | -------------------------------------------------------------------------------- /sjtu-2018/18-07-28 2016-2017 ACM-ICPC, Central Europe Regional Contest (CERC 16).page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [Codeforces](http://codeforces.com/gym/101173) 5 | 6 | 解体原因 7 | ======== 8 | 9 | 算法复杂度不够优秀，疯狂被卡常 10 | 11 | E题不会做 12 | 13 | B. Bipartite Blanket 14 | ==================== 15 | 16 | D. Dancing Disks 17 | ================ 18 | 19 | E. Easy Equation 20 | ================ 21 | 22 | G. Geohash Grid 23 | =============== 24 | 25 | I. Invisible Integers 26 | ===================== 27 | -------------------------------------------------------------------------------- /sjtu-2018/18-07-29 Changsha 2013.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [HDU 4791-4801](http://acm.hdu.edu.cn/showproblem.php?pid=4791) 5 | 6 | 罚时过大原因 7 | ============ 8 | 9 | A题垃圾OJ卡cin 10 | 11 | K题转魔方只转了纸带 12 | 13 | B. Bob's new toy 14 | ================ 15 | 16 | 是个错题，选择放弃 17 | 18 | E. Easy Problem Once More 19 | ========================= 20 | 21 | F. Winter's Coming 22 | ================== 23 | -------------------------------------------------------------------------------- /sjtu-2018/18-07-31 2015 German Collegiate Programming Contest.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [Codeforces](http://codeforces.com/gym/100753) 5 | 6 | Congratulations! 7 | ================ 8 | 9 | AK 10 | 11 | M. Sums 12 | ======= 13 | -------------------------------------------------------------------------------- /sjtu-2018/18-08-02 ECNA2013.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [Codeforces](http://codeforces.com/gym/100291) 5 | 6 | G. Tree Lighting 7 | ================ 8 | -------------------------------------------------------------------------------- /sjtu-2018/18-08-04 Dalian 2016.page: -------------------------------------------------------------------------------- 1 | Congratulations! 2 | ================ 3 | -------------------------------------------------------------------------------- /sjtu-2018/18-08-11 2017-2018 CTU Open Contest.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [Codeforces](http://codeforces.com/gym/101670) 5 | 6 | 解体原因 7 | ======== 8 | 9 | 使用了读到EOF还会接着读的劣质读入优化板子 10 | 11 | 使用了把longlong强转int作为hash函数的辣鸡unordered\_set 12 | 13 | **mxh傻逼** 14 | -------------------------------------------------------------------------------- /sjtu-2018/18-09-12 2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest.page: -------------------------------------------------------------------------------- 1 | Source 2 | ====== 3 | 4 | [Codeforces](http://codeforces.com/gym/100253) 5 | 6 | J. Contest, Another Contest and Train 7 | ===================================== 8 | -------------------------------------------------------------------------------- /sjtu-2018/2016 Multi-University Training Contest 10.page: -------------------------------------------------------------------------------- 1 | 2 | B(yzh) 3 | 4 | C\*(cc) 5 | 6 | G(lbn) AC 7 | -------------------------------------------------------------------------------- /sjtu-2018/2016-2017 ACM-ICPC, Central Europe Regional Contest (CERC 16).page: -------------------------------------------------------------------------------- 1 | 解体原因 2 | ======== 3 | 4 | 算法复杂度不够优秀，疯狂被卡常 5 | 6 | E题不会做 7 | 8 | B. Bipartite Blanket 9 | ==================== 10 | 11 | D. Dancing Disks 12 | ================ 13 | 14 | E. Easy Equation 15 | ================ 16 | 17 | G. Geohash Grid 18 | =============== 19 | 20 | I. Invisible Integers 21 | ===================== 22 | -------------------------------------------------------------------------------- /sjtu-2018/Dalian 2016.page: -------------------------------------------------------------------------------- 1 | 解体原因 2 | ======== 3 | 4 | 　队长睡觉，队员划水。。。 5 | -------------------------------------------------------------------------------- /sjtu-2018/Front Page.page: -------------------------------------------------------------------------------- 1 | SJTU ACM 2018 Teams 2 | =================== 3 | 4 | [Lagran]() 5 | 6 | [Manual/Intelligence](Manual%20Intelligence) 7 | 8 | [Mortal Reminder]() 9 | 10 | [NEW CODE!!](NEW%20CODE) 11 | 12 | [Platelet]() 13 | 14 | [Quasar]() 15 | 16 | [Skyrim]() 17 | 18 | [Talisman]() 19 | -------------------------------------------------------------------------------- /sjtu-2018/JAG Regional 2017.page: -------------------------------------------------------------------------------- 1 | 补题：　Ｄ　(cc) <- 不会做。。。\*J 2 | -------------------------------------------------------------------------------- /sjtu-2018/Phuket 2015.page: -------------------------------------------------------------------------------- 1 | Solve:9 Rank:6 2 | 3 | 补题任务：yzh(H) 4 | -------------------------------------------------------------------------------- /sjtu-2018/a.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /sjtu-2018/b.page: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /sjtu-2018/lbn187.page: -------------------------------------------------------------------------------- 1 | 坑：Opentrain1382K 2 | 3 | 不会的算法：消圈、块状链表、Top-Tree、生成函数、DP线性优化、仙人掌、表达式、PYTHON 4 | 5 | 不求甚解：最小树形图、K短路、带花树、tarjan、后缀结构、回文自动机、插头、筛、质因数分解、线性递推、指标、母函数、群、莫比乌斯、多项式、拉格朗日、类欧、线性规划 6 | 7 | (store) 8 | ======= 9 | 10 | GYM100920I 网络流好题 待做 11 | 12 | NWERC2010I Telephone Network Dinic 待做 13 | 14 | Hangzhou 2016(CCPC) J 筛 坑 15 | 16 | Ended on 2018.09.19 17 | -------------------------------------------------------------------------------- /sjtu-2018/奖励与罚款.page: -------------------------------------------------------------------------------- 1 | [奖励]() 2 | ======== 3 | 4 | [违纪罚款]() 5 | ============ 6 | 7 | [训练罚款]() 8 | ============ 9 | 10 | [奖励与罚款公示]() 11 | ================== 12 | -------------------------------------------------------------------------------- /sjtu-2018/比赛.page: -------------------------------------------------------------------------------- 1 | CCPC秦皇岛 2 | ========== 3 | 4 | Solve：7/10 Rank：2（杯） 5 | 6 | ICPC徐州 7 | ======== 8 | 9 | Solve：5/13 Rank：4（杯） 10 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/2011-2012 2012 ICPC Chengdu Onsite.page: -------------------------------------------------------------------------------- 1 | 总结：
2 | 1.跟榜，强队出来的题不能太执着，先尝试着开自己擅长的题目。
3 | 2.遇到不能解决的一部分问题的时候要早点询问一下队友，可能可以解决快一些。或者说遇到不会的题目的时候互相问一下，是不是XX？ 4 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/2011-2012 2013 ICPC Hangzhou Onsite.page: -------------------------------------------------------------------------------- 1 | replay
1.学习博弈dp的套路 2.题目都不会就开新题。 2 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/2012-2013 2013 ICPC Chengdu Onsite.page: -------------------------------------------------------------------------------- 1 | cyh: 卡签到题注意检查输入输出比如%% 2 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/2015-2016 2015 ICPC Shenyang Onsite.page: -------------------------------------------------------------------------------- 1 | replay
1.大家都过的题，试了很多种办法，想着换各种姿势暴力。
2 | 2.配合出现失误的时候，先不要责怪队友，先过题。
3 | 3.让队友实现一个功能的时候，要说好实现的接口，写的人不要改主体内容，如果觉得不对要说出来，商量一下。
4 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/2015-2016 2015 ICPC shanghai EC-Final.page: -------------------------------------------------------------------------------- 1 | replay:
2 | 1.hyq表达时，如果队友一直听不懂，尝试换一种方式来讲。队友坚持认为有不对的地方，时间允许的话应该停下来，一起把流程再走一遍。 3 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/2017-2018 2017 CCPC Qinhuangdao Onsite.page: -------------------------------------------------------------------------------- 1 | Replay
2 | 1.各种边界数据要想全面，特别是卡题wa了很多发的时候，这时候要换题。
3 | 2.一个题如果讨论不出有效的算法来，这时候应该问队友。加强交流。
4 | 3.除了签到题，剩下的题看完题3个人最好都知道题意，再决定谁去做。
5 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest.page: -------------------------------------------------------------------------------- 1 | 总结： 2 | 1.注意分析问题要彻底，防止走一些歪路，使得代码量变大，或者说做法变麻烦。
3 | 2.出数据的时候先检查下数据是否合法 4 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/cyh个人.page: -------------------------------------------------------------------------------- 1 | 增强切水题的速度和稳定性。 2 | 3 | 准备模板，做各方面专题。 4 | 5 | 准备线代。 6 | 7 | 准备dp。 8 | 9 | Todo List 10 | ========= 11 | 12 | - hdu 5939（单调队列优化dp） 13 | - cf851D【Done】 14 | - spoj cot3 15 | - hdu4609(fft)【Done】 16 | - hdu5965 (平行四边形) 17 | - hdu5072 (莫比乌斯反演) 18 | - hdu5080 (置换群) 19 | - hdu5017 (几何) 20 | - cf437 21 | - hiho1597
22 | 23 | Cautious 24 | ======== 25 | 26 | - unsigned long long 输出%llu 27 | 28 | -------------------------------------------------------------------------------- /so-hard-so-brilliant/wwh个人.page: -------------------------------------------------------------------------------- 1 | - 2017.9.8 Magical Bridges UVALive - 5988 最短路优化，思维 2 | - 2017.9.10 飞行员配对方案问题 二分图最大匹配 3 | - 2017.9.12 太空飞行计划问题 最大权闭合子图（输出解） 4 | - 2017.9.13 最小路径覆盖问题 二分图最大匹配 最小不相交路径覆盖 5 | - 2017.9.13 魔术球问题 最小不相交路径覆盖 6 | - 2017.9.13 圆桌问题 最大流 7 | - 2017.9.13 最长递增子序列问题 最大流，建模 8 | - 2017.9.14 试题库问题 最大流 9 | 10 | -------------------------------------------------------------------------------- /speak-study-stay-sing/2015EC-Final.page: -------------------------------------------------------------------------------- 1 | **tangjz's Solutions** 2 | ====================== 3 | 4 | [Solution](https://github.com/tangjz/acm-icpc/commit/1f288603ecec3a8adbffac73d113c4fcfe7df13b) 5 | -------------------------------------------------------------------------------- /speak-study-stay-sing/2017-2018 ACM-ICPC, NEERC, Moscow Subregional Contest.page: -------------------------------------------------------------------------------- 1 | Info 2 | ==== 3 | 4 | Date: 2017.11.12 5 | 6 | [Link](http://codeforces.com/gym/101611) 7 | 8 | Solutions 9 | ========= 10 | 11 | J Judging the Trick 12 | ------------------- 13 | 14 | upsolved by nike0good 15 | 16 | 考虑一条将矩形分成2部分，此时必然有一边的三角形面积和<矩形部分的面积。二分答案。 17 | -------------------------------------------------------------------------------- /speak-study-stay-sing/nike0good.page: -------------------------------------------------------------------------------- 1 | 近期补题： 2 | 3 | 题源 题号 题名 题解 4 | --------- ------ ---------------- ---------------------- 5 | HK 2016 A Colorful Graph 构造 6 | HK 2016 I Special Tour 构造 7 | HK 2016 C Peak Tower 运动规划，矩形面积并 8 | 9 | 10 | -------------------------------------------------------------------------------- /speak-study-stay-sing/zbh2047.page: -------------------------------------------------------------------------------- 1 | Some valueable upsolved problems are shown in the following chart: 2 | 3 | Problem Source Tags 4 | ------------------------ ------------------------- -------------------- 5 | Diversity and Variance CCPC Qinhuangdao 2017 K Prefix suffix; Set 6 | Highway Hassle BAPC 2014 H Dijkstra 7 | 8 | 9 | -------------------------------------------------------------------------------- /stay-real/zsc.page: -------------------------------------------------------------------------------- 1 | 记录下我的cf做题记录 按通过人数排序 从25页开始刷 2 | ================================================ 3 | 4 | 5.26 5 | 6 | 366E 对于每种颜色维护个x+y x-y的最大最小就好了 7 | 8 | 392B 考虑f\[n\]\[i\]\[j\] n个盘子从i移到j 就两种情况 转移一下就好了 9 | -------------------------------------------------------------------------------- /stay-real/分锅大会.page: -------------------------------------------------------------------------------- 1 | Roooooo 2 | ======= 3 | 4 | 2017/04/27 接下了博弈的锅 5 | 6 | Zsc 7 | === 8 | 9 | 2017/05/03 接下了插头DP的锅 10 | -------------------------------------------------------------------------------- /suibian/2014ACM/ICPC亚洲区广州站.page: -------------------------------------------------------------------------------- 1 | 2014ACM/ICPC亚洲区广州站 2 | ======================== 3 | 4 | 题解 5 | ==== 6 | 7 | The E-pang Palace 8 | ----------------- 9 | 10 | 水题啦，暴力判判判就好了 11 | 12 | Little Zu Chongzhi's Triangles 13 | ------------------------------ 14 | 15 | C(12,3)*C(9,3)*C(6,3)的复杂度去枚举就好了 16 | 17 | Song Jiang's rank list 18 | ---------------------- 19 | 20 | How Many Maos Does the Guanxi Worth 21 | ----------------------------------- 22 | -------------------------------------------------------------------------------- /suibian/2015beijingonline.page: -------------------------------------------------------------------------------- 1 | 题解 2 | ==== 3 | 4 | A 5 | - 6 | 7 | 暴力就好了，没什么好说的[代码](http://www.cnblogs.com/qscqesze/p/4824196.html) 8 | 9 | B 10 | - 11 | 12 | 暴力模拟 13 | 14 | H 15 | - 16 | 17 | 找规律题，注意不要写错二分 18 | [代码](http://www.cnblogs.com/qscqesze/p/4824212.html) 19 | 20 | G 21 | - 22 | 23 | bfs题，除了恶心一点以外，没有任何难度 24 | [代码](http://www.cnblogs.com/qscqesze/p/4824234.html) 25 | 26 | J 27 | - 28 | 29 | 开5\*sqrt(n)个bitset，然后每次都从最近的bitset转移过来，然后再随便交一下就好了[代码](http://www.cnblogs.com/qscqesze/p/4826769.html) 30 | -------------------------------------------------------------------------------- /suibian/single/qscqesze.page: -------------------------------------------------------------------------------- 1 | [2015年9月26日22:15:46 BestCoder Round \#57 2 | (div.1)](single/qscqesze/BestCoder Round) 3 | 4 | [2015年9月23日12:26:41 Codeforces Round \#321 (Div. 5 | 2)](single/qscqesze/Codeforces Round) 6 | -------------------------------------------------------------------------------- /suibian/single/qscqesze/BestCoder Round .page: -------------------------------------------------------------------------------- 1 | 题解 2 | ==== 3 | 4 | A Conturbatio 5 | ============= 6 | 7 | 线段树就好了[代码](http://www.cnblogs.com/qscqesze/p/4841393.html) 8 | 9 | B Desiderium 10 | ============ 11 | 12 | 简单dp [代码](http://www.cnblogs.com/qscqesze/p/4841401.html) 13 | -------------------------------------------------------------------------------- /tdl/2016-Sichuan-C.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/tdl/2016-Sichuan-C.png -------------------------------------------------------------------------------- /tdl/Constroy/.log.page: -------------------------------------------------------------------------------- 1 | This is happstack logfile 2 | ========================= 3 | -------------------------------------------------------------------------------- /tdl/Constroy/经验.page: -------------------------------------------------------------------------------- 1 | - 当需要合并数据结构时，通常有两种方案，线段树合并和平衡树合并。线段树合并的时间复杂度是 2 | O(nlogn)，而平衡树采用启发式合并的时间复杂度也是 O(nlogn)。\ 3 | 线段树合并的编码复杂度较低，通常运行也更快。但需要注意的是，线段树的空间复杂度是 4 | O(nlogn)，这比平衡树更大，在空间有限的情况下不宜使用，如 HDU5029。 5 | 6 | - 如果对 inf 进行加减，那么最好赋值为 0x3fffffff。而在 treap 7 | 等使用的随机数域中，应该使用 RAND\_MAX（通常为 8 | 0x7fffffff）。还需要注意数域不是 int 的情况。 9 | 10 | 11 | -------------------------------------------------------------------------------- /tdl/ProofOfD.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/tdl/ProofOfD.jpg -------------------------------------------------------------------------------- /tdl/Skywalkert/2012Tokyo-J.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/tdl/Skywalkert/2012Tokyo-J.png -------------------------------------------------------------------------------- /tdl/THU Campus 2016.page: -------------------------------------------------------------------------------- 1 | A. AI \[Constroy\] 2 | ================== 3 | 4 | B. Business Plan 5 | ================ 6 | 7 | C. Cosine \[Skywalkert\] 8 | ======================== 9 | 10 | D. Drill 11 | ======== 12 | 13 | E. Edit 14 | ======= 15 | 16 | F. Festival \[Constroy\] 17 | ======================== 18 | 19 | G. Go 20 | ===== 21 | 22 | H. Hang Out 23 | =========== 24 | 25 | I. Increase a Second 26 | ==================== 27 | 28 | J. Jewelry 29 | ========== 30 | -------------------------------------------------------------------------------- /tdl/XVI Open Cup Grand Prix of Southern Caucasus.page: -------------------------------------------------------------------------------- 1 | A. Business 2 | =========== 3 | 4 | B. Edit 5 | ======= 6 | 7 | C. Cellular Explosion 8 | ===================== 9 | 10 | D. Pocket Money \[Constroy\] 11 | ============================ 12 | 13 | E. Lighting 14 | =========== 15 | 16 | F. Toll Roads \[Constroy\] 17 | ========================== 18 | 19 | G. Boxes 20 | ======== 21 | 22 | H. Track Gauge 23 | ============== 24 | 25 | I. States 26 | ========= 27 | 28 | J. Dancing Course 29 | ================= 30 | -------------------------------------------------------------------------------- /tdl/braveTester/CF367.page: -------------------------------------------------------------------------------- 1 | A. Beru-taxi 2 | ============ 3 | 4 | B. Interesting drink 5 | ==================== 6 | 7 | C. Hard problem 8 | =============== 9 | 10 | D. Vasiliy's Multiset 11 | ===================== 12 | 13 | E. Working routine 14 | ================== 15 | -------------------------------------------------------------------------------- /tdl/braveTester/CF368.page: -------------------------------------------------------------------------------- 1 | A. Brain's Photos 2 | ================= 3 | 4 | B. Bakery 5 | ========= 6 | 7 | C. Pythagorean Triples 8 | ====================== 9 | 10 | D. Persistent Bookcase 11 | ====================== 12 | 13 | E. Garlands 14 | =========== 15 | -------------------------------------------------------------------------------- /tdl/braveTester/概率论.page: -------------------------------------------------------------------------------- 1 | 一些题目 2 | ======== 3 | 4 | 1. 第十一届北航程序设计竞赛预赛: 5 | [抽奖箱](https://biancheng.love/contest-ng/index.html#/29/problems) 6 | 2. BUAA Summer Practice 2016 \#3: [Random walks in 7 | Thailand](http://acm.hust.edu.cn/vjudge/contest/125007#problem/B) 8 | 3. 2016 Multi-University Training Contest 7: 9 | [Knights](http://acm.hdu.edu.cn/showproblem.php?pid=5819) 10 | 11 | 分析方法 12 | ======== 13 | 14 | 对称性 15 | ------ 16 | -------------------------------------------------------------------------------- /three-investigators/2009-2010 Summer Petrozavodsk Camp, Andrew Stankevich Contest 35, F Graph Factorization.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/three-investigators/2009-2010 Summer Petrozavodsk Camp, Andrew Stankevich Contest 35, F Graph Factorization.png -------------------------------------------------------------------------------- /three-investigators/2017.09.09 meeting.page: -------------------------------------------------------------------------------- 1 | 2017.09.09 ??? 队会议 2 | ===================== 3 | 4 | 默认赛区 5 | -------- 6 | 7 | 沈 + 青 + 秦 8 | 9 | 训练计划 10 | -------- 11 | 12 | ### 团队 13 | 14 | 网络赛 + 东欧 15 | 16 | ### 个人 17 | 18 | 黄：打比赛 (CF, TC, AGC)，以及补中期 TC 题 19 | 20 | 刘：练习 CF 比赛，打一补二，周期三天，给出链接 21 | 22 | 唐：带薪补题 23 | 24 | 补题计划 25 | -------- 26 | 27 | 黄：Matching in a Tree, AnShan contest 28 | 29 | 刘：图论 5 道，凸包面积并 30 | 31 | 唐：神题 + 恶心题，第 10 场多校 replay 32 | -------------------------------------------------------------------------------- /three-investigators/2018.03.31 meeting.page: -------------------------------------------------------------------------------- 1 | 主线 2 | ==== 3 | 4 | 翻以前 Training 5 | --------------- 6 | 7 | - 做到做过的题会做，减少再错概率 8 | - 同步更新 github 9 | - 找 bug 10 | - 找例题充实 topic 11 | - 找代码充实 template 12 | 13 | 造 final template 14 | ----------------- 15 | 16 | - 堆放 template 17 | - 选测试题 18 | - 测试 template 19 | 20 | 补技能 21 | ------ 22 | 23 | - 确定专题 24 | - ~~学习~~抢救…… 25 | - 死亡 26 | 27 | 支线 28 | ==== 29 | 30 | 更新 self page 31 | -------------- 32 | 33 | - cf tc 进度 34 | 35 | -------------------------------------------------------------------------------- /three-investigators/braveTester/Front Page.page: -------------------------------------------------------------------------------- 1 | CF 记录 2 | ======= 3 | 4 | [Codeforces Round 441]() **DONE** `pro:8/8` `sol:8/8` 5 | 6 | [Codeforces Round 440 and Technocup 2018 Elimination Round 2]() 7 | `pro:3/7` `sol:4/7` 8 | 9 | [Educational Codeforces Round 30]() `pro:2/6` `sol:3/6` 10 | 11 | [Codeforces Round 439]() **DONE** `pro:5/5` `sol:5/5` 12 | 13 | [Codeforces Round 438]() `pro:2/7` `sol:2/7` 14 | 15 | 杂项 16 | ==== 17 | 18 | [莫比乌斯反演]() 19 | -------------------------------------------------------------------------------- /three-investigators/chitanda/CF.page: -------------------------------------------------------------------------------- 1 | [Codeforces Round 290 (Div. 1)]() ABCDE 2 | 3 | [Codeforces Round 292 (Div. 1)]() ABCD 4 | -------------------------------------------------------------------------------- /three-investigators/chitanda/Front Page.page: -------------------------------------------------------------------------------- 1 | [TC]() 2 | 3 | [CF]() 4 | 5 | [delaunay三角剖分]() 6 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM652.page: -------------------------------------------------------------------------------- 1 | SRM652 Medium 2 | ------------- 3 | 4 | > $n$个点$m$条边,边有边权,一个人要从$0$号点走向$n-1$号点,另一个人最多能$k$次强行改变这个人走的路径,第一个人每次会选择使得自己将要走的距离最小的路径,另一个人将尽量使第一个人走不到,如果不能,尽量使他走的距离更长,问两人都足够聪明的情况下,第一个人能否走到$n-1$号点,如果能,最少需要走多少距离. 5 | 6 | 设$dp[i][j]$表示在$i$号点还剩$j$次机会第一个人需要走的距离. 7 | 考虑从小到大枚举$j$. 如果在$i$号点第二个人使用一次机会,那么直接转移. 8 | 如果第二个人不使用,发现由于存在环,不能够直接转移,而迭代显然是正确的,故使用堆优化dij. 9 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM656.page: -------------------------------------------------------------------------------- 1 | SRM656 Medium 2 | ------------- 3 | 4 | > 给出一个$N$和一个位置集合$pos$,问有多少个长为$N$的排列满足:对于每个位置$k(1\le k \lt n)$,当且仅当$k$属于$pos$集合时有$p(k)\lt p(k + 1)$,否则$p(k)\gt p(k + 1)$. 5 | 6 | 在$pos$集合中加入$0$和$N$,对$pos$集合中的值从小到大排序,设$dp[i]$表示排列的前$pos_i - 1$个数都满足条件. 7 | 注意到排列中从$pos_{i-1}+1$到$pos_i$的数都是递减的,假设不考虑$p(pos_{i-1})\lt p(pos_{i-1}+1)$这个条件,那么总共有$dp[i-1]\times C_{pos_i}^{pos_{i-1}}$种方案, 8 | 要减去不合法的,即从$pos_{i-2}+1$到$pos_i$都是递减的,即$dp[i-2]\times C_{pos_i}^{pos_{i-2}}$,这个时候又多减了,于是就可以容斥了. 9 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM658.page: -------------------------------------------------------------------------------- 1 | SRM658 Medium 2 | ------------- 3 | 4 | > $n(n\le 20)$只怪,每个怪不超过$60$血,你每次攻击可以选择三个怪,分别打$9,3,1$点血,血量小于等于$0$怪死亡.问最少需要多少次攻击. 5 | 6 | 首先答案不超过$100$,那么我们可以二分答案$m$,然后设个状态$dp[i][j][k]$表示前面$i$只怪用了$j$次$9$血攻击,$k$次$3$血攻击,需要最少多少次$1$血攻击,看上去$O(nm^4\log m)$,实际上可以优化掉一些.注意对一个怪三种攻击次数加起来要小于等于$m$. 7 | 8 | SRM658 Hard 9 | ----------- 10 | 11 | > 一个二分图,求一个大于等于$1$的匹配,使得对于每个被匹配的左端点,与它相连的所有右端点都被匹配了. 12 | 13 | 每次做一个最大匹配,把不满足条件的左端点都删了,直到满足条件. 14 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM659.page: -------------------------------------------------------------------------------- 1 | SRM659 Medium 2 | ------------- 3 | 4 | > $M(M\le 16)$个人吃$N(N\le 16)$天饭,每天坐座位的顺序不同,给他们安排吃饭有三种方法: 5 | > 6 | > - 给相邻的两个人一份double午餐 7 | > - 给一个人一份double午餐,他连续吃两天 8 | > - 给一个人一份单份午餐. 问有多少种方案. 9 | 10 | 考虑用二进制表示$M$个人是否在上一天被授予了double午餐,状态数$2^M$. 11 | 考虑转移,在这一天,可以枚举相邻的两个人给他们double午餐,然后枚举每个人给他们单份午餐. 12 | 复杂度 $O(NM\times 2^M)$,具体看代码. 13 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM675.page: -------------------------------------------------------------------------------- 1 | SRM675 Easy 2 | ----------- 3 | 4 | > 构造一棵不超过 500 个点的树，使得距离为 3 的无序点对数恰为 5 | > $s(s\le 10^4)$ 。 6 | 7 | 设一个根，然后它有 $x$ 个儿子，并且它们都各有一个儿子，第 $x$ 8 | 个儿子的儿子再连出去一条长为 $y$ 的链，那么此时距离为 3 的无序点对数为 9 | $x(x-1)+y$ 。 10 | 11 | SRM675 Medium 12 | ------------- 13 | 14 | > 根据 $x0,a,b$ 生成长为 $n(n\le 5\cdot 10^6)$ 的随机序列，有 15 | > $q(q\le 100)$ 个询问，每次询问序列中从小到大第 $query[i]$ 个数。 16 | 17 | 根据基数排序的方法，$O(nq)$ 就行了。 18 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM676.page: -------------------------------------------------------------------------------- 1 | SRM676 Easy 2 | ----------- 3 | 4 | > 水池容量为 $C$ ，有 $n$ 段连续时间段进水，每次持续时间 $t[i]$ 5 | > ，每单位时间进 $x[i]$ 的水，问一个最小的放水速度 $q$ 6 | > ，使得水池水不会溢出。 7 | 8 | 二分答案。 9 | 10 | SRM676 Medium 11 | ------------- 12 | 13 | > 一个四连通地图，有的地方是障碍，有的地方是出口，有的地方是空地，有的空地上有一个物体，并且每个物体有一个初始值 14 | > $k$ 15 | > 。两个人轮流操作，将一个物体移动一步（多个物体可以重叠），不能移动到障碍或者移出界，如果移动到出口该物体消失，否则该物体的值减 16 | > $1$ ，如果减到 $0$ 则消失，不能移动的人输。 17 | 18 | 暴力处理完前 $2500$ 步的 SG 函数，之后的 SG 值以 $2$ 为周期变化。 19 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM684.page: -------------------------------------------------------------------------------- 1 | SRM684 Easy 2 | ----------- 3 | 4 | > 给定一个集合 $a$ 和一个数 $k$ ，问能满足下列条件的最大的 $a$ 5 | > 的子集的大小：将子集中的数两两之间的绝对值加入一个新的集合 $b$ 6 | > ，对于任意两个 $b$ 中元素 $A,B$ ，都有 $A\le k\times B$ 成立。 7 | 8 | 设子集中两两之间绝对值的最大值为 $x$ ，最小值为 $y$ ，那么只需满足 9 | $x\le k\times y$ 10 | 即可。将所有数从小到大排序后，枚举子集中最小的数和最大的数，相当于固定了 11 | $x$ ，那么我们需要使得 $y$ 大于一个值，贪心的选取中间的数即可。 12 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM696.page: -------------------------------------------------------------------------------- 1 | SRM696 Easy 2 | ----------- 3 | 4 | > 给定 $50$ 个点之间的 $m(m\le 20)$ 5 | > 条边，你要依次给点染色，每次染色的花费是染完后两个端点都被染色的边的条数，问最小总花费。 6 | 7 | 倒着考虑，就相当于要依次删点，删掉一个点后和它相连的边都删掉，每次删点的花费是删之前图中还存在的边数。那么 8 | $f[S]$ 表示当前图中还存在 $S$ 9 | 集合中的边的最小花费，每次枚举一个还存在的边的端点删掉来转移。 10 | -------------------------------------------------------------------------------- /three-investigators/chitanda/SRM698.page: -------------------------------------------------------------------------------- 1 | SRM698 Easy 2 | ----------- 3 | 4 | > 给定字符串 $S$，求最小编辑距离使得 $S=T+T$。 5 | 6 | 枚举两个 $T$ 的分界线，然后 DP，复杂度 $O(n^3)$ 7 | 8 | SRM698 Medium 9 | ------------- 10 | 11 | > 平面上 $n$ 12 | > 个点，任意三个点不在同一条直线上，问有多少对不相交的点集（集合元素个数不小于 13 | > $3$），满足它们的凸包相交面积大于 $0$ 14 | 15 | 考虑计算凸包不相交的，那么它们必定能够被两个公切线分开，枚举这条公切线（即枚举两个点），然后看这条直线的两边各有多少点，复杂度 16 | $O(n^3)$ 17 | -------------------------------------------------------------------------------- /three-investigators/chitanda/TCO2016 R1A.page: -------------------------------------------------------------------------------- 1 | TCO2016 Round1A Hard 2 | -------------------- 3 | 4 | > 给一棵树,从根节点出发,每次可以走到其祖先中的一个没走过的点,或者其子树中的一个没走过的点,询问一个字典序最小的走完所有点的方案 5 | 6 | 如果忽略字典序最小,如何判断是否有解呢? 7 | 贪心的走,如果当前节点所在子树有没走过的点,那么尽量往下走,否则,走到离它最近的一个没走过的祖先,如果无法走完所有点,那么无解.这样贪心暴力跑的复杂度为$O(n^2)$ 8 | 而要求字典序最小的解,只需枚举每一步,然后从小到大枚举这一步走哪,判断这么走之后是否还有解就行. 9 | 那么总复杂度为$O(n^4)$ 10 | -------------------------------------------------------------------------------- /three-investigators/tips and tricks.page: -------------------------------------------------------------------------------- 1 | skywalkert's note 2 | 3 | - 手写 bitset 考虑清楚 shift 64 bits 的问题 4 | - suffix array 的数组大小均与串长相关，与字符集大小无关 5 | - typedef double DB; 能用 double 就不用 long double 6 | - 判断一个题要用边双还是点双的方法做，不是看这个图满足什么性质，而是限制在边上还是点上 7 | - 如果要 hash 不同长度的字符串，则字符串中不能有字符映射到 0 8 | - acos 时注意 -1.000000002 的问题 9 | - 注意检查整数（或浮点数）被零除 10 | - 目前写的并查集使用负数记录秩的**相反数**、使用非负数记录父节点，需要注意按秩合并时是谁合并给谁 11 | 12 | -------------------------------------------------------------------------------- /toofartooclose/2014-2015 Summer Petrozavodsk Camp, Andrew Stankevich Contest 46 (ASC 46).page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | D. 11 | == 12 | 13 | E. 14 | == 15 | 16 | zlc1114：这个E。。我想到写的有点慢，赛后 $1min$ 过题。。惨啊 17 | 18 | F. 19 | == 20 | 21 | G. 22 | == 23 | 24 | H. 25 | == 26 | 27 | I. 28 | == 29 | 30 | J. 31 | == 32 | 33 | Summary 34 | ======= 35 | 36 | zlc1114：$B$ 37 | 确实是我的问题，想到了思路算不对。我数学有点太差，以后可能要加强一些这方面的训练。 38 | -------------------------------------------------------------------------------- /toofartooclose/wjy/Front Page.page: -------------------------------------------------------------------------------- 1 | [个人每日做题记录]() 2 | -------------------------------------------------------------------------------- /twsf/2015 Multi-University Training Contest.page: -------------------------------------------------------------------------------- 1 | [2015 Multi-University Training Contest 1]() 2 | 3 | [2015 Multi-University Training Contest 2]() 4 | -------------------------------------------------------------------------------- /twsf/Codeforces Round 274.page: -------------------------------------------------------------------------------- 1 | A 2 | = 3 | 4 | 题解：按$ai$为第一关键字，$bi$为第二关键字从小到大排序。维护前面最优天数。贪心，若当前的$bi$大于等于最优天数则用$bi$。否则用$ai$。 5 | 6 | B 7 | = 8 | 9 | 题解：显然答案最多为$2$。检查一个长度是否可量，可对$ai(i>=2)$，检查是否由$ai-x$这个刻度。（用$lower_bound$即可）。如果$x$，$y$都可量输出$0$，有一个可量，答案为$1$，输出另一个值即可。如果都不可量，先将所有能量出$x$的刻度位置(即对所有$ai$, 10 | $ai-x$, 11 | $ai+x$)存在一个数组中。排序取重后，检查所有能量出$y$的刻度位置是否在这个数组中。如果在答案为$1$。否则为$2$。 12 | 13 | C 14 | = 15 | 16 | 题解：$f[i][j]$表示旅行了$i$次，当前在$j$楼的方案数。暴力转移是枚举转移到那层。发现转移是一段连续的区间。用前缀和优化即可。注意不能由自己转移到自己。如果转移区间包括自己，需要将自己减去。 17 | -------------------------------------------------------------------------------- /twsf/Codeforces Round 285.page: -------------------------------------------------------------------------------- 1 | A 2 | = 3 | 4 | 题解：森林必然存在叶子节点。每次选取叶子，它连向的点就是它的权值，连边，修改它链接点的权值。（用一个队列维护即可） 5 | 6 | B 7 | = 8 | 9 | 题解：将$Ord(p)$写出来发现是一个$(n - 1)!$进制的数，同时发现$(n - 1)!$进制的数一一对应一个排列p，于是只需将两个$(n - 1)!$进制的数相加，由于模$n!$所以又是一个$(n - 1)!$进制的数，于是还原成排列即可。中间需要用到数据结构查询当前比x小的有多少个，以及当前有x个比自己小的最小的数是多少。我使用的是线段树，赛后发现可以树状数组。树状数组的困难主要是第二个查询，可以二分，也看到了一种比较炫酷的做法，尝试理解了一下发现不是很好记忆与运用，但是线段树写起来还是非常方便。 10 | 11 | C 12 | = 13 | 14 | 题解：截去首位相同的部分，余下的字符串定义为s，则s的前缀或者后缀必须被可行区间覆盖。发现这个前缀的右端点满足单调性，可以二分。同理后缀也是，于是正着做一遍，倒着再做，统计答案即可。 15 | -------------------------------------------------------------------------------- /twsf/Google code jam.page: -------------------------------------------------------------------------------- 1 | 2015 2 | ==== 3 | 4 | Round 1B 5 | -------- 6 | 7 | ### A. Counter Culture 8 | 9 | 考虑每个数把它变成1，因为翻转并不会影响数位，所以必须先把这个数变成10\^k，再减一来减少位数。 10 | 11 | 然后考虑靠什么来变成10^k，暴力可以发现先把它的后一半数位变成00...001，然后翻转，再减少到10^k，这样是最优的。 12 | 13 | Round 2 14 | ------- 15 | 16 | ### B. Kiddie Pool 17 | 18 | 只需要知道这些水的融合的比例就行了，贪心地减少最热的/最凉的水的比例来调整温度。 19 | 20 | 一定要注意精度问题，能重算尽量重算，而不是维护某些值。 21 | -------------------------------------------------------------------------------- /twsf/logo.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/twsf/logo.jpg -------------------------------------------------------------------------------- /wizards/2012-2013 NEERC, Moscow Subregional Contest.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | D. 11 | == 12 | 13 | 感谢叉姐提供的题解\~ 14 | [link](https://post.icpc-camp.org/d/142-neerc-2012-moscow-subregional-d-darkwing-duck/5) 15 | 16 | E. 17 | == 18 | 19 | F. 20 | == 21 | 22 | G. 23 | == 24 | 25 | H. 26 | == 27 | 28 | I. 29 | == 30 | 31 | J. 32 | == 33 | 34 | K. 35 | == 36 | 37 | Summary 38 | ======= 39 | -------------------------------------------------------------------------------- /wizards/2013 Multi-University Training Contest 9.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | D. 11 | == 12 | 13 | E. 14 | == 15 | 16 | F. 17 | == 18 | 19 | G. 20 | == 21 | 22 | H. 23 | == 24 | 25 | I. 26 | == 27 | 28 | Summary 29 | ======= 30 | -------------------------------------------------------------------------------- /wizards/2013 多校第九场.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | D. 11 | == 12 | 13 | E. 14 | == 15 | 16 | F. 17 | == 18 | 19 | G. 20 | == 21 | 22 | H. 23 | == 24 | 25 | I. 26 | == 27 | 28 | Summary 29 | ======= 30 | -------------------------------------------------------------------------------- /wizards/2017 Russian Code Cup (RCC 17), 3rd qualification round.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | 求\[L,R\]中首位和末位相等的数的个数(1<=L<=R<=10\^18) 11 | 12 | D. 13 | == 14 | 15 | E. 16 | == 17 | -------------------------------------------------------------------------------- /wizards/2017 Yandex.Algorithm - Elimination Stage, Online Round 1.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | D. 11 | == 12 | 13 | E. 14 | == 15 | 16 | F. Measure Twice, Divide Once. 17 | ============================== 18 | 19 | 题意：给出一棵节点数不超过3e5的树，要求考虑树分治，求最少的分治层数。 20 | 21 | 感谢Miceren拯救智商。 22 | 23 | 考虑转化题意，对给定的树染色，要求任何一对相同颜色的节点，路径上都有一个颜色标号比他们大的节点把他们隔开。 24 | 25 | 考虑贪心，除了两个节点的树，叶子节点肯定都是最小标号的颜色，从底往上贪心，每次选取可用的标号最小的颜色，因为颜色只有log个，直接维护一个table，记录到当前处理的节点，有那些颜色还没有更大的颜色来隔断他，然后暴力即可。 26 | -------------------------------------------------------------------------------- /wizards/2017 Yandex.Algorithm - Elimination Stage, Online Round 2.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | D. 11 | == 12 | 13 | E. 14 | == 15 | 16 | F. 17 | == 18 | -------------------------------------------------------------------------------- /wizards/ECNA 2014.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | D. 11 | == 12 | 13 | E. 14 | == 15 | 16 | F. 17 | == 18 | 19 | G. 20 | == 21 | 22 | H. 23 | == 24 | 25 | I. 26 | == 27 | 28 | Summary. 29 | ======== 30 | 31 | **fyd** 32 | 33 | **cyx** 34 | 35 | **llx** 36 | -------------------------------------------------------------------------------- /wizards/ECNA 2015.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | D. 11 | == 12 | 13 | E. 14 | == 15 | 16 | F. 17 | == 18 | 19 | G. 20 | == 21 | 22 | H. 23 | == 24 | 25 | I. 26 | == 27 | 28 | Summary. 29 | ======== 30 | -------------------------------------------------------------------------------- /wizards/SJTU ACM 2017 线段树加训.page: -------------------------------------------------------------------------------- 1 | A. 2 | == 3 | 4 | B. 5 | == 6 | 7 | C. 8 | == 9 | 10 | 理性放弃…… 11 | -------------------------------------------------------------------------------- /wood-cube/Asia CHINA-Final 2016.page: -------------------------------------------------------------------------------- 1 | CCPC-Final 和 CHINA-Final 总结 \[TDJ\] 2 | -------------------------------------- 3 | 4 | 0. 封榜前罚时爆炸，封榜后没有出题 5 | 1. 出题方都是谷歌，水题都要写4个小时，剩下的时间都不够每个人思考剩下每道题 6 | 2. 关键题都是概率期望题，且都用到了某些只有TDJ知道的知识点 7 | 3. 一些小失误 8 | 9 | -------------------------------------------------------------------------------- /wood-cube/Asia Hong Kong Regional 2016.page: -------------------------------------------------------------------------------- 1 | F. Perfect k-ary Tree \[GX\] 2 | ---------------------------- 3 | 4 | DP,容斥求去掉一个选择后方案数或方案和的应用之一，类似上次的矩阵法。 5 | -------------------------------------------------------------------------------- /wood-cube/Asia Nanning Regional 2017.page: -------------------------------------------------------------------------------- 1 | 标准Doc题场… 2 | 3 | 最后一题在131分钟通过，然后两个人分别开B、C，另一个人想G…最后一道题都没过… 4 | 5 | 总结： 6 | 7 | - G是个裸模型，没见过大概确实是想不出来的… 8 | - C几何做法一直TLE…根本没往**复杂度更高**的线规想… 9 | - B题正常做法算复杂度会TLE，标程用了古怪的方法…不知道说什么… 10 | 11 | 祝：健康、快乐。 12 | -------------------------------------------------------------------------------- /wood-cube/Asia Xi'an Regional 2017 Online.page: -------------------------------------------------------------------------------- 1 | 数据范围错误、题意不清还不发Clarification的垃圾比赛… 2 | 3 | D题可能还算好题… 4 | 通过恰当的分数计算，分为3阶级，对于每个阶级，证明每次只能对局面取走大于等于0的分数值，计算出大于0的分数的局面必然可以转移到另一个大于0的分数局面，那么对于等于0的分数值可以继续取，也就是把无穷小继续放大来看。 5 | 6 | I原题题解有$O(Q^2/64)$的做法。 7 | -------------------------------------------------------------------------------- /wood-cube/Asia Xi'an Regional 2017.page: -------------------------------------------------------------------------------- 1 | A题队里出题时讨论过一模一样的模型…而且做法还比西安的标解少一个log。 2 | 3 | E题不会做，冲了一发贪心过了。 4 | 5 | C题有过较为正确的思路，但最后没做出来。 6 | 7 | D题根本没时间写…封板后就扔了… 8 | 9 | 剩下的题目基本都是无聊的简单数据结构题。 10 | -------------------------------------------------------------------------------- /wood-cube/CCPC Final 2016.page: -------------------------------------------------------------------------------- 1 | C. Mr. Panda and Survey \[TDJ\] 2 | ------------------------------- 3 | 4 | 注意第一遍超集和其实不需要$O(3^m*m)$地做，因为只有全集上有初始值，所以只要DP的时候任找一个位$O(1)$转移就可以了，复杂度$O(n+3^m)$ 5 | -------------------------------------------------------------------------------- /wood-cube/CCPC Finals 2016.page: -------------------------------------------------------------------------------- 1 | C. Mr. Panda and Survey \[TDJ\] 2 | ------------------------------- 3 | 4 | 注意第一遍超集和其实不需要$O(3^m*m)$地做，因为只有全集上有初始值，所以只要DP的时候任找一个位$O(1)$转移就可以了，复杂度$O(n+3^m)$ 5 | -------------------------------------------------------------------------------- /wood-cube/GX个人.page: -------------------------------------------------------------------------------- 1 | 2016.04.11 2 | ========== 3 | 4 | 504A 5 | ---- 6 | 7 | easy problem 8 | 9 | 2016.04.13 10 | ========== 11 | 12 | 607A 13 | ---- 14 | 15 | easy problem 16 | 17 | 2016.04.14 18 | ========== 19 | 20 | 605D 21 | ---- 22 | 23 | 这题整理一下之后发现本质上是一个dp，然后dp转移状态要转移到N个状态，所以最后要n\^2的效率，一种方法是用二维线段树，但是难写而且nlogn，最后用了线段树套vector的方法，可以证明每个元素最后退出vector一次所以效率最后是nlogn的。 24 | -------------------------------------------------------------------------------- /wood-cube/MIPT Workshop 2017 GP of Moscow Workshop.page: -------------------------------------------------------------------------------- 1 | 想B还是想E呢？ 2 | -------------------------------------------------------------------------------- /wood-cube/MIPT Workshop 2017 Korean Selection 1.page: -------------------------------------------------------------------------------- 1 | A、I题面有问题，没看Clarification，浪费大量时间(最后居然都枚举题意过了)，J题少看一个条件(a单调)，写了个复杂得多的做法。 2 | -------------------------------------------------------------------------------- /wood-cube/MIPT Workshop 2017 Latin America Selection.page: -------------------------------------------------------------------------------- 1 | tunls抄错Splay板子然后以为板子错了于是上机调了很久…直接崩… 2 | -------------------------------------------------------------------------------- /wood-cube/MIPT Workshop 2017 NAIPC-2017.page: -------------------------------------------------------------------------------- 1 | E题tunls忘记LCT板子正确用法了…… 2 | -------------------------------------------------------------------------------- /wood-cube/MIPT Workshop 2017 Worldwide Selection.page: -------------------------------------------------------------------------------- 1 | 手里拿着3份WA的代码…外加一道简单题没开…梦游状态 2 | -------------------------------------------------------------------------------- /wood-cube/MIPT Workshop 2017 Zagreb U Selection 1.page: -------------------------------------------------------------------------------- 1 | 封榜前B题几乎没队伍过，于是把剩下时间都扔在仙人掌上了，最后B过了一大堆，GG。 2 | -------------------------------------------------------------------------------- /wood-cube/Open Ural FU Personal Contest 2013.page: -------------------------------------------------------------------------------- 1 | A. Kite 2 | ------- 3 | 4 | B. Cycling Roads 5 | ---------------- 6 | 7 | C. In Chinese Restaurant 8 | ------------------------ 9 | 10 | D. Cantonese Dialect 11 | -------------------- 12 | 13 | E. 皇后像廣場 14 | ------------- 15 | 16 | F. Pear Trees 17 | ------------- 18 | 19 | G. Glass Pyramid 20 | ---------------- 21 | 22 | H. Hong Kong Tram 23 | ----------------- 24 | 25 | I. Programmer Casino 26 | -------------------- 27 | -------------------------------------------------------------------------------- /wood-cube/Petrozavodsk Summer-2015 Petr Mitrichev.page: -------------------------------------------------------------------------------- 1 | A. Automat 2 | ---------- 3 | 4 | B. Baum 5 | ------- 6 | 7 | C. Entfernung 8 | ------------- 9 | 10 | D. Geld 11 | ------- 12 | 13 | E. Mannschaft 14 | ------------- 15 | 16 | F. Quadrat 17 | ---------- 18 | 19 | G. Sprache 20 | ---------- 21 | 22 | H. Steigung 23 | ----------- 24 | 25 | I. Vieleck 26 | ---------- 27 | 28 | J. Zubereitung 29 | -------------- 30 | -------------------------------------------------------------------------------- /wood-cube/Rocky Mountain Regional 2015.page: -------------------------------------------------------------------------------- 1 | 水题场，2小时15分AK。 2 | -------------------------------------------------------------------------------- /wood-cube/THUPC 2016.page: -------------------------------------------------------------------------------- 1 | A. AI 2 | ----- 3 | 4 | B. Business Plan 5 | ---------------- 6 | 7 | C. Cosine 8 | --------- 9 | 10 | D. Drill 11 | -------- 12 | 13 | E. Edit 14 | ------- 15 | 16 | F. Festival 17 | ----------- 18 | 19 | G. Game of Go 20 | ------------- 21 | 22 | H. Hang Out \[MZH\] 23 | ------------------- 24 | 25 | FFT中$\pi$开成了double。。 26 | 27 | I. Increase a Second 28 | -------------------- 29 | 30 | J. Jewelry 31 | ---------- 32 | -------------------------------------------------------------------------------- /wood-cube/XVI Open Cup GP of Peterhof.page: -------------------------------------------------------------------------------- 1 | A. (a,b)-tower 2 | -------------- 3 | 4 | B. Bridges Construction 5 | ----------------------- 6 | 7 | C. Equivalence Relation 8 | ----------------------- 9 | 10 | D. Formula-1 11 | ------------ 12 | 13 | E. Ideal Photo 14 | -------------- 15 | 16 | F. (p, q)-Knight 17 | ---------------- 18 | 19 | G. Random Wormholes 20 | ------------------- 21 | 22 | H. Second Maximum 23 | ----------------- 24 | 25 | I. Ticket To Ride 26 | ----------------- 27 | -------------------------------------------------------------------------------- /wood-cube/XVII Open Cup GP of Eurasia.page: -------------------------------------------------------------------------------- 1 | D题死于树状数组手抖打错一个字符…要加强手抖检测啊… 2 | -------------------------------------------------------------------------------- /wood-cube/XVII Open Cup GP of Siberia.page: -------------------------------------------------------------------------------- 1 | 05题题面数据范围错误…卡了很久… 2 | -------------------------------------------------------------------------------- /wood-cube/red.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ftiasch/icpc-camp-wiki/364abdcbedef99104107d01e64152fa0e492bade/wood-cube/red.png -------------------------------------------------------------------------------- /wood-cube/训练环境.page: -------------------------------------------------------------------------------- 1 | 代码打印脚本 2 | ============ 3 | 4 | pr -e' '4 -t -n "$@" | fold -w 93 | pr -W 93 -l 81 -h "$@" | lpr -o cpi=12 -o lpi=7.2 5 | 6 | 代码打印命令 7 | ============ 8 | 9 | printfile "%f" -T 4 --line-number=1 10 | 11 | 编译命令 12 | ======== 13 | 14 | [F8] Compile : g++ -o "%e" "%f" -std=c++11 -g 15 | [F9] Build : g++ -o "%e" "%f" -std=c++11 -g -Wall 16 | [F5] Execute : g++ -o "%e" "%f" -std=c++11 -g && bash test.sh %e 17 | --------------------------------------------------------------------------------