Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- #include <vector>
- #include <bitset>
- using namespace std;
- #define all(v) v.begin(), v.end()
- int main() {
- int n, k; cin >> n >> k; // количество переменных в скобках, количество скобок
- vector<vector<int>>f(k, vector<int>(n));
- for (int i = 0; i < k; i++) {
- for (int j = 0; j < n; j++) {
- cin >> f[i][j]; // 0 - отрицание переменной, 1 - переменная, -1 - отсутствие переменной
- }
- }
- vector<vector<int>>given = f;
- int cnt = 0;
- vector<int>x(n, -1);
- while (cnt < 10000000) {
- bool saw_only_one = false;
- for (int i = 0; i < k; i++) {
- int only_one = 0; // 0 - not_see, 1 - only_one, 2+ - more than one
- for (int j = 0; j < n; j++) {
- if (f[i][j] != -1) {
- only_one++;
- }
- }
- if (only_one == 1) {
- saw_only_one = true;
- for (int j = 0; j < n; j++) {
- if (f[i][j] == 0) {
- f[i][j] = -1;
- x[j] = 0;
- break;
- } else if (f[i][j] == 1) {
- f[i][j] = -1;
- x[j] = 1;
- break;
- }
- }
- }
- }
- if (saw_only_one == false) {
- for (int i = 0; i < n; i++) {
- x[i] = 0;
- }
- break;
- }
- for (int i = 0; i < f.size(); i++) {
- bool all_minus_one = true;
- for (int j = 0; j < f[i].size(); j++) {
- if (f[i][j] != -1) {
- all_minus_one = false;
- }
- }
- if (all_minus_one == true) {
- cout << "YES\n";
- return 0;
- }
- }
- cnt++;
- }
- for (int i = 0; i < x.size(); i++) {
- if(x[i] == -1) {
- cout << "YES\n";
- return 0;
- }
- }
- for (int i = 0; i < k; i++) {
- int result = 0;
- for (int j = 0; j < n; j++) {
- if (given[i][j] == -1) {
- continue;
- } else if (given[i][j] == 0) {
- result = result | !x[j];
- } else if (given[i][j] == 1) {
- result = result | x[j];
- }
- }
- if (result == 0) {
- cout << "YES\n";
- return 0;
- }
- }
- cout << "NO\n";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement