結果
問題 | No.1017 Reiwa Sequence |
ユーザー | NyaanNyaan |
提出日時 | 2020-04-03 22:35:50 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,226 bytes |
コンパイル時間 | 1,538 ms |
コンパイル使用メモリ | 173,548 KB |
実行使用メモリ | 18,688 KB |
最終ジャッジ日時 | 2024-07-03 04:46:21 |
合計ジャッジ時間 | 31,115 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 14 ms
17,536 KB |
testcase_01 | AC | 17 ms
17,536 KB |
testcase_02 | AC | 14 ms
17,408 KB |
testcase_03 | AC | 26 ms
17,408 KB |
testcase_04 | AC | 14 ms
17,408 KB |
testcase_05 | AC | 18 ms
17,408 KB |
testcase_06 | AC | 16 ms
17,408 KB |
testcase_07 | AC | 15 ms
17,408 KB |
testcase_08 | AC | 14 ms
17,280 KB |
testcase_09 | AC | 32 ms
17,536 KB |
testcase_10 | AC | 31 ms
17,536 KB |
testcase_11 | WA | - |
testcase_12 | AC | 35 ms
17,536 KB |
testcase_13 | AC | 30 ms
17,408 KB |
testcase_14 | AC | 29 ms
17,536 KB |
testcase_15 | AC | 34 ms
17,664 KB |
testcase_16 | AC | 30 ms
17,408 KB |
testcase_17 | AC | 32 ms
17,536 KB |
testcase_18 | AC | 31 ms
17,536 KB |
testcase_19 | AC | 42 ms
17,536 KB |
testcase_20 | AC | 43 ms
17,664 KB |
testcase_21 | AC | 41 ms
17,408 KB |
testcase_22 | AC | 43 ms
17,408 KB |
testcase_23 | AC | 49 ms
17,408 KB |
testcase_24 | AC | 42 ms
17,408 KB |
testcase_25 | AC | 42 ms
17,408 KB |
testcase_26 | AC | 43 ms
17,408 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 34 ms
17,536 KB |
testcase_34 | AC | 41 ms
17,408 KB |
testcase_35 | AC | 14 ms
17,408 KB |
testcase_36 | AC | 23 ms
17,408 KB |
testcase_37 | AC | 42 ms
17,408 KB |
testcase_38 | AC | 17 ms
17,408 KB |
testcase_39 | AC | 42 ms
17,408 KB |
testcase_40 | AC | 63 ms
18,176 KB |
testcase_41 | AC | 58 ms
18,176 KB |
testcase_42 | AC | 61 ms
18,304 KB |
testcase_43 | AC | 59 ms
18,176 KB |
testcase_44 | AC | 33 ms
18,176 KB |
testcase_45 | AC | 63 ms
18,176 KB |
testcase_46 | AC | 57 ms
18,176 KB |
testcase_47 | AC | 57 ms
18,176 KB |
testcase_48 | AC | 53 ms
18,688 KB |
testcase_49 | AC | 36 ms
18,432 KB |
testcase_50 | AC | 39 ms
18,688 KB |
testcase_51 | AC | 14 ms
17,536 KB |
testcase_52 | WA | - |
testcase_53 | WA | - |
ソースコード
#pragma region Tmpl #include <bits/stdc++.h> // clang-format off #define pb push_back #define eb emplace_back #define fi first #define se second #define each(x,v) for(auto& x : v) #define all(v) (v).begin(),(v).end() #define sz(v) ((int)(v).size()) #define ini(...) int __VA_ARGS__; in(__VA_ARGS__) #define inl(...) long long __VA_ARGS__; in(__VA_ARGS__) #define ins(...) string __VA_ARGS__; in(__VA_ARGS__) #define inc(...) char __VA_ARGS__; in(__VA_ARGS__) #define in2(s,t) rep(i,sz(s)){in(s[i] , t[i]);} #define in3(s,t,u) rep(i,sz(s)){in(s[i] , t[i] , u[i]);} #define in4(s,t,u,v) rep(i,sz(s)){in(s[i] , t[i] , u[i] , v[i]);} #ifdef ONLINE_JUDGE #define rep(i,N) for(int i = 0; i < (int)(N); i++) #define repr(i,N) for(int i = (int)(N) - 1; i >= 0; i--) #define rep1(i,N) for(int i = 1; i <= (int)(N) ; i++) #define repr1(i,N) for(int i = (N) ; (int)(i) > 0 ; i--) #else #define rep(i,N) for(long long i = 0; i < (long long)(N); i++) #define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--) #define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++) #define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--) #endif using namespace std; void solve(); using ll = long long; template<class T = ll> using V = vector<T>; using vi = V<int>; using vl = V<>; using vvi = V< V<int> >; using vd = V<double>; using vs = V<string>; using vvl = V< V<> >; constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1; template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;} template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); for(int i=0;i<s;i++) os << (i ? " " : "") << v[i]; return os; } template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; } void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);} void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);} template<typename T>void die(T x){out(x); exit(0);} #ifdef NyaanDebug #include "NyaanDebug.h" #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0) #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);} while(0) #define trcc(v) do { cerr << "name : " << #v << "\n"; int cnt = 0; each(x , v){cerr << (cnt++) << " : "; trc(x); } } while(0) #else #define trc(...) #define trca(...) #define trcc(...) int main(){solve();} #endif constexpr ll TEN(int n){ll ret=1,x=10;while(n){if(n&1)ret*=x;x*=x;n>>=1;}return ret;} #define mem(a, val) memset(a, val, sizeof(a)) #pragma endregion struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya; using P = pair<int,int>; using vp = V<P>; constexpr uint32_t MOD = /** 1000000007; //*/ 998244353; // clang-format on //////////////////////////////////////////////////// constexpr int M = 300000; vector<int> dp[M + 300], nxt[M + 300]; void solve(){ ini(N); vi a(N); in(a); auto ret = [&](vector<int> &s,vector<int> &t){ out("Yes"); vi ans(N,0); each(x,s) if(x!=-1) ans[x] = a[x]; each(x,t) if(x!=-1) ans[x] =-a[x]; out(ans); exit(0); }; dp[0].emplace_back(-1); rep(i,N){ each(x,nxt) x.clear(); rep(j,M+1){ if(dp[j].empty())continue; trc(i,j,dp[j]); if(!nxt[j].empty()){ ret(dp[j],nxt[j]); } nxt[j] = vi(dp[j]); if(j+a[i]>M)continue; dp[j].pb(i); if(!nxt[j+a[i]].empty()){ ret(dp[j],nxt[j+a[i]]); } swap(nxt[j+a[i]],dp[j]); } swap(dp,nxt); } out("No"); }