結果
問題 | No.2090 否定論理積と充足可能性 |
ユーザー |
👑 ![]() |
提出日時 | 2022-09-30 22:11:26 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,029 bytes |
コンパイル時間 | 4,436 ms |
コンパイル使用メモリ | 259,860 KB |
最終ジャッジ日時 | 2025-02-07 19:33:23 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int,int>#define pil pair<int,ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int,int>>#define vpll vector<pair<ll,ll>>#define vvpii vector<vector<pair<int,int>>>#define vvpll vector<vector<pair<ll,ll>>>template<typename T> void debug(T e){cerr << e << endl;}template<typename T> void debug(vector<T> &v){rep(i, v.size()){cerr << v[i] << " ";}cerr << endl;}template<typename T> void debug(vector<vector<T>> &v){rep(i, v.size()){rep(j, v[i].size()){cerr << v[i][j] << " ";}cerr << endl;}}template<typename T> void debug(vector<pair<T, T>> &v){rep(i,v.size()){cerr << v[i].first << " " << v[i].second << endl;}}template<typename T> void debug(set<T> &st){for (auto itr = st.begin(); itr != st.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(multiset<T> &ms){for (auto itr = ms.begin(); itr != ms.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(map<T, T> &mp){for (auto itr = mp.begin(); itr != mp.end(); itr++){cerr << itr->first << " " << itr->second << endl;}}void debug_out(){cerr << endl;}template <typename Head, typename... Tail>void debug_out(Head H, Tail... T){cerr << H << " ";debug_out(T...);}bool nand(bool a, bool b){bool ret;if (a & b){ret = false;}else{ret = true;}return ret;}int main(){vector<string> a(6);rep(i,6) cin >> a[i];map<string, int> mp;rep(i,6){mp[a[i]]++;}int now = 1;for (auto itr = mp.begin(); itr != mp.end(); itr++){itr->second = now;now++;}vector<int> vec(6);rep(i,6){vec[i] = mp[a[i]];}bool pos = false;for (int i = 0; i < (1 << 7); i++){vector<bool> chart(6);for (int j = 0; j < 6; j++){if ((i >> vec[j]) & 1){chart[j] = true;}else{chart[j] = false;}}if (nand(nand(nand(chart[0], chart[1]), chart[2]), nand(nand(chart[3], chart[4]), chart[5]))){pos = true;}}if (pos) cout << "YES" << endl;else cout << "NO" << endl;}