結果
| 問題 | No.1627 三角形の成立 |
| ユーザー |
 nuip
|
| 提出日時 | 2021-07-23 22:36:55 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 10,598 bytes |
| コンパイル時間 | 1,554 ms |
| コンパイル使用メモリ | 148,076 KB |
| 最終ジャッジ日時 | 2025-01-23 08:25:39 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 8 TLE * 14 |
ソースコード
#include <string>#include <vector>#include<iostream>#include<cstdio>#include<cstdlib>#include<stack>#include<queue>#include<cmath>#include<algorithm>#include<functional>#include<list>#include<deque>#include<bitset>#include<set>#include<map>#include<unordered_map>#include<unordered_set>#include<cstring>#include<sstream>#include<complex>#include<iomanip>#include<numeric>#include<cassert>#include<random>#define X first#define Y second#define pb push_back#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))#define peat(X,Y) for (;(X) < (Y);++(X))#define all(X) (X).begin(),(X).end()#define rall(X) (X).rbegin(),(X).rend()#define eb emplace_back#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())#define Endl endl#define NL <<"\n"#define cauto const autousing namespace std;using ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;template<class T> using vv=vector<vector<T>>;template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}//#undef NUIP#ifdef NUIP#include "benri.h"#else#define out(args...)#endifvoid ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}#ifdef __cpp_init_capturestemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}#endiftemplate<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}template<class T=ll> T read(){ T re; cin>>re; return re;}template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;}template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;}vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;}vv<int> readG(const int &n){ return readG(n,n-1);}vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;}vv<int> readD(const int &n){ return readD(n,n-1);}template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;}template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);}template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); } return g;}template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);}#ifdef __cpp_init_capturestemplate<typename T> vector<T> readT(int n, T v){ return readV(n,v);}template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...)); return re;}template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }; (void)l;}template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){ addadd(lhs, rhs, index_sequence_for<T...>{}); returnlhs;}template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;}template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }; (void)l;}template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){ subsub(lhs, rhs, index_sequence_for<T...>{}); returnlhs;}template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;}template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);}template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;}#endif#define TT cauto TTT=read();rep(_,TTT)const ll MOD=1e9+7; //998244353;ll modpow_(ll r,ll n,ll m=MOD){ll re=1,d=r%m;if(n<0)(n%=m-1)+=m-1;for(;n;n/=2){if(n&1)(re*=d)%=m;(d*=d)%=m;}return re;}template <int mod=MOD> struct ModInt{int v;ModInt(int v=0):v(v){}ModInt operator+(const ModInt &n)const{return v+n.v<mod ? v+n.v : v+n.v-mod;}ModInt operator-(const ModInt &n)const{return v-n.v<0 ? v-n.v+mod : v-n.v;}ModInt operator*(const ModInt &n)const{return ll(v)*n.v%mod;}ModInt operator/(const ModInt &n)const{return ll(v)*modpow_(n.v%mod,-1,mod)%mod;}ModInt operator+(const ll &n)const{return v+n<mod ? v+n : v+n-mod;}ModInt operator-(const ll &n)const{return v-n<0 ? v-n+mod : v-n;}ModInt operator*(const ll &n)const{return ll(v)*(n%mod)%mod;}ModInt operator/(const ll &n)const{return ll(v)*modpow_(n%mod,-1,mod)%mod;}ModInt& operator+=(const ModInt &n){v+=n.v; if(v>=mod) v-=mod; return *this;}ModInt& operator-=(const ModInt &n){v-=n.v; if(v<0) v+=mod; return *this;}ModInt& operator*=(const ModInt &n){v=ll(v)*n.v%mod; return *this;}ModInt& operator/=(const ModInt &n){v=ll(v)*modpow_(n.v,-1,mod)%mod; return *this;}ModInt& operator+=(const ll &n){v+=n; if(v>=mod) v-=mod; return *this;}ModInt& operator-=(const ll &n){v-=n; if(v<0) v+=mod; return *this;}ModInt& operator*=(const ll &n){v=ll(v)*n%mod; return *this;}ModInt& operator/=(const ll &n){v=ll(v)*modpow_(n,-1,mod)%mod; return *this;}bool operator==(const ModInt &n)const{return v==n.v;};bool operator!=(const ModInt &n)const{return v!=n.v;};ModInt& operator++(){ return operator+=(1); }ModInt& operator--(){ return operator-=(1); }ModInt operator++(int i){ ModInt tmp(*this); operator++(); return tmp; }ModInt operator--(int i){ ModInt tmp(*this); operator--(); return tmp; }};#ifdef NUIPclass MINT_FRAC____{public:unordered_map<int,pii> dict;MINT_FRAC____(int n){rep(p,n+1)reps(q,1,n+1)if(__gcd(p,q)==1){dict[1ll*p*modpow_(q,-1)%MOD]=pii(p,q);dict[MOD-1ll*p*modpow_(q,-1)%MOD]=pii(-p,q);}}} Il1Il1Il1(1000);template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){if(Il1Il1Il1.dict.count(n.v)) os<<n.v, cerr<<"("<<Il1Il1Il1.dict[n.v].X<<"/"<<Il1Il1Il1.dict[n.v].Y<<")";else os<<n.v;return os;};#elsetemplate<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){return os<<n.v;};#endiftemplate<int mod> ModInt<mod> operator+(const ll &n,const ModInt<mod> &m){return m.v+n<mod ? m.v+n : m.v+n-mod;}template<int mod> ModInt<mod> operator-(const ll &n,const ModInt<mod> &m){return n-m.v<0 ? n-m.v+mod : n-m.v;}template<int mod> ModInt<mod> operator*(const ll &n,const ModInt<mod> &m){return ll(m.v)*(n%mod)%mod;}template<int mod> ModInt<mod> operator/(const ll &n,const ModInt<mod> &m){return ModInt<mod>(n%mod)/m;}typedef ModInt<MOD> mint;template <int mod> ModInt<mod> modpow(ModInt<mod> r,ll n){ ModInt<mod> re(1); if(n<0)(n%=mod-1)+=mod-1; for(;n;n/=2){if(n&1) re*=r; r*=r;} return re;}vector<mint> fact,finv,inv;mint comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]*finv[r];}class Doralion{void Modinvs(vector<mint> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i);}void Facts(vector<mint> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1);}void Factinvs(vector<mint> &re,const vector<mint> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1];}public:Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n);}} doralion(1123456);using pmm=pair<mint,mint>;mint modpow(ll r,ll n){ return modpow_(r,n);}mint c3(const mint n){return n*(n-1)*(n-2)*finv[3];}mint bf(const int n,const int m){vector<pii> ps;map<pii,int> cnt;int re=0;rep(i,n)rep(j,m) ps.eb(j,i);for(cauto &p:ps){for(cauto &q:ps){if(p==q) break;for(cauto &r:ps){if(r==q) break;cauto &[x,y]=p-r;cauto &[X,Y]=q-r;if(x*Y==X*y){cauto dx=abs(x);cauto dy=abs(y);cauto g=__gcd(dx,dy);++cnt[{dx/g,dy/g}];continue;}++re;}}}out(cnt,1);return re;}vector<int> primes,prime;vv<pii> facts;class PRPRPR{public:PRPRPR(int PRIME_MAX){prime.resize(PRIME_MAX);for(int i=2;i<PRIME_MAX;i++)if(!prime[i]){primes.pb(i);for(int j=i*2;j<PRIME_MAX;j+=i)prime[j]=1;}// fact();}void fact(){facts.resize(prime.size());for(cauto &p:primes){for(ll i=p;i<(int)facts.size();i+=p) facts[i].eb(p,1);for(ll pp=1ll*p*p;pp<(int)facts.size();pp*=p){for(ll i=pp;i<facts.size();i+=pp) ++facts[i].back().Y;}}}} prprprpr(1123456);vector<mint> get(const int n, const int d){vector<mint> re(n/d+1);rep(i,n)for(auto j=d;j<=i;j+=d) ++re[i/j];return re;}int main(){ios_base::sync_with_stdio(false); cin.tie(0);cout<<fixed<<setprecision(0);vector<int> sgn(212345,1); sgn[0]=0;for(cauto &p:primes){for(auto i=p;i<sgn.size();i+=p) sgn[i]*=-1;for(auto i=1ll*p*p;i<sgn.size();i+=1ll*p*p) sgn[i]=0;}cauto n=read();cauto m=read();mint re=c3(mint(n)*m);re-=c3(n)*m;re-=c3(m)*n;out(re,c3(n)*m,c3(m)*n,1);// map<pii,mint> cnt;// rep(y,n)reps(dy,1,y+1)rep(x,m)reps(dx,1,x+1)if(__gcd(dx,dy)==1){// cauto t=min(x/dx,y/dy);// re-=mint(t)*(t-1);// cnt[{dx,dy}]+=mint(t)*(t-1);// }// out(cnt,1);reps(d,1,n+1)if(sgn[d]){cauto vs=get(n,d);cauto us=get(m,d);mint sum=0;rep(i,vs.size())rep(j,us.size()) sum+=vs[i]*us[j]*min(i,j)*(min(i,j)-1);if(sum.v) out(d,sum,1);if(sgn[d]>0) re-=sum;else re+=sum;}cout<<re NL;out(bf(n,m),1);return 0;}