結果
問題 | No.990 N×Mマス計算(Kの倍数) |
ユーザー | wakannyaai |
提出日時 | 2020-02-24 14:16:56 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 151 ms / 2,000 ms |
コード長 | 4,832 bytes |
コンパイル時間 | 1,830 ms |
コンパイル使用メモリ | 182,764 KB |
実行使用メモリ | 45,236 KB |
最終ジャッジ日時 | 2024-04-27 21:33:57 |
合計ジャッジ時間 | 3,713 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 10 ms
34,628 KB |
testcase_01 | AC | 12 ms
34,460 KB |
testcase_02 | AC | 12 ms
34,564 KB |
testcase_03 | AC | 11 ms
34,536 KB |
testcase_04 | AC | 11 ms
34,520 KB |
testcase_05 | AC | 11 ms
34,616 KB |
testcase_06 | AC | 11 ms
34,520 KB |
testcase_07 | AC | 11 ms
34,588 KB |
testcase_08 | AC | 12 ms
34,484 KB |
testcase_09 | AC | 11 ms
34,480 KB |
testcase_10 | AC | 54 ms
37,616 KB |
testcase_11 | AC | 54 ms
35,668 KB |
testcase_12 | AC | 151 ms
36,176 KB |
testcase_13 | AC | 39 ms
35,188 KB |
testcase_14 | AC | 59 ms
35,856 KB |
testcase_15 | AC | 42 ms
35,252 KB |
testcase_16 | AC | 66 ms
38,364 KB |
testcase_17 | AC | 33 ms
35,100 KB |
testcase_18 | AC | 151 ms
36,188 KB |
testcase_19 | AC | 62 ms
35,444 KB |
testcase_20 | AC | 150 ms
45,236 KB |
ソースコード
#include "bits/stdc++.h" #include <unordered_set> #define rep(i,n) for(int i = 0; i < n; i++) typedef long long ll; typedef unsigned long long ull; using namespace std; #define vll vector<vector<long long>> #define vl vector<long long> #define vi vector<int> #define vii vector<vector<int>> #define pb push_back #define pf push_front #define ld long double #define Sort(a) sort(a.begin(),a.end()) #define cSort(a,cmp) sort(a.begin(),a.end(),cmp) #define reSort(a) sort(a.rbegin(), a.rend()) static const ll llMAX = numeric_limits<long long>::max(); static const int intMAX = numeric_limits<int>::max(); static const ll llMIN = numeric_limits<long long>::min(); static const int intMIN = numeric_limits<int>::min(); static const ll d_5 = 100000; static const ll d9_7 = 1000000007; static const ll d_9 = 1000000000; static const double PI=3.14159265358979323846; template<class T> void Printvector(std::vector<T> a){ int size = a.size(); rep(i,size){ cout<<a[i]<<" "; } cout<<endl; } template<class T> void Printvector(std::vector<std::vector<T>> a){ int size = a.size(); rep(i,size){ int size2=a[i].size(); rep(j,size2){ cout<<a[i][j]<<" "; } cout<<endl; } cout<<endl; } ll digitpower(ll a,ll b){//aのb乗を計算 if(b==1){ return a; }else if(b==0){ return 1; } int mode=1; if(b%2==1){ ll tmp = digitpower(a,(b-1)/2); if(mode==1){ tmp%=d9_7; } tmp*=tmp; if(mode==1){ tmp%=d9_7; } tmp*=a; if(mode==1){ return tmp%d9_7; }else{ return tmp; } }else{ ll tmp = digitpower(a,(b)/2); if(mode==1){ tmp%=d9_7; } tmp*=tmp; if(mode==1){ tmp%=d9_7; } if(mode==1){ return tmp%d9_7; }else{ return tmp; } } } vl facs(2000010,-1); ll Factrial(ll num){ if(facs[num]!=-1){ return facs[num]; } if(num==1||num<=0){ return 1; }else if(num<0){ printf("ERROR_minus\n"); return 0; }else{ facs[num]=(num*Factrial(num-1))%d9_7; return facs[num]; } } long long modinv(long long a, long long m) {//modの逆元 long long b = m, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= m; if (u < 0) u += m; return u; } vl invs(2000010,-1); ll linercomb(ll n,ll k, ll mod){//n,kの線形時間で求める if(n<k)return 0; if(n<0)return 0; if(k==0 || k==n)return 1; ll ans=Factrial(n); if(invs[k]==-1){ invs[k]=modinv(Factrial(k),mod); } ans*=invs[k]; ans%=d9_7; ll k1=Factrial(n-k); k1%=mod; ans*=modinv(k1,mod); ans%=mod; return ans; } unordered_map<ll,ll> prime_factor(int64_t n) { unordered_map<ll,ll> ret; for(int64_t i = 2; i * i <= n; i++) { while(n % i == 0) { ret[i]++; n /= i; } } if(n != 1) ret[n] = 1; return ret; } template<class T> vector<T> getaccum(vector<T> a){ int size=a.size(); vector<T> ans(size); ans[0]=a[0]; for(int i=0;i<size-1;i++){ ans[i+1]=ans[i]+a[i+1]; //ans[i+1]%=d9_7; } return ans; } ll getaccumnum(vector<ll> accum,int l,int r){//閉区間[l,r]の総和 if(l==0){ return accum[r]; }else{ return accum[r]-accum[l-1]; } } struct datas{ ll p; ll q; };/* bool cmp(const datas &a, const datas &b) { return a.num < b.num; }*/ template<class T> T gcd(T a,T b){ if(a==0){ return b; }else if(b==0){ return a; } while(1) { if(a < b) swap(a, b); if(!b) break; a %= b; } return a; } int main(void){ ll n,m,k; cin>>n>>m>>k; char ope; cin>>ope; vl b(m); rep(i,m)cin>>b[i]; vl a(n); rep(i,n)cin>>a[i]; if(ope=='*'){ unordered_map<ll,ll> ka,kb; rep(i,n){ ll tmp=gcd((ll)k,(ll)a[i]); if(ka.find(tmp)==ka.end()){ ka.insert({tmp,1}); }else{ ka[tmp]++; } } rep(i,m){ ll tmp=gcd(k,(ll)b[i]); if(kb.find(tmp)==kb.end()){ kb.insert({tmp,1}); }else{ kb[tmp]++; } } ll ans=0; for(auto i:ka){ for(auto j:kb){ if((i.first*j.first)%k==0){ ans+=i.second*j.second; } } } cout<<ans<<endl; }else{ unordered_map<ll,ll> ka,kb; rep(i,n){ ll tmp=a[i]%k; if(ka.find(tmp)==ka.end()){ ka.insert({tmp,1}); }else{ ka[tmp]++; } } rep(i,m){ ll tmp=b[i]%k; if(kb.find(tmp)==kb.end()){ kb.insert({tmp,1}); }else{ kb[tmp]++; } } ll ans=0; for(auto i:ka){ if(kb.find((k-i.first)%k)!=kb.end()){ ans+=i.second*kb[(k-i.first)%k]; } } cout<<ans<<endl; } return 0; } //<<std::setprecision(30) //重複削除 /* std::sort(vec.begin(), vec.end()); vec.erase(std::unique(vec.begin(), vec.end()), vec.end());*/