結果
問題 |
No.3211 NAND Oracle
|
ユーザー |
![]() |
提出日時 | 2025-07-25 22:12:54 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 5,496 bytes |
コンパイル時間 | 5,432 ms |
コンパイル使用メモリ | 337,384 KB |
実行使用メモリ | 7,716 KB |
最終ジャッジ日時 | 2025-07-25 22:13:04 |
合計ジャッジ時間 | 8,827 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
ソースコード
#include <bits/stdc++.h> using namespace std; using std::cerr; using std::cin; using std::cout; #if __has_include(<atcoder/all>) #include <atcoder/all> using mint = atcoder::modint998244353; istream &operator>>(istream &is, mint &a) { long long t; is >> t; a = t; return is; } ostream &operator<<(ostream &os, mint a) { return os << a.val(); } #endif typedef long double ld; #define long long long #define uint unsigned int #define ull unsigned long #define overload3(a, b, c, name, ...) name #define rep3(i, a, b) for (int i = (a); i < (b); i++) #define rep2(i, n) rep3(i, 0, n) #define rep1(n) rep2(__i, n) #define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__) #define per3(i, a, b) for (int i = (b) - 1; i >= (a); i--) #define per2(i, n) per3(i, 0, n) #define per1(n) per2(__i, n) #define per(...) overload3(__VA_ARGS__, per3, per2, per1)(__VA_ARGS__) #define all(a) a.begin(), a.end() #define UNIQUE(a) \ sort(all(a)); \ a.erase(unique(all(a)), a.end()) #define sz(a) (int)a.size() #define vec vector #ifndef DEBUG #define cerr \ if (0) \ cerr // #undef assert // #define assert(...) void(0) #undef endl #define endl '\n' #endif template <typename T> ostream &operator<<(ostream &os, vector<T> a) { const int n = a.size(); rep(i, n) { os << a[i]; if (i + 1 != n) os << " "; } return os; } template <typename T, size_t n> ostream &operator<<(ostream &os, array<T, n> a) { rep(i, n) { os << a[i]; if (i + 1 != n) os << " "; } return os; } template <typename T> istream &operator>>(istream &is, vector<T> &a) { for (T &i : a) is >> i; return is; } template <typename T, typename S> bool chmin(T &x, S y) { if ((T)y < x) { x = (T)y; return true; } return false; } template <typename T, typename S> bool chmax(T &x, S y) { if (x < (T)y) { x = (T)y; return true; } return false; } template <typename T> void operator++(vector<T> &a) { for (T &i : a) ++i; } template <typename T> void operator--(vector<T> &a) { for (T &i : a) --i; } template <typename T> void operator++(vector<T> &a, int) { for (T &i : a) i++; } template <typename T> void operator--(vector<T> &a, int) { for (T &i : a) i--; } struct S { vec<int> a, b, c, d; vec<pair<int, int>> so; int calc() { int ans = 0; { int c = 0; for (int i : a) c += i; chmax(ans, c); } { int c = 0; for (int i : b) c += i; chmax(ans, c); } { int cc = 0; for (int i : c) cc += i; chmax(ans, cc); } { int c = 0; for (int i : d) c += i; chmax(ans, c); } return ans; } void ap(int i, int j) { a.push_back(1 - (a[i] & a[j])); b.push_back(1 - (b[i] & b[j])); c.push_back(1 - (c[i] & c[j])); d.push_back(1 - (d[i] & d[j])); so.emplace_back(i, j); } }; void gu() { vec<S> s; { vec<int> a = {0, 0}; vec<int> b = {0, 1}; vec<int> c = {1, 0}; vec<int> d = {1, 1}; S x = {a, b, c, d}; s = {x}; } for (int n = 2; n < 10; n++) { vec<S> ss; rep(i, n) rep(j, i) { for (S v : s) { v.ap(j, i); ss.push_back(v); } } swap(s, ss); int ans = n + 5; for (S v : s) chmin(ans, v.calc()); cout << n + 1 << " : " << ans << endl; for (S v : s) if (ans == v.calc()) { for (auto [i, j] : v.so) { cout << i + 1 << " " << j + 1 << endl; } break; } } } void solve() { // gu(); int n, m; cin >> n >> m; n += 2; if (n == 3) { if (m < 2) { cout << "No" << endl; return; } cout << "Yes" << endl; cout << "1 2" << endl; return; } if (n == 4) { if (m < 3) { cout << "No" << endl; return; } cout << "Yes" << endl; cout << "1 2" << endl; cout << "1 2" << endl; return; } if (n == 5) { if (m < 3) { cout << "No" << endl; return; } cout << "Yes" << endl; cout << "1 2" << endl; cout << "2 3" << endl; cout << "1 4" << endl; return; } if (n == 6) { if (m < 4) { cout << "No" << endl; return; } cout << "Yes" << endl; cout << "1 2" << endl; cout << "2 3" << endl; cout << "1 3" << endl; cout << "1 2" << endl; return; } if (n == 7) { if (m < 4) { cout << "No" << endl; return; } cout << "Yes" << endl; cout << "1 2" << endl; cout << "1 2" << endl; cout << "3 4" << endl; cout << "3 4" << endl; cout << "1 2" << endl; return; } if (n == 8) { if (m < 5) { cout << "No" << endl; return; } cout << "Yes" << endl; cout << "1 2" << endl; cout << "1 2" << endl; cout << "3 4" << endl; cout << "3 4" << endl; cout << "1 2" << endl; cout << "1 2" << endl; return; } if (n == 9) { if (m < 5) { cout << "No" << endl; return; } cout << "Yes" << endl; cout << "1 2" << endl; cout << "1 2" << endl; cout << "3 4" << endl; cout << "3 4" << endl; cout << "3 4" << endl; cout << "1 2" << endl; cout << "1 2" << endl; return; } if (m < 5) { cout << "No" << endl; return; } cout << "Yes" << endl; cout << "1 2" << endl; cout << "1 2" << endl; cout << "3 4" << endl; cout << "4 5" << endl; cout << "4 5" << endl; rep(n - 7) cout << "6 7" << endl; return; } int main() { // srand((unsigned)time(NULL)); cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); int t = 1; // cin >> t; while (t--) solve(); }