結果
| 問題 |
No.3313 Matryoshka
|
| コンテスト | |
| ユーザー |
 aPNJ777
|
| 提出日時 | 2025-10-24 21:56:22 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 881 ms / 4,000 ms |
| コード長 | 10,281 bytes |
| コンパイル時間 | 3,846 ms |
| コンパイル使用メモリ | 299,244 KB |
| 実行使用メモリ | 64,156 KB |
| 最終ジャッジ日時 | 2025-10-24 21:56:44 |
| 合計ジャッジ時間 | 19,319 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 35 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
#define vv(type, name, h, w) vector<vector<type>> name(h, vector<type>(w))
#define vvv(type, name, h, w, l) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(l)))
#define vvvv(type, name, a, b, c, d) vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(d))))
#define vvvvv(type, name, a, b, c, d, e) vector<vector<vector<vector<vector<type>>>>> name(a, vector<vector<vector<vector<type>>>>(b, vector<vector<vector<type>>>(c, vector<vector<type>>(d, vector<type>(e)))))
#define elif else if
#define FOR1(a) for (long long _ = 0; _ < (long long)(a); _++)
#define FOR2(i, n) for (long long i = 0; i < (long long)(n); i++)
#define FOR3(i, l, r) for (long long i = l; i < (long long)(r); i++)
#define FOR4(i, l, r, c) for (long long i = l; i < (long long)(r); i += c)
#define FOR1_R(a) for (long long _ = (long long)(a) - 1; _ >= 0; _--)
#define FOR2_R(i, n) for (long long i = (long long)(n) - 1; i >= (long long)(0); i--)
#define FOR3_R(i, l, r) for (long long i = (long long)(r) - 1; i >= (long long)(l); i--)
#define FOR4_R(i, l, r, c) for (long long i = (long long)(r) - 1; i >= (long long)(l); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_in(a, A) for (auto a: A)
#define FOR_each(a, A) for (auto &&a: A)
#define FOR_subset(t, s) for(long long t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#define all(x) x.begin(), x.end()
#define len(x) int(x.size())
int popcount(int x) { return __builtin_popcount(x); }
int popcount(uint32_t x) { return __builtin_popcount(x); }
int popcount(long long x) { return __builtin_popcountll(x); }
int popcount(uint64_t x) { return __builtin_popcountll(x); }
// __builtin_clz(x)は最上位bitからいくつ0があるか.
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(uint32_t x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(long long x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(uint64_t x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// 入力
void rd() {}
void rd(char &c) { cin >> c; }
void rd(string &s) { cin >> s; }
void rd(int &x) { cin >> x; }
void rd(uint32_t &x) { cin >> x; }
void rd(long long &x) { cin >> x; }
void rd(uint64_t &x) { cin >> x; }
template<class T>
void rd(vector<T> &v) {
for (auto& x:v) rd(x);
}
void read() {}
template <class H, class... T>
void read(H &h, T &... t) {
rd(h), read(t...);
}
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define STRING(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define U32(...) \
uint32_t __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
long long __VA_ARGS__; \
read(__VA_ARGS__)
#define U64(...) \
uint64_t __VA_ARGS__; \
read(__VA_ARGS__)
#define VC(t, a, n) \
vector<t> a(n); \
read(a)
#define VVC(t, a, h, w) \
vector<vector<t>> a(h, vector<t>(w)); \
read(a)
//出力
void wt() {}
void wt(const char c) { cout << c; }
void wt(const string s) { cout << s; }
void wt(int x) { cout << x; }
void wt(uint32_t x) { cout << x; }
void wt(long long x) { cout << x; }
void wt(uint64_t x) { cout << x; }
void wt(double x) { cout << fixed << setprecision(16) << x; }
void wt(long double x) { cout << fixed << setprecision(16) << x; }
template<class T>
void wt(const vector<T> v) {
int n = v.size();
for (int i = 0; i < n; i++) {
if (i) wt(' ');
wt(v[i]);
}
}
void print() { wt('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
wt(head);
if (sizeof...(Tail)) wt(' ');
print(forward<Tail>(tail)...);
}
/////////////////////////////////////////////////////////////////////////////////////////
long long min(long long a, long long b) { return a < b ? a : b; }
template <class T>
T min(vector<T> A) {
assert (A.size());
T S = A[0];
for (T a : A) S = min(a, S);
return S;
}
long long max(long long a, long long b) { return a > b ? a : b; }
template <class T>
T max(vector<T> A) {
assert (A.size());
T S = A[0];
for (T a : A) S = max(a, S);
return S;
}
long long add(long long x, long long y) {return x + y; }
template <class mint>
mint add(mint x, mint y) { return x + y; }
template <class T>
bool chmin(T & x, T a) { return a < x ? (x = a, true) : false; }
template <class T>
bool chmax(T & x, T a) { return a > x ? (x = a, true) : false; }
template <class T>
T sum(vector<T> A) {
T S = 0;
for (int i = 0; i < int(A.size()); i++) S += A[i];
return S;
}
uint64_t random_u64(uint64_t l, uint64_t r) {
static std::random_device rd;
static std::mt19937_64 gen(rd());
std::uniform_int_distribution<uint64_t> dist(l, r);
return dist(gen);
}
long long gcd(long long a, long long b) {
while (a) {
b %= a;
if (b == 0) return a;
a %= b;
}
return b;
}
long long lcm(long long a, long long b) {
if (a * b == 0) return 0;
return a * b / gcd(a, b);
}
long long pow_mod(long long a, long long r, long long mod) {
long long res = 1, p = a % mod;
while (r) {
if ((r % 2) == 1) res = res * p % mod;
p = p * p % mod, r >>= 1;
}
return res;
}
long long mod_inv(long long a, long long mod) {
if (mod == 1) return 0;
a %= mod;
long long b = mod, s = 1, t = 0;
while (1) {
if (a == 1) return s;
t -= (b / a) * s;
b %= a;
if (b == 1) return t + mod;
s -= (a / b) * t;
a %= b;
}
}
long long Garner(vector<long long> Rem, vector<long long> Mod, int MOD) {
assert (Rem.size() == Mod.size());
long long mod = MOD;
Rem.push_back(0);
Mod.push_back(mod);
long long n = Mod.size();
vector<long long> coffs(n, 1);
vector<long long> constants(n, 0);
for (int i = 0; i < n - 1; i++) {
long long v = (Mod[i] + Rem[i] - constants[i]) % Mod[i];
v *= mod_inv(coffs[i], Mod[i]);
v %= Mod[i];
for (int j = i + 1; j < n; j++) {
constants[j] = (constants[j] + coffs[j] * v) % Mod[j];
coffs[j] = (coffs[j] * Mod[i]) % Mod[j];
}
}
return constants[n - 1];
}
long long Tonelli_Shanks(long long a, long long mod) {
a %= mod;
if (a < 2) return a;
if (pow_mod(a, (mod - 1) / 2, mod) != 1) return -1;
if (mod % 4 == 3) return pow_mod(a, (mod + 1) / 4, mod);
long long b = 3;
if (mod != 998244353) {
while (pow_mod(b, (mod - 1) / 2, mod) == 1) {
b = random_u64(2, mod - 1);
}
}
long long q = mod - 1;
long long Q = 0;
while (q % 2 == 0) {
Q++, q /= 2;
}
long long x = pow_mod(a, (q + 1) / 2, mod);
b = pow_mod(b, q, mod);
long long shift = 2;
while ((x * x) % mod != a) {
long long error = (((pow_mod(a, mod - 2, mod) * x) % mod) * x) % mod;
if (pow_mod(error, 1 << (Q - shift), mod) != 1) {
x = (x * b) % mod;
}
b = (b * b) % mod;
shift++;
}
return x;
}
/////////////////////////////////////////////////////////////////////////////////////////
/*
検索するとき
https://www.google.com/search?udm=14&q=
-ai
*/
/*
a : 答え
b : L_i > L_j
c : R_i < R_j
d : i > j で2つ目の条件満たす
a = binom(N, 2) - (b + c - d)
a + d = 2つめの条件満たす
*/
template <class T>
struct segtree{
// segtree<T> seg(n, op, e);
int size = 1, n;
T (*op)(T, T);
T e;
vector<T> seg;
segtree(int n, T(*op)(T, T), T e) : n(n), op(op), e(e) {
while (size < n) size <<= 1;
seg.resize(2 * size, e);
}
void set(int i, T x) {
i += size;
seg[i] = x;
while (i >>= 1) { seg[i] = op(seg[2 * i], seg[2 * i + 1]); }
}
T get(int i) { return seg[i + size]; }
void add(int i, T x) { set(i, get(i) + x); }
void set_array(vector<T> A) {
assert (size >= int(A.size()));
for (int i = 0; i < int(A.size()); i++) set(i, A[i]);
}
T prod(int l, int r) {
T L = e, R = e;
l += size, r += size;
while (l < r) {
if (l & 1) L = op(L, seg[l]), l += 1;
if (r & 1) R = op(seg[r -= 1], R);
l >>= 1, r >>= 1;
}
return op(L, R);
}
T all_prod() { return seg[1]; }
// [l, r)でtrueとなるやつ
int max_right(int l, function<bool(T)> check) {
assert (0 <= l && l <= n);
assert (check(e) == true);
if (l == n) return n;
l += size;
T sm = e;
while (1) {
while (l % 2 == 0) l >>= 1;
if (!check(op(sm, seg[l]))) {
while (l < size) {
l <<= 1;
if (check(op(sm, seg[l]))) sm = op(sm, seg[l]), l += 1;
}
return l - size;
}
sm = op(sm, seg[l]), l += 1;
if ((l & -l) == l) break;
}
return n;
}
int min_left(int r, function<bool(T)> check) {
assert (0 <= r && r <= n);
assert (check(e) == true);
if (r == 0) return 0;
r += size;
T sm = e;
while (1) {
r -= 1;
while (r > 1 && (r % 2)) r >>= 1;
if (!check(op(seg[r], sm))) {
while (r < size) {
r <<= 1;
r += 1;
if (check(op(seg[r], sm))) {
sm = op(seg[r], sm), r -= 1;
}
}
return r + 1 - size;
}
sm = op(seg[r], sm);
if ((r & -r) == r) break;
}
return 0;
}
};
void solve() {
INT(N);
vector<pair<int, int>> E;
vector<int> L(N), R(N);
FOR(i, N) cin >> L[i] >> R[i];
FOR(i, N) E.push_back({L[i], R[i]});
int M = max(max(L), max(R));
segtree<ll> seg(M + 1, add, 0);
sort(all(E));
ll ans = ll(N) * ll(N - 1);
ans /= 2;
for (auto [l, r] : E) {
ans += seg.prod(r + 1, M + 1);
seg.set(r, 1);
}
segtree<ll> C1(M + 1, add, 0), C2(M + 1, add, 0);
FOR(i, N) {
int l = L[i], r = R[i];
ans -= C1.prod(l + 1, M + 1) + C2.prod(0, r);
C1.set(l, 1), C2.set(r, 1);
}
print(ans / 2);
}
int main() {
int T = 1;
//cin >> T;
FOR(T) solve();
}