結果
問題 | No.1279 Array Battle |
ユーザー |
|
提出日時 | 2020-11-06 22:16:24 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 12 ms / 2,000 ms |
コード長 | 7,632 bytes |
コンパイル時間 | 1,821 ms |
コンパイル使用メモリ | 183,216 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-22 13:01:43 |
合計ジャッジ時間 | 2,575 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#pragma region Macros#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 pb push_back#define eb emplace_back#define vi vector<int>#define vll vector<ll>#define vpi vector<pii>#define vpll vector<pll>#define overload2(_1, _2, name, ...) name#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define VEC(type, name, size)\vector<type> name(size);\IN(name)#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define VV(type, name, h, w)\vector<vector<type>> name(h, vector<type>(w));\IN(name)#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...)\vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))#define fi first#define se second#define all(c) begin(c), end(c)#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;template <class T> using pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;#define si(c) (int)(c).size()#define INT(...)\int __VA_ARGS__;\IN(__VA_ARGS__)#define LL(...)\ll __VA_ARGS__;\IN(__VA_ARGS__)#define STR(...)\string __VA_ARGS__;\IN(__VA_ARGS__)#define CHR(...)\char __VA_ARGS__;\IN(__VA_ARGS__)#define DBL(...)\double __VA_ARGS__;\IN(__VA_ARGS__)int scan() { return getchar(); }void scan(int &a) { cin >> a; }void scan(long long &a) { cin >> a; }void scan(char &a) { cin >> a; }void scan(double &a) { cin >> a; }void scan(string &a) { cin >> a; }template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }template <class T> void scan(vector<T> &);template <class T> void scan(vector<T> &a) {for(auto &i : a) scan(i);}template <class T> void scan(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &... tail) {scan(head);IN(tail...);}template <class T, class S> inline bool chmax(T &a, S b) {if(a < b) {a = b;return 1;}return 0;}template <class T, class S> inline bool chmin(T &a, S b) {if(a > b) {a = b;return 1;}return 0;}vi iota(int n) {vi a(n);iota(all(a), 0);return a;}template <typename T> vi iota(vector<T> &a, bool greater = false) {vi res(a.size());iota(all(res), 0);sort(all(res), [&](int i, int j) {if(greater) return a[i] > a[j];return a[i] < a[j];});return res;}#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x)if(n & 1) res *= x;return res;}vector<pll> factor(ll x) {vector<pll> ans;for(ll i = 2; i * i <= x; i++)if(x % i == 0) {ans.push_back({i, 1});while((x /= i) % i == 0) ans.back().second++;}if(x != 1) ans.push_back({x, 1});return ans;}template <class T> vector<T> divisor(T x) {vector<T> ans;for(T i = 1; i * i <= x; i++)if(x % i == 0) {ans.pb(i);if(i * i != x) ans.pb(x / i);}return ans;}template <typename T> void zip(vector<T> &x) {vector<T> y = x;sort(all(y));for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }}int popcount(ll x) { return __builtin_popcountll(x); }int in() {int x;cin >> x;return x;}ll lin() {unsigned long long x;cin >> x;return x;}template <typename T> struct edge {int from, to;T cost;int id;edge(int to, T cost) : from(-1), to(to), cost(cost) {}edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template <typename T> using Edges = vector<edge<T>>;using Tree = vector<vector<int>>;using Graph = vector<vector<int>>;template <class T> using Wgraph = vector<vector<edge<T>>>;Graph getG(int n, int m = -1, bool directed = false, int margin = 1) {Tree res(n);if(m == -1) m = n - 1;while(m--) {int a, b;cin >> a >> b;a -= margin, b -= margin;res[a].emplace_back(b);if(!directed) res[b].emplace_back(a);}return move(res);}template <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {Wgraph<T> res(n);if(m == -1) m = n - 1;while(m--) {int a, b;T c;cin >> a >> b >> c;a -= margin, b -= margin;res[a].emplace_back(b, c);if(!directed) res[b].emplace_back(a, c);}return move(res);}#define i128 __int128_t#define ull unsigned long long inttemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;struct Setup_io {Setup_io() {ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);cout << fixed << setprecision(15);}} setup_io;template <typename A, typename B>ostream& operator <<(ostream& out, const pair<A, B>& a) {out << "(" << a.first << "," << a.second << ")";return out;}template <typename T, size_t N>ostream& operator <<(ostream& out, const array<T, N>& a) {out << "["; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";return out;}template <typename T>ostream& operator <<(ostream& out, const vector<T>& a) {out << "["; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";return out;}template <typename T, class Cmp>ostream& operator <<(ostream& out, const set<T, Cmp>& a) {out << "{"; bool first = true;for (auto& v : a) { out << (first ? "" :", "); out << v; first = 0;} out << "}";return out;}template <typename U, typename T, class Cmp>ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {out << "{"; bool first = true;for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";return out;}// #define LOCAL#ifdef LOCAL#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)#else#define trace(...) 42#endiftemplate <typename Arg1>void __f(const char* name, Arg1&& arg1){cerr << name << ": " << arg1 << endl;}template <typename Arg1, typename... Args>void __f(const char* names, Arg1&& arg1, Args&&... args){const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << ": " << arg1 << " |";__f(comma + 1, args...);}#pragma endregion//#include<atcoder/all>//using namespace atcoder;int main(){INT(n);VEC(ll,a,n);VEC(ll,b,n);sort(all(a));vec(int,num,n);rep(i,n)num[i] = i;ll ret = 0;do{ll tmp = 0;rep(i,n){tmp += max(0ll,a[i] - b[i]);}chmax(ret,tmp);}while(next_permutation(all(a)));trace(ret);int ans = 0;sort(all(a));do{ll tmp = 0;rep(i,n)tmp += max(0ll,a[num[i]] - b[i]);// trace(ret,tmp,a);if(ret == tmp)ans++;}while(next_permutation(all(num)));cout << ans << endl;return 0;}