oj.uz

답안 #653750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653750 2022-10-27T21:47:07 Z ksjsjsjsjsjsjs Boat (APIO16_boat) C++14
100 / 100
 1165 ms 6356 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 = 502;
const int Nx2 = 1002;
int n, m, inv[N], d[Nx2][N][2], d1[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);
    vpi seg1;
    FOR(i, 1, n) {
        if (i == 1) {
            seg.pb(a1[i]);
            continue;
        }
        if (a1[i].st > seg.bk().nd) {
            seg.pb(a1[i]);
            continue;
        }
    	seg1.clear();
        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) {
        d1[i][0] = 1;
        int cnt = min(n, seg[i].nd - seg[i].st + 1);
        FOR(j, 1, cnt) d1[i][j] = 1LL * d1[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)
        d[i][j][z] = d1[i][j];
    FOR(i, 1, n)
    FOR(j, 1, m)
    FOR(z, 0, n - i)
    FOR(stat, 0, 1) {
        if (!stat) d[j][z][stat] = 0;
        if (a[i].st <= seg[j].st && seg[j].nd <= a[i].nd) d[j][z][stat] = (d[j][z][stat] + d[j][z + 1][1]) % M;
        if (j > 1) d[j][z][stat] = (d[j][z][stat] + 1LL * d1[j][z] * d[j - 1][0][0] % M) % M;
    }
    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:66:5: note: in expansion of macro 'FOR'
   66 |     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:76:9: note: in expansion of macro 'EACH'
   76 |         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:101:5: note: in expansion of macro 'FOR'
  101 |     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:102:5: note: in expansion of macro 'FOR'
  102 |     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:105:9: note: in expansion of macro 'FOR'
  105 |         FOR(j, 1, cnt) d1[i][j] = 1LL * d1[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:107:5: note: in expansion of macro 'FOR'
  107 |     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:5: note: in expansion of macro 'FOR'
  108 |     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:109:5: note: in expansion of macro 'FOR'
  109 |     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:111:5: note: in expansion of macro 'FOR'
  111 |     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:112:5: note: in expansion of macro 'FOR'
  112 |     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:113:5: note: in expansion of macro 'FOR'
  113 |     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:114:5: note: in expansion of macro 'FOR'
  114 |     FOR(stat, 0, 1) {
      |     ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 507 ms 3292 KB Output is correct
2 Correct 520 ms 3300 KB Output is correct
3 Correct 530 ms 3292 KB Output is correct
4 Correct 490 ms 3288 KB Output is correct
5 Correct 504 ms 3288 KB Output is correct
6 Correct 506 ms 3284 KB Output is correct
7 Correct 509 ms 3288 KB Output is correct
8 Correct 522 ms 3288 KB Output is correct
9 Correct 512 ms 3288 KB Output is correct
10 Correct 513 ms 3288 KB Output is correct
11 Correct 553 ms 3288 KB Output is correct
12 Correct 517 ms 3288 KB Output is correct
13 Correct 514 ms 3288 KB Output is correct
14 Correct 529 ms 3292 KB Output is correct
15 Correct 490 ms 3288 KB Output is correct
16 Correct 109 ms 856 KB Output is correct
17 Correct 103 ms 896 KB Output is correct
18 Correct 99 ms 876 KB Output is correct
19 Correct 96 ms 852 KB Output is correct
20 Correct 98 ms 880 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 507 ms 3292 KB Output is correct
2 Correct 520 ms 3300 KB Output is correct
3 Correct 530 ms 3292 KB Output is correct
4 Correct 490 ms 3288 KB Output is correct
5 Correct 504 ms 3288 KB Output is correct
6 Correct 506 ms 3284 KB Output is correct
7 Correct 509 ms 3288 KB Output is correct
8 Correct 522 ms 3288 KB Output is correct
9 Correct 512 ms 3288 KB Output is correct
10 Correct 513 ms 3288 KB Output is correct
11 Correct 553 ms 3288 KB Output is correct
12 Correct 517 ms 3288 KB Output is correct
13 Correct 514 ms 3288 KB Output is correct
14 Correct 529 ms 3292 KB Output is correct
15 Correct 490 ms 3288 KB Output is correct
16 Correct 109 ms 856 KB Output is correct
17 Correct 103 ms 896 KB Output is correct
18 Correct 99 ms 876 KB Output is correct
19 Correct 96 ms 852 KB Output is correct
20 Correct 98 ms 880 KB Output is correct
21 Correct 1046 ms 5724 KB Output is correct
22 Correct 1038 ms 5800 KB Output is correct
23 Correct 1037 ms 5680 KB Output is correct
24 Correct 1031 ms 5648 KB Output is correct
25 Correct 1068 ms 5672 KB Output is correct
26 Correct 1079 ms 5536 KB Output is correct
27 Correct 1128 ms 5620 KB Output is correct
28 Correct 1165 ms 5528 KB Output is correct
29 Correct 1084 ms 5500 KB Output is correct
30 Correct 1048 ms 6228 KB Output is correct
31 Correct 1053 ms 6228 KB Output is correct
32 Correct 1051 ms 6228 KB Output is correct
33 Correct 1036 ms 6228 KB Output is correct
34 Correct 1060 ms 6208 KB Output is correct
35 Correct 992 ms 6224 KB Output is correct
36 Correct 993 ms 6232 KB Output is correct
37 Correct 971 ms 6228 KB Output is correct
38 Correct 995 ms 6220 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1492 KB Output is correct
2 Correct 11 ms 1492 KB Output is correct
3 Correct 10 ms 1524 KB Output is correct
4 Correct 11 ms 1532 KB Output is correct
5 Correct 10 ms 1492 KB Output is correct
6 Correct 11 ms 1492 KB Output is correct
7 Correct 11 ms 1524 KB Output is correct
8 Correct 13 ms 1532 KB Output is correct
9 Correct 11 ms 1492 KB Output is correct
10 Correct 14 ms 1492 KB Output is correct
11 Correct 11 ms 1492 KB Output is correct
12 Correct 11 ms 1492 KB Output is correct
13 Correct 11 ms 1532 KB Output is correct
14 Correct 11 ms 1492 KB Output is correct
15 Correct 11 ms 1528 KB Output is correct
16 Correct 8 ms 980 KB Output is correct
17 Correct 6 ms 1012 KB Output is correct
18 Correct 6 ms 980 KB Output is correct
19 Correct 9 ms 1108 KB Output is correct
20 Correct 6 ms 980 KB Output is correct

Subtask #4
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 507 ms 3292 KB Output is correct
2 Correct 520 ms 3300 KB Output is correct
3 Correct 530 ms 3292 KB Output is correct
4 Correct 490 ms 3288 KB Output is correct
5 Correct 504 ms 3288 KB Output is correct
6 Correct 506 ms 3284 KB Output is correct
7 Correct 509 ms 3288 KB Output is correct
8 Correct 522 ms 3288 KB Output is correct
9 Correct 512 ms 3288 KB Output is correct
10 Correct 513 ms 3288 KB Output is correct
11 Correct 553 ms 3288 KB Output is correct
12 Correct 517 ms 3288 KB Output is correct
13 Correct 514 ms 3288 KB Output is correct
14 Correct 529 ms 3292 KB Output is correct
15 Correct 490 ms 3288 KB Output is correct
16 Correct 109 ms 856 KB Output is correct
17 Correct 103 ms 896 KB Output is correct
18 Correct 99 ms 876 KB Output is correct
19 Correct 96 ms 852 KB Output is correct
20 Correct 98 ms 880 KB Output is correct
21 Correct 1046 ms 5724 KB Output is correct
22 Correct 1038 ms 5800 KB Output is correct
23 Correct 1037 ms 5680 KB Output is correct
24 Correct 1031 ms 5648 KB Output is correct
25 Correct 1068 ms 5672 KB Output is correct
26 Correct 1079 ms 5536 KB Output is correct
27 Correct 1128 ms 5620 KB Output is correct
28 Correct 1165 ms 5528 KB Output is correct
29 Correct 1084 ms 5500 KB Output is correct
30 Correct 1048 ms 6228 KB Output is correct
31 Correct 1053 ms 6228 KB Output is correct
32 Correct 1051 ms 6228 KB Output is correct
33 Correct 1036 ms 6228 KB Output is correct
34 Correct 1060 ms 6208 KB Output is correct
35 Correct 992 ms 6224 KB Output is correct
36 Correct 993 ms 6232 KB Output is correct
37 Correct 971 ms 6228 KB Output is correct
38 Correct 995 ms 6220 KB Output is correct
39 Correct 11 ms 1492 KB Output is correct
40 Correct 11 ms 1492 KB Output is correct
41 Correct 10 ms 1524 KB Output is correct
42 Correct 11 ms 1532 KB Output is correct
43 Correct 10 ms 1492 KB Output is correct
44 Correct 11 ms 1492 KB Output is correct
45 Correct 11 ms 1524 KB Output is correct
46 Correct 13 ms 1532 KB Output is correct
47 Correct 11 ms 1492 KB Output is correct
48 Correct 14 ms 1492 KB Output is correct
49 Correct 11 ms 1492 KB Output is correct
50 Correct 11 ms 1492 KB Output is correct
51 Correct 11 ms 1532 KB Output is correct
52 Correct 11 ms 1492 KB Output is correct
53 Correct 11 ms 1528 KB Output is correct
54 Correct 8 ms 980 KB Output is correct
55 Correct 6 ms 1012 KB Output is correct
56 Correct 6 ms 980 KB Output is correct
57 Correct 9 ms 1108 KB Output is correct
58 Correct 6 ms 980 KB Output is correct
59 Correct 1133 ms 6136 KB Output is correct
60 Correct 1114 ms 6228 KB Output is correct
61 Correct 1096 ms 6240 KB Output is correct
62 Correct 1110 ms 6348 KB Output is correct
63 Correct 1101 ms 6244 KB Output is correct
64 Correct 1146 ms 6348 KB Output is correct
65 Correct 1157 ms 6248 KB Output is correct
66 Correct 1162 ms 6240 KB Output is correct
67 Correct 1165 ms 6244 KB Output is correct
68 Correct 1154 ms 6348 KB Output is correct
69 Correct 1117 ms 6252 KB Output is correct
70 Correct 1124 ms 6348 KB Output is correct
71 Correct 1146 ms 6348 KB Output is correct
72 Correct 1135 ms 6352 KB Output is correct
73 Correct 1145 ms 6356 KB Output is correct
74 Correct 200 ms 1420 KB Output is correct
75 Correct 210 ms 1436 KB Output is correct
76 Correct 212 ms 1420 KB Output is correct
77 Correct 205 ms 1420 KB Output is correct
78 Correct 205 ms 1484 KB Output is correct