2015-E03-team2
从 Trac 迁移的文章
这是从旧校内 Wiki 迁移的文章,可能存在一些样式问题,您可以向 memset0 反馈。
原文章内容如下:
||User||Problem||Result||Memory||Time||Language||Length||Submit Time||
||Siunaus||I||AC||3532||140||G++||1375||2015-09-02 18:19:09||
||Siunaus||B||AC||1528||31||G++||3345||2015-09-02 18:13:15||
||Siunaus||B||PE|| || ||G++||3344||2015-09-02 18:12:09||
||Siunaus||B||WA|| || ||G++||3000||2015-09-02 17:51:55||
||Siunaus||I||WA|| || ||G++||1299||2015-09-02 17:40:36||
||Siunaus||I||WA|| || ||G++||1263||2015-09-02 17:21:37||
||Siunaus||I||WA|| || ||G++||1264||2015-09-02 17:11:57||
||Siunaus||J||AC||3604||1201||G++||1499||2015-09-02 16:53:10||
||Siunaus||D||AC||4080||343||G++||1129||2015-09-02 16:31:14||
||Siunaus||E||AC||1680||15||G++||1382||2015-09-02 16:10:40||
||Siunaus||J||WA|| || ||G++||577||2015-09-02 15:05:43||
||Siunaus||J||MLE|| || ||G++||580||2015-09-02 15:05:12||
||Siunaus||J||WA|| || ||G++||577||2015-09-02 15:04:26||
||Siunaus||A||AC||1408||15||G++||419||2015-09-02 14:47:37||
比赛链接: http://vj.acmclub.cn/contest/view.action?cid=105
== 流水账 ==
=== Patchouli_Go ===
开场猜J可以暴力,写了一下,果然跪了……[[BR]]
换高斯消元,搞了快一个小时才把方程组建对。'''J4y110'''[[BR]]
然后跟sf说了B的做法,让他上去写[[BR]]
刚不过F题的数据结构,含泪收场……[[BR]]
=== sfiction ===
开场A题打了一下表,出现的规律太过优美以至于又验证了一会儿。'''A1y2'''。[[BR]]
之后我看了看D,没过多久D已经被万人轮了。然而我花了一个多小时才确认了贪心。感觉自己的智商也是低得不行。'''D1y106'''。[[BR]]
之后我看了看其他题目,感觉B是道网络流,wxj学长建好图之后我开始抄模板。因为看错一处题目细节和看错输出格式获得WA和PE各一个。'''B3y208'''。[[BR]]
最后试图做出F,失败告终。[[BR]]
=== JTJL ===
At the begining of the contest, we guessed the pattern of the problem A and soon got AC.[[BR]]
Then I read the problem E. Aha, a stupid DP! But I thought the accuracy will BOOM, so I decided to use JAVA. Just at the time I opened eclipse, Patchouli asked me to notice the Hint: "Log is Useful." Actually, I think the word "log" meant "journal" but not "logarithms" before he told me.....= =.'''E1y85'''[[BR]]
After that, I read problem I. Firstly, I decided to use segment tree to maintain the process, and calculate the answer with the combination, ans its' time complexity was O(nlogn), SCIENTIFIC! But soon, I optimized my algorithm and decrease the time complexity to O(n)...I was too scaried to write this program because it worked too fast...[[BR]]
But the computer was spare at that time, so I wrote it. After three times Wrong Answer, I got AC at last.'''I4y214'''.[[BR]]
== 总结 ==
== 补题 ==
CFGHK
| User | Problem | Result | Memory | Time | Language | Length | Submit Time |
| Siunaus | I | AC | 3532 | 140 | G++ | 1375 | 2015-09-02 18:19:09 |
| Siunaus | B | AC | 1528 | 31 | G++ | 3345 | 2015-09-02 18:13:15 |
| Siunaus | B | PE | G++ | 3344 | 2015-09-02 18:12:09 | ||
| Siunaus | B | WA | G++ | 3000 | 2015-09-02 17:51:55 | ||
| Siunaus | I | WA | G++ | 1299 | 2015-09-02 17:40:36 | ||
| Siunaus | I | WA | G++ | 1263 | 2015-09-02 17:21:37 | ||
| Siunaus | I | WA | G++ | 1264 | 2015-09-02 17:11:57 | ||
| Siunaus | J | AC | 3604 | 1201 | G++ | 1499 | 2015-09-02 16:53:10 |
| Siunaus | D | AC | 4080 | 343 | G++ | 1129 | 2015-09-02 16:31:14 |
| Siunaus | E | AC | 1680 | 15 | G++ | 1382 | 2015-09-02 16:10:40 |
| Siunaus | J | WA | G++ | 577 | 2015-09-02 15:05:43 | ||
| Siunaus | J | MLE | G++ | 580 | 2015-09-02 15:05:12 | ||
| Siunaus | J | WA | G++ | 577 | 2015-09-02 15:04:26 | ||
| Siunaus | A | AC | 1408 | 15 | G++ | 419 | 2015-09-02 14:47:37 |
比赛链接: http://vj.acmclub.cn/contest/view.action?cid=105
流水账
Patchouli_Go
开场猜J可以暴力,写了一下,果然跪了……
换高斯消元,搞了快一个小时才把方程组建对。J4y110
然后跟sf说了B的做法,让他上去写
刚不过F题的数据结构,含泪收场……
sfiction
开场A题打了一下表,出现的规律太过优美以至于又验证了一会儿。A1y2。
之后我看了看D,没过多久D已经被万人轮了。然而我花了一个多小时才确认了贪心。感觉自己的智商也是低得不行。D1y106。
之后我看了看其他题目,感觉B是道网络流,wxj学长建好图之后我开始抄模板。因为看错一处题目细节和看错输出格式获得WA和PE各一个。B3y208。
最后试图做出F,失败告终。
JTJL
At the begining of the contest, we guessed the pattern of the problem A and soon got AC.
Then I read the problem E. Aha, a stupid DP! But I thought the accuracy will BOOM, so I decided to use JAVA. Just at the time I opened eclipse, Patchouli asked me to notice the Hint: "Log is Useful." Actually, I think the word "log" meant "journal" but not "logarithms" before he told me.....= =.E1y85
After that, I read problem I. Firstly, I decided to use segment tree to maintain the process, and calculate the answer with the combination, ans its' time complexity was O(nlogn), SCIENTIFIC! But soon, I optimized my algorithm and decrease the time complexity to O(n)...I was too scaried to write this program because it worked too fast...
But the computer was spare at that time, so I wrote it. After three times Wrong Answer, I got AC at last.I4y214.
总结
补题
CFGHK