Submission #258555

#	Time	Username	Problem	Language	Result	Execution time	Memory
258555		errorgorn	Lucky Numbers (RMI19_lucky)	C++14	100 / 100	41 ms	8320 KiB

lucky

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

ll MAX(ll a){return a;}
ll MIN(ll a){return a;}
template<typename... Args>
ll MAX(ll a,Args... args){return max(a,MAX(args...));}
template<typename... Args>
ll MIN(ll a,Args... args){return min(a,MIN(args...));}

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const int MOD=1000000007;

int n,q;
int arr[100005];

int memo[100005][2];

int dp(int i,int flag){ //prev is 1, flag=1, else flag=0
	if (i==0) return 1;
	if (memo[i][flag]!=-1) return memo[i][flag];
	
	int ans=0;
	rep(x,0,10){
		if (flag && x==3) continue;
		ans=(ans+dp(i-1,x==1))%MOD;
	}
	
	return memo[i][flag]=ans;
}

int get(int l,int r){
	int len=r-l;
	int ans=0;
	
	int flag=0;
	rep(x,l,r+1){
		rep(y,0,arr[x]){
			if (flag && y==3) continue;
			ans=(ans+dp(len,y==1))%MOD;
		}
		
		if (arr[x]==1) flag=1;
		else if (flag && arr[x]==3) return ans;
		else flag=0;
		len--;
	}
	
	return (ans+1)%MOD;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	memset(memo,-1,sizeof(memo));
	
	cin>>n>>q;
	
	string s;
	cin>>s;
	rep(x,0,n) arr[x]=s[x]-'0';
	
	cout<<get(0,n-1)<<endl;
	
	int a,b;
	while (q--){
		cin>>a;
		
		if (a==2){
			cin>>a>>b;
			arr[a-1]=b;
		}
		else{
			cin>>a>>b;
			cout<<get(a-1,b-1)<<endl;
		}
	}
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 9 / 9
• Subtask 4: 27 / 27
• Subtask 5: 9 / 9
• Subtask 6: 27 / 27