seektheworld

1787. Turn for MEGATime limit: 1.0 secondMemory limit: 64 MBA traffic light at the turn for the “MEGA” shopping center from the Novomoskovskiy highway works in such a way that k cars are

Problem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central Loowater had always been a prime b

PacketsTime Limit: 1000msMemory Limit: 10000KBThis problem will be judged on PKU. Original ID: 101764-bit integer IO format: %lld      Java class name: MainPrev Submit Status

#include #include using namespace std;#define MAX_N 20000int n,s;long long c,y;int main(){ scanf("%d%d",&n,&s); long long c,y; cin>>c>>y; long long last=c; long long a

Stall ReservationsTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 319064-bit integer IO format: %lld      Java class name: MainSpecial Jud

Radar InstallationTime Limit: 1000msMemory Limit: 10000KBThis problem will be judged on PKU. Original ID:132864-bit integer IO format: %lld      Java class name:Main PrevSubmit

Cleaning ShiftsTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 237664-bit integer IO format: %lld      Java class name: MainPrev Submi

OsenbeiTime Limit: 3000msMemory Limit: 65536KBThis problem will be judged on Aizu. Original ID: 052564-bit integer IO format: %lld      Java class name: MainPrev Submit Statu

HopscotchTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 305064-bit integer IO format: %lld      Java class name: MainPrev Submit Stat

Backward Digit SumsTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 318764-bit integer IO format: %lld      Java class name: MainPrev S

Smallest DifferenceTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 271864-bit integer IO format: %lld      Java class name: MainPrev S

Seven PuzzleTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on Aizu. Original ID: 012164-bit integer IO format: %lld      Java class name: MainPrev Submit 

1219: 爱抱怨的一对儿Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 13  Solved: 4[Submit][Status][Web Board]Description唐学长和他的女朋友又要出去旅游了，这次他们要想去好多个城市！已知有n个城市，为了方便城市之间联络，城市之间建立了m条路，每条路连接两座

Meteor ShowerTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 366964-bit integer IO format: %lld      Java class name: MainPrev Submit 

377. 护卫队★☆   输入文件：convoy.in   输出文件：convoy.out   简单对比时间限制：1 s   内存限制：128 MB护卫车队在一条单行的街道前排成一队，前面河上是一座单行的桥。因为街道是一条单行道，所以任何车辆都不能超车。桥能承受一个给定的最大承载量。为了控制桥上的交通，桥两边各站一个指挥员。护卫车队被分成几个组，每组中的车辆都能同时通过该桥。当一组

Curling 2.0Time Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 300964-bit integer IO format: %lld      Java class name: MainPrev Submit St

BallTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on Aizu. Original ID: 003364-bit integer IO format: %lld      Java class name: MainPrev Submit Status S

Property DistributionTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on Aizu. Original ID: 011864-bit integer IO format: %lld      Java class name: MainPrev 

Red and BlackTime Limit: 1000msMemory Limit: 30000KBThis problem will be judged on PKU. Original ID: 197964-bit integer IO format: %lld      Java class name: MainPrev Submit 

375. 字符串的距离★☆   输入文件：blast.in   输出文件：blast.out   简单对比时间限制：1 s   内存限制：128 MB设有字符串X，我们称在X的头尾及中间插入任意多个空格后构成的新字符串为X的扩展串，如字符串X为“abcbcd”，则字符串“abcb□cd”，“□a□bcbcd□”和“abcb□cd□”都是X的扩展串，这里“□”代表空格字符。如果A