結果
問題 | No.1279 Array Battle |
ユーザー | nazcazcan |
提出日時 | 2020-11-06 21:27:32 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 72 ms / 2,000 ms |
コード長 | 3,208 bytes |
コンパイル時間 | 3,855 ms |
コンパイル使用メモリ | 230,000 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-09-29 18:10:56 |
合計ジャッジ時間 | 4,768 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,384 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 3 ms
4,380 KB |
testcase_13 | AC | 9 ms
4,376 KB |
testcase_14 | AC | 8 ms
4,380 KB |
testcase_15 | AC | 71 ms
4,376 KB |
testcase_16 | AC | 71 ms
4,380 KB |
testcase_17 | AC | 71 ms
4,376 KB |
testcase_18 | AC | 70 ms
4,376 KB |
testcase_19 | AC | 72 ms
4,376 KB |
ソースコード
constexpr bool isDebugMode = false; int testcase = 1; #include <bits/stdc++.h> #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif using namespace std; typedef long long ll; typedef pair<long long, long long> P; struct edge{long long to,cost;}; const int inf = 1 << 27; const long long INF = 1LL << 60; const int COMBMAX = 1001001; const long long MOD = 1000000007; //998244353; const long long dy[] = {-1, 0, 0, 1}; const long long dx[] = {0, -1, 1, 0}; const string abc = "abcdefghijklmnopqrstuvwxyz"; #define rep(i, n) for(int i = 0; i < (n); ++i) #define eachdo(v, e) for (const auto &e : (v)) #define all(v) (v).begin(), (v).end() #define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e)) #define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e)) long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;} void pt(){cout << endl; return;} template<class Head> void pt(Head&& head){cout << head; pt(); return;} template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);} void dpt(){if(!isDebugMode) return; cout << endl; return;} template<class Head> void dpt(Head&& head){if(!isDebugMode) return; cout << head; pt(); return;} template<class Head, class... Tail> void dpt(Head&& head, Tail&&... tail){if(!isDebugMode) return; cout << head << " "; pt(forward<Tail>(tail)...);} template<class T> void enu(T v){rep(i, v.size()) cout << v[i] << " " ; cout << endl;} template<class T> void enu2(T v){rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}} template<class T> void debug(T v){if(!isDebugMode) return; rep(i, v.size()) cout << v[i] << " " ; cout << endl;} template<class T> void debug2(T v){if(!isDebugMode) return; rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}} template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;} template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;} template<class T1, class T2> long long recgcd(T1 a, T2 b){return a % b ? recgcd(b, a % b) : b;} bool valid(long long H, long long W, long long h, long long w) { return 0 <= h && h < H && 0 <= w && w < W; } void solve(); int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); // cin >> testcase; while(testcase--) solve(); return 0; } ll f(vector<ll> o, vector<ll> a, vector<ll> b) { ll N = a.size(); ll ret = 0; rep(i, N){ if(a[o[i]] > b[i]) ret += a[o[i]] - b[i]; } return ret; } void solve(){ ll N; cin >> N; vector<ll> a(N); rep(i, N) cin >> a[i]; vector<ll> b(N); rep(i, N) cin >> b[i]; vector<ll> o(N); rep(i, N) o[i] = i; ll ans = 0; do{ chmax(ans, f(o, a, b)); }while(next_permutation(all(o))); ll ret = 0; rep(i, N) o[i] = i; do{ if (ans == f(o, a, b)) ret++; }while(next_permutation(all(o))); pt(ret); }