#879859 (C++17) No.960 マンハッタン距離3

提出ソース

結果

問題	No.960 マンハッタン距離3
ユーザー	heno239
提出日時	2023-06-11 14:58:15
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	12,243 bytes
コンパイル時間	2,259 ms
コンパイル使用メモリ	155,384 KB
実行使用メモリ	21,124 KB
最終ジャッジ日時	2023-08-31 01:57:16
合計ジャッジ時間	13,263 ms
ジャッジサーバーID （参考情報）	judge13 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	7 ms 19,684 KB
testcase_01	AC	7 ms 19,640 KB
testcase_02	AC	7 ms 19,824 KB
testcase_03	AC	8 ms 19,648 KB
testcase_04	AC	9 ms 19,648 KB
testcase_05	AC	9 ms 19,820 KB
testcase_06	AC	9 ms 19,872 KB
testcase_07	AC	9 ms 19,792 KB
testcase_08	AC	7 ms 19,644 KB
testcase_09	AC	8 ms 19,776 KB
testcase_10	AC	7 ms 19,772 KB
testcase_11	AC	8 ms 19,684 KB
testcase_12	AC	8 ms 19,644 KB
testcase_13	AC	7 ms 19,760 KB
testcase_14	AC	8 ms 19,828 KB
testcase_15	AC	7 ms 19,792 KB
testcase_16	AC	7 ms 19,824 KB
testcase_17	AC	8 ms 19,660 KB
testcase_18	AC	7 ms 19,824 KB
testcase_19	AC	7 ms 19,788 KB
testcase_20	AC	7 ms 19,640 KB
testcase_21	AC	8 ms 19,760 KB
testcase_22	AC	8 ms 19,772 KB
testcase_23	AC	8 ms 19,640 KB
testcase_24	WA	-
testcase_25	WA	-
testcase_26	AC	8 ms 19,644 KB
testcase_27	AC	7 ms 19,832 KB
testcase_28	AC	8 ms 19,644 KB
testcase_29	AC	7 ms 19,832 KB
testcase_30	AC	7 ms 19,796 KB
testcase_31	AC	7 ms 19,832 KB
testcase_32	AC	7 ms 19,640 KB
testcase_33	AC	7 ms 19,656 KB
testcase_34	AC	7 ms 19,848 KB
testcase_35	AC	7 ms 19,780 KB
testcase_36	AC	7 ms 19,660 KB
testcase_37	AC	7 ms 19,784 KB
testcase_38	AC	8 ms 19,776 KB
testcase_39	AC	8 ms 19,804 KB
testcase_40	AC	7 ms 19,764 KB
testcase_41	AC	7 ms 19,768 KB
testcase_42	AC	8 ms 19,644 KB
testcase_43	AC	7 ms 19,656 KB
testcase_44	AC	7 ms 19,788 KB
testcase_45	AC	7 ms 19,792 KB
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	AC	7 ms 19,660 KB
testcase_51	AC	7 ms 19,780 KB
testcase_52	AC	7 ms 19,644 KB
testcase_53	AC	7 ms 19,820 KB
testcase_54	AC	7 ms 19,780 KB
testcase_55	AC	6 ms 19,656 KB
testcase_56	AC	8 ms 19,828 KB
testcase_57	AC	7 ms 19,832 KB
testcase_58	AC	7 ms 19,692 KB
testcase_59	AC	7 ms 19,796 KB
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	AC	9 ms 19,656 KB
testcase_65	AC	9 ms 19,756 KB
testcase_66	AC	8 ms 19,768 KB
testcase_67	AC	8 ms 19,832 KB
testcase_68	AC	9 ms 19,780 KB
testcase_69	AC	8 ms 19,772 KB
testcase_70	AC	8 ms 19,772 KB
testcase_71	AC	7 ms 19,856 KB
testcase_72	AC	8 ms 19,784 KB
testcase_73	AC	7 ms 19,792 KB
testcase_74	AC	7 ms 19,692 KB
testcase_75	AC	7 ms 19,760 KB
testcase_76	AC	7 ms 19,760 KB
testcase_77	AC	8 ms 19,780 KB
testcase_78	AC	7 ms 19,860 KB
testcase_79	AC	7 ms 19,832 KB
testcase_80	AC	7 ms 19,848 KB
testcase_81	AC	8 ms 19,824 KB
testcase_82	AC	7 ms 19,768 KB
testcase_83	AC	7 ms 19,764 KB
testcase_84	AC	8 ms 19,644 KB
testcase_85	AC	7 ms 19,752 KB
testcase_86	AC	7 ms 19,796 KB
testcase_87	AC	8 ms 19,636 KB
testcase_88	AC	8 ms 19,772 KB
testcase_89	WA	-
testcase_90	WA	-
testcase_91	WA	-
testcase_92	AC	8 ms 19,652 KB
testcase_93	AC	8 ms 19,764 KB
testcase_94	AC	8 ms 19,760 KB
testcase_95	AC	8 ms 19,828 KB
testcase_96	AC	9 ms 19,840 KB
testcase_97	AC	9 ms 19,656 KB
testcase_98	AC	10 ms 19,644 KB
testcase_99	AC	8 ms 19,652 KB
testcase_100	AC	7 ms 19,800 KB
testcase_101	AC	7 ms 19,828 KB
testcase_102	AC	7 ms 19,644 KB
testcase_103	WA	-
testcase_104	AC	7 ms 19,640 KB
testcase_105	AC	7 ms 19,656 KB
testcase_106	AC	7 ms 19,760 KB
testcase_107	AC	7 ms 19,776 KB
testcase_108	AC	7 ms 19,644 KB
testcase_109	AC	8 ms 19,656 KB
testcase_110	AC	8 ms 19,660 KB
testcase_111	AC	7 ms 19,764 KB
testcase_112	AC	7 ms 19,772 KB
testcase_113	AC	7 ms 19,824 KB
testcase_114	AC	7 ms 19,784 KB
testcase_115	AC	7 ms 19,764 KB
testcase_116	AC	7 ms 19,876 KB
testcase_117	AC	7 ms 19,652 KB
testcase_118	AC	7 ms 19,816 KB
testcase_119	AC	7 ms 19,752 KB
testcase_120	AC	7 ms 19,856 KB
testcase_121	AC	7 ms 19,644 KB
testcase_122	AC	7 ms 19,684 KB
testcase_123	AC	7 ms 19,876 KB
testcase_124	AC	6 ms 19,656 KB
testcase_125	AC	7 ms 19,796 KB
testcase_126	AC	7 ms 19,772 KB
testcase_127	AC	7 ms 19,776 KB
testcase_128	AC	19 ms 19,716 KB
testcase_129	AC	40 ms 20,556 KB
testcase_130	AC	27 ms 20,252 KB
testcase_131	AC	41 ms 20,740 KB
testcase_132	WA	-
testcase_133	WA	-
testcase_134	AC	12 ms 19,696 KB
testcase_135	AC	18 ms 20,004 KB
testcase_136	AC	19 ms 19,876 KB
testcase_137	AC	17 ms 20,308 KB
testcase_138	AC	30 ms 20,488 KB
testcase_139	AC	36 ms 20,564 KB
testcase_140	AC	30 ms 21,084 KB
testcase_141	AC	46 ms 20,844 KB
testcase_142	AC	25 ms 19,992 KB
testcase_143	AC	21 ms 20,324 KB
testcase_144	AC	37 ms 20,832 KB
testcase_145	AC	10 ms 19,912 KB
testcase_146	AC	15 ms 19,832 KB
testcase_147	AC	33 ms 20,500 KB
testcase_148	AC	21 ms 20,060 KB
testcase_149	AC	26 ms 20,132 KB
testcase_150	AC	33 ms 20,840 KB
testcase_151	AC	9 ms 19,716 KB
testcase_152	AC	21 ms 20,488 KB
testcase_153	AC	29 ms 21,120 KB
testcase_154	WA	-
testcase_155	WA	-
testcase_156	WA	-
testcase_157	WA	-
testcase_158	AC	45 ms 20,936 KB
testcase_159	AC	14 ms 20,044 KB
testcase_160	AC	11 ms 19,848 KB
testcase_161	AC	43 ms 20,700 KB
testcase_162	AC	26 ms 20,812 KB
testcase_163	AC	19 ms 20,212 KB
testcase_164	AC	39 ms 21,052 KB
testcase_165	AC	32 ms 20,476 KB
testcase_166	AC	12 ms 19,960 KB
testcase_167	AC	22 ms 20,224 KB
testcase_168	WA	-
testcase_169	WA	-
testcase_170	WA	-
testcase_171	WA	-
testcase_172	AC	20 ms 19,920 KB
testcase_173	AC	11 ms 19,876 KB
testcase_174	AC	33 ms 20,804 KB
testcase_175	AC	41 ms 21,080 KB
testcase_176	AC	30 ms 20,392 KB
testcase_177	AC	11 ms 19,908 KB
testcase_178	AC	31 ms 20,440 KB
testcase_179	AC	34 ms 20,640 KB
testcase_180	AC	27 ms 20,832 KB
testcase_181	AC	12 ms 19,884 KB
testcase_182	AC	16 ms 20,040 KB
testcase_183	AC	18 ms 20,180 KB
testcase_184	AC	16 ms 19,996 KB
testcase_185	AC	22 ms 20,552 KB
testcase_186	AC	25 ms 20,732 KB
testcase_187	AC	22 ms 20,612 KB
testcase_188	AC	8 ms 19,648 KB
testcase_189	AC	7 ms 19,688 KB
testcase_190	AC	7 ms 19,852 KB
testcase_191	AC	7 ms 19,644 KB
testcase_192	AC	7 ms 19,792 KB
testcase_193	AC	7 ms 19,768 KB
testcase_194	AC	7 ms 19,652 KB
testcase_195	AC	7 ms 19,776 KB
testcase_196	AC	34 ms 20,552 KB
testcase_197	WA	-
testcase_198	WA	-
testcase_199	WA	-
testcase_200	AC	30 ms 20,732 KB
testcase_201	AC	20 ms 20,128 KB
testcase_202	AC	36 ms 20,484 KB
testcase_203	AC	23 ms 19,912 KB
testcase_204	AC	46 ms 20,844 KB
testcase_205	AC	29 ms 20,312 KB
testcase_206	AC	29 ms 20,656 KB
testcase_207	AC	34 ms 20,608 KB
testcase_208	AC	36 ms 20,392 KB
testcase_209	AC	17 ms 19,848 KB
testcase_210	AC	11 ms 19,792 KB
testcase_211	AC	20 ms 20,024 KB
testcase_212	AC	12 ms 19,800 KB
testcase_213	AC	22 ms 20,336 KB
testcase_214	AC	47 ms 21,104 KB
testcase_215	AC	39 ms 20,748 KB
testcase_216	AC	47 ms 20,828 KB
testcase_217	AC	29 ms 20,352 KB
testcase_218	AC	32 ms 21,124 KB
testcase_219	AC	20 ms 20,128 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------


