Go Deeper

Go Deeper

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 21 Accepted Submission(s): 10

Problem Description

Here is a procedure's pseudocode:

go(int dep, int n, int m)
begin
output the value of dep.
if dep < m and x[a[dep]] + x[b[dep]] != c[dep] then go(dep + 1, n, m)
end

In this code n is an integer. a, b, c and x are 4 arrays of integers. The index of array always starts from 0. Array a and b consist of non-negative integers smaller than n. Array x consists of only 0 and 1. Array c consists of only 0, 1 and 2. The lengths of array a, b and c are m while the length of array x is n. Given the elements of array a, b, and c, when we call the procedure go(0, n, m) what is the maximal possible value the procedure may output?

 

Input

There are multiple test cases. The first line of input is an integer T (0 < T ≤ 100), indicating the number of test cases. Then T test cases follow. Each case starts with a line of 2 integers n and m (0 < n ≤ 200, 0 < m ≤ 10000). Then m lines of 3 integers follow. The i-th(1 ≤ i ≤ m) line of them are a_i-1 ,b_i-1 and c_i-1 (0 ≤ a_i-1, b_i-1 < n, 0 ≤ c_i-1 ≤ 2).

 

Output

For each test case, output the result in a single line.

 

Sample Input

3
2 1
0 1 0
2 1
0 0 0
2 2
0 1 0
1 1 2

 

Sample Output

1
1
2

 

Author

CAO, Peng

 

Source

The 2010 ACM-ICPC Asia Chengdu Regional Contest

 

Recommend

zhouzeyong

 

/*
题意：给出递归函数：
    void go(int dep, int n, int m){
        printf("%d\n",dep);
        if(dep<m&&x[a[dep]]+x[b[dep]]!=c[dep])
            go(dep + 1, n, m);
    }
    其中，a,b数组的元素小于n 数组长度为m，c数组的元素只有 0,1,2 数组长度为m, x数组的元素只有0，1现在给出a,b,c
    数组的元素，问你这个输出的dep最大是多少，也就是递归最多的次数。

初步思路：分析条件：dep<m&&x[a[dep]]+x[b[dep]]!=c[dep] m是最大可能的递归次数，并且x[a[dep]]+x[b[dep]]!=c[dep]
    实际上是x[a[dep]]+x[b[dep]]和c[dep]是不能共存的，也就是说有如下几种情况：
        c[dep]==0：x[a[dep]]和x[b[dep]]，必定至少有一个为真
        c[dep]==1：x[a[dep]]和x[b[dep]]，只能都为真都为假
        c[dep]==2：x[a[dep]]和x[b[dep]]，不能都为真
    由上面三种情况，二分递归的次数，判断的规则就是2-SAT跑的结果
*/
#include<bits/stdc++.h>
using namespace std;
int t;
int n,m;
int a[],b[],c[],x[];
/*********************************************2-SAT模板*********************************************/
const int maxn=+;
struct TwoSAT
{
    int n;//原始图的节点数(未翻倍)
    vector<int> G[maxn*];//G[i].j表示如果mark[i]=true,那么mark[j]也要=true
    bool mark[maxn*];//标记
    int S[maxn*],c;//S和c用来记录一次dfs遍历的所有节点编号

    //从x执行dfs遍历,途径的所有点都标记
    //如果不能标记,那么返回false
    bool dfs(int x)
    {
        if(mark[x^]) return false;//这两句的位置不能调换
        if(mark[x]) return true;
        mark[x]=true;
        S[c++]=x;
        for(int i=;i<G[x].size();i++)
            if(!dfs(G[x][i])) return false;
        return true;
    }

    void init(int n)
    {
        this->n=n;
        for(int i=;i<*n;i++)
            G[i].clear();
        memset(mark,,sizeof(mark));
    }

    //加入(x,xval)或(y,yval)条件
    //xval=0表示假，yval=1表示真
    void add_clause(int x,int xval,int y,int yval)//这个地方不是一尘不变的，而是参照问题的约束条件进行加边
    {
        G[*x+xval].push_back(y*+yval);
    }

    //判断当前2-SAT问题是否有解
    bool solve()
    {
        for(int i=;i<*n;i+=)
        if(!mark[i] && !mark[i+])
        {
            c=;
            if(!dfs(i))
            {
                while(c>) mark[S[--c]]=false;
                if(!dfs(i+)) return false;
            }
        }
        return true;
    }
}TS;
/*********************************************2-SAT模板*********************************************/
void build(int mid){
    TS.init(n);
    for(int i=;i<mid;i++){
        switch(c[i]){
            case :
                TS.add_clause(a[i],,b[i],);
                TS.add_clause(b[i],,a[i],);
                break;//不能都为假
            case :
                TS.add_clause(a[i],,b[i],);
                TS.add_clause(b[i],,a[i],);
                TS.add_clause(a[i],,b[i],);
                TS.add_clause(b[i],,a[i],);
                break;//同真同假
            case :
                TS.add_clause(a[i],,b[i],);
                TS.add_clause(b[i],,a[i],);
                break;//不能同真
        }
    }
}
int main(){
    // freopen("in.txt","r",stdin);
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        for(int i=;i<m;i++){
            scanf("%d%d%d",&a[i],&b[i],&c[i]);
        }
        int l=,r=m;
        while(l<=r){
            int mid=(l+r)/;
            build(mid);
            if(TS.solve()==true) l=mid+;
            else r=mid-;
        }
        printf("%d\n",l-);
    }
    return ;
}