- 博客(19)
- 收藏
- 关注
原创 POJ 2553 The Bottom of a Graph【强联通】
The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 11632 Accepted: 4788DescriptionWe will use the following (standard) definitions fro
2018-02-23 19:24:12 155
原创 POJ 1236 Network of Schools【强联通】
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20668 Accepted: 8155DescriptionA number of schools are connected to a computer network
2018-02-22 15:43:48 154
原创 Educational Codeforces Round 38 (Rated for Div. 2) 【B】 【双指针】
B. Run For Your Prizetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou and your friend are participating
2018-02-21 16:56:52 227
原创 Educational Codeforces Round 37 (Rated for Div. 2) 【F】【线段树】
门F. SUM and REPLACEtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet D(x) be the number of positiv
2018-02-19 16:21:16 187
原创 HDU 1867 A + B for you again 【KMP】
A + B for you againTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8399 Accepted Submission(s): 2098Problem DescriptionGenerally
2018-02-14 21:12:38 167
原创 POJ 3461 Oulipo 【KMP】
OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 45274 Accepted: 18103DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La
2018-02-13 21:46:58 174
原创 HDU 1711 Number Sequence 【KMP】
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33291 Accepted Submission(s): 13910Problem DescriptionGiven two s
2018-02-13 12:41:54 159
原创 Educational Codeforces Round 33 (Rated for Div. 2)【C】【并查集】
我是门C. Rumortime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVova promised himself that he would never
2018-02-07 21:09:10 248
原创 HDU 1285 确定比赛名次 【拓扑排序】
确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30931 Accepted Submission(s): 12198Problem Description有N个比赛队(1 Inpu
2018-02-07 20:37:48 186
原创 HDU 2236 无题II 【二分 匈牙利】
无题IITime Limit: 2000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1868 Accepted Submission(s): 850Problem Description这是一个简单的游戏,在一个n*n的矩阵中,找n个数使
2018-02-07 00:04:07 246
原创 HDU 2063 过山车 【匈牙利】
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26089 Accepted Submission(s): 11296Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于
2018-02-06 22:14:14 155
原创 HDU 1874 畅通工程续 【最短路】
畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 61564 Accepted Submission(s): 23057Problem Description某省自从实行了很多年的畅通工程计划后,终于修
2018-02-05 22:33:42 150
原创 POJ 2387 Til the Cows Come Home【最短路】
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 63291 Accepted: 21379DescriptionBessie is out in the field and wants to get back t
2018-02-05 22:02:45 167
原创 Educational Codeforces Round 37 (Rated for Div. 2)【A B C】【水】【模拟】
嗖的一下!A#includeusing namespace std;#define ll long longint a[500];int c[500];int main(){ int N; cin >> N; while(N--) { int n, m; cin >> n >> m; for(int
2018-02-03 16:18:51 217
原创 Codeforces Round #376 (Div. 2) B Coupons and Discounts【水思维】
B. Coupons and Discountstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe programming competition season
2018-02-02 22:10:38 178
原创 Codeforces Round #459 (Div. 2) 【A B C】【水】【思维】
传送门A#includeusing namespace std;int a[10000000], b[1000];int main(){ a[1] = 1; a[2] = 2; for(int i = 3; i <= 20; i++) a[i] = a[i - 1] + a[i - 2]; for(int i = 1; i <= 10
2018-02-02 21:52:54 124
原创 vijos 1456 最小总代价【状压dp】
描述n个人在做传递物品的游戏,编号为1-n。游戏规则是这样的:开始时物品可以在任意一人手上,他可把物品传递给其他人中的任意一位;下一个人可以传递给未接过物品的任意一人。即物品只能经过同一个人一次,而且每次传递过程都有一个代价;不同的人传给不同的人的代价值之间没有联系;求当物品经过所有n个人后,整个过程的总代价是多少。格式输入格式第一行为n,表示共有n个人(1
2018-02-01 16:52:33 207
原创 Codeforces Round #460 (Div. 2) 【D】【dfs or 拓扑排序】
传送门题意:寻找路线中出现次数最多的字母个数;判断是否有回路,如果有回路就可以无限循环就直接输出-1,如果没有回路,则可以用dfs或者拓扑排序解决dfs:#includeusing namespace std;const int MAX = 3e5 + 7;vector v[MAX];char s[MAX];int vis[MAX], a[MAX][26], ans =
2018-02-01 16:14:37 126
原创 Codeforces Round #460 (Div. 2) 【A B C】【水】【暴力】
传送门A#includeusing namespace std;int main(int argc,char *argv[]){ int n, m; cin >> n >> m; double minn = 0x3f3f3f3f; for(int i = 0; i < n; i++) { double a, b;
2018-02-01 12:09:57 153
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人