oj.uz

답안 #1105440

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105440 2024-10-26T12:08:16 Z alexdd Flooding Wall (BOI24_wall) C++17
70 / 100
 5000 ms 400628 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9+7;
int n,maxh,cate;
int a[500005],b[500005];
int prefmax[500005],suffmax[500005];
int p2[1000005],inv2;

int put(int a, int exp)
{
    if(exp==0)
        return 1;
    if(exp%2==0)
        return put(a*a%MOD,exp/2);
    else
        return put(a*a%MOD,exp/2)*a%MOD;
}

map<int,int> mp,nrm;
int inv[2000005];

int aint[8000005],lazy[8000005];
void build(int nod, int st, int dr)
{
    lazy[nod]=1;
    if(st==dr)
    {
        aint[nod] = inv[dr]-inv[st-1];
        return;
    }
    int mij=(st+dr)/2;
    build(nod*2,st,mij);
    build(nod*2+1,mij+1,dr);
    aint[nod] = (aint[nod*2] + aint[nod*2+1])%MOD;
}
void propagate(int nod)
{
    if(lazy[nod]==1)
        return;
    lazy[nod*2] = (lazy[nod*2]*lazy[nod])%MOD;
    lazy[nod*2+1] = (lazy[nod*2+1]*lazy[nod])%MOD;
    aint[nod*2] = (aint[nod*2]*lazy[nod])%MOD;
    aint[nod*2+1] = (aint[nod*2+1]*lazy[nod])%MOD;
    lazy[nod]=1;
}
void upd(int nod, int st, int dr, int le, int ri, int newv)
{
    assert(newv!=0);
    if(le>ri)
        return;
    if(le==st && dr==ri)
    {
        lazy[nod] = (lazy[nod]*newv)%MOD;
        aint[nod] = (aint[nod]*newv)%MOD;
        return;
    }
    propagate(nod);
    int mij=(st+dr)/2;
    upd(nod*2,st,mij,le,min(mij,ri),newv);
    upd(nod*2+1,mij+1,dr,max(mij+1,le),ri,newv);
    aint[nod] = (aint[nod*2] + aint[nod*2+1])%MOD;
}
int qry(int nod, int st, int dr, int le, int ri)
{
    if(le>ri)
        return 0;
    if(le==st && dr==ri)
        return aint[nod];
    propagate(nod);
    int mij=(st+dr)/2;
    return (qry(nod*2,st,mij,le,min(mij,ri)) + qry(nod*2+1,mij+1,dr,max(mij+1,le),ri))%MOD;
}

