#613844 (C++17) No.1374 Absolute Game

提出ソース

結果

問題	No.1374 Absolute Game
ユーザー	Gosu_Hiroo
提出日時	2021-02-05 22:32:22
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	8,917 bytes
コンパイル時間	2,176 ms
コンパイル使用メモリ	209,860 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-07-02 13:07:18
合計ジャッジ時間	3,381 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	1 ms 6,940 KB
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
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	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <bits/stdc++.h>

using namespace std;
using ll=long long;
using ld = long double;
template<typename T, typename U = T>
using P = pair<T, U>;
template<typename T>
using V = vector<T>;
using VI = vector<int>;
using VL = vector<long long>;
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("avx512f")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast")

#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((long long)(x).size())
#define READ ({long long t;cin >> t;t;})

#define FOR(i, __begin, __end) for (auto i = (__begin) - ((__begin) > (__end)); i != (__end) - ((__begin) > (__end)); i += 1 - 2 * ((__begin) > (__end)))
#define REP(i, __end) for (auto i = decltype(__end){0}; i < (__end); ++i)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << '\n'
#define printE(x) cout << (x) << endl;
#define fprint(x) cout << fixed << setprecision(12) << (x) << '\n'
# define BYE(a) do { cout << (a) << endl; return ; } while (false)
#define LB lower_bound
#define UB upper_bound
#define LBI(c, x) distance((c).begin(), lower_bound((c).begin(), (c).end(), (x)))
#define UBI(c, x) distance((c).begin(), upper_bound((c).begin(), (c).end(), (x)))

#ifdef DEBUG
#define DBG(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(cerr,_it, args); }
#define ERR(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(std::cerr,_it, args); }
#else
#define DBG(args...) {};
#define ERR(args...) {};
#endif

void _err(std::ostream &cerr, istream_iterator<string> it){cerr<<endl;}

template<typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args){
    cerr<<*it<<" = "<<a<<"  ";
    _err(cerr, ++it, args...);
}

namespace aux{
    template<std::size_t...>
    struct seq{
    };

    template<std::size_t N, std::size_t... Is>
    struct gen_seq : gen_seq<N - 1, N - 1, Is...>{
    };

    template<std::size_t... Is>
    struct gen_seq<0, Is...> : seq<Is...>{
    };

    template<class Ch, class Tr, class Tuple, std::size_t... Is>
    void print_tuple(std::basic_ostream<Ch, Tr>& os, Tuple const& t, seq<Is...>){
        using swallow = int[];
        (void) swallow{0, (void(os << (Is == 0 ? "" : ",") << std::get<Is>(t)), 0)...};
    }

    template<class Ch, class Tr, class Tuple, std::size_t... Is>
    void read_tuple(std::basic_istream<Ch, Tr>& os, Tuple& t, seq<Is...>){
        using swallow = int[];
        (void) swallow{0, (void(os >> std::get<Is>(t)), 0)...};
    }
} // aux::

template<class Ch, class Tr, class... Args>
auto operator<<(std::basic_ostream<Ch, Tr>& os, std::tuple<Args...> const& t)
-> std::basic_ostream<Ch, Tr>&{
    os << "(";
    aux::print_tuple(os, t, aux::gen_seq<sizeof...(Args)>());
    return os << ")";
}

template<class Ch, class Tr, class... Args>
auto operator>>(std::basic_istream<Ch, Tr>& os, std::tuple<Args...>& t)
-> std::basic_istream<Ch, Tr>&{
    aux::read_tuple(os, t, aux::gen_seq<sizeof...(Args)>());
    return os;
}

template<class T>
inline bool chmax(T &a, const T &b){
    if(a < b){
        a=b;
        return 1;
    }
    return 0;
}

template<class T>
inline bool chmin(T &a, const T &b){
    if(b < a){
        a=b;
        return 1;
    }
    return 0;
}

