結果
問題 | No.2828 Remainder Game |
ユーザー |
![]() |
提出日時 | 2024-08-02 23:35:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 69 ms / 2,000 ms |
コード長 | 5,762 bytes |
コンパイル時間 | 2,137 ms |
コンパイル使用メモリ | 203,760 KB |
最終ジャッジ日時 | 2025-02-23 20:35:01 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
/*#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")//*/// #include <atcoder/all>#include <bits/stdc++.h>using namespace std;// using namespace atcoder;// #define _GLIBCXX_DEBUG#define DEBUG(x) cerr << #x << ": " << x << endl;#define DEBUG_VEC(v) \cerr << #v << ":"; \for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \cerr << " " << v[iiiiiiii]; \cerr << endl;#define DEBUG_MAT(v) \cerr << #v << endl; \for (int iv = 0; iv < v.size(); iv++) { \for (int jv = 0; jv < v[iv].size(); jv++) { \cerr << v[iv][jv] << " "; \} \cerr << endl; \}typedef long long ll;// #define int ll#define vi vector<int>#define vl vector<ll>#define vii vector<vector<int>>#define vll vector<vector<ll>>#define pii pair<int, int>#define pis pair<int, string>#define psi pair<string, int>#define pll pair<ll, ll>template <class S, class T>pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {return pair<S, T>(s.first + t.first, s.second + t.second);}template <class S, class T>pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }template <class S, class T>ostream &operator<<(ostream &os, pair<S, T> p) {os << "(" << p.first << ", " << p.second << ")";return os;}#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)#define REP(i, a, b) for (int i = a; i < b; i++)#define in(x, a, b) (a <= x && x < b)#define all(c) c.begin(), c.end()void YES(bool t = true) {cout << (t ? "YES" : "NO") << endl;}void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return 1;}return 0;}template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return 1;}return 0;}template <class T, class U>T ceil_div(T a, U b) {return (a + b - 1) / b;}template <class T>T safe_mul(T a, T b) {if (a == 0 || b == 0) return 0;if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();return a * b;}#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());const ll inf = 1000000001;const ll INF = (ll)1e18 + 1;const long double pi = 3.1415926535897932384626433832795028841971L;int popcount(ll t) { return __builtin_popcountll(t); }vector<int> gen_perm(int n) {vector<int> ret(n);iota(all(ret), 0);return ret;}// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};struct Setup_io {Setup_io() {ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);cout << fixed << setprecision(25);cerr << fixed << setprecision(25);}} setup_io;constexpr ll MOD = 1000000007;// constexpr ll MOD = 998244353;// #define mp make_pairsigned main() {int n;cin >> n;#ifdef LOCALvi a(5);rep(i, 5) {cin >> a[i];}#endifvi ps = {2, 3, 5, 11, 13};// ps[0] = 2;// for (int i = 1; i < 30; i++) {// int x = ps[i - 1] + 1;// // x が素数じゃない場合インクリメント// while (true) {// bool is_prime = true;// for (int j = 2; j * j <= x; j++) {// if (x % j == 0) {// is_prime = false;// break;// }// }// if (is_prime) {// ps[i] = x;// break;// }// x++;// }// }DEBUG_VEC(ps);int q = 29;vector<pii> asks;for (int p : ps) {if (q == 0) {break;}vi ret;int sub = 5;rep(i, p - 1) {if (q == 0) {break;}vi ask(1, i);cout << p << " " << ask.size() << endl;for (int u : ask) {cout << u << " ";}cout << endl;int res = 0;#ifdef LOCALfor (int x : a) {if (x % p == i) {res++;}}#elsecin >> res;#endifret.push_back(res);sub -= res;q--;}if (ret.size() != p - 1) {break;}ret.push_back(sub);int sum = 0;rep(i, ret.size()) {sum += ret[i] * i;}asks.emplace_back(p, sum % p);}DEBUG_VEC(asks);rep1(x, 5 * n) {bool flag = true;for (auto [p, r] : asks) {if (x % p != r) {flag = false;break;}}if (flag) {cout << 0 << " " << 1 << endl;cout << x << endl;return 0;}}}