結果
| 問題 |
No.382 シャイな人たち (2)
|
| コンテスト | |
| ユーザー |
 横山緑
|
| 提出日時 | 2025-03-11 18:05:30 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 9,315 bytes |
| コンパイル時間 | 4,307 ms |
| コンパイル使用メモリ | 307,772 KB |
| 実行使用メモリ | 11,164 KB |
| 最終ジャッジ日時 | 2025-03-11 18:05:54 |
| 合計ジャッジ時間 | 23,312 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | TLE * 1 -- * 20 |
ソースコード
#line 1 "/home/y_midori/cp/test/test.test.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 <bits/stdc++.h>
using namespace std;
// https://xn--kst.jp/blog/2019/08/29/cpp-comp/
// debug methods
// usage: debug(x,y);
// vector 出力できるように修正
template <typename T>
ostream& debug_print(ostream& os, const vector<T>& v) {
os << "[";
for (size_t i = 0; i < v.size(); ++i) {
os << v[i];
if (i < v.size() - 1) os << ", ";
}
os << "]";
return os;
}
template <typename T>
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<ll>;
using vll = vector<vl>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
template <typename T> inline bool chmax(T &a, T b) {
return ((a < b) ? (a = b, true) : (false));
}
template <typename T> 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 <class... T> constexpr auto min(T... a) {
return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
for(T &x : a)
cin >> x;
}
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
cout << a;
(cout << ... << (cout << ' ', b));
cout << '\n';
}
void print(const string &s) {
cout << s << '\n';
}
template <class Container, typename = void>
struct is_container : std::false_type {};
template <class Container>
struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};
template <class Container>
typename enable_if<is_container<Container>::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 <class T = ll> 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 <class T = ll> struct Graph {
using cost_type = T;
vector<vector<Edge<T>>> 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<Edge<T>> &operator[](const int &k) { return g[k]; }
const vector<Edge<T>> &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/test/test.test.cpp"
template <class edge_type>
vector<int> max_independent_set(int n, const vector<edge_type> &edges) {
using Edges = vector<edge_type>;
auto dfs = [](auto &&dfs, Edges edges, vector<int> rem,
vector<int> ans) -> vector<int> {
unordered_map<int, int> mp;
for(auto &e : edges) {
mp[e.from]++;
mp[e]++;
}
ranges::sort(rem, [&](int i, int j) { return mp[i] > mp[j]; });
while(rem.size() and mp[rem.back()] == 0) {
mp.erase(rem.back());
ans.emplace_back(rem.back());
rem.pop_back();
}
while(rem.size() and mp[rem.back()] == 1) {
int idx = -1, v = -1;
rep(i, edges.size()) {
if(edges[i].to == rem.back())
swap(edges[i].to, edges[i].from);
if(edges[i].from == rem.back()) {
idx = i;
v = edges[i].to;
break;
}
}
// assert(idx != -1);
ans.emplace_back(rem.back());
rem.pop_back();
// rem.back()使ってv使わない
for(auto itr = begin(rem);; itr++) {
if(*itr == v) {
rem.erase(itr);
break;
}
}
for(int i = ssize(edges) - 1; i >= 0; i--) {
if(edges[i].to == v)
swap(edges[i].to, edges[i].from);
if(edges[i].from == v) {
mp[edges[i]]--;
edges.erase(begin(edges) + i);
}
}
}
if(rem.empty())
return ans;
int s = rem.front();
rem.erase(begin(rem));
// sを使うor使わない
vector<int> nei;
for(int i = ssize(edges) - 1; i >= 0; i--) {
if(edges[i].to == s)
swap(edges[i].to, edges[i].from);
if(edges[i].from == s) {
nei.emplace_back(edges[i].to);
edges.erase(begin(edges) + i);
}
}
auto a1 = dfs(dfs, edges, rem, ans);
for(auto i : nei) {
assert(find(all(rem), i) != end(rem));
rem.erase(find(all(rem), i));
}
Edges nex_edges;
ranges::sort(rem);
for(auto &e : edges) {
if(binary_search(all(rem), e.from) and
binary_search(all(rem), e.to))
nex_edges.emplace_back(e);
}
auto a2 = dfs(dfs, nex_edges, rem, ans);
a2.emplace_back(s);
return a1.size() > a2.size() ? a1 : a2;
};
vector<int> rem(n);
iota(all(rem), 0);
return dfs(dfs, edges, rem, {});
}
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<bool>;
using Edges = vector<edge_type>;
Edges edges;
rep(i, n) {
rep(j, i + 1, n) {
s = 12345 * s % mod;
if(s >= p)
edges.emplace_back(i, j);
}
}
// INT(n, m);
// rep(i, m) {
// INT(a, b);
// edges.emplace_back(a, b);
// }
auto ans = max_independent_set(n, edges);
print(ans.size() + 1);
print(ans);
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
solve();
}