template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &V){
    is>>V.F>>V.S;
    return is;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &V){
    for(auto &&ele : V)is>>ele;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> V){
    os<<"[";
    int cnt=0;
    T curr;
    if(!V.empty()){
        for(int i=0; i < V.size()-1; ++i){
            if(V[i] == curr)cnt++;
            else cnt=0;
            if(cnt == 4)os<<"... ";
            if(cnt < 4)
                os<<i<<":"<<V[i]<<" ";
            curr=V[i];
        }
        os<<V.size()-1<<":"<<V.back();
    }
    os<<"]\n";
    return os;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P){
    os<<"(";
    os<<P.first<<","<<P.second;
    os<<")";
    return os;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V){
    os<<"{";
    if(!V.empty()){
        auto it=V.begin();
        for(int i=0; i < V.size()-1; ++i){
            os<<*it<<" ";
            it++;
        }
        os<<*it;
    }
    os<<"}\n";
    return os;
}

template<typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V){
    os<<"{";
    if(!V.empty()){
        auto it=V.begin();
        for(int i=0; i < V.size()-1; ++i){
            os<<*it<<" ";
            it++;
        }
        os<<*it;
    }
    os<<"}\n";
    return os;
}

template<typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V){
    os<<"{";
    if(!V.empty()){
        auto it=V.begin();
        for(int i=0; i < V.size()-1; ++i){
            os<<*it<<" ";
            it++;
        }
        os<<*it;
    }
    os<<"}";
    return os;
}

template<typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V){
    os<<"{";
    if(!V.empty()){
        auto it=V.begin();
        for(int i=0; i < V.size()-1; ++i){
            os<<"(";
            os<<it->first<<","<<it->second;
            os<<") ";
            it++;
        }
        os<<"(";
        os<<it->first<<","<<it->second;
        os<<")";
    }
    os<<"}\n";
    return os;
}

template<typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V){
    os<<"{";
    if(!V.empty()){
        auto it=V.begin();
        for(int i=0; i < V.size()-1; ++i){
            os<<"(";
            os<<it->first<<","<<it->second;
            os<<") ";
            it++;
        }
        os<<"(";
        os<<it->first<<","<<it->second;
        os<<")";
    }
    os<<"}\n";
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, const deque<T> V){
    os<<"[";
    if(!V.empty()){
        for(int i=0; i < V.size()-1; ++i){
            os<<V[i]<<"->";
        }
        if(!V.empty())os<<V.back();
    }
    os<<"]\n";
    return os;
};

template<typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V){
    priority_queue<T, Cont, Comp> _V=V;
    os<<"[";
    if(!_V.empty()){
        while(_V.size() > 1){
            os<<_V.top()<<"->";
            _V.pop();
        }
        os<<_V.top();
    }
    os<<"]\n";
    return os;
};

template<class F>
struct y_combinator{
    F f; // the lambda will be stored here

    // a forwarding operator():
    template<class... Args>
    decltype(auto) operator()(Args &&... args) const{
        // we pass ourselves to f, then the arguments.
        // the lambda should take the first argument as `auto&& recurse` or similar.
        return f(*this, std::forward<Args>(args)...);
    }
};

// helper function that deduces the type of the lambda:
template<class F>
y_combinator<std::decay_t<F>> recursive(F &&f){
    return {std::forward<F>(f)};
}

struct hash_pair{
    template<class T1, class T2>
    size_t operator()(const pair<T1, T2> &p) const{
        auto hash1=hash<T1>{}(p.first);
        auto hash2=hash<T2>{}(p.second);
        return hash1^hash2;
    }

};

template<typename U>
auto vec(int n, U v){
    return std::vector(n, v);
}

template<typename... Args>
auto vec(int n, Args... args){
    auto val = vec(std::forward<Args>(args)...);
    return std::vector<decltype(val)>(n, std::move(val));
}

const double PI=2*acos(.0);
const int INF=0x3f3f3f3f;

template<class T>
inline T ceil(T a, T b){return (a+b-1)/b;}
inline long long popcount(ll x){return __builtin_popcountll(x);}

void solve(std::istream& cin, std::ostream& cout, std::ostream& cerr) {
    ll N;cin >> N;
    VL a(N);cin >>a;
    sort(RALL(a));
    ll I = accumulate(ALL(a), 0ll), S = 0;
    REP(i,(N+1)/2)S += a[i];
    DBG(S,I)
    VL ans = {S*2-I,-I,I,I-S*2};
    sort(RALL(ans));
    print(ans[1]);
}







#undef int
int main() {
	istream& in(cin);
    ostream& out(cout);
    ostringstream err;
	in.tie(0); ios::sync_with_stdio(0);
    solve(in, out, err);
	return 0;
}

yukicoder

結果

テストケース

ソースコード