int calc_0(int inc[4][500005])
{
    int rez=0;
    build(1,1,cate);
    for(int i=1;i<=n;i++)
    {
        rez = (rez + p2[n-i]*qry(1,1,cate,nrm[inc[0][i]],nrm[maxh]))%MOD;
        upd(1,1,cate,nrm[b[i]+1],nrm[maxh],2);
    }
    return rez;
}
int calc_1(int inc[4][500005])
{
    int rez=0;
    build(1,1,cate);
    for(int i=n;i>0;i--)
    {
        rez = (rez + qry(1,1,cate,nrm[inc[1][i]],nrm[maxh])*p2[i-1])%MOD;
        upd(1,1,cate,nrm[b[i]+1],nrm[maxh],2);
    }
    return rez;
}
int calc_2(int inc[4][500005])
{
    int rez=0;
    build(1,1,cate);
    for(int i=1;i<=n;i++)
        upd(1,1,cate,nrm[b[i]+1],nrm[maxh],2);
    for(int i=1;i<=n;i++)
    {
        upd(1,1,cate,nrm[b[i]+1],nrm[maxh],inv2);
        rez = (rez + qry(1,1,cate,nrm[inc[2][i]],nrm[maxh]))%MOD;
        /*for(int h=inc[2][i];h<=maxh;h++)
        {
            int cnt=0;
            for(int j=1;j<=n;j++)
                if(j!=i && b[j] < h)
                    cnt++;
            rez = (rez + p2[cnt])%MOD;
        }*/
        upd(1,1,cate,nrm[b[i]+1],nrm[maxh],2);
    }
    return rez;
}
int calc_3(int inc[4][500005])
{
    int rez=0;
    for(int i=1;i<=n;i++)
    {
        rez = (rez + 5LL*MOD + maxh - inc[3][i] + 1)%MOD;
    }
    for(int i=1;i<n;i++)
        rez = rez*2%MOD;
    return rez;
}
int inc[2][4][500005];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    p2[0]=1;
    for(int i=1;i<=1000000;i++)
        p2[i] = p2[i-1]*2%MOD;
    inv2 = put(2,MOD-2);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++)
    {
        cin>>b[i];
        if(a[i]>b[i])
            swap(a[i],b[i]);
        maxh = max(maxh, b[i]);
        mp[a[i]]++;
        mp[a[i]+1]++;
        mp[b[i]]++;
        mp[b[i]+1]++;
    }
    mp[0]++;
    mp[1]++;
    //for(int i=0;i<=maxh;i++)
      //  mp[i]++;
    for(auto it:mp)
    {
        if(!it.second)
            continue;
        nrm[it.first] = ++cate;
        inv[cate] = it.first;
    }
    int rez=0;
    for(int i=1;i<=n;i++)
        prefmax[i] = max(prefmax[i-1], a[i]);
    for(int i=n;i>0;i--)
        suffmax[i] = max(suffmax[i+1], a[i]);
    for(int i=1;i<=n;i++)
    {
        inc[0][0][i] = inc[1][0][i] = prefmax[i-1]+1;
        inc[0][1][i] = inc[1][1][i] = suffmax[i+1]+1;
        inc[0][2][i] = inc[1][2][i] = max(prefmax[i-1], suffmax[i+1]) + 1;
        inc[0][3][i] = inc[1][3][i] = 0;

        for(int j=0;j<4;j++)
        {
            inc[0][j][i] = max(inc[0][j][i], a[i]+1);
            inc[1][j][i] = max(inc[1][j][i], b[i]+1);
        }
    }
    for(int i=0;i<2;i++)
    {
        rez = (rez + calc_3(inc[i]) + calc_2(inc[i]))%MOD;
        rez = (rez + MOD - calc_0(inc[i]))%MOD;
        rez = (rez + MOD - calc_1(inc[i]))%MOD;
    }
    cout<<rez;
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35152 KB Output is correct
2 Correct 9 ms 35300 KB Output is correct
3 Correct 9 ms 35156 KB Output is correct
4 Correct 8 ms 35152 KB Output is correct
5 Correct 9 ms 35152 KB Output is correct
6 Correct 9 ms 35304 KB Output is correct
7 Correct 8 ms 35152 KB Output is correct
8 Correct 8 ms 35152 KB Output is correct
9 Correct 8 ms 35152 KB Output is correct
10 Correct 8 ms 35152 KB Output is correct
11 Correct 8 ms 35152 KB Output is correct
12 Correct 7 ms 35152 KB Output is correct
13 Correct 9 ms 35152 KB Output is correct
14 Correct 9 ms 35152 KB Output is correct
15 Correct 9 ms 35152 KB Output is correct
16 Correct 9 ms 35320 KB Output is correct
17 Correct 9 ms 35152 KB Output is correct
18 Correct 8 ms 35320 KB Output is correct
19 Correct 8 ms 35152 KB Output is correct
20 Correct 8 ms 35152 KB Output is correct
21 Correct 10 ms 35152 KB Output is correct
22 Correct 8 ms 35152 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 35328 KB Output is correct
2 Correct 8 ms 35152 KB Output is correct
3 Correct 8 ms 35152 KB Output is correct
4 Correct 8 ms 35152 KB Output is correct
5 Correct 8 ms 35292 KB Output is correct
6 Correct 9 ms 35152 KB Output is correct
7 Correct 9 ms 35152 KB Output is correct
8 Correct 8 ms 35152 KB Output is correct
9 Correct 9 ms 35152 KB Output is correct
10 Correct 8 ms 35152 KB Output is correct
11 Correct 8 ms 35152 KB Output is correct
12 Correct 9 ms 35368 KB Output is correct
13 Correct 9 ms 35152 KB Output is correct
14 Correct 8 ms 35152 KB Output is correct
15 Correct 9 ms 35408 KB Output is correct
16 Correct 9 ms 35152 KB Output is correct
17 Correct 9 ms 35152 KB Output is correct
18 Correct 9 ms 35152 KB Output is correct
19 Correct 9 ms 35152 KB Output is correct
20 Correct 9 ms 35152 KB Output is correct
21 Correct 9 ms 35152 KB Output is correct
22 Correct 8 ms 35152 KB Output is correct
23 Correct 9 ms 35152 KB Output is correct
24 Correct 9 ms 35152 KB Output is correct
25 Correct 8 ms 35152 KB Output is correct
26 Correct 9 ms 35152 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 35328 KB Output is correct
2 Correct 8 ms 35152 KB Output is correct
3 Correct 8 ms 35152 KB Output is correct
4 Correct 8 ms 35152 KB Output is correct
5 Correct 8 ms 35292 KB Output is correct
6 Correct 9 ms 35152 KB Output is correct
7 Correct 9 ms 35152 KB Output is correct
8 Correct 8 ms 35152 KB Output is correct
9 Correct 9 ms 35152 KB Output is correct
10 Correct 8 ms 35152 KB Output is correct
11 Correct 8 ms 35152 KB Output is correct
12 Correct 9 ms 35368 KB Output is correct
13 Correct 9 ms 35152 KB Output is correct
14 Correct 8 ms 35152 KB Output is correct
15 Correct 9 ms 35408 KB Output is correct
16 Correct 9 ms 35152 KB Output is correct
17 Correct 9 ms 35152 KB Output is correct
18 Correct 9 ms 35152 KB Output is correct
19 Correct 9 ms 35152 KB Output is correct
20 Correct 9 ms 35152 KB Output is correct
21 Correct 9 ms 35152 KB Output is correct
22 Correct 8 ms 35152 KB Output is correct
23 Correct 9 ms 35152 KB Output is correct
24 Correct 9 ms 35152 KB Output is correct
25 Correct 8 ms 35152 KB Output is correct
26 Correct 9 ms 35152 KB Output is correct
27 Correct 47 ms 35572 KB Output is correct
28 Correct 47 ms 35640 KB Output is correct
29 Correct 11 ms 35408 KB Output is correct
30 Correct 10 ms 35408 KB Output is correct
31 Correct 19 ms 35408 KB Output is correct
32 Correct 18 ms 35516 KB Output is correct
33 Correct 20 ms 35420 KB Output is correct
34 Correct 17 ms 35408 KB Output is correct
35 Correct 18 ms 35408 KB Output is correct
36 Correct 20 ms 35408 KB Output is correct
37 Correct 12 ms 35408 KB Output is correct
38 Correct 11 ms 35408 KB Output is correct
39 Correct 17 ms 35408 KB Output is correct
40 Correct 17 ms 35420 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35152 KB Output is correct
2 Correct 9 ms 35300 KB Output is correct
3 Correct 9 ms 35156 KB Output is correct
4 Correct 8 ms 35152 KB Output is correct
5 Correct 9 ms 35152 KB Output is correct
6 Correct 9 ms 35304 KB Output is correct
7 Correct 8 ms 35152 KB Output is correct
8 Correct 8 ms 35152 KB Output is correct
9 Correct 8 ms 35152 KB Output is correct
10 Correct 8 ms 35152 KB Output is correct
11 Correct 8 ms 35152 KB Output is correct
12 Correct 7 ms 35152 KB Output is correct
13 Correct 9 ms 35152 KB Output is correct
14 Correct 9 ms 35152 KB Output is correct
15 Correct 9 ms 35152 KB Output is correct
16 Correct 9 ms 35320 KB Output is correct
17 Correct 9 ms 35152 KB Output is correct
18 Correct 8 ms 35320 KB Output is correct
19 Correct 8 ms 35152 KB Output is correct
20 Correct 8 ms 35152 KB Output is correct
21 Correct 10 ms 35152 KB Output is correct
22 Correct 8 ms 35152 KB Output is correct
23 Correct 9 ms 35328 KB Output is correct
24 Correct 8 ms 35152 KB Output is correct
25 Correct 8 ms 35152 KB Output is correct
26 Correct 8 ms 35152 KB Output is correct
27 Correct 8 ms 35292 KB Output is correct
28 Correct 9 ms 35152 KB Output is correct
29 Correct 9 ms 35152 KB Output is correct
30 Correct 8 ms 35152 KB Output is correct
31 Correct 9 ms 35152 KB Output is correct
32 Correct 8 ms 35152 KB Output is correct
33 Correct 8 ms 35152 KB Output is correct
34 Correct 9 ms 35368 KB Output is correct
35 Correct 9 ms 35152 KB Output is correct
36 Correct 8 ms 35152 KB Output is correct
37 Correct 9 ms 35408 KB Output is correct
38 Correct 9 ms 35152 KB Output is correct
39 Correct 9 ms 35152 KB Output is correct
40 Correct 9 ms 35152 KB Output is correct
41 Correct 9 ms 35152 KB Output is correct
42 Correct 9 ms 35152 KB Output is correct
43 Correct 9 ms 35152 KB Output is correct
44 Correct 8 ms 35152 KB Output is correct
45 Correct 9 ms 35152 KB Output is correct
46 Correct 9 ms 35152 KB Output is correct
47 Correct 8 ms 35152 KB Output is correct
48 Correct 9 ms 35152 KB Output is correct
49 Correct 47 ms 35572 KB Output is correct
50 Correct 47 ms 35640 KB Output is correct
51 Correct 11 ms 35408 KB Output is correct
52 Correct 10 ms 35408 KB Output is correct
53 Correct 19 ms 35408 KB Output is correct
54 Correct 18 ms 35516 KB Output is correct
55 Correct 20 ms 35420 KB Output is correct
56 Correct 17 ms 35408 KB Output is correct
57 Correct 18 ms 35408 KB Output is correct
58 Correct 20 ms 35408 KB Output is correct
59 Correct 12 ms 35408 KB Output is correct
60 Correct 11 ms 35408 KB Output is correct
61 Correct 17 ms 35408 KB Output is correct
62 Correct 17 ms 35420 KB Output is correct
63 Correct 131 ms 42576 KB Output is correct
64 Correct 141 ms 42568 KB Output is correct
65 Correct 17 ms 35664 KB Output is correct
66 Correct 22 ms 35408 KB Output is correct
67 Correct 18 ms 35664 KB Output is correct
68 Correct 22 ms 35576 KB Output is correct
69 Correct 83 ms 36788 KB Output is correct
70 Correct 79 ms 36688 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 35152 KB Output is correct
2 Correct 9 ms 35152 KB Output is correct
3 Correct 9 ms 35152 KB Output is correct
4 Correct 8 ms 35344 KB Output is correct
5 Correct 9 ms 35152 KB Output is correct
6 Correct 8 ms 35296 KB Output is correct
7 Correct 9 ms 35152 KB Output is correct
8 Correct 8 ms 35152 KB Output is correct
9 Correct 8 ms 35152 KB Output is correct
10 Correct 10 ms 35408 KB Output is correct
11 Correct 10 ms 35408 KB Output is correct
12 Correct 10 ms 35408 KB Output is correct
13 Correct 10 ms 35408 KB Output is correct
14 Correct 123 ms 62548 KB Output is correct
15 Correct 129 ms 64584 KB Output is correct
16 Correct 123 ms 64584 KB Output is correct
17 Correct 125 ms 64492 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35152 KB Output is correct
2 Correct 9 ms 35300 KB Output is correct
3 Correct 9 ms 35156 KB Output is correct
4 Correct 8 ms 35152 KB Output is correct
5 Correct 9 ms 35152 KB Output is correct
6 Correct 9 ms 35304 KB Output is correct
7 Correct 8 ms 35152 KB Output is correct
8 Correct 8 ms 35152 KB Output is correct
9 Correct 8 ms 35152 KB Output is correct
10 Correct 8 ms 35152 KB Output is correct
11 Correct 8 ms 35152 KB Output is correct
12 Correct 7 ms 35152 KB Output is correct
13 Correct 9 ms 35152 KB Output is correct
14 Correct 9 ms 35152 KB Output is correct
15 Correct 9 ms 35152 KB Output is correct
16 Correct 9 ms 35320 KB Output is correct
17 Correct 9 ms 35152 KB Output is correct
18 Correct 8 ms 35320 KB Output is correct
19 Correct 8 ms 35152 KB Output is correct
20 Correct 8 ms 35152 KB Output is correct
21 Correct 10 ms 35152 KB Output is correct
22 Correct 8 ms 35152 KB Output is correct
23 Correct 9 ms 35328 KB Output is correct
24 Correct 8 ms 35152 KB Output is correct
25 Correct 8 ms 35152 KB Output is correct
26 Correct 8 ms 35152 KB Output is correct
27 Correct 8 ms 35292 KB Output is correct
28 Correct 9 ms 35152 KB Output is correct
29 Correct 9 ms 35152 KB Output is correct
30 Correct 8 ms 35152 KB Output is correct
31 Correct 9 ms 35152 KB Output is correct
32 Correct 8 ms 35152 KB Output is correct
33 Correct 8 ms 35152 KB Output is correct
34 Correct 9 ms 35368 KB Output is correct
35 Correct 9 ms 35152 KB Output is correct
36 Correct 8 ms 35152 KB Output is correct
37 Correct 9 ms 35408 KB Output is correct
38 Correct 9 ms 35152 KB Output is correct
39 Correct 9 ms 35152 KB Output is correct
40 Correct 9 ms 35152 KB Output is correct
41 Correct 9 ms 35152 KB Output is correct
42 Correct 9 ms 35152 KB Output is correct
43 Correct 9 ms 35152 KB Output is correct
44 Correct 8 ms 35152 KB Output is correct
45 Correct 9 ms 35152 KB Output is correct
46 Correct 9 ms 35152 KB Output is correct
47 Correct 8 ms 35152 KB Output is correct
48 Correct 9 ms 35152 KB Output is correct
49 Correct 47 ms 35572 KB Output is correct
50 Correct 47 ms 35640 KB Output is correct
51 Correct 11 ms 35408 KB Output is correct
52 Correct 10 ms 35408 KB Output is correct
53 Correct 19 ms 35408 KB Output is correct
54 Correct 18 ms 35516 KB Output is correct
55 Correct 20 ms 35420 KB Output is correct
56 Correct 17 ms 35408 KB Output is correct
57 Correct 18 ms 35408 KB Output is correct
58 Correct 20 ms 35408 KB Output is correct
59 Correct 12 ms 35408 KB Output is correct
60 Correct 11 ms 35408 KB Output is correct
61 Correct 17 ms 35408 KB Output is correct
62 Correct 17 ms 35420 KB Output is correct
63 Correct 131 ms 42576 KB Output is correct
64 Correct 141 ms 42568 KB Output is correct
65 Correct 17 ms 35664 KB Output is correct
66 Correct 22 ms 35408 KB Output is correct
67 Correct 18 ms 35664 KB Output is correct
68 Correct 22 ms 35576 KB Output is correct
69 Correct 83 ms 36788 KB Output is correct
70 Correct 79 ms 36688 KB Output is correct
71 Correct 9 ms 35152 KB Output is correct
72 Correct 9 ms 35152 KB Output is correct
73 Correct 9 ms 35152 KB Output is correct
74 Correct 8 ms 35344 KB Output is correct
75 Correct 9 ms 35152 KB Output is correct
76 Correct 8 ms 35296 KB Output is correct
77 Correct 9 ms 35152 KB Output is correct
78 Correct 8 ms 35152 KB Output is correct
79 Correct 8 ms 35152 KB Output is correct
80 Correct 10 ms 35408 KB Output is correct
81 Correct 10 ms 35408 KB Output is correct
82 Correct 10 ms 35408 KB Output is correct
83 Correct 10 ms 35408 KB Output is correct
84 Correct 123 ms 62548 KB Output is correct
85 Correct 129 ms 64584 KB Output is correct
86 Correct 123 ms 64584 KB Output is correct
87 Correct 125 ms 64492 KB Output is correct
88 Execution timed out 5070 ms 400628 KB Time limit exceeded
89 Halted 0 ms 0 KB -