oj.uz

Submission #645048

# Submission time Handle Problem Language Result Execution time Memory
645048 2022-09-26T04:21:38 Z ghostwriter Boat (APIO16_boat) C++14
58 / 100
 2000 ms 10368 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const int M = 1e9 + 7;
const int N = 505;
const int Nx2 = 1005;
int n, m, d[Nx2][N][2], d1[Nx2][N][2], d2[Nx2][N];
pi a[N], a1[N];
vpi seg;
int fpow(int a, int b, int M) {
    if (b == 0) return 1;
    int tmp = fpow(a, b >> 1, M);
    if (b & 1) return 1LL * tmp * tmp % M * a % M;
    return 1LL * tmp * tmp % M;
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n;
    FOR(i, 1, n) {
        cin >> a[i].st >> a[i].nd;
        a1[i] = a[i];
    }
    sort(a1 + 1, a1 + 1 + n);
    FOR(i, 1, n) {
        if (i == 1) {
            seg.pb(a1[i]);
            continue;
        }
        if (a1[i].st > seg.bk().nd) {
            seg.pb(a1[i]);
            continue;
        }
        vpi seg1;
        EACH(j, seg) {
            int l = j.st, r = j.nd;
            if (l <= a1[i].st && a1[i].nd <= r) {
                if (l < a1[i].st) seg1.pb({l, a1[i].st - 1});
                seg1.pb(a1[i]);
                if (r > a1[i].nd) seg1.pb({a1[i].nd + 1, r});
            }
            else if (l < a1[i].st && r >= a1[i].st) {
                seg1.pb({l, a1[i].st - 1});
                seg1.pb({a1[i].st, r});
            }
            else if (l <= a1[i].nd && r > a1[i].nd) {
                seg1.pb({l, a1[i].nd});
                seg1.pb({a1[i].nd + 1, r});
            }
            else seg1.pb({l, r});
        }
        if (a1[i].nd > seg1.bk().nd) seg1.pb({seg1.bk().nd + 1, a1[i].nd});
        swap(seg, seg1);
    }
    reverse(all(seg));
    seg.pb({-1, -1});
    reverse(all(seg));
    m = sz(seg) - 1;
    FOR(i, 1, m) {
        d2[i][0] = 1;
        int cnt = min(n, seg[i].nd - seg[i].st + 1);
        FOR(j, 1, cnt) d2[i][j] = 1LL * d2[i][j - 1] * (seg[i].nd - seg[i].st + 2 - j) % M * fpow(j, M - 2, M) % M;
    }
    FOR(i, 1, m)
    FOR(j, 0, n)
    FOR(z, 0, 1)
        d1[i][j][z] = d2[i][j];
    FOR(i, 1, n) {
        FOR(j, 1, m)
        FOR(z, 0, n - i)
        FOR(stat, 0, 1) {
            int &rs = d[j][z][stat];
            rs = 0;
            if (stat) rs = (rs + d1[j][z][1]) % M;
            if (a[i].st <= seg[j].st && seg[j].nd <= a[i].nd) rs = (rs + d1[j][z + 1][1]) % M;
            if (j > 1) rs = (rs + 1LL * d2[j][z] * d[j - 1][0][0] % M) % M;
        }
        FOR(j, 1, m)
        FOR(z, 0, n - i)
        FOR(stat, 0, 1)
            d1[j][z][stat] = d[j][z][stat];
    }
    cout << (d[m][0][1] - 1 + M) % M;
    return 0;
}
/*
2
1 5
3 3
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:66:5: note: in expansion of macro 'FOR'
   66 |     FOR(i, 1, n) {
      |     ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:71:5: note: in expansion of macro 'FOR'
   71 |     FOR(i, 1, n) {
      |     ^~~
boat.cpp:34:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   34 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
boat.cpp:81:9: note: in expansion of macro 'EACH'
   81 |         EACH(j, seg) {
      |         ^~~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:105:5: note: in expansion of macro 'FOR'
  105 |     FOR(i, 1, m) {
      |     ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:108:9: note: in expansion of macro 'FOR'
  108 |         FOR(j, 1, cnt) d2[i][j] = 1LL * d2[i][j - 1] * (seg[i].nd - seg[i].st + 2 - j) % M * fpow(j, M - 2, M) % M;
      |         ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:110:5: note: in expansion of macro 'FOR'
  110 |     FOR(i, 1, m)
      |     ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:111:5: note: in expansion of macro 'FOR'
  111 |     FOR(j, 0, n)
      |     ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:112:5: note: in expansion of macro 'FOR'
  112 |     FOR(z, 0, 1)
      |     ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:114:5: note: in expansion of macro 'FOR'
  114 |     FOR(i, 1, n) {
      |     ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:115:9: note: in expansion of macro 'FOR'
  115 |         FOR(j, 1, m)
      |         ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:116:9: note: in expansion of macro 'FOR'
  116 |         FOR(z, 0, n - i)
      |         ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'stat' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:117:9: note: in expansion of macro 'FOR'
  117 |         FOR(stat, 0, 1) {
      |         ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:124:9: note: in expansion of macro 'FOR'
  124 |         FOR(j, 1, m)
      |         ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:125:9: note: in expansion of macro 'FOR'
  125 |         FOR(z, 0, n - i)
      |         ^~~
boat.cpp:30:31: warning: unnecessary parentheses in declaration of 'stat' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
boat.cpp:126:9: note: in expansion of macro 'FOR'
  126 |         FOR(stat, 0, 1)
      |         ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 669 ms 5284 KB Output is correct
2 Correct 671 ms 5288 KB Output is correct
3 Correct 703 ms 5204 KB Output is correct
4 Correct 617 ms 5284 KB Output is correct
5 Correct 642 ms 5288 KB Output is correct
6 Correct 671 ms 5204 KB Output is correct
7 Correct 664 ms 5204 KB Output is correct
8 Correct 669 ms 5284 KB Output is correct
9 Correct 653 ms 5288 KB Output is correct
10 Correct 674 ms 5288 KB Output is correct
11 Correct 626 ms 5204 KB Output is correct
12 Correct 660 ms 5368 KB Output is correct
13 Correct 682 ms 5292 KB Output is correct
14 Correct 690 ms 5204 KB Output is correct
15 Correct 699 ms 5288 KB Output is correct
16 Correct 117 ms 1108 KB Output is correct
17 Correct 123 ms 1288 KB Output is correct
18 Correct 111 ms 1248 KB Output is correct
19 Correct 130 ms 1288 KB Output is correct
20 Correct 122 ms 1256 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 669 ms 5284 KB Output is correct
2 Correct 671 ms 5288 KB Output is correct
3 Correct 703 ms 5204 KB Output is correct
4 Correct 617 ms 5284 KB Output is correct
5 Correct 642 ms 5288 KB Output is correct
6 Correct 671 ms 5204 KB Output is correct
7 Correct 664 ms 5204 KB Output is correct
8 Correct 669 ms 5284 KB Output is correct
9 Correct 653 ms 5288 KB Output is correct
10 Correct 674 ms 5288 KB Output is correct
11 Correct 626 ms 5204 KB Output is correct
12 Correct 660 ms 5368 KB Output is correct
13 Correct 682 ms 5292 KB Output is correct
14 Correct 690 ms 5204 KB Output is correct
15 Correct 699 ms 5288 KB Output is correct
16 Correct 117 ms 1108 KB Output is correct
17 Correct 123 ms 1288 KB Output is correct
18 Correct 111 ms 1248 KB Output is correct
19 Correct 130 ms 1288 KB Output is correct
20 Correct 122 ms 1256 KB Output is correct
21 Correct 1578 ms 9352 KB Output is correct
22 Correct 1612 ms 9480 KB Output is correct
23 Correct 1521 ms 9316 KB Output is correct
24 Correct 1430 ms 9244 KB Output is correct
25 Correct 1425 ms 9288 KB Output is correct
26 Correct 1377 ms 9044 KB Output is correct
27 Correct 1413 ms 9188 KB Output is correct
28 Correct 1469 ms 9024 KB Output is correct
29 Correct 1469 ms 9000 KB Output is correct
30 Correct 1387 ms 10200 KB Output is correct
31 Correct 1490 ms 10224 KB Output is correct
32 Correct 1646 ms 10200 KB Output is correct
33 Correct 1612 ms 10216 KB Output is correct
34 Correct 1535 ms 10188 KB Output is correct
35 Correct 1570 ms 10204 KB Output is correct
36 Correct 1407 ms 10316 KB Output is correct
37 Correct 1416 ms 10208 KB Output is correct
38 Correct 1439 ms 10188 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2260 KB Output is correct
2 Correct 19 ms 2332 KB Output is correct
3 Correct 22 ms 2260 KB Output is correct
4 Correct 25 ms 2308 KB Output is correct
5 Correct 19 ms 2332 KB Output is correct
6 Correct 24 ms 2260 KB Output is correct
7 Correct 19 ms 2260 KB Output is correct
8 Correct 20 ms 2304 KB Output is correct
9 Correct 21 ms 2260 KB Output is correct
10 Correct 19 ms 2240 KB Output is correct
11 Correct 19 ms 2336 KB Output is correct
12 Correct 19 ms 2260 KB Output is correct
13 Correct 21 ms 2208 KB Output is correct
14 Correct 19 ms 2260 KB Output is correct
15 Correct 19 ms 2380 KB Output is correct
16 Correct 10 ms 1364 KB Output is correct
17 Correct 10 ms 1364 KB Output is correct
18 Correct 13 ms 1484 KB Output is correct
19 Correct 10 ms 1364 KB Output is correct
20 Correct 10 ms 1364 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 669 ms 5284 KB Output is correct
2 Correct 671 ms 5288 KB Output is correct
3 Correct 703 ms 5204 KB Output is correct
4 Correct 617 ms 5284 KB Output is correct
5 Correct 642 ms 5288 KB Output is correct
6 Correct 671 ms 5204 KB Output is correct
7 Correct 664 ms 5204 KB Output is correct
8 Correct 669 ms 5284 KB Output is correct
9 Correct 653 ms 5288 KB Output is correct
10 Correct 674 ms 5288 KB Output is correct
11 Correct 626 ms 5204 KB Output is correct
12 Correct 660 ms 5368 KB Output is correct
13 Correct 682 ms 5292 KB Output is correct
14 Correct 690 ms 5204 KB Output is correct
15 Correct 699 ms 5288 KB Output is correct
16 Correct 117 ms 1108 KB Output is correct
17 Correct 123 ms 1288 KB Output is correct
18 Correct 111 ms 1248 KB Output is correct
19 Correct 130 ms 1288 KB Output is correct
20 Correct 122 ms 1256 KB Output is correct
21 Correct 1578 ms 9352 KB Output is correct
22 Correct 1612 ms 9480 KB Output is correct
23 Correct 1521 ms 9316 KB Output is correct
24 Correct 1430 ms 9244 KB Output is correct
25 Correct 1425 ms 9288 KB Output is correct
26 Correct 1377 ms 9044 KB Output is correct
27 Correct 1413 ms 9188 KB Output is correct
28 Correct 1469 ms 9024 KB Output is correct
29 Correct 1469 ms 9000 KB Output is correct
30 Correct 1387 ms 10200 KB Output is correct
31 Correct 1490 ms 10224 KB Output is correct
32 Correct 1646 ms 10200 KB Output is correct
33 Correct 1612 ms 10216 KB Output is correct
34 Correct 1535 ms 10188 KB Output is correct
35 Correct 1570 ms 10204 KB Output is correct
36 Correct 1407 ms 10316 KB Output is correct
37 Correct 1416 ms 10208 KB Output is correct
38 Correct 1439 ms 10188 KB Output is correct
39 Correct 22 ms 2260 KB Output is correct
40 Correct 19 ms 2332 KB Output is correct
41 Correct 22 ms 2260 KB Output is correct
42 Correct 25 ms 2308 KB Output is correct
43 Correct 19 ms 2332 KB Output is correct
44 Correct 24 ms 2260 KB Output is correct
45 Correct 19 ms 2260 KB Output is correct
46 Correct 20 ms 2304 KB Output is correct
47 Correct 21 ms 2260 KB Output is correct
48 Correct 19 ms 2240 KB Output is correct
49 Correct 19 ms 2336 KB Output is correct
50 Correct 19 ms 2260 KB Output is correct
51 Correct 21 ms 2208 KB Output is correct
52 Correct 19 ms 2260 KB Output is correct
53 Correct 19 ms 2380 KB Output is correct
54 Correct 10 ms 1364 KB Output is correct
55 Correct 10 ms 1364 KB Output is correct
56 Correct 13 ms 1484 KB Output is correct
57 Correct 10 ms 1364 KB Output is correct
58 Correct 10 ms 1364 KB Output is correct
59 Correct 1691 ms 10248 KB Output is correct
60 Correct 1633 ms 10252 KB Output is correct
61 Correct 1642 ms 10248 KB Output is correct
62 Correct 1643 ms 10248 KB Output is correct
63 Correct 1656 ms 10132 KB Output is correct
64 Correct 1760 ms 10288 KB Output is correct
65 Correct 1796 ms 10368 KB Output is correct
66 Correct 1799 ms 10244 KB Output is correct
67 Correct 1941 ms 10248 KB Output is correct
68 Execution timed out 2003 ms 10252 KB Time limit exceeded
69 Halted 0 ms 0 KB -