POJ 3207 Ikki's Story IV - Panda's Trick

简单的看了2-sat……似乎还是挺神奇的东西……等大致刷完几道题再来写总结吧!

而这道题……算是2-sat的超级入门题了吧

不过题目大意也是醉了:圆上顺序排列n个点,现要在一些点间连边,规定边只能在圆内或圆外,求有没有可能不相交 。一开始想的是嗷嗷嗷,圆上两个点的连线怎么可能有什么在圆外在圆内之分,不都是弦么?后来才知道……原来两个点的连线不是直线可以使曲线……

判定是否相交很简单吧……看成是一条直线上四个点,那么如果e1.a<e2.a<e1.b<e2.b就相交啦……

都说是热身题没多难……

type
  arr1=record
    a,b:longint;
  end;
  arr2=record
    toward,next:longint;
  end;

var
  e:array[0..3000]of arr1;
  edge:array[0..3000]of arr2;
  first,dfn,low,scc,p,num1,num2:array[0..3000]of longint;
  chose:array[0..3000]of boolean;
  time,total,tot,n,m,tail,sum:longint;

procedure swap(var x,y:longint);
var
  i:longint;
begin
  i:=x;
  x:=y;
  y:=i;
end;

procedure addedge(j,k:longint);
begin
  inc(total);
  edge[total].toward:=k;
  edge[total].next:=first[j];
  first[j]:=total;
end;

procedure add(j,k:longint);
begin
  addedge(j,k);
  addedge(k,j);
end;

function check(x,y:arr1):boolean;
begin
  if (x.a<y.a) and (y.a<x.b) and (x.b<y.b) then exit(true);
  exit(false);
end;

procedure tarjan(x:longint);
var
  i,too,j:longint;
begin
  inc(time);
  dfn[x]:=time;
  low[x]:=time;
  chose[x]:=true;
  inc(tail);
  p[tail]:=x;
  i:=first[x];
  while i>0 do begin
    too:=edge[i].toward;
    if dfn[too]=0 then begin
      tarjan(too);
      if low[too]<low[x] then low[x]:=low[too];
    end
    else
      if dfn[too]<low[x] then low[x]:=dfn[too];
    i:=edge[i].next;
  end;
  if dfn[x]=low[x] then begin
    inc(sum);
    repeat
      j:=p[tail];
      dec(tail);
      chose[j]:=false;
      scc[j]:=sum;
    until j=x;
  end;
end;

procedure into;
var
  i,j:longint;
begin
  readln(n,m);
  for i:=1 to m do begin
    read(e[i].a,e[i].b);
    if e[i].a>e[i].b then swap(e[i].a,e[i].b);
    inc(tot);
    num1[i]:=tot;
    inc(tot);
    num2[i]:=tot;
  end;
  for i:=1 to m-1 do
    for j:=i+1 to m do
      if check(e[i],e[j]) or check(e[j],e[i]) then begin
        add(num1[i],num2[j]);
        add(num2[i],num1[j]);
      end;
end;

function work:boolean;
var
  i:longint;
begin
  for i:=1 to tot do
    if dfn[i]=0 then tarjan(i);
  for i:=1 to m do
    if scc[num1[i]]=scc[num2[i]] then exit(false);
  exit(true);
end;

begin
  into;
  if work then writeln(‘panda is telling the truth...‘)
    else writeln(‘the evil panda is lying again‘);
end.

POJ 3207 Ikki's Story IV - Panda's Trick

时间: 2024-07-28 20:41:04

POJ 3207 Ikki's Story IV - Panda's Trick的相关文章

POJ 3207 Ikki&#39;s Story IV - Panda&#39;s Trick (2-SAT)

题目地址:POJ 3207 找好矛盾关系,矛盾关系是(2,5)和(3,6)这两个只能一个在外边,一个在里边,利用这个矛盾关系来建图. 可以用在外边和里边来当1和0,最后判断每对是否出现矛盾. 代码如下: #include <iostream> #include <cstdio> #include <string> #include <cstring> #include <stdlib.h> #include <math.h> #inc

POJ 3207 Ikki&#39;s Story IV - Panda&#39;s Trick(2 - sat啊)

题目链接:http://poj.org/problem?id=3207 Description liympanda, one of Ikki's friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play another game with Ikki. liy

POJ 3207 Ikki&#39;s Story IV - Panda&#39;s Trick(2-sat)

POJ 3207 Ikki's Story IV - Panda's Trick 题目链接 题意:一个圆上顺序n个点,然后有m组连线,连接两点,要求这两点可以往圆内或圆外,问是否能构造出使得满足所有线段不相交 思路:2-sat,判断相交的建边,一个在内,一个在外,然后跑一下2-sat即可 代码: #include <cstdio> #include <cstring> #include <cstdlib> #include <vector> #include

[2-SAT] poj 3207 Ikki&#39;s Story IV - Panda&#39;s Trick

题目链接: http://poj.org/problem?id=3207 Ikki's Story IV - Panda's Trick Time Limit: 1000MS   Memory Limit: 131072K Total Submissions: 8063   Accepted: 2969 Description liympanda, one of Ikki's friend, likes playing games with Ikki. Today after minesweep

poj 3207 Ikki&#39;s Story IV - Panda&#39;s Trick【2-set】

题目:poj 3207 Ikki's Story IV - Panda's Trick 题意:给出一个有(0-n-1)组成的圆,然后连接上面的一些点,可以选择从圆内部连接或者内部连接,然后问你所有的都不想交可不可行 分析:对于每条Link,要么在圆外,要么在圆内,且不可同时满足, 只能两者取一,判断这M条Link是否合法,也就是M条Link不冲突, 这就是典型的2-sat问题了. 将每条Link i 看做一个点,如果Link在圆内, 则选做i ,如果在圆外, 则选做i'.对于两条线(i,j) ,

POJ 3207 Ikki&#39;s Story IV - Panda&#39;s Trick(2-sat判解存在性)

题意:平面上,一个圆,圆的边上按顺时针放着n个点.现在要连m条边,比如a,b,那么a到b可以从圆的内部连接,也可以从圆的外部连接.给你的信息中,每个点最多只会连接的一条边.问能不能连接这m条边,使这些边都不相交. 算比较裸的题目了,关键找到如何判断两对点交不交叉的关系就好 #include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<vector&g

【POJ】3207 Ikki&#39;s Story IV - Panda&#39;s Trick

http://poj.org/problem?id=3207 题意:一个圆上顺时针依次排列着标号为1-n的点,这些点之间共有m条边相连,每两个点只能在圆内或者圆外连边.问是否存在这些边不相交的方案.(n<=1000, m<=500) #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <iostream> using n

HDU 3207 Ikki&#39;s Story IV - Panda&#39;s Trick(图论-2SAT,图论-tarjan)

Ikki's Story IV - Panda's Trick Time Limit: 1000MS   Memory Limit: 131072K Total Submissions: 7821   Accepted: 2892 Description liympanda, one of Ikki's friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many tim

Ikki&#39;s Story IV - Panda&#39;s Trick (poj 3207 2-SAT)

Language: Default Ikki's Story IV - Panda's Trick Time Limit: 1000MS   Memory Limit: 131072K Total Submissions: 8796   Accepted: 3241 Description liympanda, one of Ikki's friend, likes playing games with Ikki. Today after minesweeping with Ikki and w