minecraft magical kingdom

1006: [HNOI2008] Magical Country Time limit:20 Sec Memory limit:162 MBsubmit:3114 solved:1401[Submit] [Status] [Discuss] DescriptionThe Kingdom of K is a country of keen triangle, even people's intercourse also only like the triangle principle. They think triangular relationship: that AB mutual understanding, BC Mutual Understanding, CAMutual understanding, is concise and efficient. In order to con

... There is only n pairs of cognitive relationships between an: (A1A2) (A2A3) ... (AnA1), and there is no other understanding. For example, four-sided relationship refers to ABCD four people ab,bc,cd,da mutual understanding, and ac,bd do not know. When the national competition, in order to prevent the harm, the provision of any pair of mutual understanding of the person must not be in a team, the king knows, at least how many detachment.InputThe first row of two integers n,m. 1OutputOutput an

http://www.lydsy.com/JudgeOnline/problem.php?id=1006 (Topic link)Test instructionsThe minimum number of staining for the chord graph is obtained.Solutionstring diagram, see paper for details.Here I write the Gar of the Nlogn, linear with the N list of links to maintain a bit and then hit the mark to delete on the line.DetailsWA took 2 rounds.Codebzoj1006#include"bzoj1006" hnoi2008-The Magical kingdom

not understand. Basically it means to mark a picture from the beginning of the big, at the same time for points connected to the mark Point du++, the next mark is unmarked Point du the largest point, so as to form a queue in order to dye the queue, each Dianran the smallest color is OK, I do not know why this is right ...1#include 2 intn,m,cnt,ans,u,v,x,t;3 inthead[10005],du[10005],q[10005],col[10005],hash[10005];4 BOOLvis[10005];5 structdata{intTo,next;} e[2000005];6 voidInsintUintv)7{e[++cnt]

structedge{intGo,next;} E[MAXN]; -InlinevoidAddintXinty) the { +E[++tot]= (Edge) {y,head[x]};head[x]=tot; AE[++tot]= (Edge) {x,head[y]};head[y]=tot; the } + intMain () - { $Freopen ("Input.txt","R", stdin); $Freopen ("output.txt","W", stdout); -N=read (); m=read (); - For1 (i,m) Add (read (), read ()); theFor1 (I,n) Q.push (PA (0, i)); -For3 (I,n,1)Wuyi { the while(Id[q.top (). Second]) Q.pop (); - intx=q.top (). Second;q.pop (); WuFor4 (j,x)if(!id[y]) Q.push (PA (+ +)v[y],

, Pq.pop (); +S[i] = u, vis[u] =-1; - for(intj = Fst[u]; J j =e[j].nxt) the { *v =e[j].v; $ if(Vis[v])Continue;Panax NotoginsengPq.push (Make_pair (+ +Label[v], v)); - } the } +memset (Label,0,sizeof(label)); A for(inti = n; I --i) the { + for(intj = Fst[s[i]]; J j =e[j].nxt) -VIS[LABEL[E[J].V]] =i; $ for(intj =1; ; ++j) $ if(Vis[j]! =i) - { -Label[s[i]] = j, ans =Max (ans, j); the Break;

)ExercisesThesis question. See-->CDQ Chord chart and interval diagramCode:#include #include #include #include #include #include using namespace Std;#define N 10010#define M 1000100struct edge{intVNext;} edge[m1];intNm,s, num=0, Head[n],b[n],c[n],d[n],Q[m]; bool Vis[n]={0};intIn () {int x=0; Char Ch=getchar (); while(ch' 0 '|| Ch>' 9 ') Ch=getchar (); while(ch>=' 0 ' ch' 9 ')x=x*10+ch-' 0 ', Ch=getchar ();return x;} void Add (intUintV) {edge[++num].v=v; Edge[num].Next=head[u]; Head[u]=num;}intMai

){ - intx=seq[j],i; the for(intI=head[x];i;i=table[i].next)Bayimark[Color[table[i].to]]=J; the for(i=1; I); thecolor[x]=i; -ans=Max (ans,i); - } theprintf"%d\n", ans); the return 0; the}View Code 1006: [HNOI2008] Magical Country Time limit:20 Sec Memory limit:162 MBsubmit:2208 solved:989[Submit] [Status] [Discuss] DescriptionK Country is a country of keen triangles, even people's contacts only like th

Title Link: BZOJ-1006Problem analysisThis problem is a bare model of the minimum number of staining figures for a chord graph.The minimum coloring method of a string graph is to find out the perfect elimination sequence (MCS algorithm) of the chord graph, and then, in accordance with the perfect elimination sequence, backward forward from backward to the smallest color that each Dianran can dye.The number of colors found is the smallest stain, but also the largest group.Code#include 　　[Bzoj 1006

implementation of MCS: http://tieba.baidu.com/p/2891159900.[Sum]The number of ① of the chord graph = number of colors.② three ways to perfect the elimination sequence: violence, priority queuing, linearity.③ If you want to change the elements in the queue, it is equivalent to re-inserting the elements so that the elements in the original queue do not have an effect.Used in a variety of data structures such as priority queues, linked lists, and more.④ the method of recording time stamp staining.