結果
問題 | No.2090 否定論理積と充足可能性 |
ユーザー |
![]() |
提出日時 | 2022-09-30 22:07:09 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 6,555 bytes |
コンパイル時間 | 2,001 ms |
コンパイル使用メモリ | 194,668 KB |
最終ジャッジ日時 | 2025-02-07 19:31:28 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of ‘void input(Head&&, Tail&& ...) [with Head = std::vector<std::__cxx11::basic_string<char> >&; Tail = {}]’: main.cpp:240:10: required from here main.cpp:48:9: error: no match for ‘operator>>’ (operand types are ‘std::istream’ {aka ‘std::basic_istream<char>’} and ‘std::vector<std::__cxx11::basic_string<char> >’) 48 | cin >> head; | ~~~~^~~~~~~ In file included from /usr/include/c++/13/sstream:40, from /usr/include/c++/13/complex:45, from /usr/include/c++/13/ccomplex:39, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127, from main.cpp:1: /usr/include/c++/13/istream:325:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]’ 325 | operator>>(void*& __p) | ^~~~~~~~ /usr/include/c++/13/istream:325:25: note: no known conversion for argument 1 from ‘std::vector<std::__cxx11::basic_string<char> >’ to ‘void*&’ 325 | operator>>(void*& __p) | ~~~~~~~^~~ /usr/include/c++/13/istream:224:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]’ 224 | operator>>(long double& __f) | ^~~~~~~~ /usr/include/c++/13/istream:224:31: note: no known conversion for argument 1 from ‘std::vector<std::__cxx11::basic_string<char> >’ to ‘long double&’ 224 | operator>>(long double& __f) | ~~~~~~~~~~~~~^~~ /usr/include/c++/13/istream:220:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(double&) [with _CharT =
ソースコード
#include "bits/stdc++.h"#pragma GCC optimize("Ofast")// Begin Header {{{#pragma regionusing namespace std;#ifndef DEBUG#define dump(...)#endif#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)#define var(Type, ...) \Type __VA_ARGS__; \input(__VA_ARGS__)#define let const autoconstexpr size_t operator""_zu(unsigned long long value) {return value;};constexpr intmax_t operator""_jd(unsigned long long value) {return value;};constexpr uintmax_t operator""_ju(unsigned long long value) {return value;};constexpr int INF = 0x3f3f3f3f;constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;using usize = size_t;using imax = intmax_t;using uimax = uintmax_t;using ld = long double;template <class T, class Compare = less<>>using MaxHeap = priority_queue<T, vector<T>, Compare>;template <class T, class Compare = greater<>>using MinHeap = priority_queue<T, vector<T>, Compare>;inline void input() {}template <class Head, class... Tail>inline void input(Head&& head, Tail&&... tail) {cin >> head;input(forward<Tail>(tail)...);}template <class Container, class Value = typename Container::value_type,enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>inline istream& operator>>(istream& is, Container& vs) {for (auto& v: vs) is >> v;return is;}template <class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) {is >> p.first >> p.second;return is;}inline void output() {cout << "\n";}template <class Head, class... Tail>inline void output(Head&& head, Tail&&... tail) {cout << head;if (sizeof...(tail)) cout << " ";output(forward<Tail>(tail)...);}template <class Container, class Value = typename Container::value_type,enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>inline ostream& operator<<(ostream& os, const Container& vs) {static constexpr const char* delim[] = {" ", ""};for (auto it = begin(vs); it != end(vs); ++it) {os << delim[it == begin(vs)] << *it;}return os;}template <class Iterator>inline void join(const Iterator& Begin, const Iterator& End, const string& delim = "\n",const string& last = "\n") {for (auto it = Begin; it != End; ++it) {cout << ((it == Begin) ? "" : delim) << *it;}cout << last;}template <class T>inline vector<T> makeVector(const T& init_value, size_t sz) {return vector<T>(sz, init_value);}template <class T, class... Args>inline auto makeVector(const T& init_value, size_t sz, Args... args) {return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));}template <class Func>class FixPoint : Func {public:explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}template <class... Args>constexpr decltype(auto) operator()(Args&&... args) const {return Func::operator()(*this, std::forward<Args>(args)...);}};template <class Func>static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {return FixPoint<Func> {forward<Func>(f)};}template <class Container>struct reverse_t {Container& c;reverse_t(Container& c) : c(c) {}auto begin() {return c.rbegin();}auto end() {return c.rend();}};template <class Container>auto reversed(Container& c) {return reverse_t<Container>(c);}template <class T>inline bool chmax(T& a, const T& b) noexcept {return b > a && (a = b, true);}template <class T>inline bool chmin(T& a, const T& b) noexcept {return b < a && (a = b, true);}template <class T>inline T diff(const T& a, const T& b) noexcept {return a < b ? b - a : a - b;}template <class T>inline T sigma(const T& l, const T& r) noexcept {return (l + r) * (r - l + 1) / 2;}template <class T>inline T ceildiv(const T& n, const T& d) noexcept {return (n + d - 1) / d;}void operator|=(vector<bool>::reference lhs, const bool rhs) {lhs = lhs | rhs;}void operator&=(vector<bool>::reference lhs, const bool rhs) {lhs = lhs & rhs;}void operator^=(vector<bool>::reference lhs, const bool rhs) {lhs = lhs ^ rhs;}void ioinit() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);clog << fixed << setprecision(10);}#pragma endregion// }}} End Header// Compress {{{template <class T>class Compress {vector<T> xs;public:Compress() = default;Compress(const vector<T> &vs) {add(vs);}void add(const vector<T> &vs) {copy(vs.begin(), vs.end(), back_inserter(xs));}void add(const T &x) {xs.emplace_back(x);}void build() {sort(xs.begin(), xs.end());xs.erase(unique(xs.begin(), xs.end()), xs.end());}vector<intmax_t> get(const vector<T> &vs) const {vector<intmax_t> ret;transform(vs.begin(), vs.end(), back_inserter(ret), [&](const T &v) {return distance(xs.begin(), lower_bound(xs.begin(), xs.end(), v));});return ret;}unordered_map<T, intmax_t> dict() const {unordered_map<T, intmax_t> ret;for (intmax_t i = 0; i < xs.size(); ++i) {ret[xs[i]] = i;}return ret;}const size_t size() const {return xs.size();}const T &operator[](size_t k) const {return xs[k];}};// }}}int main() {ioinit();vector<string> bs(6);input(bs);Compress<string> zip(bs);zip.build();const auto as = zip.get(bs);const auto nand = [](short a, short b) { return !(a && b); };const auto calc = [&](short a, short b, short c) {return nand(nand(a, b), c);};// repc(i, 0, 1) repc(j, 0, 1) dump(i, j , nand(i, j));size_t N = zip.size();rep(mask, 0, 1 << N) {vector<short> ps(N);rep(i, 0, N) {ps[i] = (mask >> i & 1);}if (nand(calc(ps[as[0]], ps[as[1]], ps[as[2]]), calc(ps[as[3]], ps[as[4]], ps[as[5]])) == 1) {return output("YES"), 0;}}output("NO");return 0;}