結果
問題 | No.546 オンリー・ワン |
ユーザー | 小指が強い人 |
提出日時 | 2017-08-20 11:00:36 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 4,045 bytes |
コンパイル時間 | 1,862 ms |
コンパイル使用メモリ | 176,832 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-14 17:20:03 |
合計ジャッジ時間 | 2,455 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,824 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 3 ms
6,820 KB |
testcase_10 | AC | 2 ms
6,816 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> veci; typedef vector<ll> vecll; typedef vector<string> vecs; template<class T,class U> using Hash=unordered_map<T,U>; #define REP(i, a, n) for(ll i = a; i < (ll)n; i++) #define RREP(i, a, n) for(ll i = n-1; i >= (ll)a; i--) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) RREP(i, 0, n) #define MD 1000000007 template<class T> T read(){T a;cin >> a;return a;} template<class T> void read(T& a){cin >> a;} template<class T, class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}} template<char c = ' ',class T> void write(T a){cout << fixed << setprecision(4) << a << endl;} template<char c = ' ',class T,class ...Args> void write(T a, Args... args){cout << fixed << setprecision(4) << a << c; write<c>(args...);} template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;} template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;} void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}} void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}} ull gcd(ull a, ull b){while(true){ull k = a % b;if(k == 0)return b;a = b;b = k;}} ull lcm(ull a, ull b){return a*b/gcd(a,b);} ull comb(ull n, ull m){ull p=1;m=min(m,n-m);for(ull i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;} template<typename FI> void parted_rotate(FI first1, FI last1, FI first2, FI last2) { if(first1 == last1 || first2 == last2) return; FI next = first2; while (first1 != next) { std::iter_swap(first1++, next++); if(first1 == last1) first1 = first2; if (next == last2) { next = first2; } else if (first1 == first2) { first2 = next; } } } template<typename BI> bool next_combination_imp(BI first1, BI last1, BI first2, BI last2) { if(first1 == last1 || first2 == last2) return false; auto target = last1; --target; auto last_elem = last2; --last_elem; // find right-most incrementable element: target while(target != first1 && !(*target < *last_elem)) --target; if(target == first1 && !(*target < *last_elem)) { parted_rotate(first1, last1, first2, last2); return false; } // find the next value to be incremented: *next auto next = first2; while(!(*target < *next)) ++next; std::iter_swap(target++, next++); parted_rotate(target, last1, next, last2); return true; } // INVARIANT: is_sorted(first, mid) && is_sorted(mid, last) template<typename BI> inline bool next_combination(BI first, BI mid, BI last) { return next_combination_imp(first, mid, mid, last); } // INVARIANT: is_sorted(first, mid) && is_sorted(mid, last) template<typename BI> inline bool prev_combination(BI first, BI mid, BI last) { return next_combination_imp(mid, last, first, mid); } int n,l,h; ll c[10]; ll run(int d){ ll res=0; //rep(i,n)res+=d/c[i]; int sign=1; REP(i,1,n+1){ ll t[10]; rep(j,n)t[j]=c[j]; while(true){ ll p=1; rep(j,i){ p=lcm(p,t[j]); if(p>d)break; } res+=d/p*sign*i; if(!next_combination(t,t+i,t+n))break; } sign*=-1; } //write(res); return res; } int main(void) { read(n,l,h); rep(i,n)read(c[i]); sort(c,c+n); ll res=0; res+=run(h); res-=run(l-1); write(res); return 0; }