oj.uz

Submission #645053

# Submission time Handle Problem Language Result Execution time Memory
645053 2022-09-26T04:23:33 Z ghostwriter Boat (APIO16_boat) C++14
100 / 100
 1839 ms 10292 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 = 502;
const int Nx2 = 1002;
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 601 ms 5204 KB Output is correct
2 Correct 613 ms 5264 KB Output is correct
3 Correct 629 ms 5272 KB Output is correct
4 Correct 594 ms 5204 KB Output is correct
5 Correct 597 ms 5204 KB Output is correct
6 Correct 616 ms 5324 KB Output is correct
7 Correct 629 ms 5268 KB Output is correct
8 Correct 603 ms 5268 KB Output is correct
9 Correct 613 ms 5256 KB Output is correct
10 Correct 608 ms 5264 KB Output is correct
11 Correct 601 ms 5204 KB Output is correct
12 Correct 606 ms 5248 KB Output is correct
13 Correct 626 ms 5204 KB Output is correct
14 Correct 615 ms 5264 KB Output is correct
15 Correct 603 ms 5204 KB Output is correct
16 Correct 105 ms 1108 KB Output is correct
17 Correct 116 ms 1236 KB Output is correct
18 Correct 110 ms 1236 KB Output is correct
19 Correct 114 ms 1236 KB Output is correct
20 Correct 115 ms 1248 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 5204 KB Output is correct
2 Correct 613 ms 5264 KB Output is correct
3 Correct 629 ms 5272 KB Output is correct
4 Correct 594 ms 5204 KB Output is correct
5 Correct 597 ms 5204 KB Output is correct
6 Correct 616 ms 5324 KB Output is correct
7 Correct 629 ms 5268 KB Output is correct
8 Correct 603 ms 5268 KB Output is correct
9 Correct 613 ms 5256 KB Output is correct
10 Correct 608 ms 5264 KB Output is correct
11 Correct 601 ms 5204 KB Output is correct
12 Correct 606 ms 5248 KB Output is correct
13 Correct 626 ms 5204 KB Output is correct
14 Correct 615 ms 5264 KB Output is correct
15 Correct 603 ms 5204 KB Output is correct
16 Correct 105 ms 1108 KB Output is correct
17 Correct 116 ms 1236 KB Output is correct
18 Correct 110 ms 1236 KB Output is correct
19 Correct 114 ms 1236 KB Output is correct
20 Correct 115 ms 1248 KB Output is correct
21 Correct 1302 ms 9304 KB Output is correct
22 Correct 1382 ms 9428 KB Output is correct
23 Correct 1402 ms 9248 KB Output is correct
24 Correct 1297 ms 9180 KB Output is correct
25 Correct 1292 ms 9212 KB Output is correct
26 Correct 1313 ms 9036 KB Output is correct
27 Correct 1341 ms 9164 KB Output is correct
28 Correct 1315 ms 8976 KB Output is correct
29 Correct 1300 ms 8936 KB Output is correct
30 Correct 1364 ms 10188 KB Output is correct
31 Correct 1381 ms 10148 KB Output is correct
32 Correct 1351 ms 10124 KB Output is correct
33 Correct 1376 ms 10148 KB Output is correct
34 Correct 1372 ms 10116 KB Output is correct
35 Correct 1352 ms 10208 KB Output is correct
36 Correct 1387 ms 10132 KB Output is correct
37 Correct 1359 ms 10132 KB Output is correct
38 Correct 1335 ms 10120 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2260 KB Output is correct
2 Correct 18 ms 2232 KB Output is correct
3 Correct 19 ms 2260 KB Output is correct
4 Correct 19 ms 2260 KB Output is correct
5 Correct 18 ms 2300 KB Output is correct
6 Correct 20 ms 2312 KB Output is correct
7 Correct 20 ms 2312 KB Output is correct
8 Correct 19 ms 2316 KB Output is correct
9 Correct 19 ms 2260 KB Output is correct
10 Correct 19 ms 2308 KB Output is correct
11 Correct 19 ms 2312 KB Output is correct
12 Correct 18 ms 2316 KB Output is correct
13 Correct 19 ms 2188 KB Output is correct
14 Correct 20 ms 2264 KB Output is correct
15 Correct 18 ms 2260 KB Output is correct
16 Correct 10 ms 1388 KB Output is correct
17 Correct 10 ms 1364 KB Output is correct
18 Correct 10 ms 1364 KB Output is correct
19 Correct 10 ms 1448 KB Output is correct
20 Correct 10 ms 1424 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 5204 KB Output is correct
2 Correct 613 ms 5264 KB Output is correct
3 Correct 629 ms 5272 KB Output is correct
4 Correct 594 ms 5204 KB Output is correct
5 Correct 597 ms 5204 KB Output is correct
6 Correct 616 ms 5324 KB Output is correct
7 Correct 629 ms 5268 KB Output is correct
8 Correct 603 ms 5268 KB Output is correct
9 Correct 613 ms 5256 KB Output is correct
10 Correct 608 ms 5264 KB Output is correct
11 Correct 601 ms 5204 KB Output is correct
12 Correct 606 ms 5248 KB Output is correct
13 Correct 626 ms 5204 KB Output is correct
14 Correct 615 ms 5264 KB Output is correct
15 Correct 603 ms 5204 KB Output is correct
16 Correct 105 ms 1108 KB Output is correct
17 Correct 116 ms 1236 KB Output is correct
18 Correct 110 ms 1236 KB Output is correct
19 Correct 114 ms 1236 KB Output is correct
20 Correct 115 ms 1248 KB Output is correct
21 Correct 1302 ms 9304 KB Output is correct
22 Correct 1382 ms 9428 KB Output is correct
23 Correct 1402 ms 9248 KB Output is correct
24 Correct 1297 ms 9180 KB Output is correct
25 Correct 1292 ms 9212 KB Output is correct
26 Correct 1313 ms 9036 KB Output is correct
27 Correct 1341 ms 9164 KB Output is correct
28 Correct 1315 ms 8976 KB Output is correct
29 Correct 1300 ms 8936 KB Output is correct
30 Correct 1364 ms 10188 KB Output is correct
31 Correct 1381 ms 10148 KB Output is correct
32 Correct 1351 ms 10124 KB Output is correct
33 Correct 1376 ms 10148 KB Output is correct
34 Correct 1372 ms 10116 KB Output is correct
35 Correct 1352 ms 10208 KB Output is correct
36 Correct 1387 ms 10132 KB Output is correct
37 Correct 1359 ms 10132 KB Output is correct
38 Correct 1335 ms 10120 KB Output is correct
39 Correct 18 ms 2260 KB Output is correct
40 Correct 18 ms 2232 KB Output is correct
41 Correct 19 ms 2260 KB Output is correct
42 Correct 19 ms 2260 KB Output is correct
43 Correct 18 ms 2300 KB Output is correct
44 Correct 20 ms 2312 KB Output is correct
45 Correct 20 ms 2312 KB Output is correct
46 Correct 19 ms 2316 KB Output is correct
47 Correct 19 ms 2260 KB Output is correct
48 Correct 19 ms 2308 KB Output is correct
49 Correct 19 ms 2312 KB Output is correct
50 Correct 18 ms 2316 KB Output is correct
51 Correct 19 ms 2188 KB Output is correct
52 Correct 20 ms 2264 KB Output is correct
53 Correct 18 ms 2260 KB Output is correct
54 Correct 10 ms 1388 KB Output is correct
55 Correct 10 ms 1364 KB Output is correct
56 Correct 10 ms 1364 KB Output is correct
57 Correct 10 ms 1448 KB Output is correct
58 Correct 10 ms 1424 KB Output is correct
59 Correct 1682 ms 10180 KB Output is correct
60 Correct 1586 ms 10180 KB Output is correct
61 Correct 1612 ms 10188 KB Output is correct
62 Correct 1598 ms 10292 KB Output is correct
63 Correct 1598 ms 10176 KB Output is correct
64 Correct 1686 ms 10188 KB Output is correct
65 Correct 1682 ms 10176 KB Output is correct
66 Correct 1674 ms 10156 KB Output is correct
67 Correct 1653 ms 10180 KB Output is correct
68 Correct 1839 ms 10180 KB Output is correct
69 Correct 1697 ms 10188 KB Output is correct
70 Correct 1744 ms 10188 KB Output is correct
71 Correct 1790 ms 10188 KB Output is correct
72 Correct 1821 ms 10192 KB Output is correct
73 Correct 1782 ms 10188 KB Output is correct
74 Correct 409 ms 2124 KB Output is correct
75 Correct 290 ms 2184 KB Output is correct
76 Correct 286 ms 2156 KB Output is correct
77 Correct 275 ms 2152 KB Output is correct
78 Correct 380 ms 2124 KB Output is correct