結果
| 問題 | No.122 傾向と対策：門松列（その３） |
| ユーザー |
 jabee
|
| 提出日時 | 2023-03-31 20:55:46 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,719 bytes |
| コンパイル時間 | 4,813 ms |
| コンパイル使用メモリ | 273,540 KB |
| 実行使用メモリ | 18,856 KB |
| 最終ジャッジ日時 | 2023-10-24 06:34:53 |
| 合計ジャッジ時間 | 5,346 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
ソースコード
#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
return ModInt(u); }
bool operator==(ModInt that) const { return x == that.x; }
bool operator!=(ModInt that) const { return x != that.x; }
ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
// combination of paris for n com.aCb(h+w-2,h-1);
};
typedef ModInt<1000000007> mint;
//typedef ModInt<998244353> mint;
//typedef ModInt<1000000000> mint;
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
std::random_device seed_gen;
std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";
#endif // templete
//---------------------------------------------------------------------------------------------------
ll maxx = 20005;
vector<P>a,b;
mint over_cnt(P p,ll val){
ll minp = p.first;
ll maxp = p.second;
if(val < minp){
return maxp - minp + 1;
}else if(val > maxp)return mint(0);
else{
// cout << minp << " " << maxp << " " << val << endl;
return mint(maxp - val + 1);
}
}
mint under_cnt(P p,ll val){
ll minp = p.first;
ll maxp = p.second;
if(!(minp <= val && val <= maxp))return mint(0);
else return mint(val - minp + 1);
}
bool check(P p ,ll val){
ll minp = p.first;
ll maxp = p.second;
if(!(minp <= val && val <= maxp))return false;
else return true;
}
/*
mint calc_range_width(P x, P y){
ll l = max(x.first,y.first);
ll r = min(x.second,y.second);
if(l > r)return mint(0);
else return r - l + 1;
}
*/
mint calc_range_width(P x){
ll l = x.first;
ll r = x.second;
if(l > r)return mint(0);
else return r - l + 1;
}
mint calc_range_ok(P x, ll val){
ll l = x.first;
ll r = x.second;
if(l <= val && val <= r)return mint(1);
else return mint(0);
}
P merge_range(P x, P y){
ll l = max(x.first,y.first);
ll r = min(x.second,y.second);
return {l,r};
}
mint calc_two(ll val, vector<P>v,ll flag){
mint res = 0;
P e = {val,infl};
if(flag == 1){
swap(e.first,e.second);
e.first *= -1;
}
rep(i,0,v.size())v[i] = merge_range(v[i],e);
res = calc_range_width(v[0])*calc_range_width(v[1]);
res -= calc_range_width(merge_range(v[0],v[1]));
return res;
}
mint calc_three(ll val, vector<P>v,ll flag){
mint res = 0;
// if(check(v,val) == false)return res;
P e = {val,infl};
if(flag == 1){
swap(e.first,e.second);
e.first *= -1;
}
rep(i,0,v.size())v[i] = merge_range(v[i],e);
res += calc_range_ok(v[0],val) * calc_two(val+1,{v[1],v[2]},flag);
res += calc_range_ok(v[1],val) * calc_two(val+1,{v[0],v[2]},flag);
res += calc_range_ok(v[2],val) * calc_two(val+1,{v[0],v[1]},flag);
return res;
/*
P upper_e = {val+1,infl};
res += calc_range_ok(v[0],e) * calc_range_width(merge_range(v[1],upper_e),merge_range(v[2],upper_e));
vector<mint>over_v(v.size());
rep(i,0,v.size()){
auto p = v[i];
over_v[i] = over_cnt(p,val);
cout << p.first << " " << p.second << " " << over_cnt(p,val) << endl;
}
mint tot = 1;
rep(i,0,over_v.size())tot *= over_v[i];
ll siz = v.size();
rep(msk,1,1<<siz){
int cnt = __builtin_popcount(msk);
mint add = 1;
rep(i,0,siz)if(msk>>i&1)add *= over_v[i];
else{
if(check(v[i],val))add *= 1;
else add *= 0;
}
if(cnt %2 == 0)add *= -1;
res += add;
}
cout << res << endl;
return res;
*/
}
/*
mint calc_four(ll val, vector<P>v){
mint res = 0;
P e = {val,infl};
rep(i,0,v.size())v[i] = merge_range(v[i],e);
res += calc_range_width(v[0]) * calc_three(val+1,{v[1],v[2],v[3]});
res += calc_range_width(v[1]) * calc_three(val+1,{v[0],v[2],v[3]});
res += calc_range_width(v[2]) * calc_three(val+1,{v[0],v[1],v[3]});
res += calc_range_width(v[3]) * calc_three(val+1,{v[0],v[1],v[2]});
return res;
}
*/
void _main() {
rep(i,0,7){
ll x,y;
cin >> x >> y;
if(i % 2 == 0)a.push_back({x,y});
else b.push_back({x,y});
}
maxx = 20;
vector<mint>amin(maxx),amax(maxx),bmin(maxx),bmax(maxx);
rep(i,0,maxx)bmin[i] = calc_three(i,b,0);
rep(i,0,maxx)bmax[i] = calc_three(i,b,1);
// rep(i,0,maxx)amin[i] = calc_min(i,a);
rep(i,0,13){
// cout << i << " " << bmin[i] << endl;
cout << i << " " << bmax[i] << endl;
}
mint ans = 0;
rep(i,1,maxx)rep(j,i+1,maxx)ans += amax[i] * bmin[j];
rep(i,1,maxx)rep(j,i+1,maxx)ans += bmax[i] * amin[j];
cout << ans << endl;
}