結果
| 問題 |
No.1017 Reiwa Sequence
|
| ユーザー |
 noimi
|
| 提出日時 | 2020-04-03 22:41:24 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,073 ms / 2,000 ms |
| コード長 | 6,829 bytes |
| コンパイル時間 | 2,382 ms |
| コンパイル使用メモリ | 198,536 KB |
| 実行使用メモリ | 116,096 KB |
| 最終ジャッジ日時 | 2024-07-03 05:03:08 |
| 合計ジャッジ時間 | 37,901 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 50 |
ソースコード
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define vec2(a,b) vector<vec>(a,vec(b))
#define vec2ll(a,b) vector<vecll>(a,vecll(b))
#define vec3(a,b,c) vector<vector<vec>>(a,vec2(b,c))
#define vec3ll(a,b,c) vector<vector<vecll>>(a,vec2ll(b,c))
#define fi first
#define se second
#define endl "\n"
#define all(c) begin(c),end(c)
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),(x)))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),(x)))
using namespace std;
int in() {int x;cin>>x;return x;}
ll lin() {ll x;cin>>x;return x;}
string stin() {string s;cin>>s;return s;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
vec iota(int n){vec a(n);iota(all(a),0);return a;}
void print(){putchar(' ');}
void print(bool a){cout<<a;}
void print(int a){cout<<a;}
void print(long long a){cout<<a;}
void print(char a){cout<<a;}
void print(string &a){cout<<a;}
void print(double a){cout<<a;}
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } cout<<" ";}
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ cout<<'(';print(p.first); cout<<","; print(p.second);cout<<')'; }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ cout<<" "; print(*i); } }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }
ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
#define _GLIBCXX_DEBU
#ifdef _MY_DEBUG
#undef endl
#define debug(x) cout<<#x<<": "<<x<<endl
void err(){}
template<class T> void err(const T& t){ print(t); cout<<" ";}
template<class Head, class... Tail> void err(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); }
#else
#define debug(x)
template<class... T> void err(const T&...){}
#endif
#pragma endregion
string wins[7]={
"ooo",
"o---o",
"-oo",
"oo-",
"o-o",
"--o-",
"-o--"
};
using B = bitset<200000> ;
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll MAXVALUE){
uniform_int_distribution<> rand(0, INT_MAX - 1);
if(MAXVALUE==0)return 0;
return rand(mt)%MAXVALUE;
}
signed main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);cout<<fixed<<setprecision(15);
int n=in();
vec cnt(150001);
vec a;rep(i,n)a.pb(in());
rep(i,n){
if(cnt[a[i]]){
cout<<"Yes\n";
rep(j,n)
if(j+1==cnt[a[i]]){
cout<<-a[i]<<" ";
}
else if(j==i)cout<<a[i]<<" ";
else cout<<0<<" ";
return 0;
}
cnt[a[i]]=i+1;
}
const int S = 12;
if(n>=S*2){
cout<<"Yes\n";
map<ll,vec> mp,mp2;
int T = pow(3,S);
rep(mask,T){
int now=mask;
int sum=0;
vec tmp;
rep(i,S){
if(now%3 == 1){
tmp.pb(a[i]);
sum+=a[i];
}
else if(now%3==2){
tmp.pb(-a[i]);
sum-=a[i];
}
else tmp.pb(0);
now/=3;
}
mp[sum]=tmp;
}
rep(mask,T){
int now=mask;
int sum=0;
vec tmp;
rep2(i,S,S*2-1){
if(now%3 == 1){
tmp.pb(a[i]);
sum+=a[i];
}
else if(now%3==2){
tmp.pb(-a[i]);
sum-=a[i];
}
else tmp.pb(0);
now/=3;
}
mp2[-sum]=tmp;
}
for(auto e:mp){
if(mp2.count(e.fi)){
if(e.se==vec(S,0) and mp2[e.fi]==vec(S,0))continue;
print(e.se);
print(mp2[e.fi]);
rep(i,n-S*2)cout<<0<<" ";
cout<<endl;
return 0;
}
}
}
else{
int pre = n/2;
int suf = (n+1)/2;
map<ll,vec> mp,mp2;
int T = pow(3,pre);
rep(mask,T){
int now=mask;
int sum=0;
vec tmp;
rep(i,pre){
if(now%3 == 1){
tmp.pb(a[i]);
sum+=a[i];
}
else if(now%3==2){
tmp.pb(-a[i]);
sum-=a[i];
}
else tmp.pb(0);
now/=3;
}
mp[sum]=tmp;
}
T*=(pre<suf ? 3:1);
rep(mask,T){
int now=mask;
int sum=0;
vec tmp;
rep2(i,pre,pre+suf-1){
if(now%3 == 1){
tmp.pb(a[i]);
sum+=a[i];
}
else if(now%3==2){
tmp.pb(-a[i]);
sum-=a[i];
}
else tmp.pb(0);
now/=3;
}
mp2[-sum]=tmp;
}
for(auto e:mp){
if(mp2.count(e.fi)){
if(e.se == vec(pre,0) and mp2[e.fi]==vec(suf,0))continue;
cout<<"Yes\n";
print(e.se);
print(mp2[e.fi]);
cout<<endl;
return 0;
}
}
cout<<"No\n";
}
}