結果
問題 | No.630 門松グラフ |
ユーザー | ir5 |
提出日時 | 2024-06-28 00:32:56 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 189 ms / 1,500 ms |
コード長 | 2,925 bytes |
コンパイル時間 | 4,308 ms |
コンパイル使用メモリ | 143,744 KB |
実行使用メモリ | 8,320 KB |
最終ジャッジ日時 | 2024-06-28 00:33:05 |
合計ジャッジ時間 | 5,775 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 187 ms
8,192 KB |
testcase_21 | AC | 34 ms
8,320 KB |
testcase_22 | AC | 189 ms
8,320 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 172 ms
8,192 KB |
testcase_25 | AC | 27 ms
8,192 KB |
testcase_26 | AC | 170 ms
8,320 KB |
testcase_27 | AC | 169 ms
8,192 KB |
testcase_28 | AC | 188 ms
8,064 KB |
testcase_29 | AC | 164 ms
7,680 KB |
testcase_30 | AC | 180 ms
8,064 KB |
testcase_31 | AC | 160 ms
7,808 KB |
testcase_32 | AC | 84 ms
5,632 KB |
testcase_33 | AC | 85 ms
6,016 KB |
testcase_34 | AC | 136 ms
6,944 KB |
testcase_35 | AC | 97 ms
6,144 KB |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n; public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}}; template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif namespace solver { template<typename T1, typename T2> struct In2 { T1 a; T2 b; friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; } }; template<typename T1, typename T2, typename T3> struct In3 { T1 a; T2 b; T3 c; friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; } }; ll n, m; void read() { cin >> n >> m; } using RetType = void; set<pair<int, int>> st; int e; void add(int i, int j) { if (!st.count({i, j})) { st.insert({i, j}); e++; } } RetType run() { int n0 = n / 2, n1 = n - n0; st.clear(); e = 0; for (int i : range(n0)) add(i, n0); for (int j : range(n1)) add(0, n0 + j); for (int i : range(n0)) for (int j : range(n1)) { if (e >= m) goto NEXT; add(i, n0 + j); } NEXT: if (e != m) { cout << "NO" << endl; return; } cout << "YES" << endl; for (int i : range(n)) cout << i + 1 << " "; cout << endl; for (auto p : st) cout << p.first + 1 << " " << p.second + 1 << endl; } } // namespace template <typename F> void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { solver::read(); } run(solver::run); }