結果
| 問題 | No.332 数列をプレゼントに |
| ユーザー |
 shimomire
|
| 提出日時 | 2015-12-25 00:32:05 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 26 ms / 2,000 ms |
| コード長 | 5,460 bytes |
| コンパイル時間 | 1,196 ms |
| コンパイル使用メモリ | 125,320 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-12-24 07:25:05 |
| 合計ジャッジ時間 | 3,736 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 42 |
ソースコード
#include <cassert>// c#include <iostream>// io#include <iomanip>#include <fstream>#include <sstream>#include <vector>// container#include <map>#include <set>#include <queue>#include <bitset>#include <stack>#include <algorithm>// other#include <complex>#include <numeric>#include <functional>#include <random>#include <regex>using namespace std;using i32=int32_t;using i64=int64_t;using ll =i64;using uint=uint32_t;using ull=uint64_t;template<typename T> using matrix=vector<vector<T> >;#define ALL(c) (begin(c)),(end(c))#define REP(i,n) FOR(i,0,n)#define REPr(i,n) FORr(i,0,n)#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)#define IN(l,v,r) ((l)<=(v) && (v)<(r))#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())//debug#define DUMP(x) cerr << #x << " = " << (x)#define LINE() cerr<< " (L" << __LINE__ << ")"class range {private:struct Iter{int v;int operator*(){return v;}bool operator!=(Iter& itr) {return v < itr.v;}void operator++() {++v;}};Iter i, n;public:range(int n) : i({0}), n({n}) {}range(int i, int n) : i({i}), n({n}) {}Iter& begin() {return i;}Iter& end() {return n;}};//outputtemplate<typename T> ostream& operator << (ostream& os, const vector<T>& as){REP(i,as.size()){if(i!=0)os<<" "; os<<as[i];}return os;}template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){REP(i,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){os<<p.first<<" "<<p.second;return os;}template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){os << get<0>(t);return os;}template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){os << get<0>(t)<<" "<<get<1>(t);return os;}template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);return os;}template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);return os;}template<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t);return os;}template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>&t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t);return os;}template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t)<<" "<<get<6>(t);return os;}//inputchar tmp[1000];#define nextInt(n) scanf("%d",&n)#define nextLong(n) scanf("%lld",&n) //I64d#define nextDouble(n) scanf("%lf",&n)#define nextChar(n) scanf("%c",&n)#define nextString(n) scanf("%s",tmp);n=tmp// valuestemplate<typename T> T INF(){assert(false);};template<> int INF<int>(){return 1<<28;};template<> ll INF<ll>(){return 1LL<<58;};template<> double INF<double>(){return 1e16;};template<class T> T EPS(){assert(false);};template<> int EPS<int>(){return 1;};template<> ll EPS<ll>(){return 1LL;};template<> double EPS<double>(){return 1e-8;};template<> long double EPS<long double>(){return 1e-8;};template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}ll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }ll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }ll lcm(ll a,ll b){return a/gcd(a,b)*b;}class Main{public:vector<string> dp;int N; ll X;vector<pair<ll,int>> as;string str="";bool ok = false;void dfs(ll v,int i){if(IN(0,X-v,100050) and dp[X-v].size()>0){ok = true;for(int i:range(N))if(dp[X-v][i]=='o')str[i]='o';return;}if(i==N)return;if(!ok){dfs(v,i+1);}if(!ok){str[as[i].second] = 'o';dfs(v+as[i].first,i+1);if(!ok)str[as[i].second] = 'x';}}void run(){cin >> N >> X;as = vector<pair<ll,int>>(N);for(int i:range(N)){int v;cin >> v;as[i]={v,i};}sort(ALL(as));// 上の20個は 2^20 -> 残りは 10^5 以下 くらいdp = vector<string>(100050,string(0,'x'));for(int i:range(N)) dp[0]+='x';for(int i:range(max(0,N-20))){for(int v=100050-1;v>=0;v--)if(dp[v].size()>0){assert(v+as[i].first < 100050);// cerr<< make_tuple(v+as[i].first,v) << endl;dp[v+as[i].first] = dp[v];dp[v+as[i].first][as[i].second] = 'o';}}for(int i:range(N)) str+='x';dfs(0,max(0,N-20));if(ok){cout << str << endl;}else{cout << "No" << endl;}}};int main(){cout <<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);Main().run();return 0;}