結果
問題 | No.2090 否定論理積と充足可能性 |
ユーザー |
![]() |
提出日時 | 2022-09-30 21:56:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,401 bytes |
コンパイル時間 | 3,894 ms |
コンパイル使用メモリ | 252,444 KB |
最終ジャッジ日時 | 2025-02-07 19:27:14 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;using ll = long long;using pl = std::pair<long long, long long>;using mint = atcoder::modint1000000007;//using mint = atcoder::modint998244353;#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)#define all(v) (v).begin(), (v).end()#define dump(var) do{ if(debug::enable) { std::cerr << #var << " : "; debug::print(var); } } while(0);constexpr int di[4] = {1, -1, 0, 0};constexpr int dj[4] = {0, 0, 1, -1};constexpr long long inf = 1LL<<60;template<typename T> inline void chmax(T &a, T b) { a = std::max(a, b); };template<typename T> inline void chmin(T &a, T b) { a = std::min(a, b); };template<typename T> void vprint(const std::vector<T>& v) { for(int i = 0; i < v.size(); i++) { std::cout << v[i] << (i == v.size()-1 ? "\n" : " "); }}template<typename T> void vprintln(const std::vector<T>& v) { for(int i = 0; i < v.size(); i++) { std::cout << v[i] << "\n"; } }template<int M> void vprint(const std::vector<atcoder::static_modint<M>>& v) { for(int i = 0; i < v.size(); i++) { std::cout << v[i].val() << (i == v.size()-1 ? "\n" : " "); } }template<int M> void vprintln(const std::vector<atcoder::static_modint<M>>& v) { for(int i = 0; i < v.size(); i++) { std::cout << v[i].val() << "\n";} }namespace debug {#if defined(ONLINE_JUDGE)const bool enable = false;#elseconst bool enable = true;#endiftemplate<typename T> void push(const T& e) { std::cerr << e; }template<int M> void push(const atcoder::static_modint<M>& e) { std::cerr << e.val(); }template<typename T1, typename T2> void push(const std::pair<T1, T2>& e) { std::cerr << "("; push(e.first); std::cerr << ","; push(e.second); std::cerr << ")"; }template<typename T1, typename T2, typename T3> void push(const std::tuple<T1, T2, T3>& e) { std::cerr << "("; push(get<0>(e)); std::cerr << ",";push(get<1>(e)); std::cerr << ","; push(get<2>(e)); std::cerr << ")"; }template<typename T> void print(const T& e) { push(e); std::cerr << "\n"; }template<typename T> void print(const std::vector<T>& v) { for(int i = 0; i < v.size(); i++) { push(v[i]); std::cerr << " "; } std::cerr << "\n";}template<typename T> void print(const std::vector<std::vector<T>>& v) { std::cerr << "\n"; for(int i = 0; i < v.size(); i++) { std::cerr << i << ": "; print(v[i]); } }};bool nand(bool a, bool b) {return !(a && b);}const ll n = 6;bool check1(ll bit) {vector<bool> p(n);rep(i, 0, n) p[i] = (bit & (1<<i));bool f1 = nand(p[0], p[1]);bool f2 = nand(p[2], f1);bool f3 = nand(p[3], p[4]);bool f4 = nand(f3, p[5]);return nand(f2, f4);}void solve() {vector<string> s(n);rep(i, 0, n) cin >> s[i];auto check2 = [&](ll bit) -> bool {rep(i, 0, n) {rep(j, i+1, n) {if(s[i] == s[j]) {bool z1 = bit & (1<<i);bool z2 = bit & (1<<j);if(z1 != z2) return false;}}}return true;};rep(bit, 0, 1<<n) {if(check1(bit) && check2(bit)) {cout << "YES" << endl;return;}}cout << "NO" << endl;}int main() {ios::sync_with_stdio(false);cin.tie(nullptr);solve();return 0;}