【BZOJ】2102: [Usaco2010 Dec]The Trough Game(暴力)
The 暴力 BZOJ Game Dec
2023-09-27 14:22:21 时间
http://www.lydsy.com/JudgeOnline/problem.php?id=2102
直接枚举所有情况。。。。。。然后判断是否可行。。
#include <cstdio> #include <cstring> #include <cmath> #include <string> #include <iostream> #include <algorithm> #include <queue> using namespace std; #define rep(i, n) for(int i=0; i<(n); ++i) #define for1(i,a,n) for(int i=(a);i<=(n);++i) #define for2(i,a,n) for(int i=(a);i<(n);++i) #define for3(i,a,n) for(int i=(a);i>=(n);--i) #define for4(i,a,n) for(int i=(a);i>(n);--i) #define CC(i,a) memset(i,a,sizeof(i)) #define read(a) a=getint() #define print(a) printf("%d", a) #define dbg(x) cout << #x << " = " << x << endl #define printarr2(a, b, c) for1(i, 1, b) { for1(j, 1, c) cout << a[i][j]; cout << endl; } #define printarr1(a, b) for1(i, 1, b) cout << a[i]; cout << endl inline const int getint() { int r=0, k=1; char c=getchar(); for(; c<'0'||c>'9'; c=getchar()) if(c=='-') k=-1; for(; c>='0'&&c<='9'; c=getchar()) r=r*10+c-'0'; return k*r; } inline const int max(const int &a, const int &b) { return a>b?a:b; } inline const int min(const int &a, const int &b) { return a<b?a:b; } const int N=105; int n, m, cnt, ans, a[N][N], b[N]; bool check(int t) { for1(i, 1, m) { int tot=0; rep(j, n) if(a[i][j] && (t&(1<<j))) ++tot; if(tot!=b[i]) return 0; } return 1; } int main() { read(n); read(m); for1(i, 1, m) { rep(j, n) { char ch=getchar(); while(ch<'0'||ch>'9') ch=getchar(); a[i][j]=ch-'0'; } b[i]=getint(); } int mx=(1<<n)-1, flag=0; for1(x, 0, mx) { if(check(x)) { if(cnt) { puts("NOT UNIQUE"); return 0; } flag=1; ans=x; ++cnt; } } if(!flag) puts("IMPOSSIBLE"); else rep(i, n) printf("%d", (bool)(ans&(1<<i))); return 0; }
Description
Farmer John and Bessie are playing games again. This one has to do with troughs of water. Farmer John has hidden N (1 <= N <= 20) troughs behind the barn, and has filled some of them with food. Bessie has asked M (1 <= M <= 100) questions of the form, "How many troughs from this list (which she recites) are filled?". Bessie needs your help to deduce which troughs are actually filled. Consider an example with four troughs where Bessie has asked these questions (and received the indicated answers): 1) "How many of these troughs are filled: trough 1" --> 1 trough is filled 2) "How many of these troughs are filled: troughs 2 and 3" --> 1 trough is filled 3) "How many of these troughs are filled: troughs 1 and 4" --> 1 trough is filled 4) "How many of these troughs are filled: troughs 3 and 4" --> 1 trough is filled From question 1, we know trough 1 is filled. From question 3, we then know trough 4 is empty. From question 4, we then know that trough 3 is filled. From question 2, we then know that trough 2 is empty. 求N位二进制数X,使得给定的M个数,满足X and Bi=Ci ,Bi ci分别是读入的两个数
Input
* Line 1: Two space-separated integers: N and M * Lines 2..M+1: A subset of troughs, specified as a sequence of contiguous N 0's and 1's, followed by a single integer that is the number of troughs in the specified subset that are filled.
Output
* Line 1: A single line with: * The string "IMPOSSIBLE" if there is no possible set of filled troughs compatible with Farmer John's answers. * The string "NOT UNIQUE" if Bessie cannot determine from the given data exactly what troughs are filled. * Otherwise, a sequence of contiguous N 0's and 1's specifying which troughs are filled.
Sample Input
4 4
1000 1
0110 1
1001 1
0011 1
1000 1
0110 1
1001 1
0011 1
Sample Output
1010
HINT
Source
相关文章
- What can be the reasons of connection refused errors?
- What is the difference between --save and --save-dev?
- What is the difference between POST and GET?
- This may cause things to work incorrectly. Make sure to use the same version for both. If you are us
- HDU 4462 Scaring the Birds (暴力求解,二进制法)
- HDU 5443 The Water Problem (水题,暴力)
- CodeForces 288B Polo the Penguin and Houses (暴力或都快速幂)
- MYSQL : The user specified as a definer ('root'@'%') does not exist
- [daily paper 10]2023 03 10 2014 217 Efficient SpMV on GPUs using the CSR storage format
- Design Patterns Uncovered: The Chain Of Responsibility Pattern