Submission #47154

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
47154	2018-04-28T07:42:03 Z	PowerOfNinjaGo	Boat (APIO16_boat)	C++17	100 / 100	1271 ms	9164 KB

boat

//Power Of Ninja Go
#include <bits/stdc++.h>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll; typedef pair<int, int> ii; typedef vector<int> vi; typedef vector< ii > vii;
#define X first
#define Y second
#define pb push_back
const int maxn = 505;
const int md = 1e9+7;
void add(int &a, int b)
{
    a += b;
    if(a>= md) a-= md;
}
int mul(int a, int b)
{
    return (1LL*a*b)%md;
}
int expo(int a, int b)
{
    if(b == 0) return 1;
    int x = expo(a, b/2);
    int y = mul(x, x);
    if(b%2) y = mul(y, a);
    return y;
}
int inv(int x)
{
    return expo(x, md-2);
}
int a[maxn];
int b[maxn];
int qu[maxn][2*maxn];
int f[maxn][2*maxn];
int sum[maxn][2*maxn];
int mem[maxn][2*maxn];
int invfac[maxn];
int n;
vi vec;
int g(int L, int R, int intv)
{
    //cout << L << ' ' << R << ' ' << intv << endl;
    int k = qu[R][intv]-qu[L-1][intv]-1;
    int sz = vec[intv+1]-vec[intv];
    if(mem[k][intv] != -1) return mem[k][intv];
    int res = 1;
    for(int i = sz; i<= sz+k; i++) res = mul(res, i);
    res = mul(res, invfac[k+1]);
    return mem[k][intv] = res;
}
int main()
{
    memset(mem, -1, sizeof mem);
    cin >> n;
    invfac[0] = 1;
    for(int i = 1; i<= n; i++) invfac[i] = mul(invfac[i-1], inv(i));
    for(int i = 1; i<= n; i++)
    {
        cin >> a[i] >> b[i];
        b[i]++;
        vec.pb(a[i]); vec.pb(b[i]);
    }
    sort(vec.begin(), vec.end()); vec.resize(unique(vec.begin(), vec.end())-vec.begin());
    for(int i = 1; i<= n; i++)
    {
        a[i] = lower_bound(vec.begin(), vec.end(), a[i])-vec.begin();
        b[i] = lower_bound(vec.begin(), vec.end(), b[i])-vec.begin();
    }
    for(int i = 1; i<= n; i++)
    {
        for(int j = 0; j< (int) vec.size()-1; j++)
        {
            qu[i][j] = qu[i-1][j] + (a[i]<= j && j< b[i]);
        }
    }
    for(int j = 0; j< (int) vec.size()-1; j++) sum[0][j] = 1;
    for(int i = 1; i<= n; i++)
    {
        for(int j = 0; j< (int) vec.size()-1; j++)
        {
            if(a[i]<= j && j <b[i])
            {
                for(int a = 0; a< i ; a++)
                {
                    int sm;
                    if(j == 0 && a == 0) sm = 1;
                    else if(j == 0) sm = 0;
                    else sm = sum[a][j-1];
                    //cout << sm << endl;
                    add(f[i][j], mul(sm, g(a+1, i, j)));
                }
            }
            //printf("f[%d][%d] = %d\n", i, j, f[i][j]);
            sum[i][j] = j?sum[i][j-1]:0;
            add(sum[i][j], f[i][j]);
        }
    }
    int res = 0;
    for(int i = 1; i<= n; i++)
    {
        for(int j = 0; j< (int) vec.size()-1; j++)
        {
            add(res, f[i][j]);
        }
    }
    cout << res << endl;
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	7928 KB	Output is correct
2	Correct	14 ms	7928 KB	Output is correct
3	Correct	15 ms	8112 KB	Output is correct
4	Correct	13 ms	8112 KB	Output is correct
5	Correct	13 ms	8112 KB	Output is correct
6	Correct	13 ms	8480 KB	Output is correct
7	Correct	13 ms	8480 KB	Output is correct
8	Correct	14 ms	8480 KB	Output is correct
9	Correct	14 ms	8480 KB	Output is correct
10	Correct	14 ms	8480 KB	Output is correct
11	Correct	13 ms	8480 KB	Output is correct
12	Correct	14 ms	8480 KB	Output is correct
13	Correct	13 ms	8480 KB	Output is correct
14	Correct	13 ms	8480 KB	Output is correct
15	Correct	14 ms	8480 KB	Output is correct
16	Correct	11 ms	8480 KB	Output is correct
17	Correct	11 ms	8480 KB	Output is correct
18	Correct	11 ms	8480 KB	Output is correct
19	Correct	12 ms	8496 KB	Output is correct
20	Correct	17 ms	8496 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	7928 KB	Output is correct
2	Correct	14 ms	7928 KB	Output is correct
3	Correct	15 ms	8112 KB	Output is correct
4	Correct	13 ms	8112 KB	Output is correct
5	Correct	13 ms	8112 KB	Output is correct
6	Correct	13 ms	8480 KB	Output is correct
7	Correct	13 ms	8480 KB	Output is correct
8	Correct	14 ms	8480 KB	Output is correct
9	Correct	14 ms	8480 KB	Output is correct
10	Correct	14 ms	8480 KB	Output is correct
11	Correct	13 ms	8480 KB	Output is correct
12	Correct	14 ms	8480 KB	Output is correct
13	Correct	13 ms	8480 KB	Output is correct
14	Correct	13 ms	8480 KB	Output is correct
15	Correct	14 ms	8480 KB	Output is correct
16	Correct	11 ms	8480 KB	Output is correct
17	Correct	11 ms	8480 KB	Output is correct
18	Correct	11 ms	8480 KB	Output is correct
19	Correct	12 ms	8496 KB	Output is correct
20	Correct	17 ms	8496 KB	Output is correct
21	Correct	714 ms	8640 KB	Output is correct
22	Correct	678 ms	8640 KB	Output is correct
23	Correct	609 ms	8640 KB	Output is correct
24	Correct	684 ms	8640 KB	Output is correct
25	Correct	722 ms	8672 KB	Output is correct
26	Correct	974 ms	8672 KB	Output is correct
27	Correct	1012 ms	8752 KB	Output is correct
28	Correct	979 ms	8752 KB	Output is correct
29	Correct	1002 ms	8780 KB	Output is correct
30	Correct	17 ms	8780 KB	Output is correct
31	Correct	19 ms	8780 KB	Output is correct
32	Correct	17 ms	8804 KB	Output is correct
33	Correct	17 ms	8816 KB	Output is correct
34	Correct	16 ms	8816 KB	Output is correct
35	Correct	18 ms	8816 KB	Output is correct
36	Correct	16 ms	8816 KB	Output is correct
37	Correct	17 ms	8816 KB	Output is correct
38	Correct	16 ms	8816 KB	Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
42.0 / 42.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	7928 KB	Output is correct
2	Correct	14 ms	7928 KB	Output is correct
3	Correct	15 ms	8112 KB	Output is correct
4	Correct	13 ms	8112 KB	Output is correct
5	Correct	13 ms	8112 KB	Output is correct
6	Correct	13 ms	8480 KB	Output is correct
7	Correct	13 ms	8480 KB	Output is correct
8	Correct	14 ms	8480 KB	Output is correct
9	Correct	14 ms	8480 KB	Output is correct
10	Correct	14 ms	8480 KB	Output is correct
11	Correct	13 ms	8480 KB	Output is correct
12	Correct	14 ms	8480 KB	Output is correct
13	Correct	13 ms	8480 KB	Output is correct
14	Correct	13 ms	8480 KB	Output is correct
15	Correct	14 ms	8480 KB	Output is correct
16	Correct	11 ms	8480 KB	Output is correct
17	Correct	11 ms	8480 KB	Output is correct
18	Correct	11 ms	8480 KB	Output is correct
19	Correct	12 ms	8496 KB	Output is correct
20	Correct	17 ms	8496 KB	Output is correct
21	Correct	714 ms	8640 KB	Output is correct
22	Correct	678 ms	8640 KB	Output is correct
23	Correct	609 ms	8640 KB	Output is correct
24	Correct	684 ms	8640 KB	Output is correct
25	Correct	722 ms	8672 KB	Output is correct
26	Correct	974 ms	8672 KB	Output is correct
27	Correct	1012 ms	8752 KB	Output is correct
28	Correct	979 ms	8752 KB	Output is correct
29	Correct	1002 ms	8780 KB	Output is correct
30	Correct	17 ms	8780 KB	Output is correct
31	Correct	19 ms	8780 KB	Output is correct
32	Correct	17 ms	8804 KB	Output is correct
33	Correct	17 ms	8816 KB	Output is correct
34	Correct	16 ms	8816 KB	Output is correct
35	Correct	18 ms	8816 KB	Output is correct
36	Correct	16 ms	8816 KB	Output is correct
37	Correct	17 ms	8816 KB	Output is correct
38	Correct	16 ms	8816 KB	Output is correct
39	Correct	8 ms	8816 KB	Output is correct
40	Correct	9 ms	8816 KB	Output is correct
41	Correct	9 ms	8816 KB	Output is correct
42	Correct	9 ms	8816 KB	Output is correct
43	Correct	9 ms	8816 KB	Output is correct
44	Correct	12 ms	8816 KB	Output is correct
45	Correct	12 ms	8816 KB	Output is correct
46	Correct	12 ms	8816 KB	Output is correct
47	Correct	12 ms	8816 KB	Output is correct
48	Correct	11 ms	8816 KB	Output is correct
49	Correct	10 ms	8816 KB	Output is correct
50	Correct	7 ms	8816 KB	Output is correct
51	Correct	8 ms	8816 KB	Output is correct
52	Correct	8 ms	8816 KB	Output is correct
53	Correct	9 ms	8816 KB	Output is correct
54	Correct	7 ms	8816 KB	Output is correct
55	Correct	8 ms	8816 KB	Output is correct
56	Correct	7 ms	8816 KB	Output is correct
57	Correct	6 ms	8816 KB	Output is correct
58	Correct	9 ms	8816 KB	Output is correct
59	Correct	769 ms	8928 KB	Output is correct
60	Correct	758 ms	8928 KB	Output is correct
61	Correct	706 ms	8928 KB	Output is correct
62	Correct	851 ms	8976 KB	Output is correct
63	Correct	791 ms	8976 KB	Output is correct
64	Correct	1205 ms	9064 KB	Output is correct
65	Correct	1216 ms	9164 KB	Output is correct
66	Correct	1271 ms	9164 KB	Output is correct
67	Correct	1199 ms	9164 KB	Output is correct
68	Correct	1237 ms	9164 KB	Output is correct
69	Correct	518 ms	9164 KB	Output is correct
70	Correct	528 ms	9164 KB	Output is correct
71	Correct	528 ms	9164 KB	Output is correct
72	Correct	561 ms	9164 KB	Output is correct
73	Correct	579 ms	9164 KB	Output is correct
74	Correct	134 ms	9164 KB	Output is correct
75	Correct	125 ms	9164 KB	Output is correct
76	Correct	131 ms	9164 KB	Output is correct
77	Correct	132 ms	9164 KB	Output is correct
78	Correct	136 ms	9164 KB	Output is correct

Submission #47154

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 22.0 / 22.0

Subtask #3 27.0 / 27.0

Subtask #4 42.0 / 42.0

Subtask #1
9.0 / 9.0

Subtask #2
22.0 / 22.0

Subtask #3
27.0 / 27.0

Subtask #4
42.0 / 42.0