oj.uz

답안 #653746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653746 2022-10-27T21:21:47 Z ksjsjsjsjsjsjs Boat (APIO16_boat) C++14
100 / 100
 1597 ms 10188 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) {
            d[j][z][stat] = 0;
            if (stat) d[j][z][stat] = (d[j][z][stat] + d1[j][z][1]) % M;
            if (a[i].st <= seg[j].st && seg[j].nd <= a[i].nd) d[j][z][stat] = (d[j][z][stat] + d1[j][z + 1][1]) % M;
            if (j > 1) d[j][z][stat] = (d[j][z][stat] + 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:119:9: note: in expansion of macro 'FOR'
  119 |         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:120:9: note: in expansion of macro 'FOR'
  120 |         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:121:9: note: in expansion of macro 'FOR'
  121 |         FOR(stat, 0, 1)
      |         ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 602 ms 5240 KB Output is correct
2 Correct 659 ms 5244 KB Output is correct
3 Correct 620 ms 5248 KB Output is correct
4 Correct 652 ms 5248 KB Output is correct
5 Correct 721 ms 5248 KB Output is correct
6 Correct 635 ms 5244 KB Output is correct
7 Correct 608 ms 5244 KB Output is correct
8 Correct 621 ms 5240 KB Output is correct
9 Correct 632 ms 5328 KB Output is correct
10 Correct 650 ms 5204 KB Output is correct
11 Correct 649 ms 5240 KB Output is correct
12 Correct 668 ms 5244 KB Output is correct
13 Correct 704 ms 5244 KB Output is correct
14 Correct 684 ms 5240 KB Output is correct
15 Correct 625 ms 5204 KB Output is correct
16 Correct 110 ms 1208 KB Output is correct
17 Correct 137 ms 1276 KB Output is correct
18 Correct 121 ms 1236 KB Output is correct
19 Correct 116 ms 1272 KB Output is correct
20 Correct 117 ms 1236 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 602 ms 5240 KB Output is correct
2 Correct 659 ms 5244 KB Output is correct
3 Correct 620 ms 5248 KB Output is correct
4 Correct 652 ms 5248 KB Output is correct
5 Correct 721 ms 5248 KB Output is correct
6 Correct 635 ms 5244 KB Output is correct
7 Correct 608 ms 5244 KB Output is correct
8 Correct 621 ms 5240 KB Output is correct
9 Correct 632 ms 5328 KB Output is correct
10 Correct 650 ms 5204 KB Output is correct
11 Correct 649 ms 5240 KB Output is correct
12 Correct 668 ms 5244 KB Output is correct
13 Correct 704 ms 5244 KB Output is correct
14 Correct 684 ms 5240 KB Output is correct
15 Correct 625 ms 5204 KB Output is correct
16 Correct 110 ms 1208 KB Output is correct
17 Correct 137 ms 1276 KB Output is correct
18 Correct 121 ms 1236 KB Output is correct
19 Correct 116 ms 1272 KB Output is correct
20 Correct 117 ms 1236 KB Output is correct
21 Correct 1383 ms 9284 KB Output is correct
22 Correct 1371 ms 9404 KB Output is correct
23 Correct 1346 ms 9232 KB Output is correct
24 Correct 1347 ms 9172 KB Output is correct
25 Correct 1367 ms 9212 KB Output is correct
26 Correct 1376 ms 8968 KB Output is correct
27 Correct 1405 ms 9104 KB Output is correct
28 Correct 1382 ms 8952 KB Output is correct
29 Correct 1418 ms 8916 KB Output is correct
30 Correct 1403 ms 10108 KB Output is correct
31 Correct 1331 ms 10140 KB Output is correct
32 Correct 1362 ms 10108 KB Output is correct
33 Correct 1359 ms 10068 KB Output is correct
34 Correct 1330 ms 10096 KB Output is correct
35 Correct 1315 ms 10124 KB Output is correct
36 Correct 1330 ms 10128 KB Output is correct
37 Correct 1338 ms 10188 KB Output is correct
38 Correct 1294 ms 10096 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2260 KB Output is correct
2 Correct 16 ms 2308 KB Output is correct
3 Correct 16 ms 2316 KB Output is correct
4 Correct 13 ms 2260 KB Output is correct
5 Correct 16 ms 2312 KB Output is correct
6 Correct 14 ms 2320 KB Output is correct
7 Correct 14 ms 2312 KB Output is correct
8 Correct 15 ms 2260 KB Output is correct
9 Correct 14 ms 2260 KB Output is correct
10 Correct 14 ms 2260 KB Output is correct
11 Correct 14 ms 2308 KB Output is correct
12 Correct 13 ms 2260 KB Output is correct
13 Correct 13 ms 2316 KB Output is correct
14 Correct 13 ms 2308 KB Output is correct
15 Correct 13 ms 2260 KB Output is correct
16 Correct 7 ms 1364 KB Output is correct
17 Correct 9 ms 1448 KB Output is correct
18 Correct 7 ms 1364 KB Output is correct
19 Correct 8 ms 1468 KB Output is correct
20 Correct 7 ms 1364 KB Output is correct

Subtask #4
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 602 ms 5240 KB Output is correct
2 Correct 659 ms 5244 KB Output is correct
3 Correct 620 ms 5248 KB Output is correct
4 Correct 652 ms 5248 KB Output is correct
5 Correct 721 ms 5248 KB Output is correct
6 Correct 635 ms 5244 KB Output is correct
7 Correct 608 ms 5244 KB Output is correct
8 Correct 621 ms 5240 KB Output is correct
9 Correct 632 ms 5328 KB Output is correct
10 Correct 650 ms 5204 KB Output is correct
11 Correct 649 ms 5240 KB Output is correct
12 Correct 668 ms 5244 KB Output is correct
13 Correct 704 ms 5244 KB Output is correct
14 Correct 684 ms 5240 KB Output is correct
15 Correct 625 ms 5204 KB Output is correct
16 Correct 110 ms 1208 KB Output is correct
17 Correct 137 ms 1276 KB Output is correct
18 Correct 121 ms 1236 KB Output is correct
19 Correct 116 ms 1272 KB Output is correct
20 Correct 117 ms 1236 KB Output is correct
21 Correct 1383 ms 9284 KB Output is correct
22 Correct 1371 ms 9404 KB Output is correct
23 Correct 1346 ms 9232 KB Output is correct
24 Correct 1347 ms 9172 KB Output is correct
25 Correct 1367 ms 9212 KB Output is correct
26 Correct 1376 ms 8968 KB Output is correct
27 Correct 1405 ms 9104 KB Output is correct
28 Correct 1382 ms 8952 KB Output is correct
29 Correct 1418 ms 8916 KB Output is correct
30 Correct 1403 ms 10108 KB Output is correct
31 Correct 1331 ms 10140 KB Output is correct
32 Correct 1362 ms 10108 KB Output is correct
33 Correct 1359 ms 10068 KB Output is correct
34 Correct 1330 ms 10096 KB Output is correct
35 Correct 1315 ms 10124 KB Output is correct
36 Correct 1330 ms 10128 KB Output is correct
37 Correct 1338 ms 10188 KB Output is correct
38 Correct 1294 ms 10096 KB Output is correct
39 Correct 13 ms 2260 KB Output is correct
40 Correct 16 ms 2308 KB Output is correct
41 Correct 16 ms 2316 KB Output is correct
42 Correct 13 ms 2260 KB Output is correct
43 Correct 16 ms 2312 KB Output is correct
44 Correct 14 ms 2320 KB Output is correct
45 Correct 14 ms 2312 KB Output is correct
46 Correct 15 ms 2260 KB Output is correct
47 Correct 14 ms 2260 KB Output is correct
48 Correct 14 ms 2260 KB Output is correct
49 Correct 14 ms 2308 KB Output is correct
50 Correct 13 ms 2260 KB Output is correct
51 Correct 13 ms 2316 KB Output is correct
52 Correct 13 ms 2308 KB Output is correct
53 Correct 13 ms 2260 KB Output is correct
54 Correct 7 ms 1364 KB Output is correct
55 Correct 9 ms 1448 KB Output is correct
56 Correct 7 ms 1364 KB Output is correct
57 Correct 8 ms 1468 KB Output is correct
58 Correct 7 ms 1364 KB Output is correct
59 Correct 1552 ms 10156 KB Output is correct
60 Correct 1515 ms 10156 KB Output is correct
61 Correct 1529 ms 10176 KB Output is correct
62 Correct 1517 ms 10156 KB Output is correct
63 Correct 1509 ms 10156 KB Output is correct
64 Correct 1597 ms 10152 KB Output is correct
65 Correct 1591 ms 10156 KB Output is correct
66 Correct 1535 ms 10156 KB Output is correct
67 Correct 1561 ms 10156 KB Output is correct
68 Correct 1556 ms 10188 KB Output is correct
69 Correct 1515 ms 10156 KB Output is correct
70 Correct 1517 ms 10152 KB Output is correct
71 Correct 1511 ms 10068 KB Output is correct
72 Correct 1528 ms 10152 KB Output is correct
73 Correct 1528 ms 10156 KB Output is correct
74 Correct 245 ms 2104 KB Output is correct
75 Correct 258 ms 2132 KB Output is correct
76 Correct 251 ms 2132 KB Output is correct
77 Correct 261 ms 2148 KB Output is correct
78 Correct 245 ms 2004 KB Output is correct