oj.uz

Submission #200761

# Submission time Handle Problem Language Result Execution time Memory
200761 2020-02-08T05:27:45 Z BThero Boat (APIO16_boat) C++17
100 / 100
 727 ms 12408 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
                                                  
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;   
typedef pair<int, int> pii;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MAXN = (int)1e3 + 5;
const int MOD = (int)1e9 + 7;

int dp[2][MAXN][MAXN];

int mem[MAXN][MAXN];

vector<int> T;

pii arr[MAXN];

int rev[MAXN];

int n;

void addMod(int &a, int b, int m = MOD) {
    a += b;

    if (m <= a) {
        a -= m;
    }
}

void mulMod(int &a, int b, int m = MOD) {
    a = (a * 1ll * b) % m;
}

int binPow(int a, int b) {
    int ret = 1;

    while (b > 0) {
        if (b & 1) {
            mulMod(ret, a);
        }

        mulMod(a, a);
        b >>= 1;
    }

    return ret;
}

void solve() {
    scanf("%d", &n);

    for (int i = 1; i <= n; ++i) {
        scanf("%d %d", &arr[i].fi, &arr[i].se);
        T.pb(arr[i].fi);
        T.pb(arr[i].se + 1);
    }

    T.pb(0);
    sort(all(T));
    T.resize(unique(all(T)) - T.begin());

    for (int i = 1; i <= n; ++i) {
        arr[i].fi = lower_bound(all(T), arr[i].fi) - T.begin();
        arr[i].se = lower_bound(all(T), arr[i].se + 1) - T.begin();
    }

    for (int i = 0; i <= n; ++i) {
        rev[i] = binPow(i, MOD - 2);        
    }

    for (int i = 0; i + 1 < T.size(); ++i) {
        int x = T[i + 1] - T[i];
        mem[i][0] = 1;

        for (int j = 1; j <= n; ++j) {
            if (j > x) {
                mem[i][j] = 0;
                continue;
            }

            int tmp = mem[i][j - 1];
            mulMod(tmp, x - j + 1);
            mulMod(tmp, rev[j]);
            mem[i][j] = tmp;
        }                                                                                    
    }    

    dp[0][0][0] = 1;

    for (int i = 1; i <= n; ++i) {
        int p = 0, w = 0;

        for (int c = arr[i].fi; c < arr[i].se; ++c) {
            for (int cnt = 1; cnt <= i; ++cnt) {
                addMod(dp[1][c][cnt], dp[0][c][cnt - 1]);                                                                
            }

            while (p < c) {
                for (int cnt = 0; cnt <= i; ++cnt) {
                    int tmp = dp[0][p][cnt];
                    mulMod(tmp, mem[p][cnt]);
                    addMod(w, tmp);
                }

                ++p;
            }

            addMod(dp[1][c][1], w);
        }

        for (int c = 0; c < T.size(); ++c) {
            for (int cnt = 0; cnt <= i; ++cnt) {
                addMod(dp[0][c][cnt], dp[1][c][cnt]);
                dp[1][c][cnt] = 0;
            }
        }
    }

    int ans = 0;

    for (int c = 0; c + 1 < T.size(); ++c) {
        for (int cnt = 1; cnt <= n; ++cnt) {
            int tmp = dp[0][c][cnt];
            mulMod(tmp, mem[c][cnt]);
            addMod(ans, tmp);            
        }
    }        

    printf("%d\n", ans);
}

