poursoul

Equivalent SetsTime Limit: 12000/4000 MS (Java/Others)    Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 2587    Accepted Submission(s): 877Problem DescriptionTo prove two

Going from u to v or from v to u?Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 14052Accepted: 3676DescriptionIn order to make their son

Father Christmas flymouseTime Limit: 1000MSMemory Limit: 131072KTotal Submissions: 2513Accepted: 838DescriptionAfter retirement as contestant

The Cow PromTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1152Accepted: 726DescriptionThe N (2 <= N <= 10,000) cows are so excited: it's prom night!

Countries in WarTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2236Accepted: 698DescriptionIn the year 2050, after different attem

Instantaneous TransferenceTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 5581Accepted: 1237DescriptionIt was long ago when we played the game Red

GroupingTime Limit: 2 Seconds      Memory Limit: 65536 KB Suppose there are N people in ZJU, whose ages are unknown. We have some messages about them. Thei-th message shows that the age of

传送门：【CodeForces】467D Fedor and Essay

传送门：【Live Archive】6393 Self-Assembly题目分析：假设我们只用到向上或者向右的块，这样我们只要找到一个回路使得某个块可以和第一个块一样，那么我们就相当于找到了一个循环，这样就可以无限循环了。但是我们要怎样去找这么一个环？考虑到必须是对应字母X+,X−X^+,X^-才能建边，然后一个环中一定是多个一对一对的这样的对应字母组成的。可以发现块的数量那么大也是无所谓的，因为我

题目链接：Metal Processing Plantbitset优化kosaraju，复杂度O(n^2/64)，总复杂度O(n^4/64)。#include <bits/stdc++.h>using namespace std ;typedef long long LL ;typedef pair < int , int > pii ;typedef unsigned long long U

Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22560 Accepted: 9243DescriptionEvery cow's dream is to become the most popular cow in the herd

Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10726 Accepted: 4271DescriptionA number of schools are connected to a computer network.

Cow Ski AreaTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2191Accepted: 627DescriptionFarmer John's cousin, Farmer Ron, who lives i

Consider the following exercise, found in a generic linear algebratextbook.Let A be an n × n matrix. Prove that the followingstatements are equivalent:A is invertible.Ax = b has exactly one solu

Problem B: The Largest CliqueGiven a directed graph G, consider the following transformation. First, create a new graphT(G) to have the same vertex set asG. Create a directed edge betweentwo ver

传送门：【HDU】3861 The King’s Problem题目分析：

Summer HolidayTime Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1489    Accepted Submission(s): 676Problem DescriptionTo see a Wo

Intelligence SystemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1301    Accepted Submission(s): 579Problem DescriptionAfter a

传送门：【HDU】2767 Proving Equivalences

Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1774    Accepted Submission(s): 505Problem DescriptionKids in ki

迷宫城堡Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6600    Accepted Submission(s): 2946Problem Description为了训练小希的方向感，Gardon建立了一座大城堡

The Bottom of a GraphTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 8636Accepted: 3582DescriptionWe will use the following (standard)

题目链接：【HDU】5420 Victor and Proposition#include <bits/stdc++.h>using namespace std ;typedef long long LL ;#define clr( a , x ) memset ( a , x , sizeof a )const int MAXN = 100005 ;const int MAXM = 40000