oj.uz

Submission #864492

# Submission time Handle Problem Language Result Execution time Memory
864492 2023-10-23T04:45:04 Z AgentPengin Lucky Numbers (RMI19_lucky) C++14
28 / 100
 200 ms 3760 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define read() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define day() time_t now = time(0);char* x = ctime(&now);cerr<<"Right Now Is : "<<x<<"\n"
 
#define ii pair<int,int>
#define X first
#define Y second 
 
const long long MAX = (int)2e5 + 5;
const long long INF = (int)1e9;
const long long MOD = (int)1e9 + 7;
 
int n,q;
int a[MAX];
int visited[MAX][2][2];
int dp[MAX][2][2];
int times = 0;
 
int f(int id,int l,int r,bool last,bool lower){
	if(id + l > r)return 1;
	if(visited[id][last][lower] == times)return dp[id][last][lower];
	visited[id][last][lower] = times;
	int &res = dp[id][last][lower] = 0;
	
	for(int digit = 0;digit < 10;digit++){
		if(!lower && digit > a[id + l])continue;
		if(last && digit == 3)continue;
		res = (res + f(id + 1,l,r,digit == 1,lower || digit < a[id + l])) % MOD;
	}
	return res;
}
signed main(){
	
	read();
	
	cin >> n >> q;
	
	for(int i = 1;i <= n;i++){
		char x;
		cin >> x;
		a[i] = x - '0';
	}	
	times++;
	cout << f(0,1,n,0,0) << '\n';
	for(int i = 1,c,u,v;i <= q;i++){
		cin >> c >> u >> v;
		if(c == 1){
			times++;
			cout << f(0,u,v,0,0) << '\n';
		}else{
			a[u] = v;
		}
	}
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 3760 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 3760 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Execution timed out 1083 ms 3760 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Execution timed out 1083 ms 3760 KB Time limit exceeded
8 Halted 0 ms 0 KB -