oj.uz

Submission #636887

# Submission time Handle Problem Language Result Execution time Memory
636887 2022-08-30T11:30:56 Z ogibogi2004 Lucky Numbers (RMI19_lucky) C++14
46 / 100
 200 ms 1744 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const ll MAXN=1e5+6;
ll dp[MAXN];
int n,q;
ll a[MAXN];
ll solve(int l,int r)
{
    ll ans=0;
    for(int i=l;i<=r;i++)
    {
        if(i>l+1&&a[i-2]==1&&a[i-1]==3)break;
        ans+=a[i]*dp[r-i];
        if(a[i]>1&&i<r)ans-=dp[r-i-1];
        if(i!=l&&a[i-1]==1&&a[i]>3)ans-=dp[r-i];
        while(ans<0)ans+=mod;
        ans%=mod;
        //cout<<i<<" "<<a[i]<<" "<<ans<<endl;
    }
    bool flag=1;
    for(int i=l;i+1<=r;i++)
    {
        if(a[i]==1&&a[i+1]==3)flag=0;
    }
    if(flag)ans++;
    ans%=mod;
    return ans;
}
void precompute()
{
    dp[0]=1;
    dp[1]=10;
    for(int i=2;i<MAXN;i++)
    {
        dp[i]=dp[i-1]*10ll-dp[i-2];
        dp[i]+=mod;
        dp[i]%=mod;
    }
}
int main()
{
    ios_base::sync_with_stdio();
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>q;
    precompute();
    for(int i=1;i<=n;i++)
    {
        char c;
        cin>>c;
        a[i]=c-'0';
    }
    cout<<solve(1,n)<<endl;
    for(int i=0;i<q;i++)
    {
        int t,x,y;
        cin>>t>>x>>y;
        if(t==1)cout<<solve(x,y)<<endl;
        else a[x]=y;
    }
return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 1108 KB Output is correct
2 Correct 109 ms 1344 KB Output is correct

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 1108 KB Output is correct
2 Correct 109 ms 1344 KB Output is correct
3 Execution timed out 411 ms 1744 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 67 ms 1108 KB Output is correct
8 Correct 109 ms 1344 KB Output is correct
9 Correct 42 ms 1180 KB Output is correct
10 Correct 52 ms 1184 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 67 ms 1108 KB Output is correct
8 Correct 109 ms 1344 KB Output is correct
9 Execution timed out 411 ms 1744 KB Time limit exceeded
10 Halted 0 ms 0 KB -