http://acm.hdu.edu.cn/showproblem.php?pid=5743
令pre[i]为前i个数的和(mod 2)。
题中给的m个限制条件l,r,s,可以转化为pre[r] - pre[l-1] = s,就把区间转化为了点。每个限制条件表示两点间的关系
与其他 pre[] 都没有关系的 pre[i] 可以单独考虑。
而与其他数有限制关系 ,就至少与一个数有关。如果i和j相关,那么确定pre[i] 就能 确定pre[j] 。那么最多只要枚举n/2个pre[i],就能知道所有数的奇偶性。
所以复杂度o(2^(n/2)).
odd[i][j] 的二进制第k位,表示 pre[i]为j时,pre[k]的值
ctl[i] 的二进制第k位,表示pre[i],与pre[k]是否相关(其实ctl[i] = odd[i][0] | odd[i][1],所以可以不要这个变量)
dp[i][j]表示 pre[i]为j的方案数
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
void fre(){freopen("t.txt","r",stdin);}
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
#define ls o<<1
#define rs o<<1|1
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x, y) memcpy(x, y, sizeof(x))
#define debug(x) printf("%d",x);
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
const int N = 45;
const int M = 1e9+7;
template <class T1, class T2>inline void gadd(T1 &a, T2 b) { a+=b; a%=M; }
int n,m,l[N],r[N];
LL odd[N][2],ctl[N];
int vis[N],cnt[N][2],t[N];
int dp[N][2];
int ans;
vector<int>e[N];
void get(LL sta,LL vis)
{
int x,y,flag = 0,lst=0;
for(int i = 1; i <= n; ++i)
{
if(vis>>i & 1)
{
y = lst ^ (sta>>i & 1);
if(y)
{
if(l[i]&1) x = l[i];
else x = l[i]+1;
}
else
{
if(l[i]&1) x = l[i]+1;
else x = l[i];
}
}
else x = l[i];
if(flag) t[i] = x;
else
{
if(x > t[i]) return;
if(x < t[i]) flag = 1,t[i] = x;
}
lst = lst^(x&1);
}
}
void dfs(int pos,LL sta, LL vis)
{
if(pos == n+1)
{
int ret = 0;
for(int i = 0; i < 2; ++i)
{
if(vis>>pos-1 & 1 && (sta>>pos-1 & 1) != i) continue;
gadd(ret,dp[pos-1][i]);
}
if(ret)get(sta,vis);
gadd(ans,ret);
return;
}
dp[pos][0] = dp[pos][1] = 0;
for(int i = 0; i < 2; ++i)
{
if(vis>>pos-1 & 1 && (sta>>pos-1 & 1) != i) continue;
for(int j = 0; j < 2; ++j) gadd(dp[pos][i^j] , (LL)dp[pos-1][i]*cnt[pos][j]%M);
}
if(vis>>pos & 1 || e[pos].empty()) {dfs(pos+1,sta,vis);return;}
if(dp[pos][0]) dfs(pos+1,sta|odd[pos][0],vis|ctl[pos]);
if(dp[pos][1]) dfs(pos+1,sta|odd[pos][1],vis|ctl[pos]);
}
void solve()
{
MS(odd,0),MS(ctl,0);
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; ++i)
{
scanf("%d%d",&l[i],&r[i]);
if(l[i] & 1) cnt[i][1] = (r[i]-l[i])/2+1, cnt[i][0] = r[i]-l[i]+1 - cnt[i][1];
else cnt[i][0] = (r[i]-l[i])/2+1, cnt[i][1] = r[i]-l[i]+1 - cnt[i][0];
}
int u,v,s;
for(int i = 0; i <= n; ++i) e[i].clear(),t[i] = M;
for(int i = 1; i <= m; ++i)
{
scanf("%d%d%d",&u,&v,&s); u--;
e[u].push_back(v<<1 | s);
e[v].push_back(u<<1 | s);
}
for(int i = 0; i <= n; ++i)
{
MS(vis,-1);
queue<int>q; vis[i] = 1;
q.push(i);
while(!q.empty())
{
u = q.front(); q.pop();
ctl[i] |= 1ll<<u; odd[i][vis[u]] |= 1ll<<u;
for(int j = e[u].size()-1; ~j; --j)
{
v = e[u][j]>>1; s = e[u][j]&1;
if(vis[v] != -1)
{
if(vis[v] != (vis[u]^s))
{
printf("0\n-1\n");
return;
}
}
else
{
vis[v] = vis[u]^s;
q.push(v);
}
}
}
}
ans = 0;
dfs(1,odd[0][0],ctl[0]);
if(t[1] == M)
{
printf("0\n-1\n");
return;
}
printf("%d\n",ans);
for(int i = 1; i <= n; ++i) printf("%d%c",t[i],i==n?'\n':' ');
}
int main()
{
dp[0][0] = 1;
int T;
scanf("%d",&T);
while(T--)solve();
return 0;
}