csu and dsu

].v; -Ans = (ans + a[u] * B[v]% MOD)%MOD; -A[V] = (A[u] + a[v])%MOD; ---inch[v]; - if(inch[v] = =0) Que.push (v); - } in } - } to + intMain () { - while(~SCANF ("%d%d", n, m)) { the for(inti =1; I "%lld%lld", a[i], b[i]); *Ans = tot =0; $Memset (Head,-1,sizeof(head));Panax NotoginsengMemsetinch,0,sizeof(inch)); - for(inti =1; I ) { the intU, v; scanf"%d%d", u, v); +ADD (U, v);inch[v]++; A } the BFS (); +printf"%lld\n", ans%MOD);

corresponding to the count (i,j) *BJ and then by AI, accumulation is the answer, note here to be similar to the topological sort, but to do backwards, to avoid the aftereffect of Reference blog HTTP/ blog.csdn.net/qq_21057881/article/details/52431139#include #includestring.h>#include#include#include#includeusing namespacestd;#defineLL Long LongConst intMAXN = 1e5+7;Const intMoD = 1e9+7; Vectorint>E[MAXN];intA[MAXN],B[MAXN],D[MAXN];intANS[MAXN];intMain () {intn,m; while(Cin >> N >>m) {

->next->Next; thePk1->prior=pk1->prior->Prior; the +P1=pend->Prior; -pk->next=Pend; thePk->prior=P1;Bayip1->next=PK; thePend->prior=PK; the } - Else - { thescanf"%d%d",k,d); the thePk=mp[k]->Next; thePk_1=pk->Prior; -Pk1=pk->Next; thePk_1->next=pk_1->next->Next; thePk1->prior=pk1->prior->Prior; the 94P1=mp[d]->Next; theP2=p1->Next; thepk->next=P2; thePk->prior=P1;98p1->next=PK; AboutP2->prior=PK; - }101 //printf ("Step%d has been comp

Links:http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1612Test instructions: Give a matrix a size n*n, B = a^1 + a^2 + a^3 + .... A^n, there are no 0 items in B.The title can be converted to n points numbered 1-n, for any point V, after some arbitrary step to reach U (U for any point set of any one). In discrete mathematics, the matrix-related knowledge a^k of graphs represents the number of steps in the matrix from I to J in step K.The question is whether the graph is strong or not.Learn the K

;Ten intV[MAXN]; One intF[MAXN]; A intMain () - { - intn,m,qu,i,j,k,sum,a,b,t,da,o=1; the intLpintRpint*p; - while(~SCANF (" %d%d%d",n,m,qu)) - { -Memset (F,0,sizeof(f)); +a=-1, sum=0, da=0; - for(i=0; i) +scanf"%d",v[i]); ASort (v,v+n); at for(i=0; i) - { -scanf"%d%d",b,t); -Lp=lower_bound (v,v+n,a+1)-v; -Rp=lower_bound (v,v+n,b+1)-v; -f[lp]+=1; inf[rp]-=1; -A=T; to } + for(i=0; i) - { thef[i]+=sum; *sum=F[i]; $ if(

1323:zzy and his little friendsTime Limit:5 Sec Memory limit:256 MB submit:239 solved:103 [Submit] [Status] [Web Board] Description Zzy raised a little monster and N Bump man, singled out every bump is not the opponent of the small monster, so must be two bump-man cooperation to fight with the small monsters. The combat effectiveness of bump man A and bump man B is the difference or value of their combat effectiveness. Now it is up to the zzy to fight the little monsters by electing two from th

1855:shut the Box Submit Page    Summary    time limit:1 sec     Memory Limit : 256 mb     submitted:37     solved:9     Description Shut the Box is a one-player game, begins with a set of n pieces labeled from 1 to N. All pieces are initially '

Tan Songsong's travel plans Time limit:3000/1000ms (java/others) Memory limit:65535/65535kb (java/others)Submit Status Tan Songsong is a person who loves to travel, he loves traveling very much, even if the body is emptied also must insist on

Topic link Pigs can ' t take a sudden turn Time limit:1000 Ms Memory limit:65536 KB problem Descrpition You maybe has aced a question about computational Geometry,which describes the dogs ' journey and calculate the shortest D Istance between them.

" topic link ": Click here " main idea": Calculate x1^m+x2^m+. Xn^m (1 " Thinking of Solving problems ": fast power-taking mode Code: Solution One: #include #define LL Long Long using namespace std; Const LL mod= (LL) 1e9+7; ll Pow_mod (ll a,ll p,

1510:happy RobotTime limit:1 Sec Memory limit:128 MBsubmit:19 Solved:7DescriptionInputThere'll is at the most test cases. Each case contains a command sequence with no more than characters.OutputFor each test case, print the case number, followed by

DP is a simple question. It was previously written using a for loop. This time it is written using state recursion. I feel that the idea is clearer than before. 1 #include 2 #include 3 const int maxm=500+5,maxn=1000+5; 4 int

Question link: http://acm.csu.edu.cn/OnlineJudge/problem.php? Id = 1290 Question: Given the number of K, you can generate any number in 0-n-1 each time. The mathematical expectation of the number of K numbers with different integers 1 # include 2

1460: KastenlaufTime Limit: 1 Sec Memory Limit: 128 MB Submit: 90 Solved: 28 [Submit] [Status] [Web Board] Description Input Output Sample Input 220 01000 01000 10002000 100020 01000 02000 10002000 2000Sample Output happysad A. Drink once every 50

1459: ChessTime Limit: 1 Sec Memory Limit: 128 MB Special Judge Submit: 58 Solved: 31 [Submit] [Status] [Web Board] Description Input Output Sample Input 3E 2 E 3F 1 E 8A 3 A 3Sample Output Impossible2 F 1 B 5 E 80 A 3 Given the start point and

1458: BookingTime Limit: 3 Sec Memory Limit: 128 MB Submit: 116 Solved: 27 [Submit] [Status] [Web Board] Description Input Output Sample Input 42 1201 2013-07-01 15:59 2013-07-08 16:302 2013-07-08 17:30 2013-07-15 12:003 6065 2013-07-08 14:30 2013-

1601:war time limit:1 Sec Memory limit:128 MBsubmit:127 solved:36[Submit] [Status] [Web Board] DescriptionAME decided to destroy CH ' s country. In CH ' country, there is N villages, which is numbered from 1 to N. We say village A and B are

DescriptionInputThe input contains no more than 10000 sets of data. Each set of data contains 6 integers r1, C1, R2, C2, R3, C3 (1OutputFor each set of data, the test point number and the minimum number of steps are output.Sample Input1 1 8 7 5 (1 3

Description Input Output Sample Input 35 3 4 15 3 110 2 2 3 3100 1 100 1 2 Sample output 4350 Question: calculate the number of elements with the same equidifference Sequence Idea: first, we can assume that the solution is F1 + D1 * k1

/* The Shortest Path + the minimum spanning tree. A graph is given, starting point, and ending point. Find the path from the start point to the end point (the longest section of this path must be the shortest !) Enumerate the "Longest path", which