ACMACM International Collegiate Programming ContestACM-ICPC

ACM-ICPC

Baylor University(Association for Computing Machinery, ACM) IBM

ICPCBattle of the Brains

1970A&Mthe Alpha Chapter of the UPE Computer Science Honor Society1977ACM1997IBM

Contest RuleICPC : (Regional Contest) (World Final)

Contest Rule3()2415CC++JavaPascal810

Contest Rule

20penalty

Contest Rule accepted () wrong answer ()AcceptedAccepted (P.E.)Wrong AnswerTime Limit Exceededetc

Error MessagesAccepted Aceepted (P.E.) (Presentation Error) Accepted ()Wrong Answer Time Limit Exceeded (TL) Judge Memory Limit Exceeded (ML) Output Limit Exceeded (OL):

Error MessagesCompile Error (CE) LinuxC/C++gccSubmission Error (SE) IDRuntime Error(SIGSEGV) 0()Restricted Function (RF) ()system (...)

Contest RuleABA1:002:45A1:00+2:45=3:45B1:202:00B2()B1:20+2:00+0:20=3:40B

ACM ACM ACM

31 ACM (2006 Annual ACM International Collegiate Programming Contest Asia Kaohsiung Contest Site2006 11 17 ()11 18 ()

2007 FinalThe 31st ACM International Collegiate Programming Contest World Finals March 12-16, 2007 - Hilton Tokyo Bay

TipsOnline JudgeUniversidad de Valladolid Online Judge Ural State University Online Judge Tianjin University Online Judge Saratov State University Online Judge Sphere Online Judge ACM-ICPC Live Archive Around the World MIPT Online Judge Peking University Online Judge Zhejiang University Online Judge Harbin Institute of Technology Online Judge Fuzhou University Online Judge Online Problems Solving System

Tips GNU/Linux SUSE Enterprise for desktop 10 World FinalFedora Core 4 Linux GNU C/C++ Eclipse World Final Java (version 1.5)C/C++ (GCC 4.0) Pascal Java - Eclipse 3.1C/C++ - CDT 3.0 under Eclipse 3.1Pascal - Borland Kylix Version 3.0 PC2 (Programming Contest Control System)

TipsPDA

Tips()C++ Standard Template LibraryE.G. #include stack S; queue Q; priority_queue PQ;stack - S.push(), S.top(), S.pop(), S.empty()You should always top on pop because top returns but does not remove the element on top, while pop removes but does not return the element.Linked implementations ensure the stack will never be full.queue Q.front(), Q.back(), Q.push(), Q.pop(), and Q.empty()hash_map H.erase(), H.find(), H.insert()priority_queue PQ.push(), PQ.top(), PQ.pop(), PQ.empty()set S.set_union, S.set_intersectionsort or stable_sort

Good Luck!!

1970A&Mthe Alpha Chapter of the UPE Computer Science Honor Society1977ACM291997IBM19975608402004840410910-20%1980ACM1990 200226200529(Association of Computing Machinery, ACM)1947Six regions: North America, Latin America, Europe, Africa, Asia, South PafificThe competition rewards team work, problem analysis, and rapid software development.