結果
問題 | No.1463 Hungry Kanten |
ユーザー | yuto1115 |
提出日時 | 2021-04-02 21:27:52 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,243 ms / 2,000 ms |
コード長 | 4,951 bytes |
コンパイル時間 | 2,442 ms |
コンパイル使用メモリ | 220,812 KB |
実行使用メモリ | 196,424 KB |
最終ジャッジ日時 | 2023-08-25 14:43:00 |
合計ジャッジ時間 | 5,690 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 25 ms
8,052 KB |
testcase_03 | AC | 124 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1,243 ms
196,424 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 3 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,384 KB |
testcase_14 | AC | 9 ms
5,196 KB |
testcase_15 | AC | 3 ms
4,380 KB |
testcase_16 | AC | 31 ms
10,320 KB |
testcase_17 | AC | 86 ms
17,072 KB |
testcase_18 | AC | 26 ms
8,780 KB |
testcase_19 | AC | 465 ms
78,820 KB |
testcase_20 | AC | 572 ms
104,116 KB |
testcase_21 | AC | 2 ms
4,376 KB |
ソースコード
//@formatter:off #include<bits/stdc++.h> #define overload4(_1,_2,_3,_4,name,...) name #define rep1(i,n) for (ll i = 0; i < ll(n); ++i) #define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i) #define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d) #define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__) #define rrep1(i,n) for (ll i = ll(n)-1; i >= 0; i--) #define rrep2(i,n,t) for (ll i = ll(n)-1; i >= (ll)t; i--) #define rrep3(i,n,t,d) for (ll i = ll(n)-1; i >= (ll)t; i-=d) #define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define popcount(x) __builtin_popcountll(x) #define pb push_back #define eb emplace_back #ifdef __LOCAL #define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; } #else #define debug(...) void(0) #endif #define INT(...) int __VA_ARGS__;scan(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__) #define STR(...) string __VA_ARGS__;scan(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__) using namespace std; using ll = long long; using ld = long double; using P = pair<int,int>; using LP = pair<ll,ll>; using vi = vector<int>; using vvi = vector<vector<int>>; using vl = vector<ll>; using vvl = vector<vector<ll>>; using vd = vector<double>; using vvd = vector<vector<double>>; using vs = vector<string>; using vc = vector<char>; using vvc = vector<vector<char>>; using vb = vector<bool>; using vvb = vector<vector<bool>>; using vp = vector<P>; using vvp = vector<vector<P>>; template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; } template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; } template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; } template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; } template<class T> void vecout(const vector<T> &v,char div='\n') { rep(i,v.size()) cout<<v[i]<<(i==int(v.size()-1)?'\n':div);} template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;} template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;} void scan(){} template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); } template<class T> void print(const T& t){ cout << t << '\n'; } template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); } template<class... T> void fin(const T&... a) { print(a...); exit(0); } struct Init_io { Init_io() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cout << boolalpha << fixed << setprecision(15); } } init_io; const string yes[] = {"no","yes"}; const string Yes[] = {"No","Yes"}; const string YES[] = {"NO","YES"}; const int inf = 1001001001; const ll linf = 1001001001001001001; //@formatter:on class sieve { int n; vi val; void init() { rep(i, n + 1) val[i] = i; for (int i = 2; i * i <= n; i++) { if (val[i] != i) continue; for (int j = i * 2; j <= n; j += i) { if (val[j] == j) val[j] = i; } } } public: sieve(int n) : n(n), val(n + 1) { init(); } map<int, int> factorlist(int x) { if (n < 2) return {}; map<int, int> ret; int now = x; while (now > 1) { ret[val[now]]++; now /= val[now]; } return ret; } vi unique_factor(int x) { map<int, int> m = factorlist(x); vi ret; for (P p : m) ret.pb(p.first); return ret; }; bool isPrime(int x) { return x >= 2 and val[x] == x; } int count_divisor(int x) { int ret = 1; map<int, int> fl = factorlist(x); for (auto p : fl) ret *= p.second + 1; return ret; }; } sv(20000); int main() { INT(n, k); vi a(n); cin >> a; vector<map<int, int>> v(n); rep(i, n) v[i] = sv.factorlist(a[i]); set<map<int, int>> st; rep(bit, 1 << n) { if (popcount(bit) < k) continue; map<int, int> mp; rep(i, n) { if (bit >> i & 1) { for (auto[val, cnt] : v[i]) { mp[val] += cnt; } } } st.insert(mp); } rep(bit, 1 << n) { if (popcount(bit) < k) continue; int now = 0; rep(i, n) { if (bit >> i & 1) { now += a[i]; } } st.insert(sv.factorlist(now)); } fin(st.size()); }