_log__

摘要： 写写校赛总结。。。。。。。这两次校赛是我们组队以后第一次的比赛。。。第一场打得很拙，第二场还可以吧，第一场校赛--毕竟是期待了很久的校赛，所以感觉还是很紧张，吃饭的时候打了二两，剩了一大半==， 这次我们队名叫 I_Love_High_Math......没走到现场，就快下雨了，真的有点郁闷==。... 阅读全文

摘要： Problem 2163 多米诺骨牌Accept: 10Submit: 32Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionVasya很喜欢排多米诺骨牌。他已经厌倦了普通的多米诺骨牌，所以他用不同高度的多米诺骨牌。他从左边... 阅读全文

摘要： // 没看懂，队友说水，写写过了、、// 他的代码==#include#include#include#include#include#include#include#include#include#include#define BUG printf("hehe\n")#define INF 0x3f3f3f3f#define ll __int64#define lowbit(x) x&-xusing namespace std;#pragma comment(linker, "/STACK:102400000,102400000")struct 阅读全文

摘要： // 水题，数高为 2 就可以 既把2-n 点 都连到 1 点，#include#include#include#include #include#include#include#includeusing namespace std ;#define LL long long#define mod 1000000007int main(){ int i , k ,j ,n ; int T ,case1 = 0 ; int ans ; //freopen("in.txt","r",stdin) ; cin >> T ; while(T--) { 阅读全文

摘要： // 我写完H的时候说他读懂了这题，说了题意给我，（其实我没听懂，应该是刚过H，太激动，没心情听==、、、）// 然后他说暴力可以，我就叫他写，然后我就去看室友打lu ，// 后来他卡死了==。我重新写也是 wa==// 后来他发现用 string 数组过不了==。，我理解错题意--// 后面我们一起改，相差十几秒一起A== // 思路是把每位作者的作品都记录下来，然后看对这些作品被引用次数经行排序// 然后。。。。。。看代码 hehe 数组那里#include#include#include#include#include#include#include#include#include#in 阅读全文

摘要： // 一看这题就会想到应该是用线段树处理// 一条边的分出来的两个部分点编号并不是连续的，这样很难用线段树处理// 所以我们就想到给点重新编号，dfs一次，按访问到的点顺序给点编号// dfs一条边的子树得到的编号肯定是连续，然后我们记录着这个居间// 这样就可以套线段树了，~~// by _hehele#include#include#include#include #include#include#include#includeusing namespace std ;#define LL long long#define mod 1000000007#define maxn 100010 阅读全文

摘要： Calculate RoadsTime Limit:5 Seconds Memory Limit:32768 KBLittle Vitta needs to go from home to school every day. On her way to school, there are n crossing and m roads in total. Because of lazy, she often gets up late in the morning. In order to get to school on time, she wishes that she can always 阅读全文

摘要： 488. Dales and HillsTime limit per test: 0.5 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standardLet's consider a number sequence a1, ·s, aN. We call the continuous subsequence ai, ·s, aj, ·s, ak (1 ≤ i at+1 for any j ≤ t at+1 for any i ≤ t #include #include #inc 阅读全文

摘要： 486. "Bulls and Cows"Time limit per test: 0.25 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standardYou probably know the game "bulls and cows". Just in case, we explain the rules. The first player picks a four-digit number with all digits distinct (leading zero 阅读全文

摘要： 499. Greatest Greatest Common DivisorTime limit per test: 0.5 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standardAndrew has just made a breakthrough in sociology: he realized how to predict whether two persons will be good friends or not. It turns out that each person has an inner 阅读全文