//0:-,1:|,2:/,3:
struct Data {
    int lx, rx, ly, ry;
    int dif, sum;
};
void deb(Data d) {
    cout << d.lx << " " << d.rx << " " << d.ly << " " << d.ry << " " << d.dif << " " << d.sum << "\n";
}
const int z = -mod17;
Data merge(Data a, Data b) {
    Data res;
    res.lx = max(a.lx, b.lx);
    res.rx = min(a.rx, b.rx);
    res.ly = max(a.ly, b.ly);
    res.ry = min(a.ry, b.ry);
    res.dif = z;
    res.sum = z;
    if (a.dif != z)res.dif = a.dif;
    if (b.dif != z)res.dif = b.dif;
    if (a.dif != z && b.dif != z && a.dif != b.dif) {
        res.lx = mod17;
    }
    if (a.sum != z)res.sum = a.sum;
    if (b.sum != z)res.sum = b.sum;
    if (a.sum != z && b.sum != z && a.sum != b.sum) {
        res.lx = mod17;
    }
    return res;
}
ll area(Data d) {
    ll dx = d.rx - d.lx + 1;
    ll dy = d.ry - d.ly + 1;
    if (dx <= 0 || dy <= 0)return 0;
    if (d.dif != z && d.sum != z) {
        int ny = ((ll)d.dif + d.sum) / 2;
        int nx = d.sum - ny;
        if (d.lx <= nx && nx <= d.rx && d.ly <= ny && ny <= d.ry) {
            return 1;
        }
        else {
            return 0;
        }
    }
    else if (d.dif != z) {
        int le = max(d.lx, d.ly - d.dif);
        int ri = min(d.rx, d.ry - d.dif);
        if (le > ri)return 0;
        return ri - le + 1;
    }
    else if (d.sum != z) {
        int le = max(d.lx,d.sum - d.ry);
        int ri = min(d.rx, d.sum - d.ly);
        if (le > ri)return 0;
        return ri - le + 1;
    }
    else {
        return dx * dy;
    }
}


