WarsawUniversityContestPetrozavodsk,Thursday,January31,2008ProblemA.AthleticcompetitionInputfile:athletic.inOutputfile:athletic.outElectionsarecomingandthemayorofBytetowndecidedtoorganizeanathleticcompetitiontoincreasehisodds.UnfortunatelythereisnoathleticstadiuminBytetown,soallpartsofthecompetitionwillhavetobeheldinthetown’sstreets.Mayordecidedtolimitthecompetitiononlytorunningeventsandaskedyouforhelpwithplanningtheirtracks.Therearenstreetjunctionsandn1streetsinBytetown.Fromeachjunctionthereisapathleading−toeveryotherjunction.Everyrunningtrackmuststartatsomejunction,leadalongsomestreetsandfinishatsomeotherjunction.Mayorwouldliketoorganizeasmanyeventssimultaneouslyaspossible,sothenumberoftracksshouldbemaximized.Duetosafetyreasonsnotwotracksmayhaveacommonjunctionorstreet.Additionally,noteveryjunctioncanbeusedasastartingorendingpointofanevent.InputThefirstlineoftheinputfilecontainsasingleintegern(1n200000),denotingthenumberof≤≤junctionsinBytetown.Thejunctionsarenumberedfrom1ton.Thefollowingn1linescontain−descriptionsofthestreets;eachofthemconsistsoftwointegersaandb(1a;bn,a=b),separated≤≤6byasinglespace—numbersofjunctionsthatareconnectedbythestreet.Linenumbern+1containsoneintegerm(0mn),denotingthenumberofjunctionsthatcanserveas≤≤astartingorendingpointofanevent.Thelastlineoftheinputfilecontainsmdistinctspace–separatednumbers—thenumbersofthosejunctions,eachintherange[1;n].OutputThefirstandonlylineoftheinputfileshouldcontainoneinteger,denotingthemaximalpossiblenumberofrunningeventsthatcanbeheldinBytetownsimultaneously.Exampleathletic.inathletic.out511232411541254Page1of14WarsawUniversityContestPetrozavodsk,Thursday,January31,2008ProblemB.CylindersInputfile:cylinders.inOutputfile:cylinders.outBytemanurgentlyneedstomeasurelmillilitersofwater,sohewenttoashopthatsellstechnicalglass.Unfortunately,watermeasuringglassisoutofdatenowandtheshopwasbeingwoundupatthemoment.Mostoftheglasswassoldoutandtherewereonlytwoidenticaldefectivecylinders.