摘要:
#1185 : 连通性·三 #1185 : 连通性·三 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 暑假到了!!小Hi和小Ho为了体验生活,来到了住在大草原的约翰家。今天一大早,约翰因为有事要出去,就拜托小Hi和小Ho忙帮放牧。 约翰家一共有N个草场,每个草场有容量 阅读全文
摘要:
C. Ray Tracing C. Ray Tracing There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). 阅读全文
摘要:
D. Dense Subsequence D. Dense Subsequence You are given a string s, consisting of lowercase English letters, and the integer m. One should choose some 阅读全文
摘要:
D. Kefa and Dishes time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output When Kefa came to the 阅读全文
摘要:
One-Way Reform Description There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than on 阅读全文
摘要:
C. Polycarp at the Radio time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Polycarp at 阅读全文
摘要:
D. Lakes in Berland time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The map of Berland i 阅读全文
摘要:
odd-even number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 454 Accepted Submission(s): 245 P 阅读全文
摘要:
D. Mishka and Interesting sum D. Mishka and Interesting sum Little Mishka enjoys programming. Since her birthday has just passed, her friends decided 阅读全文
摘要:
Turing Tree Description After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily 阅读全文