結果
| 問題 | No.990 N×Mマス計算（Kの倍数） |
| ユーザー |
 east1016
|
| 提出日時 | 2020-02-14 22:36:44 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,158 bytes |
| コンパイル時間 | 2,932 ms |
| コンパイル使用メモリ | 225,136 KB |
| 実行使用メモリ | 23,552 KB |
| 最終ジャッジ日時 | 2024-11-16 01:02:40 |
| 合計ジャッジ時間 | 4,516 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 2 ms
6,820 KB |
| testcase_02 | WA | - |
| testcase_03 | AC | 2 ms
6,816 KB |
| testcase_04 | AC | 2 ms
6,816 KB |
| testcase_05 | AC | 2 ms
6,816 KB |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | AC | 2 ms
6,820 KB |
| testcase_09 | AC | 2 ms
6,816 KB |
| testcase_10 | AC | 50 ms
10,240 KB |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | AC | 62 ms
11,136 KB |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | AC | 174 ms
23,552 KB |
コンパイルメッセージ
main.cpp:55:11: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
55 | void Vout(auto a){if(a.size()==0) cout<<"."<<endl;
| ^~~~
main.cpp:57:11: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
57 | void Verr(auto a){if(a.size()==0) cerr<<"."<<endl;
| ^~~~
main.cpp:59:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
59 | void VVout(auto a){if(a.size()==0)cout<<"."<<endl;
| ^~~~
main.cpp:61:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
61 | void VVerr(auto a){if(a.size()==0)cerr<<"."<<endl;
| ^~~~
main.cpp:63:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
63 | void VPout(auto a){if(a.size()==0)cout<<"."<<endl;
| ^~~~
main.cpp:65:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
65 | void VPerr(auto a){if(a.size()==0)cerr<<"."<<endl;
| ^~~~
main.cpp:83:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
83 | void press(auto &v){v.erase(unique(ALL(v)),v.end());} // 圧縮
| ^~~~
ソースコード
#include <bits/stdc++.h> // ver2.4.4
#include <complex.h>
//#include <boost/math/tools/minima.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#define fmin brent_find_minima
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()
#define Vi vector<int>
#define VVi vector<Vi>
#define VVVi vector<VVi>
#define Vm vector<mint>
#define Vs vector<string>
#define Pii pair<int,int>
#define Pdd pair<double,double>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define VTiii vector<Tiii>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define dem(a,b) ((a+b-1)/(b))
#define Vin(a) rep(iI,0,a.size())cin>>a[iI]
#define INF 3000000000000000000 // 3.0*10^18(MAXの1/3くらい)
#define MAX LLONG_MAX
#define PI 3.141592653589793238462
#define MOD 1000000007 // 10^9 + 7
using namespace std;
/* fmin(f,L,R,100) で関数の最小値を(x,min)で返す */
//using boost::math::tools::brent_find_minima;
/* cpp_int (任意の長さのint) */
//using boost::multiprecision::cpp_int;
/* デバッグ用 */
void Vout(auto a){if(a.size()==0) cout<<"."<<endl;
else{rep(i,0,a.size()-1)cout<<a[i]<<' ';if(a.size()>0)cout<<a.back()<<endl;}return;}
void Verr(auto a){if(a.size()==0) cerr<<"."<<endl;
else{rep(i,0,a.size()-1)cerr<<a[i]<<' ';if(a.size()>0)cerr<<a.back()<<endl;}return;}
void VVout(auto a){if(a.size()==0)cout<<"."<<endl;
else{rep(i,0,a.size())Vout(a[i]);}return;}
void VVerr(auto a){if(a.size()==0)cerr<<"."<<endl;
else{rep(i,0,a.size())Verr(a[i]);}return;}
void VPout(auto a){if(a.size()==0)cout<<"."<<endl;
else{rep(i,0,a.size())cout<<a[i].FI<<' '<<a[i].SE<<endl;}return;}
void VPerr(auto a){if(a.size()==0)cerr<<"."<<endl;
else{rep(i,0,a.size())cerr<<a[i].FI<<' '<<a[i].SE<<endl;}return;}
/* 便利関数 */
int gcd(int a,int b){return b?gcd(b,a%b):a;} // 最大公約数gcd
int lcm(int a,int b){return a/gcd(a,b)*b;} // 最小公倍数lcm
int mypow(int x, int n, int m){ // 累乗x^n(mod m) O(log(n))
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int scomb(int n, int r){if(n<=0||r<0||r>n)return 0;if((n-r)<r)r=n-r; // nCr
int a=1;for(int i=n;i>n-r;--i){a=a*i;}for(int i=1;i<r+1;++i){a=a/i;}return a;}
int comb(int n, int r){if(n<=0||r<0||r>n)return 0;if((n-r)<r)r=n-r; // nCr(%MOD)
int a=1;for(int i=n;i>n-r;--i){a=a*i%MOD;}for(int i=1;
i<r+1;++i){a=a*mypow(i,MOD-2,MOD)%MOD;}return a%MOD;}
Vi stpowV(){Vi a(100005);
a[0]=1;repeq(i,1,100004)a[i]=a[i-1]*i%MOD;return a;}
//Vi stpow = stpowV(); // 階乗配列(%MOD)
Vi vis(Vi &v){Vi S(v.size()+1);rep(i,1,S.size())S[i]+=v[i-1]+S[i-1];return S;} // 累積和
int digit(int k,int i){string s = itos(k);return s[s.size()-i]-'0';} // i桁目の数字
void press(auto &v){v.erase(unique(ALL(v)),v.end());} // 圧縮
Vi zip(Vi b){int Z=b.size(); // 座標圧縮
Pii p[Z+10];int a=b.size();Vi l(a);for(int i=0;i<a;i++)
p[i]=mp(b[i],i);sort(p,p+a);int w=0;for(int i=0;i<a;i++)
{if(i&&p[i].first!=p[i-1].first)w++;l[p[i].second]=w;}return l;}
Vi beki2V(){Vi a(63);int q = 1;rep(i,0,63){a[i]=q;q*=2;}return a;}
Vi beki2 = beki2V(); // 2^n配列
int modiv(int a,int b){return a*mypow(b,MOD-2,MOD)%MOD;} // a÷b(MOD環境)
struct mint { // 出力するときだけ.xをつける
int x;
mint(int x=0):x((x%MOD+MOD)%MOD){}
mint& operator+=(const mint a) {
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator-=(const mint a) {
if ((x += MOD-a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint a) const {
mint res(*this);
return res*=a;
}
mint pow(int t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
mint inv() const {
return pow(MOD-2);
}
mint& operator/=(const mint a) {
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res/=a;
}
};
vector<int> divisor(int n) { // 約数列挙 O(√n)
Vi r;for(int i=1;i*i<=n;i++){if(n%i==0){r.pb(i);if(i*i!=n)r.pb(n/i);}}
sort(ALL(r));return r;}
signed main() {
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
int h,w,k;
cin >> h >> w >> k;
char c;
cin >> c;
Vi ta(h),yo(w);
Vin(yo);
Vin(ta);
if(c=='+'){
map<int,int> yok,tak;
rep(i,0,w){
yok[yo[i]%k]++;
}
rep(i,0,h){
tak[ta[i]%k]++;
}
int ans = 0;
for (auto p : yok ) {
auto nowk = p.first;
auto v = p.second;
ans += v*(tak[k-nowk]);
}
cout << ans << endl;
}
else {
rep(i,0,h) {
ta[i] = gcd(k,ta[i]);
}
rep(i,0,w) {
yo[i] = gcd(k,yo[i]);
}
Vi di = divisor(k);
int m = di.size();
Vi kot(m),koy(m);
map<int,int> to;
rep(i,0,m) to[di[i]] = i;
rep(i,0,h) kot[to[ta[i]]]++;
rep(i,0,w) koy[to[yo[i]]]++;
Vi kott(m),koyy(m);
repreq(i,m-1,0){
if(kot[i]==0) continue;
repreq(j,i,0){
if(di[i]%di[j]==0) kott[j] += kot[i];
}
}
int now;
int ans = 0;
rep(i,0,m){
if(koy[i]==0) continue;
int qw = di[i];
qw = k/qw;
qw = to[qw];
ans += kott[qw];
}
cout << ans << endl;
}
return 0;
}