oj.uz

Submission #653745

# Submission time Handle Problem Language Result Execution time Memory
653745 2022-10-27T21:19:28 Z ksjsjsjsjsjsjs Boat (APIO16_boat) C++14
100 / 100
 1828 ms 10208 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
----------------------------------------------------------------
	GOAT
----------------------------------------------------------------
*/
const int M = 1e9 + 7;
const int N = 501;
const int Nx2 = 1001;
int n, m, inv[N], d[Nx2][N][2], d1[Nx2][N][2], d2[Nx2][N];
pi a[N], a1[N];
vpi seg;
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;
    inv[1] = 1;
    FOR(i, 2, n) inv[i] = 1LL * (-M / i + M) % M * inv[M % i] % M;
    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 * inv[j] % 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;
}
/*
----------------------------------------------------------------
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:60:5: note: in expansion of macro 'FOR'
   60 |     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:65:5: note: in expansion of macro 'FOR'
   65 |     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:75:9: note: in expansion of macro 'EACH'
   75 |         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:100:5: note: in expansion of macro 'FOR'
  100 |     FOR(i, 2, n) inv[i] = 1LL * (-M / i + M) % M * inv[M % i] % 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:101:5: note: in expansion of macro 'FOR'
  101 |     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:104:9: note: in expansion of macro 'FOR'
  104 |         FOR(j, 1, cnt) d2[i][j] = 1LL * d2[i][j - 1] * (seg[i].nd - seg[i].st + 2 - j) % M * inv[j] % 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:106:5: note: in expansion of macro 'FOR'
  106 |     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:107:5: note: in expansion of macro 'FOR'
  107 |     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:108:5: note: in expansion of macro 'FOR'
  108 |     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:110:5: note: in expansion of macro 'FOR'
  110 |     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:111:9: note: in expansion of macro 'FOR'
  111 |         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:112:9: note: in expansion of macro 'FOR'
  112 |         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:113:9: note: in expansion of macro 'FOR'
  113 |         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:120:9: note: in expansion of macro 'FOR'
  120 |         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:121:9: note: in expansion of macro 'FOR'
  121 |         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:122:9: note: in expansion of macro 'FOR'
  122 |         FOR(stat, 0, 1)
      |         ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 5256 KB Output is correct
2 Correct 663 ms 5256 KB Output is correct
3 Correct 636 ms 5256 KB Output is correct
4 Correct 693 ms 5252 KB Output is correct
5 Correct 682 ms 5256 KB Output is correct
6 Correct 646 ms 5252 KB Output is correct
7 Correct 712 ms 5252 KB Output is correct
8 Correct 655 ms 5252 KB Output is correct
9 Correct 683 ms 5252 KB Output is correct
10 Correct 650 ms 5252 KB Output is correct
11 Correct 648 ms 5264 KB Output is correct
12 Correct 646 ms 5252 KB Output is correct
13 Correct 686 ms 5268 KB Output is correct
14 Correct 675 ms 5256 KB Output is correct
15 Correct 641 ms 5252 KB Output is correct
16 Correct 126 ms 1116 KB Output is correct
17 Correct 131 ms 1236 KB Output is correct
18 Correct 111 ms 1252 KB Output is correct
19 Correct 139 ms 1292 KB Output is correct
20 Correct 113 ms 1236 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 5256 KB Output is correct
2 Correct 663 ms 5256 KB Output is correct
3 Correct 636 ms 5256 KB Output is correct
4 Correct 693 ms 5252 KB Output is correct
5 Correct 682 ms 5256 KB Output is correct
6 Correct 646 ms 5252 KB Output is correct
7 Correct 712 ms 5252 KB Output is correct
8 Correct 655 ms 5252 KB Output is correct
9 Correct 683 ms 5252 KB Output is correct
10 Correct 650 ms 5252 KB Output is correct
11 Correct 648 ms 5264 KB Output is correct
12 Correct 646 ms 5252 KB Output is correct
13 Correct 686 ms 5268 KB Output is correct
14 Correct 675 ms 5256 KB Output is correct
15 Correct 641 ms 5252 KB Output is correct
16 Correct 126 ms 1116 KB Output is correct
17 Correct 131 ms 1236 KB Output is correct
18 Correct 111 ms 1252 KB Output is correct
19 Correct 139 ms 1292 KB Output is correct
20 Correct 113 ms 1236 KB Output is correct
21 Correct 1481 ms 9300 KB Output is correct
22 Correct 1352 ms 9408 KB Output is correct
23 Correct 1366 ms 9240 KB Output is correct
24 Correct 1404 ms 9172 KB Output is correct
25 Correct 1347 ms 9212 KB Output is correct
26 Correct 1346 ms 9100 KB Output is correct
27 Correct 1475 ms 9112 KB Output is correct
28 Correct 1410 ms 8952 KB Output is correct
29 Correct 1423 ms 8928 KB Output is correct
30 Correct 1454 ms 10188 KB Output is correct
31 Correct 1443 ms 10188 KB Output is correct
32 Correct 1388 ms 10188 KB Output is correct
33 Correct 1518 ms 10144 KB Output is correct
34 Correct 1568 ms 10108 KB Output is correct
35 Correct 1589 ms 10068 KB Output is correct
36 Correct 1377 ms 10124 KB Output is correct
37 Correct 1367 ms 10068 KB Output is correct
38 Correct 1440 ms 10108 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2260 KB Output is correct
2 Correct 14 ms 2316 KB Output is correct
3 Correct 13 ms 2260 KB Output is correct
4 Correct 19 ms 2256 KB Output is correct
5 Correct 14 ms 2260 KB Output is correct
6 Correct 15 ms 2320 KB Output is correct
7 Correct 21 ms 2260 KB Output is correct
8 Correct 14 ms 2252 KB Output is correct
9 Correct 14 ms 2260 KB Output is correct
10 Correct 16 ms 2256 KB Output is correct
11 Correct 14 ms 2260 KB Output is correct
12 Correct 14 ms 2260 KB Output is correct
13 Correct 15 ms 2316 KB Output is correct
14 Correct 14 ms 2260 KB Output is correct
15 Correct 14 ms 2256 KB Output is correct
16 Correct 10 ms 1364 KB Output is correct
17 Correct 11 ms 1364 KB Output is correct
18 Correct 9 ms 1468 KB Output is correct
19 Correct 8 ms 1364 KB Output is correct
20 Correct 9 ms 1364 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 5256 KB Output is correct
2 Correct 663 ms 5256 KB Output is correct
3 Correct 636 ms 5256 KB Output is correct
4 Correct 693 ms 5252 KB Output is correct
5 Correct 682 ms 5256 KB Output is correct
6 Correct 646 ms 5252 KB Output is correct
7 Correct 712 ms 5252 KB Output is correct
8 Correct 655 ms 5252 KB Output is correct
9 Correct 683 ms 5252 KB Output is correct
10 Correct 650 ms 5252 KB Output is correct
11 Correct 648 ms 5264 KB Output is correct
12 Correct 646 ms 5252 KB Output is correct
13 Correct 686 ms 5268 KB Output is correct
14 Correct 675 ms 5256 KB Output is correct
15 Correct 641 ms 5252 KB Output is correct
16 Correct 126 ms 1116 KB Output is correct
17 Correct 131 ms 1236 KB Output is correct
18 Correct 111 ms 1252 KB Output is correct
19 Correct 139 ms 1292 KB Output is correct
20 Correct 113 ms 1236 KB Output is correct
21 Correct 1481 ms 9300 KB Output is correct
22 Correct 1352 ms 9408 KB Output is correct
23 Correct 1366 ms 9240 KB Output is correct
24 Correct 1404 ms 9172 KB Output is correct
25 Correct 1347 ms 9212 KB Output is correct
26 Correct 1346 ms 9100 KB Output is correct
27 Correct 1475 ms 9112 KB Output is correct
28 Correct 1410 ms 8952 KB Output is correct
29 Correct 1423 ms 8928 KB Output is correct
30 Correct 1454 ms 10188 KB Output is correct
31 Correct 1443 ms 10188 KB Output is correct
32 Correct 1388 ms 10188 KB Output is correct
33 Correct 1518 ms 10144 KB Output is correct
34 Correct 1568 ms 10108 KB Output is correct
35 Correct 1589 ms 10068 KB Output is correct
36 Correct 1377 ms 10124 KB Output is correct
37 Correct 1367 ms 10068 KB Output is correct
38 Correct 1440 ms 10108 KB Output is correct
39 Correct 13 ms 2260 KB Output is correct
40 Correct 14 ms 2316 KB Output is correct
41 Correct 13 ms 2260 KB Output is correct
42 Correct 19 ms 2256 KB Output is correct
43 Correct 14 ms 2260 KB Output is correct
44 Correct 15 ms 2320 KB Output is correct
45 Correct 21 ms 2260 KB Output is correct
46 Correct 14 ms 2252 KB Output is correct
47 Correct 14 ms 2260 KB Output is correct
48 Correct 16 ms 2256 KB Output is correct
49 Correct 14 ms 2260 KB Output is correct
50 Correct 14 ms 2260 KB Output is correct
51 Correct 15 ms 2316 KB Output is correct
52 Correct 14 ms 2260 KB Output is correct
53 Correct 14 ms 2256 KB Output is correct
54 Correct 10 ms 1364 KB Output is correct
55 Correct 11 ms 1364 KB Output is correct
56 Correct 9 ms 1468 KB Output is correct
57 Correct 8 ms 1364 KB Output is correct
58 Correct 9 ms 1364 KB Output is correct
59 Correct 1828 ms 10168 KB Output is correct
60 Correct 1594 ms 10164 KB Output is correct
61 Correct 1524 ms 10168 KB Output is correct
62 Correct 1515 ms 10168 KB Output is correct
63 Correct 1582 ms 10208 KB Output is correct
64 Correct 1629 ms 10168 KB Output is correct
65 Correct 1660 ms 10164 KB Output is correct
66 Correct 1578 ms 10168 KB Output is correct
67 Correct 1633 ms 10188 KB Output is correct
68 Correct 1635 ms 10164 KB Output is correct
69 Correct 1574 ms 10188 KB Output is correct
70 Correct 1617 ms 10172 KB Output is correct
71 Correct 1546 ms 10164 KB Output is correct
72 Correct 1591 ms 10164 KB Output is correct
73 Correct 1605 ms 10172 KB Output is correct
74 Correct 248 ms 2132 KB Output is correct
75 Correct 260 ms 2180 KB Output is correct
76 Correct 261 ms 2176 KB Output is correct
77 Correct 261 ms 2160 KB Output is correct
78 Correct 273 ms 2132 KB Output is correct