oj.uz

Submission #204386

# Submission time Handle Problem Language Result Execution time Memory
204386 2020-02-25T15:03:05 Z aloo123 Boat (APIO16_boat) C++14
100 / 100
 770 ms 8440 KB 
#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 fact[MAXN], rev[MAXN];
 
int dp[2][MAXN][MAXN];
 
vector<int> T;
 
pii arr[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();
    }           
 
    fact[0] = rev[0] = 1;
 
    for (int i = 1; i < MAXN; ++i) {
        fact[i] = fact[i - 1];
        mulMod(fact[i], i);
        rev[i] = binPow(fact[i], MOD - 2);
    } 
 
    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) {
            int lim = T[c + 1] - T[c];
 
            for (int cnt = 1; cnt <= i; ++cnt) {
                int tmp = dp[0][c][cnt - 1];
                mulMod(tmp, max(0, lim - cnt + 1));
                addMod(dp[1][c][cnt], tmp);                                                                
            }
 
            while (p < c) {
                for (int cnt = 0; cnt <= i; ++cnt) {
                    int tmp = dp[0][p][cnt];
                    mulMod(tmp, rev[cnt]);
                    addMod(w, tmp);
                }
 
                ++p;
            }
 
            int tmp = w;
            mulMod(tmp, lim);
            addMod(dp[1][c][1], tmp);
        }
 
        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 = 1; c + 1 < T.size(); ++c) {
        for (int cnt = 1; cnt <= n; ++cnt) {
            int tmp = dp[0][c][cnt];
            mulMod(tmp, rev[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:115:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int c = 0; c < T.size(); ++c) {
                         ~~^~~~~~~~~~
boat.cpp:125:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int c = 1; c + 1 < T.size(); ++c) {
                     ~~~~~~^~~~~~~~~~
boat.cpp:61:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
boat.cpp:64: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 425 ms 8184 KB Output is correct
2 Correct 436 ms 8316 KB Output is correct
3 Correct 421 ms 8316 KB Output is correct
4 Correct 421 ms 8312 KB Output is correct
5 Correct 426 ms 8184 KB Output is correct
6 Correct 476 ms 8316 KB Output is correct
7 Correct 492 ms 8312 KB Output is correct
8 Correct 482 ms 8312 KB Output is correct
9 Correct 489 ms 8312 KB Output is correct
10 Correct 488 ms 8312 KB Output is correct
11 Correct 486 ms 8312 KB Output is correct
12 Correct 506 ms 8312 KB Output is correct
13 Correct 489 ms 8316 KB Output is correct
14 Correct 485 ms 8312 KB Output is correct
15 Correct 488 ms 8312 KB Output is correct
16 Correct 66 ms 1912 KB Output is correct
17 Correct 63 ms 1784 KB Output is correct
18 Correct 62 ms 1784 KB Output is correct
19 Correct 64 ms 1912 KB Output is correct
20 Correct 63 ms 1912 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 425 ms 8184 KB Output is correct
2 Correct 436 ms 8316 KB Output is correct
3 Correct 421 ms 8316 KB Output is correct
4 Correct 421 ms 8312 KB Output is correct
5 Correct 426 ms 8184 KB Output is correct
6 Correct 476 ms 8316 KB Output is correct
7 Correct 492 ms 8312 KB Output is correct
8 Correct 482 ms 8312 KB Output is correct
9 Correct 489 ms 8312 KB Output is correct
10 Correct 488 ms 8312 KB Output is correct
11 Correct 486 ms 8312 KB Output is correct
12 Correct 506 ms 8312 KB Output is correct
13 Correct 489 ms 8316 KB Output is correct
14 Correct 485 ms 8312 KB Output is correct
15 Correct 488 ms 8312 KB Output is correct
16 Correct 66 ms 1912 KB Output is correct
17 Correct 63 ms 1784 KB Output is correct
18 Correct 62 ms 1784 KB Output is correct
19 Correct 64 ms 1912 KB Output is correct
20 Correct 63 ms 1912 KB Output is correct
21 Correct 578 ms 7576 KB Output is correct
22 Correct 570 ms 7672 KB Output is correct
23 Correct 546 ms 7416 KB Output is correct
24 Correct 573 ms 7548 KB Output is correct
25 Correct 551 ms 7512 KB Output is correct
26 Correct 657 ms 7420 KB Output is correct
27 Correct 661 ms 7300 KB Output is correct
28 Correct 658 ms 7416 KB Output is correct
29 Correct 649 ms 7288 KB Output is correct
30 Correct 479 ms 8312 KB Output is correct
31 Correct 481 ms 8312 KB Output is correct
32 Correct 479 ms 8316 KB Output is correct
33 Correct 479 ms 8312 KB Output is correct
34 Correct 484 ms 8184 KB Output is correct
35 Correct 426 ms 8312 KB Output is correct
36 Correct 416 ms 8440 KB Output is correct
37 Correct 431 ms 8312 KB Output is correct
38 Correct 425 ms 8184 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1912 KB Output is correct
2 Correct 11 ms 1912 KB Output is correct
3 Correct 11 ms 1912 KB Output is correct
4 Correct 11 ms 1912 KB Output is correct
5 Correct 11 ms 1912 KB Output is correct
6 Correct 12 ms 1912 KB Output is correct
7 Correct 12 ms 1912 KB Output is correct
8 Correct 12 ms 1912 KB Output is correct
9 Correct 12 ms 1916 KB Output is correct
10 Correct 12 ms 1912 KB Output is correct
11 Correct 13 ms 2168 KB Output is correct
12 Correct 11 ms 1912 KB Output is correct
13 Correct 10 ms 1912 KB Output is correct
14 Correct 11 ms 2040 KB Output is correct
15 Correct 11 ms 1916 KB Output is correct
16 Correct 8 ms 1272 KB Output is correct
17 Correct 8 ms 1272 KB Output is correct
18 Correct 8 ms 1272 KB Output is correct
19 Correct 8 ms 1272 KB Output is correct
20 Correct 9 ms 1272 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 425 ms 8184 KB Output is correct
2 Correct 436 ms 8316 KB Output is correct
3 Correct 421 ms 8316 KB Output is correct
4 Correct 421 ms 8312 KB Output is correct
5 Correct 426 ms 8184 KB Output is correct
6 Correct 476 ms 8316 KB Output is correct
7 Correct 492 ms 8312 KB Output is correct
8 Correct 482 ms 8312 KB Output is correct
9 Correct 489 ms 8312 KB Output is correct
10 Correct 488 ms 8312 KB Output is correct
11 Correct 486 ms 8312 KB Output is correct
12 Correct 506 ms 8312 KB Output is correct
13 Correct 489 ms 8316 KB Output is correct
14 Correct 485 ms 8312 KB Output is correct
15 Correct 488 ms 8312 KB Output is correct
16 Correct 66 ms 1912 KB Output is correct
17 Correct 63 ms 1784 KB Output is correct
18 Correct 62 ms 1784 KB Output is correct
19 Correct 64 ms 1912 KB Output is correct
20 Correct 63 ms 1912 KB Output is correct
21 Correct 578 ms 7576 KB Output is correct
22 Correct 570 ms 7672 KB Output is correct
23 Correct 546 ms 7416 KB Output is correct
24 Correct 573 ms 7548 KB Output is correct
25 Correct 551 ms 7512 KB Output is correct
26 Correct 657 ms 7420 KB Output is correct
27 Correct 661 ms 7300 KB Output is correct
28 Correct 658 ms 7416 KB Output is correct
29 Correct 649 ms 7288 KB Output is correct
30 Correct 479 ms 8312 KB Output is correct
31 Correct 481 ms 8312 KB Output is correct
32 Correct 479 ms 8316 KB Output is correct
33 Correct 479 ms 8312 KB Output is correct
34 Correct 484 ms 8184 KB Output is correct
35 Correct 426 ms 8312 KB Output is correct
36 Correct 416 ms 8440 KB Output is correct
37 Correct 431 ms 8312 KB Output is correct
38 Correct 425 ms 8184 KB Output is correct
39 Correct 11 ms 1912 KB Output is correct
40 Correct 11 ms 1912 KB Output is correct
41 Correct 11 ms 1912 KB Output is correct
42 Correct 11 ms 1912 KB Output is correct
43 Correct 11 ms 1912 KB Output is correct
44 Correct 12 ms 1912 KB Output is correct
45 Correct 12 ms 1912 KB Output is correct
46 Correct 12 ms 1912 KB Output is correct
47 Correct 12 ms 1916 KB Output is correct
48 Correct 12 ms 1912 KB Output is correct
49 Correct 13 ms 2168 KB Output is correct
50 Correct 11 ms 1912 KB Output is correct
51 Correct 10 ms 1912 KB Output is correct
52 Correct 11 ms 2040 KB Output is correct
53 Correct 11 ms 1916 KB Output is correct
54 Correct 8 ms 1272 KB Output is correct
55 Correct 8 ms 1272 KB Output is correct
56 Correct 8 ms 1272 KB Output is correct
57 Correct 8 ms 1272 KB Output is correct
58 Correct 9 ms 1272 KB Output is correct
59 Correct 642 ms 8312 KB Output is correct
60 Correct 637 ms 8440 KB Output is correct
61 Correct 623 ms 8312 KB Output is correct
62 Correct 637 ms 8312 KB Output is correct
63 Correct 633 ms 8312 KB Output is correct
64 Correct 768 ms 8440 KB Output is correct
65 Correct 768 ms 8440 KB Output is correct
66 Correct 770 ms 8316 KB Output is correct
67 Correct 760 ms 8312 KB Output is correct
68 Correct 762 ms 8440 KB Output is correct
69 Correct 623 ms 8312 KB Output is correct
70 Correct 618 ms 8312 KB Output is correct
71 Correct 609 ms 8440 KB Output is correct
72 Correct 617 ms 8312 KB Output is correct
73 Correct 642 ms 8312 KB Output is correct
74 Correct 108 ms 1784 KB Output is correct
75 Correct 118 ms 1784 KB Output is correct
76 Correct 127 ms 1784 KB Output is correct
77 Correct 115 ms 1912 KB Output is correct
78 Correct 109 ms 1784 KB Output is correct