結果
問題 | No.2479 Sum of Squares |
ユーザー | sgfc |
提出日時 | 2023-09-22 22:13:48 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 11 ms / 2,000 ms |
コード長 | 3,590 bytes |
コンパイル時間 | 5,408 ms |
コンパイル使用メモリ | 317,428 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-08 12:57:56 |
合計ジャッジ時間 | 6,294 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 10 ms
6,820 KB |
testcase_01 | AC | 10 ms
6,944 KB |
testcase_02 | AC | 11 ms
6,940 KB |
testcase_03 | AC | 11 ms
6,944 KB |
testcase_04 | AC | 10 ms
6,940 KB |
testcase_05 | AC | 10 ms
6,940 KB |
testcase_06 | AC | 10 ms
6,940 KB |
testcase_07 | AC | 10 ms
6,944 KB |
testcase_08 | AC | 11 ms
6,944 KB |
testcase_09 | AC | 11 ms
6,940 KB |
testcase_10 | AC | 11 ms
6,940 KB |
testcase_11 | AC | 11 ms
6,944 KB |
testcase_12 | AC | 11 ms
6,940 KB |
testcase_13 | AC | 10 ms
6,944 KB |
testcase_14 | AC | 10 ms
6,940 KB |
testcase_15 | AC | 10 ms
6,940 KB |
testcase_16 | AC | 10 ms
6,944 KB |
testcase_17 | AC | 10 ms
6,940 KB |
testcase_18 | AC | 10 ms
6,940 KB |
testcase_19 | AC | 10 ms
6,944 KB |
testcase_20 | AC | 10 ms
6,940 KB |
testcase_21 | AC | 10 ms
6,940 KB |
testcase_22 | AC | 9 ms
6,940 KB |
testcase_23 | AC | 10 ms
6,940 KB |
testcase_24 | AC | 11 ms
6,944 KB |
ソースコード
#include "bits/stdc++.h"#include <unordered_map>#include <unordered_set>#include <stdio.h>#include <math.h>#include <cassert>#include "atcoder/all"#include <float.h>//#include <boost/multiprecision/cpp_int.hpp>//using namespace boost::multiprecision;// std::fixed << std::setprecision(10) <<using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using mint = modint998244353;using mint2 = modint1000000007;const double eps = 1e-9;#define REP(i, n) for (ll i = 0; i < ll(n); ++i)#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)#define REPD(i, init) for (ll i = init; i >=0; --i)#define REPDI(i, init, n) for (ll i = init; i >=n; --i)#define REPE(i, c) for (const auto& i : c)#define TCASE ll t; cin >> t; REP(i, t)using vl = vector<ll>;#define VL(a, n) vector<ll> a; a.assign(n, 0);#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;using vvl = vector<vector<ll>>;#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);using vd = vector<double>;using pl = pair<ll, ll>;struct uv { ll u; ll v; ll c; };#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }template <class T = long long> using pql = priority_queue<T>;template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;using vm = vector<mint>;using vvm = vector<vm>;void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };template<class T, class U> bool chmin(T& a, const U& b) { const T olda = a; a = gmin(a, b); return olda != a; }template<class T, class U> bool chmax(T& a, const U& b) { const T olda = a; a = gmax(a, b); return olda != a; }template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };int main() {cin.tie(nullptr);ios::sync_with_stdio(false);vvl t(10000);REPI(i, 1, 100) {if (i * i >= t.size()) break;t[i * i].push_back(i);}REP(x, 5) {vvl t2 = t;REP(i, ssize(t)) {if (t[i].empty()) continue;REPI(j, 1, 100) {if (i + j * j >= t.size()) break;if (!t[i + j * j].empty()) continue;t2[i + j * j] = t[i];t2[i + j * j].push_back(j);}}t = move(t2);}ll s;cin >> s;vl ans;while (s >= ssize(t)) {ll xx = ll(sqrt(s));while (xx * xx > s) xx--;ans.push_back(xx * xx);s -= xx * xx;}REPE(e, t[s]) ans.push_back(e * e);cout << ans.size() << endl;ov(ans);}