結果
問題 | No.991 N×Mマス計算(構築) |
ユーザー | ecottea |
提出日時 | 2023-05-24 01:53:13 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,676 bytes |
コンパイル時間 | 3,887 ms |
コンパイル使用メモリ | 268,924 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-02 12:09:28 |
合計ジャッジ時間 | 6,845 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 9 ms
6,816 KB |
testcase_02 | AC | 3 ms
6,944 KB |
testcase_03 | AC | 4 ms
6,940 KB |
testcase_04 | AC | 4 ms
6,940 KB |
testcase_05 | WA | - |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 7 ms
6,944 KB |
testcase_08 | AC | 9 ms
6,944 KB |
testcase_09 | AC | 9 ms
6,940 KB |
testcase_10 | AC | 8 ms
6,940 KB |
testcase_11 | WA | - |
testcase_12 | AC | 10 ms
6,940 KB |
testcase_13 | WA | - |
testcase_14 | AC | 8 ms
6,940 KB |
testcase_15 | AC | 6 ms
6,944 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 12 ms
6,944 KB |
testcase_19 | AC | 4 ms
6,940 KB |
testcase_20 | AC | 6 ms
6,940 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 9 ms
6,940 KB |
testcase_25 | WA | - |
testcase_26 | AC | 9 ms
6,940 KB |
testcase_27 | AC | 13 ms
6,940 KB |
testcase_28 | WA | - |
testcase_29 | AC | 6 ms
6,940 KB |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:199:21: warning: 'e' may be used uninitialized [-Wmaybe-uninitialized] 199 | rep(hoge, e / ((ll)1e4 - 1)) A.push_back((ll)1e4 - 1); | ^ main.cpp:184:12: note: 'e' was declared here 184 | ll e, f; | ^ main.cpp:38:54: warning: 'd' may be used uninitialized [-Wmaybe-uninitialized] 38 | #define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順 | ^ main.cpp:153:21: note: 'd' was declared here 153 | ll a, b, c, d; | ^ main.cpp:198:21: warning: 'c' may be used uninitialized [-Wmaybe-uninitialized] 198 | rep(hoge, a - c) A.push_back((ll)1e5); | ^ main.cpp:153:18: note: 'c' was declared here 153 | ll a, b, c, d; | ^ main.cpp:198:21: warning: 'a' may be used uninitialized [-Wmaybe-uninitialized] 198 | rep(hoge, a - c) A.push_back((ll)1e5); | ^ main.cpp:153:12: note: 'a' was declared here 153 | ll a, b, c, d; | ^
ソースコード
#ifndef HIDDEN_IN_VS // 折りたたみ用 // 警告の抑制 #define _CRT_SECURE_NO_WARNINGS // ライブラリの読み込み #include <bits/stdc++.h> using namespace std; // 型名の短縮 using ll = long long; // -2^63 ~ 2^63 = 9 * 10^18(int は -2^31 ~ 2^31 = 2 * 10^9) using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>; using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>; using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>; template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>; using Graph = vvi; // 定数の定義 const double PI = acos(-1); const vi DX = { 1, 0, -1, 0 }; // 4 近傍(下,右,上,左) const vi DY = { 0, 1, 0, -1 }; int INF = 1001001001; ll INFL = 4004004004004004004LL; double EPS = 1e-15; // 入出力高速化 struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp; // 汎用マクロの定義 #define all(a) (a).begin(), (a).end() #define sz(x) ((int)(x).size()) #define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x)) #define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x)) #define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");} #define YES(b) {cout << ((b) ? "YES\n" : "NO\n");} #define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順 #define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順 #define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順 #define repe(v, a) for(const auto& v : (a)) // a の全要素(変更不可能) #define repea(v, a) for(auto& v : (a)) // a の全要素(変更可能) #define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索(昇順) #define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て(昇順) #define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod #define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去 #define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了 // 汎用関数の定義 template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; } template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら true を返す) template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら true を返す) template <class T> inline T get(T set, int i) { return (set >> i) & T(1); } // 演算子オーバーロード template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; } template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; } template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; } #endif // 折りたたみ用 #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #ifdef _MSC_VER #include "localACL.hpp" #endif //using mint = modint1000000007; //using mint = modint998244353; using mint = modint; // mint::set_mod(m); namespace atcoder { inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; } inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; } } using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; #endif #ifdef _MSC_VER // 手元環境(Visual Studio) #include "local.hpp" #else // 提出用(gcc) inline int popcount(int n) { return __builtin_popcount(n); } inline int popcount(ll n) { return __builtin_popcountll(n); } inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; } inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; } inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; } inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; } #define gcd __gcd #define dump(...) #define dumpel(v) #define dump_list(v) #define dump_mat(v) #define input_from_file(f) #define output_to_file(f) #define Assert(b) { if (!(b)) while (1) cout << "OLE"; } #endif //【約数列挙】O(√n) /* * n の約数全てを昇順に格納したリストを返す. */ vl divisors(ll n) { // verify : https://yukicoder.me/problems/no/2142 vl ds; if (n == 1) { ds.push_back(1); return ds; } ll i = 1; for (; i * i < n; i++) { if (n % i == 0) { ds.push_back(i); ds.push_back(n / i); } } if (i * i == n) ds.push_back(i); sort(all(ds)); return ds; } int main() { // input_from_file("input.txt"); // output_to_file("output.txt"); ll x; cin >> x; dump(x); if (x == 0) { cout << "3 2 129" << endl; cout << "+ 12 34" << endl; cout << 10 << endl; cout << 20 << endl; cout << 30 << endl; return 0; } ll k = (ll)1e9; mint::set_mod((int)k); ll a, b, c, d; for (b = min(x, (ll)1e5 - 1); b >= 0; b--) { if (b == 0) { a = b = c = d = 0; break; } a = x / b; ll cd = x - a * b; if (cd == 0) { c = d = 0; break; } auto divs = divisors(cd); bool ok = false; repe(div, divs) { if (div <= a && cd / div <= b) { c = div; d = cd / c; ok = true; break; } } if (ok) break; } dump(a, b, c, d); ll e, f; for (f = 1; f <= (ll)1e9; f += 2) { if (gcd(k, ((ll)1e4 * d + (ll)1e5 * (b - d) + f)) != 1) continue; e = (ll)((mint(x) / ((ll)1e4 * d + (ll)1e5 * (b - d) + f)) - ((ll)1e4 * c + (ll)1e5 * (a - c))).val(); if (e == 0) e = k; if (a + e / ((ll)1e4 - 1) + 1 <= (ll)1e5) break; } dump(e); vl A; rep(hoge, c) A.push_back((ll)1e4); rep(hoge, a - c) A.push_back((ll)1e5); rep(hoge, e / ((ll)1e4 - 1)) A.push_back((ll)1e4 - 1); if (e % ((ll)1e4 - 1) != 0) A.push_back(e % ((ll)1e4 - 1)); int n = sz(A); vl B; rep(hoge, d) B.push_back((ll)1e4); rep(hoge, b - d) B.push_back((ll)1e5); B.push_back(f); int m = sz(B); cout << n << " " << m << " " << k << "\n"; cout << "*"; rep(j, m) cout << " " << B[j]; cout << "\n"; rep(i, n) cout << A[i] << "\n"; }