oj.uz

Submission #567449

# Submission time Handle Problem Language Result Execution time Memory
567449 2022-05-23T13:28:29 Z zaneyu Misspelling (JOI22_misspelling) C++14
100 / 100
 1169 ms 108788 KB 
/*input
3 2
1 3
3 2
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int dp[maxn][26];
int r1[maxn],r2[maxn];
int tot[26];
int main(){
    int n,m;
    cin>>n>>m;
    REP1(i,n) r1[i]=r2[i]=i;
    REP(i,m){
        int a,b;
        cin>>a>>b;
        if(a<b){
            MXTO(r1[a],b);
        }
        else{
            MXTO(r2[b],a);
        }
    }
    set<int> up,down;
    REP1(i,n+1) up.insert(i),down.insert(i);
    REP(i,26) tot[i]=1;
    for(int i=n;i>=1;i--){
        while((*up.lower_bound(i+1))<=r1[i]){
            int tmp=(*up.lower_bound(i+1));
            up.erase(tmp);
            int pf=0;
            REP(j,26){
                tot[j]=(tot[j]-pf+MOD)%MOD;
                pf=(pf+dp[tmp][j])%MOD;
            }
        }
        while((*down.lower_bound(i+1))<=r2[i]){
            int tmp=(*down.lower_bound(i+1));
            down.erase(tmp);
            int pf=0;
            for(int j=25;j>=0;j--){
                tot[j]=(tot[j]-pf+MOD)%MOD;
                pf=(pf+dp[tmp][j])%MOD;
            }
        }
        REP(j,26) dp[i][j]=tot[j];
        int pf=0;
        REP(j,26) pf=(pf+dp[i][j])%MOD;
        REP(j,26) tot[j]=((tot[j]+pf)%MOD-dp[i][j]+MOD)%MOD;
    }
    int ans=0;
    REP(i,26) ans+=dp[1][i],ans%=MOD;
    cout<<ans<<'\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1121 ms 104304 KB Output is correct
6 Correct 1050 ms 108596 KB Output is correct
7 Correct 1075 ms 108464 KB Output is correct
8 Correct 1098 ms 108620 KB Output is correct
9 Correct 1096 ms 108536 KB Output is correct
10 Correct 35 ms 4556 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1113 ms 108592 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 34 ms 4556 KB Output is correct
27 Correct 25 ms 4412 KB Output is correct
28 Correct 26 ms 4392 KB Output is correct
29 Correct 33 ms 4484 KB Output is correct
30 Correct 34 ms 4556 KB Output is correct
31 Correct 273 ms 5832 KB Output is correct
32 Correct 44 ms 4552 KB Output is correct
33 Correct 37 ms 4524 KB Output is correct
34 Correct 33 ms 4512 KB Output is correct
35 Correct 273 ms 5900 KB Output is correct
36 Correct 16 ms 4380 KB Output is correct
37 Correct 32 ms 4436 KB Output is correct
38 Correct 31 ms 4396 KB Output is correct
39 Correct 27 ms 4308 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1121 ms 104304 KB Output is correct
31 Correct 1050 ms 108596 KB Output is correct
32 Correct 1075 ms 108464 KB Output is correct
33 Correct 1098 ms 108620 KB Output is correct
34 Correct 1096 ms 108536 KB Output is correct
35 Correct 35 ms 4556 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1113 ms 108592 KB Output is correct
39 Correct 34 ms 4556 KB Output is correct
40 Correct 25 ms 4412 KB Output is correct
41 Correct 26 ms 4392 KB Output is correct
42 Correct 33 ms 4484 KB Output is correct
43 Correct 34 ms 4556 KB Output is correct
44 Correct 273 ms 5832 KB Output is correct
45 Correct 44 ms 4552 KB Output is correct
46 Correct 37 ms 4524 KB Output is correct
47 Correct 33 ms 4512 KB Output is correct
48 Correct 273 ms 5900 KB Output is correct
49 Correct 16 ms 4380 KB Output is correct
50 Correct 32 ms 4436 KB Output is correct
51 Correct 31 ms 4396 KB Output is correct
52 Correct 27 ms 4308 KB Output is correct
53 Correct 964 ms 105256 KB Output is correct
54 Correct 799 ms 105292 KB Output is correct
55 Correct 1103 ms 108788 KB Output is correct
56 Correct 1169 ms 108768 KB Output is correct
57 Correct 1145 ms 108568 KB Output is correct
58 Correct 1154 ms 108632 KB Output is correct
59 Correct 1105 ms 108500 KB Output is correct
60 Correct 1085 ms 108616 KB Output is correct
61 Correct 562 ms 102068 KB Output is correct
62 Correct 1079 ms 107096 KB Output is correct
63 Correct 963 ms 105412 KB Output is correct
64 Correct 888 ms 103708 KB Output is correct