5-6
实验报告大致如图
实验报告已公开1,3班,其他班可加QQ: 979218087 979218087 979218087
因为太短发不出来 下面这个代码是凑篇幅用的
// Problem: Katu Puzzle
// Contest: POJ - POJ Founder Monthly Contest – 2008.07.27
// URL: http://poj.org/problem?id=3678
// Memory Limit: 65 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <queue>
#include <math.h>
#include <set>
#include <stack>
#include <algorithm>
using namespace std;
const int N = 4e6+10,INF = 0x3f3f3f3f;
const double eps = 1e-5;
int h[N],e[N],ne[N],idx;
int dfn[N],low[N],timestamp;
int id[N],scc_cnt,in_stk[N],top,stk[N];
void add(int a,int b){
ne[++idx] = h[a] ,e[idx] = b,h[a] = idx;
}
void tarjan(int u)
{
dfn[u] = low[u] = ++timestamp;
stk[++top] = u ;
in_stk[u] = true;
for(int i = h[u];i;i=ne[i])
{
int j = e[i];
if(!dfn[j])
{
tarjan(j);
low[u] =min(low[u],low[j]);
}else if(in_stk[j])
low[u] =min(low[u],dfn[u]);
}
if(dfn[u] == low[u])
{
int y;
++scc_cnt;
do{
y = stk[top--];
in_stk[y] =false;
id[y] = scc_cnt;
}while(y!=u);
}
}
int n,m;
char s[N];
void solve(){
cin>>n>>m;
while(m -- ){
int a,b,c;cin>>a>>b>>c;
a++;
b++;
std::cin>>s;
///cout<<s<<endl;
if(s[0] == 'A'){
if(c) add(a,a+n),add(b,b+n);
else add(a+n,b),add(b+n,a);
}else if(s[0] == 'O'){
if(c) add(b,a+n),add(b,a+n);
else add(a+n,a),add(b+n,b);
}else{
if(c) add(a,b+n),add(b,a+n),add(b+n,a),add(a+n,b);
else add(a,b),add(b,a),add(a+n,b+n),add(b+n,a+n);
}
}
for(int i=1;i<=n;i++)
if(!dfn[i]) tarjan(i);
for(int i=1;i<=n;i++){
if(id[i] == id[i+n]){
cout<<"NO"<<endl;
return;
}
}
cout<<"YES"<<endl;
}
int main(){
//int t;cin>>t;while(t--)
solve();
return 0 ;
}