CodeForce 1072-B. Curiosity Has No Limits
题目链接
题目大意:
给出两个数组a,b长度均为n-1
问能否构造出长度为n的t数组,满足
1、a[i] = t[i] | t[i+1]
2、b[i] = t[i] & t[i+1]
解题思路:
对所有情况枚举输出。
emmmmmm。。。。可以发现对应于一个确定的t[i] 和 a[i] 以及 b[i] t[i+1] 的值要么存在且唯一,要么不存在。所以可以先打个map表,把t[i] 在a[i] b[i] 情况下的t[i+1]存一下。然后枚举第一个t1的四种情况就行啦~
ps1:给定t1,以后的t[i+1]都能由前一个t[i]推出,所以要么存在唯一t数组,要么不存在。
ps2:可以直接DFS,因为好写,情况数唯一的话递归不会广度扩散,时间效率上看和直接递推
比差不了多少。最差情况都是O(4*n)
AC代码
递推Version
/*
* @Author: Achan
* @Date: 2018-10-22 16:43:16
* @Last Modified by: Achan
* @Last Modified time: 2018-10-24 14:57:03
*/
#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
#define X first
#define Y second
#define eps 1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))
#define rep(i,j,k) for(int i=j;i<k;i++)
#define per(i,j,k) for(int i=j;i<=k;i++)
#define io std::ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
typedef long long ll;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1e18 ;
const int mod = 1e9+7;
const int maxn = 1e5+2;
int a[maxn],b[maxn],t[maxn];
bool flag;
int n;
map <pii, int> mp[4];
void init()
{
rep(i,0,(1<<2)) //遍历所有的a[i]
{
rep(j,0,(1<<2)) //遍历b[i]
{
pii p = make_pair(i,j);
rep(t1,0,(1<<2)) //所有t[i-1]
{
flag = 0;
rep(t2,0,(1<<2)) //所有t[i]
if( (t1|t2) == i && (t1&t2) == j )
{
mp[t1][p] = t2, flag = 1;
break;
}
if(!flag) mp[t1][p] = -1;
}
}
}
}
int main(void)
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
io
init();
while(cin>>n)
{
flag = 1;
rep(i,1,n) cin>>a[i];
rep(i,1,n) cin>>b[i];
rep(i,0,(1<<2))
{
flag = 1;
t[1] = i;
per(j,2,n)
{
int nxt = mp[t[j-1]][make_pair(a[j-1],b[j-1])];
if(nxt == -1) {flag = 0; break;}
t[j] = nxt;
}
if(flag)
{
cout<<"Yes"<<endl;
per(j,1,n) cout<<t[j]<<" ";
cout<<endl;
break;
}
}
if(!flag) puts("No");
}
}
DFS Version
#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
#define X first
#define Y second
#define eps 1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))
#define rep(i,j,k) for(int i=j;i<k;i++)
#define per(i,j,k) for(int i=j;i<=k;i++)
#define io std::ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
typedef long long ll;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1e18 ;
const int mod = 1e9+7;
const int maxn = 1e5+2;
int a[maxn],b[maxn],t[maxn];
bool dp[4][4];
bool flag;
int n;
void init()
{
rep(i,0,(1<<2))
{
rep(j,0,(1<<2))
{
rep(k,0,(1<<2)) rep(l,0,(1<<2))
if( (k|l) == i && (k&l) == j )
dp[i][j] = 1; //只有部分a[i] b[i]的组合有对应的t1 t2 ,可以在输入时特判
// cout<<i<<" "<< j<<" ---->"<<k<<" "<< l<<" "<<endl;
}
}
//rep(i,0,4) rep(j,0,4) cout<<i<<" "<< j<<" "<<dp[i][j]<<endl;
}
void DFS(int u)
{
if(flag || u>n) return;
rep(i,0,(1<<2))
{
t[u] = i; //遍历所有四种情况
if( (t[u-1] | t[u]) == a[u-1] && (t[u-1] & t[u]) == b[u-1] )
{
if(u==n) {
flag = 1;
cout<<"Yes"<<endl;
per(j,1,n) cout<<t[j]<<" ";
cout<<endl;
return;
}
DFS(u+1);
}
}
}
//#define LOCAL
int main(void)
{
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#endif
io
init();
while(cin>>n)
{
flag = 1;
rep(i,1,n) cin>>a[i];
rep(i,1,n)
{
cin>>b[i];
if(dp[a[i]][b[i]]) continue;
flag = 0; //不可能的a[i] b[i]情况肯定找不到t数组!!
}
if(!flag) { puts("No"); continue;}
flag = 0;
rep(i,0,(1<<2))
{
t[1] = i;
DFS(2);
if(flag) break;
}
if(!flag) puts("No");
}
}