結果

問題 No.1017 Reiwa Sequence
ユーザー noiminoimi
提出日時 2020-04-03 22:37:15
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,816 bytes
コンパイル時間 2,794 ms
コンパイル使用メモリ 199,752 KB
実行使用メモリ 13,568 KB
最終ジャッジ日時 2024-07-03 04:51:52
合計ジャッジ時間 31,515 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
6,812 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 3 ms
6,940 KB
testcase_10 AC 53 ms
12,928 KB
testcase_11 AC 3 ms
6,940 KB
testcase_12 AC 56 ms
13,568 KB
testcase_13 AC 53 ms
13,568 KB
testcase_14 AC 2 ms
6,940 KB
testcase_15 AC 3 ms
6,940 KB
testcase_16 AC 3 ms
6,944 KB
testcase_17 AC 5 ms
6,944 KB
testcase_18 AC 3 ms
6,940 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 46 ms
10,880 KB
testcase_28 AC 48 ms
11,136 KB
testcase_29 AC 52 ms
12,032 KB
testcase_30 AC 49 ms
12,800 KB
testcase_31 AC 42 ms
9,600 KB
testcase_32 AC 41 ms
9,856 KB
testcase_33 AC 41 ms
10,368 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,940 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 30 ms
6,944 KB
testcase_38 AC 33 ms
6,940 KB
testcase_39 AC 47 ms
11,392 KB
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 AC 38 ms
6,940 KB
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 AC 26 ms
6,940 KB
testcase_49 AC 45 ms
6,944 KB
testcase_50 AC 25 ms
6,940 KB
testcase_51 AC 3 ms
6,940 KB
testcase_52 AC 38 ms
9,728 KB
testcase_53 AC 33 ms
7,424 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#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;
    }
    if(n>18){
        cout<<"Yes\n";
        map<ll,vec> mp,mp2;
        int T = pow(3,9);
        rep(mask,T){
            int now=mask;
            int sum=0;
            vec tmp;
            rep(i,9){
                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*=3;
        rep(mask,T){
            int now=mask;
            int sum=0;
            vec tmp;
            rep2(i,9,18){
                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(9,0) and mp2[e.fi]==vec(10,0))continue;
                print(e.se);
                print(mp2[e.fi]);
                rep(i,n-19)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";
    }
}



0