oj.uz

Submission #878053

# Submission time Handle Problem Language Result Execution time Memory
878053 2023-11-24T03:45:00 Z marvinthang Boat (APIO16_boat) C++17
100 / 100
 355 ms 756 KB 
/*************************************
*    author: marvinthang             *
*    created: 24.11.2023 08:47:39    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

const int MOD = 1e9 + 7;
namespace MODULAR {
    inline void fasterLLDivMod(unsigned long long x, unsigned y, unsigned &out_d, unsigned &out_m) {
        unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
    #ifdef __GNUC__
        asm(
            "divl %4 \n\t"
            : "=a" (d), "=d" (m)
            : "d" (xh), "a" (xl), "r" (y)
        );
    #else
        __asm {
            mov edx, dword ptr[xh];
            mov eax, dword ptr[xl];
            div dword ptr[y];
            mov dword ptr[d], eax;
            mov dword ptr[m], edx;
        };
    #endif
        out_d = d; out_m = m;
    }
    template <class T> T invGeneral(T a, T b) {
        a %= b;
        if (!a) return b == 1 ? 0 : -1;
        T x = invGeneral(b, a);
        return x == -1 ? -1 : ((1 - 1LL * b * x) / a + b) % b;
    }
    template <int MOD> struct ModInt {
        unsigned int val;
        ModInt(void): val(0) {}
        ModInt(const long long &x) { *this = x; }
        ModInt & normalize(const unsigned int &v) {
            val = v >= MOD ? v - MOD : v;
            return *this;
        }
        bool operator ! (void) { return !val; }
        ModInt & operator = (const ModInt &x) { val = x.val; return *this; }
        ModInt & operator = (const long long &x) { return normalize(x % MOD + MOD); }
        ModInt operator - (void) { return ModInt(MOD - val); }
        ModInt & operator += (const ModInt &other) { return normalize(val + other.val); }
        ModInt & operator -= (const ModInt &other) { return normalize(val + MOD - other.val); }
        ModInt & operator /= (const ModInt &other) { return *this *= other.inv(); }
        ModInt & operator *= (const ModInt &other) {
            unsigned dummy;
            fasterLLDivMod((unsigned long long) val * other.val, MOD, dummy, val);
            return *this;
        }
        ModInt operator + (const ModInt &other) const { return ModInt(*this) += other; }
        ModInt operator - (const ModInt &other) const { return ModInt(*this) -= other; }
        ModInt operator * (const ModInt &other) const { return ModInt(*this) *= other; }
        ModInt operator / (const ModInt &other) const { return ModInt(*this) /= other; }
        ModInt pow(long long n) const {
            assert(n >= 0);
            ModInt res = 1, a = *this;
            for (; n; n >>= 1, a *= a) if (n & 1) res *= a;
            return res;
        }
        ModInt inv(void) const {
            int i = invGeneral((int) val, MOD);
            assert(~i);
            return i;
        }
        ModInt & operator ++ (void) { return *this += 1; }
        ModInt & operator -- (void) { return *this -= 1; }
        ModInt operator ++ (int) { ModInt old = *this; operator ++(); return old; }
        ModInt operator -- (int) { ModInt old = *this; operator --(); return old; }
        friend ModInt operator + (const long long &x, const ModInt &y) { return ModInt(x) + y; }
        friend ModInt operator - (const long long &x, const ModInt &y) { return ModInt(x) - y; }
        friend ModInt operator * (const long long &x, const ModInt &y) { return ModInt(x) * y; }
        friend ModInt operator / (const long long &x, const ModInt &y) { return ModInt(x) / y; }
        friend ostream & operator << (ostream &out, const ModInt &x) { return out << x.val; }
        friend istream & operator >> (istream &in, ModInt &x) { long long a; in >> a; x = a; return in; }
        explicit operator bool(void) const { return val; }
        explicit operator int(void) const { return val; }
    };  
    using Modular = ModInt <MOD>;
}
using namespace MODULAR;

// end of template

struct Node {
	int left, right;
	Modular sum = 0;
	Node *left_child = nullptr, *right_child = nullptr;
	Node(int l, int r): left(l), right(r) {}
	void add(int p, Modular v) {
		sum += v;
		if (right - left == 1) return;
		int mid = (left + right) >> 1;
		if (p < mid) {
			if (left_child == nullptr) left_child = new Node(left, mid);
			left_child->add(p, v);
		} else {
			if (right_child == nullptr) right_child = new Node(mid, right);
			right_child->add(p, v);
		}
	}
	Modular get_sum(int l, int r) {
		if (left >= r || right <= l) return 0;		
		if (l <= left && right <= r) return sum;
		Modular res = 0;
		if (left_child != nullptr) res += left_child->get_sum(l, r);
		if (right_child != nullptr) res += right_child->get_sum(l, r);
		return res;
	}
};

const int INF = 1e9 + 1;

void process(void) {
	int n; cin >> n;
	vector <int> a(n), b(n);
	vector <int> pos;
	REP(i, n) {
		cin >> a[i] >> b[i];
		pos.push_back(a[i]);
		pos.push_back(++b[i]);
	}
	sort(ALL(pos)); pos.erase(unique(ALL(pos)), pos.end());
	vector <Modular> dp(n + 1), inv(n + 1), pref(n + 1);
	dp[0] = 1;
	inv[0] = 1;
	FORE(i, 1, n) inv[i] = Modular(i).inv();
	Modular res;
	REP(i, (int) pos.size() - 1) {
		int l = pos[i], r = pos[i + 1];
		vector <int> ex;
		REP(i, n) if (a[i] <= l && r <= b[i]) ex.push_back(i);
		int sz = ex.size();
		vector <Modular> comb(sz + 1);
		comb[0] = 1;
		FORE(i, 1, sz) comb[i] = comb[i - 1] * (r - l + i - 1) * inv[i];
		partial_sum(ALL(dp), pref.begin());
		REP(i, ex.size()) {
			Modular cur;
			REP(j, i + 1) cur += comb[i - j + 1] * (pref[ex[j]] - (j ? pref[ex[j - 1]] : 0));
			dp[ex[i] + 1] += cur;
			res += cur;
		}
	}
	cout << res << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("boat");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
boat.cpp:189:2: note: in expansion of macro 'file'
  189 |  file("boat");
      |  ^~~~
boat.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
boat.cpp:189:2: note: in expansion of macro 'file'
  189 |  file("boat");
      |  ^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 106 ms 492 KB Output is correct
22 Correct 102 ms 484 KB Output is correct
23 Correct 90 ms 344 KB Output is correct
24 Correct 103 ms 488 KB Output is correct
25 Correct 105 ms 348 KB Output is correct
26 Correct 227 ms 488 KB Output is correct
27 Correct 233 ms 348 KB Output is correct
28 Correct 229 ms 488 KB Output is correct
29 Correct 228 ms 344 KB Output is correct
30 Correct 3 ms 756 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 3 ms 468 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 3 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 372 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 656 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 106 ms 492 KB Output is correct
22 Correct 102 ms 484 KB Output is correct
23 Correct 90 ms 344 KB Output is correct
24 Correct 103 ms 488 KB Output is correct
25 Correct 105 ms 348 KB Output is correct
26 Correct 227 ms 488 KB Output is correct
27 Correct 233 ms 348 KB Output is correct
28 Correct 229 ms 488 KB Output is correct
29 Correct 228 ms 344 KB Output is correct
30 Correct 3 ms 756 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 3 ms 468 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 3 ms 348 KB Output is correct
39 Correct 2 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 600 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 4 ms 348 KB Output is correct
46 Correct 4 ms 344 KB Output is correct
47 Correct 3 ms 348 KB Output is correct
48 Correct 3 ms 348 KB Output is correct
49 Correct 2 ms 348 KB Output is correct
50 Correct 2 ms 372 KB Output is correct
51 Correct 2 ms 348 KB Output is correct
52 Correct 2 ms 344 KB Output is correct
53 Correct 2 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 656 KB Output is correct
59 Correct 152 ms 348 KB Output is correct
60 Correct 136 ms 504 KB Output is correct
61 Correct 130 ms 508 KB Output is correct
62 Correct 156 ms 496 KB Output is correct
63 Correct 146 ms 500 KB Output is correct
64 Correct 354 ms 348 KB Output is correct
65 Correct 355 ms 596 KB Output is correct
66 Correct 354 ms 348 KB Output is correct
67 Correct 354 ms 496 KB Output is correct
68 Correct 354 ms 496 KB Output is correct
69 Correct 129 ms 344 KB Output is correct
70 Correct 133 ms 488 KB Output is correct
71 Correct 133 ms 348 KB Output is correct
72 Correct 140 ms 504 KB Output is correct
73 Correct 141 ms 740 KB Output is correct
74 Correct 24 ms 344 KB Output is correct
75 Correct 22 ms 344 KB Output is correct
76 Correct 23 ms 348 KB Output is correct
77 Correct 23 ms 348 KB Output is correct
78 Correct 27 ms 344 KB Output is correct