結果
問題 | No.937 Ultra Sword |
ユーザー | fuppy_kyopro |
提出日時 | 2019-11-29 23:31:35 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,059 bytes |
コンパイル時間 | 1,526 ms |
コンパイル使用メモリ | 175,660 KB |
実行使用メモリ | 14,188 KB |
最終ジャッジ日時 | 2024-05-01 02:53:59 |
合計ジャッジ時間 | 12,277 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
11,228 KB |
testcase_01 | WA | - |
testcase_02 | AC | 4 ms
11,252 KB |
testcase_03 | AC | 4 ms
11,252 KB |
testcase_04 | AC | 4 ms
11,228 KB |
testcase_05 | AC | 369 ms
12,008 KB |
testcase_06 | AC | 204 ms
13,904 KB |
testcase_07 | AC | 221 ms
13,936 KB |
testcase_08 | AC | 97 ms
12,536 KB |
testcase_09 | AC | 73 ms
12,468 KB |
testcase_10 | AC | 234 ms
13,944 KB |
testcase_11 | AC | 21 ms
11,720 KB |
testcase_12 | AC | 91 ms
12,208 KB |
testcase_13 | AC | 86 ms
12,372 KB |
testcase_14 | AC | 100 ms
12,308 KB |
testcase_15 | AC | 83 ms
12,156 KB |
testcase_16 | AC | 7 ms
11,464 KB |
testcase_17 | AC | 12 ms
11,524 KB |
testcase_18 | AC | 90 ms
12,188 KB |
testcase_19 | AC | 55 ms
11,912 KB |
testcase_20 | AC | 45 ms
11,848 KB |
testcase_21 | AC | 260 ms
14,188 KB |
testcase_22 | AC | 15 ms
11,224 KB |
testcase_23 | WA | - |
testcase_24 | AC | 374 ms
12,068 KB |
testcase_25 | AC | 322 ms
11,988 KB |
testcase_26 | AC | 370 ms
11,928 KB |
testcase_27 | AC | 349 ms
11,888 KB |
testcase_28 | AC | 458 ms
12,180 KB |
testcase_29 | AC | 144 ms
11,288 KB |
testcase_30 | AC | 196 ms
11,976 KB |
testcase_31 | AC | 469 ms
12,104 KB |
testcase_32 | AC | 317 ms
11,780 KB |
testcase_33 | AC | 504 ms
12,040 KB |
testcase_34 | AC | 334 ms
11,620 KB |
testcase_35 | AC | 202 ms
11,488 KB |
testcase_36 | AC | 333 ms
11,992 KB |
testcase_37 | AC | 188 ms
11,392 KB |
testcase_38 | AC | 283 ms
11,936 KB |
testcase_39 | AC | 68 ms
11,344 KB |
testcase_40 | AC | 394 ms
11,900 KB |
testcase_41 | AC | 184 ms
11,576 KB |
testcase_42 | AC | 390 ms
11,820 KB |
testcase_43 | AC | 376 ms
11,752 KB |
testcase_44 | AC | 74 ms
11,672 KB |
testcase_45 | AC | 478 ms
11,728 KB |
testcase_46 | AC | 223 ms
11,844 KB |
ソースコード
#include <bits/stdc++.h> #include <unistd.h> using namespace std; #define DEBUG(x) cerr<<#x<<": "<<x<<endl; #define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl #define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;} typedef long long ll; #define int ll #define vi vector<int> #define vl vector<ll> #define vii vector< vector<int> > #define vll vector< vector<ll> > #define vs vector<string> #define pii pair<int,int> #define pis pair<int,string> #define psi pair<string,int> #define pll pair<ll,ll> template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); } template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); } template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(n);i++) #define rep1(i,n) for(int i=1;i<=(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(n);i>0;i--) #define REP(i,a,b) for(int i=a;i<b;i++) #define in(x, a, b) (a <= x && x < b) #define all(c) c.begin(),c.end() template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const ll MOD = 1000000007; //const ll MOD = 998244353; const double pi = 3.14159265358979323846; #define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl; int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 }; int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0}; int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 }; #define fio() cin.tie(0); ios::sync_with_stdio(false); // #define mp make_pair //#define endl '\n' /*void print_bit(int x) { int mask = 1 << 10; while (mask) { if (x & mask) cout << 1; else cout << 0; mask >>= 1; } cout << endl; } signed main() { int n; cin >> n; vi a(n); rep (i, n) { cin >> a[i]; } bool update = true; int m = 1000; vector<bool> used(m + 1); rep (i, n) { used[a[i]] = true; } while (update) { update = false; rep1 (i, m) { if (not used[i]) continue; int x = i * 2; while (x <= m) { if (not used[x]) { used[x] = true; update = true; } x *= 2; } } rep1 (i, m) { if (not used[i]) continue; for (int j = i + 1; j <= m; j++) { if (not used[j]) continue; if (not used[(i ^ j)]) { used[(i ^ j)] = true; update = true; } } } } rep (i, m + 1) { if (used[i]) { cout << i << " "; print_bit(i); } } } //*/ signed main() { int n; cin >> n; vl a(n); rep (i, n) cin >> a[i]; const int m = 1000000; vi sub(m + 1); rep (i, n) { for (int x = 1; x * x <= a[i]; x++) { if (a[i] % x == 0) { int y = a[i] / x; sub[x] += a[i] - a[i] / x; if (x != y) { sub[y] += a[i] - a[i] / y; } } } } priority_queue<pii> pq; rep (i, m + 1) { if (sub[i] >= 1) { pq.push(pii(sub[i], i)); } } bitset<2 * m + 1> used; rep (i, n) { int x = a[i]; while (x <= 2 * m) { used[x] = true; x *= 2; } } ll ans = 0; rep (i, n) { ans += a[i]; } while (pq.size() > 0) { pll temp = pq.top(); pq.pop(); ll x = temp.second; if (used[x]) { cout << ans - sub[x] << endl; return 0; } for (int i = 0; i <= 2 * m; i++) { if (used[i]) { ll y = x ^ i; if (used[y]) { cout << ans - sub[x] << endl; return 0; } } } } }