oj.uz

Submission #956881

# Submission time Handle Problem Language Result Execution time Memory
956881 2024-04-02T15:41:39 Z hotboy2703 Misspelling (JOI22_misspelling) C++14
100 / 100
 787 ms 389860 KB 
//assert,cout,dau // , endl,function chua reference vector,chua pragma log, builtinpopcount,bitset,...

#include<bits/stdc++.h>
using ll = long long;
using namespace std;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
#define MP make_pair
const ll MOD = 1e9 + 7;
const ll MAXN = 5e5;
const ll base = 26;
ll cond[MAXN+100][2];
stack <pll> s[base][2];
ll sum[base][2];
ll pre_sum[base][2];
ll sus[base];
ll n,m;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    cin>>n>>m;
    for (ll i = 1;i <= m;i ++){
        ll u,v;
        cin>>u>>v;
        ll l = min(u,v),r = max(u,v);
        cond[l][u < v] = max(cond[l][u < v],r);
    }
    auto mod = [&](ll &x,ll y) -> void{
//        cout<<x<<' '<<y<<'\n';
        x += y;
        if (x >= MOD)x -= MOD;
        if (x < 0)x += MOD;
    };
    auto mod2 = [&](ll x,ll y) -> ll{
        mod(x,y);
        return x;
    };

    auto add = [&](ll x,ll y,ll id,ll z){
        s[x][y].push(MP(id,z));
        mod(sum[x][y],z);
    };
    auto del = [&](ll x,ll y){
        mod(sum[x][y],-s[x][y].top().se);
        s[x][y].pop();
    };
    for (ll i = 0;i < base;i ++){
        add(i,0,n,1);
    }
//    for (ll j = 0;j < base;j ++){
//            cout<<"CHAR "<<char('a'+ j)<<' ';
//            for (ll k = 0;k < 2;k ++){
//                cout<<sum[j][k]<<' ';
//            }
//            cout<<'\n';
//        }
    for (ll i = n - 1;i >= 1;i --){
        for (ll j = 0;j < base;j ++)sus[j] = mod2(sum[j][0],sum[j][1]);
        for (ll j = base - 1; j >= 0;j --){
            if (j + 1 < base)pre_sum[j][0] = mod2(sus[j+1],pre_sum[j+1][0]);
            else pre_sum[j][0] = 0;
        }
        for (ll j = 0;j < base;j ++){
            if (j)pre_sum[j][1] = mod2(sus[j-1],pre_sum[j-1][1]);
            else pre_sum[j][1] = 0;
//            cout<<j<<' '<<pre_sum[j][1]<<' '<<sus[j-1]<<' '<<pre_sum[j-1][1]<<'\n';
        }
        for (ll j = 0;j < base;j ++){
            for (ll k = 0;k < 2;k ++){
                while (sz(s[j][k]) && s[j][k].top().fi < cond[i][!k])del(j,k);
            }
        }

        for (ll j = 0;j < base;j ++){
            for (ll k = 0;k < 2;k ++){
                if (cond[i][!k] == 0)add(j,k,i,pre_sum[j][k]);
            }
        }
//    for (ll j = 0;j < base;j ++){
//            cout<<"CHAR "<<char('a'+j)<<' ';
//            for (ll k = 0;k < 2;k ++){
//                cout<<sum[j][k]<<' ';
//            }
//            cout<<'\n';
//        }
//    cout<<'\n';

    }
    ll ans = 0;
    for (ll j = 0;j < base;j ++){
            for (ll k = 0;k < 2;k ++){
                mod(ans,sum[j][k]);
            }
        }
    cout<<ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 508 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 508 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 481 ms 8300 KB Output is correct
6 Correct 471 ms 14756 KB Output is correct
7 Correct 462 ms 14952 KB Output is correct
8 Correct 465 ms 14936 KB Output is correct
9 Correct 479 ms 14824 KB Output is correct
10 Correct 20 ms 1020 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 415 ms 16120 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 508 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 20 ms 856 KB Output is correct
27 Correct 24 ms 9480 KB Output is correct
28 Correct 22 ms 9552 KB Output is correct
29 Correct 18 ms 1928 KB Output is correct
30 Correct 19 ms 1884 KB Output is correct
31 Correct 68 ms 6992 KB Output is correct
32 Correct 19 ms 1036 KB Output is correct
33 Correct 19 ms 1028 KB Output is correct
34 Correct 18 ms 1180 KB Output is correct
35 Correct 67 ms 5972 KB Output is correct
36 Correct 26 ms 16976 KB Output is correct
37 Correct 20 ms 1112 KB Output is correct
38 Correct 19 ms 860 KB Output is correct
39 Correct 21 ms 1364 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 508 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 481 ms 8300 KB Output is correct
31 Correct 471 ms 14756 KB Output is correct
32 Correct 462 ms 14952 KB Output is correct
33 Correct 465 ms 14936 KB Output is correct
34 Correct 479 ms 14824 KB Output is correct
35 Correct 20 ms 1020 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 415 ms 16120 KB Output is correct
39 Correct 20 ms 856 KB Output is correct
40 Correct 24 ms 9480 KB Output is correct
41 Correct 22 ms 9552 KB Output is correct
42 Correct 18 ms 1928 KB Output is correct
43 Correct 19 ms 1884 KB Output is correct
44 Correct 68 ms 6992 KB Output is correct
45 Correct 19 ms 1036 KB Output is correct
46 Correct 19 ms 1028 KB Output is correct
47 Correct 18 ms 1180 KB Output is correct
48 Correct 67 ms 5972 KB Output is correct
49 Correct 26 ms 16976 KB Output is correct
50 Correct 20 ms 1112 KB Output is correct
51 Correct 19 ms 860 KB Output is correct
52 Correct 21 ms 1364 KB Output is correct
53 Correct 509 ms 33108 KB Output is correct
54 Correct 619 ms 225140 KB Output is correct
55 Correct 485 ms 36448 KB Output is correct
56 Correct 441 ms 36456 KB Output is correct
57 Correct 460 ms 14932 KB Output is correct
58 Correct 480 ms 14936 KB Output is correct
59 Correct 452 ms 14936 KB Output is correct
60 Correct 460 ms 16232 KB Output is correct
61 Correct 787 ms 389860 KB Output is correct
62 Correct 503 ms 14568 KB Output is correct
63 Correct 469 ms 13268 KB Output is correct
64 Correct 523 ms 11608 KB Output is correct