結果
問題 | No.1411 Hundreds of Conditions Sequences |
ユーザー | kiyoshi0205 |
提出日時 | 2021-02-28 18:22:10 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 144 ms / 2,000 ms |
コード長 | 4,184 bytes |
コンパイル時間 | 2,818 ms |
コンパイル使用メモリ | 203,988 KB |
実行使用メモリ | 22,672 KB |
最終ジャッジ日時 | 2024-04-27 03:40:56 |
合計ジャッジ時間 | 12,344 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 11 ms
9,456 KB |
testcase_01 | AC | 11 ms
9,436 KB |
testcase_02 | AC | 12 ms
9,464 KB |
testcase_03 | AC | 12 ms
9,460 KB |
testcase_04 | AC | 11 ms
9,504 KB |
testcase_05 | AC | 11 ms
9,432 KB |
testcase_06 | AC | 11 ms
9,428 KB |
testcase_07 | AC | 11 ms
9,324 KB |
testcase_08 | AC | 11 ms
9,476 KB |
testcase_09 | AC | 11 ms
9,388 KB |
testcase_10 | AC | 11 ms
9,532 KB |
testcase_11 | AC | 12 ms
9,460 KB |
testcase_12 | AC | 108 ms
16,512 KB |
testcase_13 | AC | 84 ms
14,924 KB |
testcase_14 | AC | 51 ms
12,472 KB |
testcase_15 | AC | 85 ms
14,776 KB |
testcase_16 | AC | 16 ms
9,924 KB |
testcase_17 | AC | 81 ms
14,584 KB |
testcase_18 | AC | 106 ms
16,468 KB |
testcase_19 | AC | 117 ms
17,076 KB |
testcase_20 | AC | 49 ms
12,460 KB |
testcase_21 | AC | 127 ms
17,548 KB |
testcase_22 | AC | 55 ms
12,800 KB |
testcase_23 | AC | 113 ms
16,624 KB |
testcase_24 | AC | 12 ms
9,472 KB |
testcase_25 | AC | 108 ms
16,500 KB |
testcase_26 | AC | 79 ms
14,644 KB |
testcase_27 | AC | 51 ms
12,604 KB |
testcase_28 | AC | 91 ms
15,376 KB |
testcase_29 | AC | 22 ms
10,368 KB |
testcase_30 | AC | 69 ms
14,044 KB |
testcase_31 | AC | 66 ms
13,680 KB |
testcase_32 | AC | 123 ms
17,672 KB |
testcase_33 | AC | 132 ms
17,652 KB |
testcase_34 | AC | 133 ms
17,668 KB |
testcase_35 | AC | 125 ms
17,424 KB |
testcase_36 | AC | 126 ms
17,580 KB |
testcase_37 | AC | 125 ms
17,596 KB |
testcase_38 | AC | 125 ms
17,552 KB |
testcase_39 | AC | 125 ms
17,616 KB |
testcase_40 | AC | 126 ms
17,664 KB |
testcase_41 | AC | 125 ms
17,484 KB |
testcase_42 | AC | 126 ms
17,588 KB |
testcase_43 | AC | 126 ms
17,584 KB |
testcase_44 | AC | 126 ms
17,520 KB |
testcase_45 | AC | 137 ms
17,596 KB |
testcase_46 | AC | 127 ms
17,668 KB |
testcase_47 | AC | 123 ms
17,572 KB |
testcase_48 | AC | 126 ms
17,592 KB |
testcase_49 | AC | 130 ms
17,628 KB |
testcase_50 | AC | 127 ms
17,752 KB |
testcase_51 | AC | 125 ms
17,596 KB |
testcase_52 | AC | 132 ms
17,892 KB |
testcase_53 | AC | 128 ms
17,732 KB |
testcase_54 | AC | 129 ms
17,784 KB |
testcase_55 | AC | 128 ms
17,788 KB |
testcase_56 | AC | 133 ms
17,752 KB |
testcase_57 | AC | 134 ms
17,740 KB |
testcase_58 | AC | 144 ms
17,768 KB |
testcase_59 | AC | 134 ms
17,748 KB |
testcase_60 | AC | 132 ms
17,832 KB |
testcase_61 | AC | 134 ms
17,664 KB |
testcase_62 | AC | 53 ms
14,196 KB |
testcase_63 | AC | 143 ms
22,672 KB |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:132:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 132 | for(auto [p,cnt]:ch[i]){ | ^ main.cpp:140:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 140 | for(auto [p,x]:fmp){ | ^
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; // #define double long double using datas=pair<ll,ll>; using ddatas=pair<double,double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end()) #define endl "\n" #define eb emplace_back #define print(x) cout<<x<<endl #define printyes print("Yes") #define printno print("No") #define printYES print("YES") #define printNO print("NO") #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) constexpr ll mod=1000000007; // constexpr ll mod=998244353; constexpr ll inf=1LL<<60; constexpr long double eps=1e-9; const long double PI=acosl(-1); template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";} template<class T> ostream& operator<<(ostream& os,const vector<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const set<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} #ifdef DEBUG void debugg(){cout<<endl;} template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);} #define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__) #else #define debug(...) (void(0)) #endif void startupcpp(){ cin.tie(0); ios::sync_with_stdio(false); } vector<int> eratosthenes(int N){ vector<int> ch(N+1,1); for(int i=2;i<=N;++i){ if(ch[i]==1){ for(int j=1;i*j<=N;j++){ ch[i*j]=i; } } } return ch; } ll modpow(ll a,ll n,ll m=mod){ if(n<0)return 0; ll res=1; while(n>0){ if(n&1)res=res*a%m; a=a*a%m; n>>=1; } return res; } ll modinv(ll a,ll m=mod) { ll b=m,u=1,v=0,t; while(b){ t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return (u+m)%m; } vector<pair<int,int>> ch[100001]; int main(){ startupcpp(); auto v=eratosthenes(1000000); int N; ll allprod=1,alllcm=1; cin>>N; vector<ll> a(N); map<int,pair<int,int>> fmp; map<int,int> smp; for(int i=0;i<N;++i){ cin>>a[i]; (allprod*=a[i])%=mod; int x=a[i]; while(x!=1){ if(ch[i].empty()||ch[i].back().first!=v[x]){ ch[i].emplace_back(v[x],1); }else ch[i].back().second++; x/=v[x]; } for(auto [p,cnt]:ch[i]){ auto now=fmp[p]; if(chmax(fmp[p],pair<int,int>(cnt,i)))smp[p]=now.first; else chmax(smp[p],cnt); } debug(ch[i]); } vector<ll> invlist(N,1); for(auto [p,x]:fmp){ (alllcm*=modpow(p,x.first))%=mod; (invlist[x.second]*=modpow(p,x.first-smp[p]))%=mod; } debug(fmp,smp); for(int i=0;i<N;++i){ ll ans1=allprod*modinv(a[i])%mod; ll ans2=alllcm*modinv(invlist[i])%mod; print((ans1-ans2+mod)%mod); } }