int main() {
    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

boat.cpp: In function 'void solve()':
boat.cpp:87:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i + 1 < T.size(); ++i) {
                     ~~~~~~^~~~~~~~~~
boat.cpp:127:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int c = 0; c < T.size(); ++c) {
                         ~~^~~~~~~~~~
boat.cpp:137:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int c = 0; c + 1 < T.size(); ++c) {
                     ~~~~~~^~~~~~~~~~
boat.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
boat.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &arr[i].fi, &arr[i].se);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 12152 KB Output is correct
2 Correct 467 ms 12408 KB Output is correct
3 Correct 476 ms 12152 KB Output is correct
4 Correct 502 ms 12196 KB Output is correct
5 Correct 473 ms 12280 KB Output is correct
6 Correct 521 ms 12152 KB Output is correct
7 Correct 540 ms 12408 KB Output is correct
8 Correct 535 ms 12328 KB Output is correct
9 Correct 562 ms 12152 KB Output is correct
10 Correct 540 ms 12280 KB Output is correct
11 Correct 543 ms 12280 KB Output is correct
12 Correct 531 ms 12408 KB Output is correct
13 Correct 549 ms 12156 KB Output is correct
14 Correct 522 ms 12152 KB Output is correct
15 Correct 539 ms 12280 KB Output is correct
16 Correct 59 ms 2424 KB Output is correct
17 Correct 62 ms 2552 KB Output is correct
18 Correct 61 ms 2552 KB Output is correct
19 Correct 62 ms 2552 KB Output is correct
20 Correct 65 ms 2556 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 12152 KB Output is correct
2 Correct 467 ms 12408 KB Output is correct
3 Correct 476 ms 12152 KB Output is correct
4 Correct 502 ms 12196 KB Output is correct
5 Correct 473 ms 12280 KB Output is correct
6 Correct 521 ms 12152 KB Output is correct
7 Correct 540 ms 12408 KB Output is correct
8 Correct 535 ms 12328 KB Output is correct
9 Correct 562 ms 12152 KB Output is correct
10 Correct 540 ms 12280 KB Output is correct
11 Correct 543 ms 12280 KB Output is correct
12 Correct 531 ms 12408 KB Output is correct
13 Correct 549 ms 12156 KB Output is correct
14 Correct 522 ms 12152 KB Output is correct
15 Correct 539 ms 12280 KB Output is correct
16 Correct 59 ms 2424 KB Output is correct
17 Correct 62 ms 2552 KB Output is correct
18 Correct 61 ms 2552 KB Output is correct
19 Correct 62 ms 2552 KB Output is correct
20 Correct 65 ms 2556 KB Output is correct
21 Correct 543 ms 11256 KB Output is correct
22 Correct 574 ms 11256 KB Output is correct
23 Correct 562 ms 11256 KB Output is correct
24 Correct 500 ms 11128 KB Output is correct
25 Correct 559 ms 11000 KB Output is correct
26 Correct 598 ms 10744 KB Output is correct
27 Correct 626 ms 11128 KB Output is correct
28 Correct 608 ms 10744 KB Output is correct
29 Correct 610 ms 10744 KB Output is correct
30 Correct 533 ms 12156 KB Output is correct
31 Correct 530 ms 12156 KB Output is correct
32 Correct 590 ms 12408 KB Output is correct
33 Correct 542 ms 12280 KB Output is correct
34 Correct 527 ms 12152 KB Output is correct
35 Correct 454 ms 12152 KB Output is correct
36 Correct 448 ms 12152 KB Output is correct
37 Correct 456 ms 12280 KB Output is correct
38 Correct 483 ms 12152 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2680 KB Output is correct
2 Correct 10 ms 2680 KB Output is correct
3 Correct 11 ms 2684 KB Output is correct
4 Correct 11 ms 2680 KB Output is correct
5 Correct 11 ms 2680 KB Output is correct
6 Correct 13 ms 2680 KB Output is correct
7 Correct 12 ms 2680 KB Output is correct
8 Correct 13 ms 2680 KB Output is correct
9 Correct 13 ms 2680 KB Output is correct
10 Correct 11 ms 2680 KB Output is correct
11 Correct 11 ms 2680 KB Output is correct
12 Correct 11 ms 2680 KB Output is correct
13 Correct 10 ms 2680 KB Output is correct
14 Correct 11 ms 2680 KB Output is correct
15 Correct 11 ms 2680 KB Output is correct
16 Correct 8 ms 1656 KB Output is correct
17 Correct 8 ms 1656 KB Output is correct
18 Correct 10 ms 1784 KB Output is correct
19 Correct 8 ms 1656 KB Output is correct
20 Correct 8 ms 1660 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 12152 KB Output is correct
2 Correct 467 ms 12408 KB Output is correct
3 Correct 476 ms 12152 KB Output is correct
4 Correct 502 ms 12196 KB Output is correct
5 Correct 473 ms 12280 KB Output is correct
6 Correct 521 ms 12152 KB Output is correct
7 Correct 540 ms 12408 KB Output is correct
8 Correct 535 ms 12328 KB Output is correct
9 Correct 562 ms 12152 KB Output is correct
10 Correct 540 ms 12280 KB Output is correct
11 Correct 543 ms 12280 KB Output is correct
12 Correct 531 ms 12408 KB Output is correct
13 Correct 549 ms 12156 KB Output is correct
14 Correct 522 ms 12152 KB Output is correct
15 Correct 539 ms 12280 KB Output is correct
16 Correct 59 ms 2424 KB Output is correct
17 Correct 62 ms 2552 KB Output is correct
18 Correct 61 ms 2552 KB Output is correct
19 Correct 62 ms 2552 KB Output is correct
20 Correct 65 ms 2556 KB Output is correct
21 Correct 543 ms 11256 KB Output is correct
22 Correct 574 ms 11256 KB Output is correct
23 Correct 562 ms 11256 KB Output is correct
24 Correct 500 ms 11128 KB Output is correct
25 Correct 559 ms 11000 KB Output is correct
26 Correct 598 ms 10744 KB Output is correct
27 Correct 626 ms 11128 KB Output is correct
28 Correct 608 ms 10744 KB Output is correct
29 Correct 610 ms 10744 KB Output is correct
30 Correct 533 ms 12156 KB Output is correct
31 Correct 530 ms 12156 KB Output is correct
32 Correct 590 ms 12408 KB Output is correct
33 Correct 542 ms 12280 KB Output is correct
34 Correct 527 ms 12152 KB Output is correct
35 Correct 454 ms 12152 KB Output is correct
36 Correct 448 ms 12152 KB Output is correct
37 Correct 456 ms 12280 KB Output is correct
38 Correct 483 ms 12152 KB Output is correct
39 Correct 11 ms 2680 KB Output is correct
40 Correct 10 ms 2680 KB Output is correct
41 Correct 11 ms 2684 KB Output is correct
42 Correct 11 ms 2680 KB Output is correct
43 Correct 11 ms 2680 KB Output is correct
44 Correct 13 ms 2680 KB Output is correct
45 Correct 12 ms 2680 KB Output is correct
46 Correct 13 ms 2680 KB Output is correct
47 Correct 13 ms 2680 KB Output is correct
48 Correct 11 ms 2680 KB Output is correct
49 Correct 11 ms 2680 KB Output is correct
50 Correct 11 ms 2680 KB Output is correct
51 Correct 10 ms 2680 KB Output is correct
52 Correct 11 ms 2680 KB Output is correct
53 Correct 11 ms 2680 KB Output is correct
54 Correct 8 ms 1656 KB Output is correct
55 Correct 8 ms 1656 KB Output is correct
56 Correct 10 ms 1784 KB Output is correct
57 Correct 8 ms 1656 KB Output is correct
58 Correct 8 ms 1660 KB Output is correct
59 Correct 603 ms 12152 KB Output is correct
60 Correct 626 ms 12280 KB Output is correct
61 Correct 621 ms 12316 KB Output is correct
62 Correct 614 ms 12280 KB Output is correct
63 Correct 602 ms 12152 KB Output is correct
64 Correct 716 ms 12280 KB Output is correct
65 Correct 723 ms 12408 KB Output is correct
66 Correct 727 ms 12280 KB Output is correct
67 Correct 717 ms 12280 KB Output is correct
68 Correct 715 ms 12156 KB Output is correct
69 Correct 657 ms 12280 KB Output is correct
70 Correct 632 ms 12280 KB Output is correct
71 Correct 635 ms 12192 KB Output is correct
72 Correct 630 ms 12192 KB Output is correct
73 Correct 616 ms 12280 KB Output is correct
74 Correct 92 ms 2424 KB Output is correct
75 Correct 93 ms 2608 KB Output is correct
76 Correct 94 ms 2680 KB Output is correct
77 Correct 96 ms 2552 KB Output is correct
78 Correct 93 ms 2424 KB Output is correct