int w, h;
Data rev(Data d) {
    Data res;
    res.lx = d.lx;
    res.rx = d.rx;
    res.ly = h + 1 - d.ry;
    res.ry = h + 1 - d.ly;
    if (d.sum == z) {
        res.dif = z;
    }
    else {
        res.dif = h + 1 - d.sum;
    }
    if (d.dif == z) {
        res.sum = z;
    }
    else {
        res.sum = h + 1 - res.dif;
    }
    return res;
}
vector<Data> ss(P a, P b) {
    vector<Data> res;
    if (a > b)swap(a, b);
    if (a.first == b.first) {
        Data d;
        d.lx = 1;
        d.rx = w;
        d.ly = (a.second + b.second) / 2;
        d.ry = d.ly;
        d.dif = z;
        d.sum = z;
        res.push_back(d);
    }
    else if (a.second == b.second) {
        Data d;
        d.lx = (a.first + b.first) / 2;
        d.rx = d.lx;
        d.ly = 1;
        d.ry = h;
        d.dif = z;
        d.sum = z;
        res.push_back(d);
    }
    else {
        if (a.second < b.second) {
            if (b.first - a.first < b.second - a.second) {
                int sum = b.first - a.first + b.second - a.second;
                Data d;
                d.lx = 1;
                d.rx = a.first - 1;
                d.ly = a.first + sum / 2;
                d.ry = d.ly;
                d.dif = z;
                d.sum = z;
                res.push_back(d);
                d.lx = b.first + 1;
                d.rx = w;
                d.ly = b.second - sum / 2;
                d.ry = d.ly;
                d.dif = z;
                d.sum = z;
                res.push_back(d);
                d.lx = a.first;
                d.rx = b.first;
                d.ly = b.second - sum / 2;
                d.ry = a.second + sum / 2;
                d.dif = z;
                d.sum = a.first + a.second + sum / 2;
                res.push_back(d);
            }
            else if (b.first - a.first == b.second - a.second) {
                Data d;
                d.lx = 1;
                d.rx = a.first;
                d.ly = b.second;
                d.ry = h;
                d.dif = z;
                d.sum = z;
                res.push_back(d);
                d.lx = b.first;
                d.rx = w;
                d.ly = 1;
                d.ry = a.second;
                d.dif = z;
                d.sum = z;
                res.push_back(d);
                d.lx = a.first + 1;
                d.rx = b.first - 1;
                d.ly = a.second + 1;
                d.ry = b.second - 1;
                d.sum = a.first + b.second;
                d.dif = z;
                res.push_back(d);
            }
            else {
                int sum = b.first - a.first + b.second - a.second;
                Data d;
                d.lx = b.first - sum / 2;
                d.rx = d.lx;
                d.ly = b.second + 1;
                d.ry = h;
                d.sum = z;
                d.dif = z;
                res.push_back(d);
                d.lx = a.first + sum / 2;
                d.rx = d.lx;
                d.ly = 1;
                d.ry = a.second - 1;
                d.sum = z;
                d.dif = z;
                res.push_back(d);
                d.lx = b.first - sum / 2;
                d.rx = a.first + sum / 2;
                d.ly = a.second;
                d.ry = b.second;
                d.sum = a.first + sum / 2 + a.second;
                d.dif = z;
                res.push_back(d);
            }
        }
        else {
            a.second = h + 1 - a.second;
            b.second = h + 1 - b.second;

            auto vd = ss(a, b);
            rep(i, vd.size()) {
                vd[i] = rev(vd[i]);
            }

            res = vd;
        }
    }
    return res;
}
void solve() {
    cin >> w >> h;
    int n; cin >> n;
    vector<int> x(n), y(n);
    rep(i, n)cin >> x[i] >> y[i];
    vector<Data> vd;
    Data ori;
    ori.lx = 1;
    ori.rx = w;
    ori.ly = 1;
    ori.ry = h;
    ori.dif = z;
    ori.sum = z;
    vd.push_back(ori);
    rep(i, n - 1) {
        int c = 0;
        if (x[i] % 2)c ^= 1;
        if (y[i] % 2)c ^= 1;
        if (x[i+1] % 2)c ^= 1;
        if (y[i + 1] % 2)c ^= 1;
        if (c) {
            cout << 0 << "\n"; return;
        }
        auto ds = ss({ x[i],y[i] }, { x[i + 1],y[i + 1] });
        vector<Data> nvd;
        rep(i, vd.size())rep(j, ds.size()) {
            Data ad = merge(vd[i], ds[j]);
            if (area(ad) > 0) {
                nvd.push_back(ad);
            }
        }
        swap(vd, nvd);
        /*cout << "hello\n";
        rep(i, vd.size()) {
            deb(vd[i]);
        }
        cout << vd.size() << "\n";*/
    }
    ll ans = 0;
    rep(i, vd.size()) {
        ans += area(vd[i]);
    }
    cout << ans << "\n";
}





signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(10);
    //init_f();
    //init();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード