Entries from 2016-03-27 to 1 day
今天中午吃麥當勞就放人了 整個氣氛不太一樣 我想這就是大家口中的二模後崩潰潮吧 不過我覺得我從這次的失敗得到的已經很多了 所以很滿足 已經使出渾身解數 就沒有什麼好愧對的 一路來放棄了很多機會 吃了很多苦 但我還是很慶幸有這些經歷 畢業後的學長還會…
Problem - D - Codeforces Just make clear how one state can transfer to another, it will be easy. #include <bits/stdc++.h> using namespace std; const int MAXM = 2000 + 3; const int MAXP = 2000 + 3; const int MOD = 1e9 + 7; #define rep( i, a ) for( int i =</bits/stdc++.h>…
http://codeforces.com/contest/652/problem/E Shrink each bridge BCC to as a single vertex. If a treasure exists in some BCC, that BCC will be sure able to take that treasure. Otherwise a treasure might be on a bridge linking BCCs, and we wi…
Problem - D - Codeforces Sort by left bound, that scan from left to right, we will query the number of right bounds that are before the right bound of the current segment. After answering the query, the segment should be removed, which wil…
Problem - C - Codeforces 每次即時刪除無用的編號( 因為所有編號相異 ),似乎就能夠均攤解決。 #include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 5; const int MAXM = 3e5 + 5; typedef long long ll; int n, m; int p[ MAXN ]; set< int > foe[ MAX</bits/stdc++.h>…
考完二模,我覺得以我來說真的考得挺不錯的,算是有拿該有的分數吧 在考試當下想起來高一校內筆試的那題 學長後來隨便捏的尤拉定理 然後就多40分了 第一次有這種感覺 蠻開心的 嘛 二模考一題數值方法 兩題模逆元也是醉了 不過聽說每年都是這樣 看來我是不能…