查看详情
   显示下一条  |  关闭
温馨提示!由于新浪微博认证机制调整,您的新浪微博帐号绑定已过期,请重新绑定!立即重新绑定新浪微博》  |  关闭

Boleyn Su's Blog

 
 
 
 
 
 
 
 

Hello, ACM-ICPC World Finals![2014年1月5日]

2014-1-5 20:00:02 阅读1628 评论4 52014/01 Jan5

好久没有写博客了,而写日记的习惯到了大学也早已丢失。但是这件事情我觉得有必要记下来,就像当初NOIP拿到一等奖需要记录下来,获得NOI参赛资格需要记录下来一样。
距离上一次写关于OI/ACM的日志(OI的结束,ACM的开始[2011年10月26日])已经两年多了,那篇写于我第一次参加ACM区域赛之后。从那时到现在期间发生了很多事情,我没有将他们记录下来,而借着这次机会,我希望将它们整理出来。
收到人大的录取通知书之后(我不是保送的),我第一个想到的事情就是加入ACM队,所以开学之前我联系了

作者  | 2014-1-5 20:00:02 | 阅读(1628) |评论(4) | 阅读全文>>

2013.03.02 ACME Training Nine - ZOJ Monthly, November 2012[team]

2013-3-4 13:01:52 阅读745 评论2 42013/03 Mar4


#F AC 11 mins
Brute force
#A AC 23 mins
SG function
#I AC 86 mins 4 wrong tries
Brute force
#G AC 171 mins 3 wrong tries
Math
#J AC 208 mins
DP
#D AC 210 mins
AC by whd
#C AC 287 mins

作者  | 2013-3-4 13:01:52 | 阅读(745) |评论(2) | 阅读全文>>



We started about 50 mins after the contest had begun.

#I AC 61 mins
Brute force
#E AC 105 mins
Greedy
#A AC 113 mins 2 wrong tries by WHD
#C AC 126 mins 1 wrong try
AC automation
#H AC 153 mins 1 wrong try
Math
#F AC 224 mins 1 wrong try
Game theory
#B AC 259 mins 5 wrong tries

作者  | 2012-12-16 20:32:23 | 阅读(714) |评论(0) | 阅读全文>>



#B AC 31 min 1 wrong try by WHD
#A AC 50 min by WDP
#D AC 75 min 3 wrong tries by WHD
#G AC 79 min 5 wrong tries
It can be solved by brute force, but I used DP to solve it, so I wasted a lot of time.
#C AC 94 min 1 wrong try
For a query, if b>sqrt(n), we can response it by brute force.

作者  | 2012-12-16 20:09:54 | 阅读(641) |评论(0) | 阅读全文>>

2012.12.5 ACME Training Three - Graph Theory Problems[individual]

2012-12-5 17:20:45 阅读663 评论0 52012/12 Dec5

URAL 1272 Non-Yekaterinburg Subway
Disjoint-set

URAL 1156 Two Rounds
Bipartite graph

作者  | 2012-12-5 17:20:45 | 阅读(663) |评论(0) | 阅读全文>>

2012.12.3 ACME Training Two - Codeforces Round #124 (Div. 1)[individual]

2012-12-5 16:56:26 阅读561 评论0 52012/12 Dec5

#A AC 6min
Greedy
#B AC 67min
BFS

#E AC

作者  | 2012-12-5 16:56:26 | 阅读(561) |评论(0) | 阅读全文>>


This is my first cooperation with my new teammates, WDP and WHD. Our team is called ACME, which can be understood as AC me, or it original meaning the peak.

#A AC 8min 1 wrong try by WHD
#I AC 17min
It is a typical DP problem.
#B AC 76min 1 wrong try
It is a math problem. WDP told me the meaning of the problem, and I come up with a formula soon.

作者  | 2012-12-2 21:55:41 | 阅读(719) |评论(0) | 阅读全文>>

[The 2009 ACM-ICPC Asia Harbin Regional Contest]G.Fuzzy Google Suggest

2012-4-8 17:17:58 阅读1097 评论0 82012/04 Apr8

字典树。

CODE:

#include <iostream>

#include <algorithm>

#include <string>

作者  | 2012-4-8 17:17:58 | 阅读(1097) |评论(0) | 阅读全文>>

[The 2009 ACM-ICPC Asia Harbin Regional Contest]D.Gold Mines

2012-4-8 17:11:37 阅读1169 评论0 82012/04 Apr8

最小费用流。

CODE:

#include <iostream>

#include <algorithm>

#include <string>

作者  | 2012-4-8 17:11:37 | 阅读(1169) |评论(0) | 阅读全文>>

The 2010 Asia Regional Contests

2012-3-11 0:15:48 阅读1502 评论0 112012/03 Mar11

You has solved this problem :-)3660

作者  | 2012-3-11 0:15:48 | 阅读(1502) |评论(0) | 阅读全文>>

The 2011 Asia Regional Contests

2012-2-27 13:22:20 阅读1943 评论0 272012/02 Feb27

作者  | 2012-2-27 13:22:20 | 阅读(1943) |评论(0) | 阅读全文>>

2-SAT。
CODE:
#include <cstring>
using namespace std;
const
int MAXV=20000;
const
int MAXE=1000000;
struct
struct_edge

作者  | 2011-12-3 18:06:59 | 阅读(985) |评论(0) | 阅读全文>>

基于连通性状态压缩的动规。
CODE:
/*
PROGRAM: $PROGRAM
AUTHOR: Su Jiao
DATE: 2011-11-28
DESCRIPTION:
$DESCRIPTION
*/

#include <iostream>
#include <cstring>
using namespace std;

typedef
long long int lli;

作者  | 2011-12-3 18:04:41 | 阅读(1442) |评论(0) | 阅读全文>>

ACM备忘

2011-11-26 0:10:23 阅读778 评论0 262011/11 Nov26

做题列表

2011-11-25
基于连通性状态压缩的动规专练
http://acm.timus.ru/problem.aspx?space=1&num=1519

2011-11-26
基于连通性状态压缩的动规专练
http://poj.org/problem?id=1739
http://acm.hdu.edu.cn/showproblem.php?pid=1964
"触宝CooTek杯” USTC Monthly Contest 2011-11-26
http://acm.ustc.edu.cn/ustcoj/contest.php?contest=21

作者  | 2011-11-26 0:10:23 | 阅读(778) |评论(0) | 阅读全文>>

查看所有日志>>

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

页脚

网易公司版权所有 ©1997-2018

注册 登录  
 加关注