結果
問題 | No.2479 Sum of Squares |
ユーザー | hamath |
提出日時 | 2023-09-22 21:21:04 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,481 bytes |
コンパイル時間 | 5,621 ms |
コンパイル使用メモリ | 216,120 KB |
実行使用メモリ | 542,052 KB |
最終ジャッジ日時 | 2024-07-08 11:58:33 |
合計ジャッジ時間 | 7,326 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | MLE | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
ソースコード
#ifdef LOCAL //#define _GLIBCXX_DEBUG #else #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl") #endif #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> P; typedef pair<int, int> Pi; typedef vector<ll> Vec; typedef vector<int> Vi; typedef vector<string> Vs; typedef vector<char> Vc; typedef vector<P> VP; typedef vector<VP> VVP; typedef vector<Vec> VV; typedef vector<Vi> VVi; typedef vector<Vc> VVc; typedef vector<VV> VVV; typedef vector<VVV> VVVV; #define MAKEVV(variable, a, ...) VV variable(a, Vec(__VA_ARGS__)) #define MAKEVVc(variable, a, ...) VVc variable(a,Vc(__VA_ARGS__)) #define MAKEVVV(variable, a, b, ...) VVV variable(a, VV(b, Vec(__VA_ARGS__))) #define MAKEVVVV(variable, a, b, c, ...) VVVV variable(a, VVV(b, (VV(c, Vec(__VA_ARGS__))))) #define endl '\n' #define REP(i, a, b) for(ll i=(a); i<(b); i++) #define PER(i, a, b) for(ll i=(a); i>=(b); i--) #define rep(i, n) REP(i, 0, n) #define per(i, n) PER(i, n, 0) const ll INF = 4'000'000'000'000'000'010LL; const ll MOD=998244353; #define Yes(n) cout << ((n) ? "Yes" : "No") << endl; #define YES(n) cout << ((n) ? "YES" : "NO") << endl; #define ALL(v) v.begin(), v.end() #define rALL(v) v.rbegin(), v.rend() #define pb(x) push_back(x) #define mp(a, b) make_pair(a,b) #define Each(a,b) for(auto &a :b) #define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i) #define SUM(a) accumulate(ALL(a),0LL) #define outminusone(a) cout<< ( a==INF ? -1 : a ) <<endl #define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end()) #define fi first #define se second template<class T, class S>bool chmax(T &a, const S &b) { if (a<b) { a=b; return true; } return false; } template<class T, class S>bool chmin(T &a, const S &b) { if (b<a) { a=b; return true; } return false; } template<class T>auto lb(vector<T> &X, T x){return lower_bound(ALL(X),x) - X.begin();} template<class T>auto ub(vector<T> &X, T x){return upper_bound(ALL(X),x) - X.begin();} ll popcnt(ll x){return __builtin_popcount(x);} ll topbit(ll t){return t==0?-1:63-__builtin_clzll(t);} ll floor(ll y,ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return (y-x+1)/x;}return y/x;}; ll ceil(ll y, ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return y/x;}return (y+x-1)/x;}; template<typename T1, typename T2>istream &operator>>(istream &i, pair<T1, T2> &p) { return i>>p.first>>p.second; } template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;} template<typename T1, typename T2>ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; } template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {bool f = false;for(const auto &d: v) {if(f) os<<" ";f = true;os<<d;}return os;} template <class T> ostream& operator<<(ostream& os, const set<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";} template <class T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";} template<class T, class U>ostream &operator<<(ostream &os, const map<T, U> &s) {bool f = false;os<<endl;for(auto p: s) {if(f) os<<endl;f = true;os<<p.first<<": "<<p.second;}return os<<endl;} void out() { cout << endl; } template <class Head, class... Tail> void out(const Head &head, const Tail &...tail) {cout << head;if(sizeof...(tail)) cout << ' ';out(tail...);} #ifdef LOCAL template<typename T>ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {int len=vv.size();for(int i=0; i<len; ++i) {if(i==0)s<<endl;s<<i<<":"<<vv[i];if(i!=len-1)s<<endl;}return s;} struct PrettyOS {ostream& os;bool first;template <class T> auto operator<<(T&& x) {if (!first) os << ", ";first = false;os << x;return *this;}}; template <class... T> void dbg0(T&&... t) {(PrettyOS{cerr, true} << ... << t);} #define dbg(...)do {cerr << #__VA_ARGS__ << ": ";dbg0(__VA_ARGS__);cerr << endl;} while (false); #else #define dbg(...) #endif int solve(){ ll s; cin>>s; Vec v; while(s){ ll x = sqrt(s); s -= x; v.pb(x); } out(v); return 0; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout<<std::setprecision(20); // ll T; // cin>>T; // while(T--) solve(); }