結果
問題 | No.2678 Minmax Independent Set (Hack) |
ユーザー |
![]() |
提出日時 | 2024-02-29 23:39:45 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,143 bytes |
コンパイル時間 | 1,393 ms |
コンパイル使用メモリ | 141,600 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-29 23:02:48 |
合計ジャッジ時間 | 1,902 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | WA * 1 |
ソースコード
#include <iostream>#include <iomanip>#include <fstream>#include <string>#include <array>#include <vector>#include <deque>#include <list>#include <set>#include <map>#include <unordered_map>#include <unordered_set>#include <stack>#include <queue>#include <bitset>#include <tuple>#include <cmath>#include <complex>#include <algorithm>#include <utility>#include <regex>#include <cstdint>#include <numeric>#include <functional>#include <cassert>using namespace std;namespace utils{#define ALL(x) begin(x), end(x)#define RALL(x) rbegin(x), rend(x)///----- aliasesusing ll = long long int;using ull = unsigned long long;template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;template<class T> using min_queue = p_queue<T, greater<T>>;template<class T> using max_queue = p_queue<T, less<T>>;template<class T> inline bool CHMIN(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }template<class T> inline bool CHMAX(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }///----- vector I/Otemplate<class T>vector<T> VEC(size_t n, T t){return vector<T>(n, t);}template<class ...Ts>auto VEC(size_t n, Ts ... ts){return vector<decltype(VEC(ts...))>(n, VEC(ts...));}template<class T>istream& operator>>(istream& is, vector<T>& v){for (auto &&x : v) { is >> x; } return is;}template<class T>ostream& operator<<(ostream& os, const vector<T>& v){auto p = v.begin();assert(p != v.end());os << *p++;while(p != v.end()){os << ' ' << *p++;}return os ;}template<class T>ostream& operator<<(ostream& os, const vector<vector<T>>& v){auto p = v.begin();assert(p != v.end());os << *p++;while(p != v.end()){os << '\n' << *p++;}return os;}///----- tuple I/Otemplate <class S, class T>istream& operator>>(istream& is, tuple<S, T>& t){return is >> get<0>(t) >> get<1>(t);}template <class S, class T>istream& operator>>(istream& is, pair<S, T>& t){return is >> get<0>(t) >> get<1>(t);}template <class S, class T, class U>istream& operator>>(istream& is, tuple<S, T, U>& t){return is >> get<0>(t) >> get<1>(t) >> get<2>(t);}template <class S, class T>ostream& operator<<(ostream& os, const tuple<S, T>& t){return os << get<0>(t) << ' ' << get<1>(t);}template <class S, class T>ostream& operator<<(ostream& os, const pair<S, T>& t){return os << get<0>(t) << ' ' << get<1>(t);}template <class S, class T, class U>ostream& operator<<(ostream& os, const tuple<S, T, U>& t){return os << get<0>(t) << ' ' << get<1>(t) << ' ' << get<2>(t);}///----- constantsconstexpr ll INFLL = 1'000'000'000'000'000'020ll;constexpr ll INF = 1'000'000'009;constexpr double PI = 3.14'159'265'358'979'323'846;constexpr double EPS = 1e-12;}using namespace utils;class solver{istream& is;ostream& os;public:solver(istream& I, ostream& O) :is(I), os(O) {}void run();};void solver::run(){const int N = 30000;int i;vector<pair<int, int>> E;for (int i = 1; i < N; ++i) {E.emplace_back(i, i+1);} // end iint cN = N;for (i = 3; i < N/2; i+=3) {E.emplace_back(i, ++cN);E.emplace_back(i, ++cN);E.emplace_back(i, ++cN);} // end ii+=2;E.emplace_back(i, ++cN);E.emplace_back(i, ++cN);E.emplace_back(i, ++cN);i+=2;while(i <= N){E.emplace_back(i, ++cN);E.emplace_back(i, ++cN);E.emplace_back(i, ++cN);i+=3;}os << cN << endl;for (auto &&[a, b]: E) {os << a << ' ' << b << '\n';} // end [a, b]}int main(int argc, char *argv[]) {cin.tie(nullptr);ios::sync_with_stdio(false);solver(cin, cout).run();return 0;}