#line 1 "/home/y_midori/cp/test3.cpp" #define PROBLEM "https://yukicoder.me/problems/no/382" #line 2 "template.hpp" // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include using namespace std; // https://xn--kst.jp/blog/2019/08/29/cpp-comp/ // debug methods // usage: debug(x,y); // vector 出力できるように修正 template ostream& debug_print(ostream& os, const vector& v) { os << "["; for (size_t i = 0; i < v.size(); ++i) { os << v[i]; if (i < v.size() - 1) os << ", "; } os << "]"; return os; } template ostream& debug_print(ostream& os, const T& var) { os << var; return os; } #define CHOOSE(a) CHOOSE2 a #define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x #define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; } #define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; } #define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << endl; } #define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; } #define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; } #ifdef LOCAL #define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__) #else #define debug(...) #endif using ll = long long; using vl = vector; using vll = vector; using P = pair; #define all(v) v.begin(), v.end() template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } #define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i) // https://trap.jp/post/1224/ template constexpr auto min(T... a) { return min(initializer_list>{a...}); } template constexpr auto max(T... a) { return max(initializer_list>{a...}); } template void input(T &...a) { (cin >> ... >> a); } template void input(vector &a) { for(T &x : a) cin >> x; } void print() { cout << '\n'; } template void print(const T &a, const Ts &...b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } void print(const string &s) { cout << s << '\n'; } template struct is_container : std::false_type {}; template struct is_container().begin()), decltype(std::declval().end())>> : std::true_type {}; template typename enable_if::value>::type print(const Container& x) { if (!x.empty()) { auto it = x.begin(); for (; it != prev(x.end()); ++it) { cout << *it << " "; } cout << *it << "\n"; // 最後の要素を出力して改行 } } #define INT(...) \ int __VA_ARGS__; \ input(__VA_ARGS__) #define LL(...) \ long long __VA_ARGS__; \ input(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ input(__VA_ARGS__) #define REP1(a) for(ll i = 0; i < a; i++) #define REP2(i, a) for(ll i = 0; i < a; i++) #define REP3(i, a, b) for(ll i = a; i < b; i++) #define REP4(i, a, b, c) for(ll i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__) ll inf = 3e18; vl dx = {1, -1, 0, 0}; vl dy = {0, 0, 1, -1}; #line 3 "graph/graph-template.hpp" // https://ei1333.github.io/library/graph/graph-template.hpp template struct Edge { int from, to; T cost; int idx; Edge() = default; Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {} Edge &operator=(const int &x) { to = x; return *this; } operator int() const { return to; } }; template struct Graph { using cost_type = T; vector>> g; int es; // edge_size Graph(int n) : g(n), es(0) {}; int size() const { return ssize(g); } void add_directed_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es++); } void add_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es); g[to].emplace_back(to, from, cost, es++); } vector> &operator[](const int &k) { return g[k]; } const vector> &operator[](const int &k) const { return g[k]; } void read(int m, int padding = -1, bool weighted = false, bool directed = false) { rep(i, m) { int a, b; T c(1); cin >> a >> b; a += padding; b += padding; if(weighted) cin >> c; if(directed) add_directed_edge(a, b, c); else add_edge(a, b, c); } } }; #line 3 "/home/y_midori/cp/test3.cpp" template vector max_independent_set(int n, const vector &edges) { using BS = bitset; BS res; auto dfs = [&n, &res](auto &&dfs, vector nbd, BS rem, BS cur) { while(1) { bool upd = false; for(int i : views::iota(0, n) | views::filter([&](int i) { return rem[i] and (rem & nbd[i]).count() <= 1; })) { rem[i] = 0; cur[i] = 1; upd = true; rem &= ~nbd[i]; } if(!upd) break; } if(rem.count() == 0) { if(res.count() < cur.count()) res = cur; return; } int max_idx = ranges::max( views::iota(0, n) | views::filter([&](int i) { return rem[i]; }), {}, [&](int i) { return (rem & nbd[i]).count(); }); assert(rem[max_idx] and nbd[max_idx].count()); rem[max_idx] = 0; // maxidx 使わない if(nbd[max_idx].count() > 2) dfs(dfs, nbd, rem, cur); // 使う cur[max_idx] = 1; rem &= ~nbd[max_idx]; dfs(dfs, nbd, rem, cur); }; vector nbd(n); BS rem; for(int i : views::iota(0, n)) rem[i] = 1; for(auto &e : edges) { assert(0 <= min(e, e.from) and max(e, e.from) < n); if(e.from == e) rem[e] = 0; nbd[e.from][e] = nbd[e][e.from] = 1; } dfs(dfs, nbd, rem, BS(0)); vector res_v; for(int i : views::iota(0, n) | views::filter([&](int i) { return res[i]; })) res_v.emplace_back(i); return res_v; } void solve() { LL(s); const ll mod = 1000003; s = 12345 * s % mod; int n = s % 120 + 2; s = 12345 * s % mod; int p = s; using edge_type = Edge; using Edges = vector; Edges edges; rep(i, n) { rep(j, i + 1, n) { s = 12345 * s % mod; if(s >= p) edges.emplace_back(i, j); } } debug(n, edges.size()); // INT(n, m); // rep(i, m) { // INT(a, b); // edges.emplace_back(a, b); // } auto ans = max_independent_set<128, edge_type>(n, edges); if(ans.size() == n) print(-1); else { print(ans.size() + 1); for(auto &a : ans) ++a; print(ans); } } int main() { ios::sync_with_stdio(false); std::cin.tie(nullptr); solve(); }