oj.uz

답안 #272084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
272084 2020-08-18T08:47:28 Z theStaticMind Lucky Numbers (RMI19_lucky) C++14
100 / 100
 15 ms 4608 KB 
#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

int dp[2][100005][2];
vector<int> arr(100005);

int calculate(int l, int r){
	int ret = 1;
	bool one = false;
	for(int i = l; i <= r; i++){
		if(arr[i] == 1){
			ret += (dp[0][r - i][0] + dp[0][r - i][1]);
		}
		else if(arr[i]){
			ret += dp[1][r - i][0] + dp[1][r - i][1];
			ret += (dp[0][r - i][0] + dp[0][r - i][1]) * max(0ll, arr[i] - 1 - (one && arr[i] > 3 ? 1 : 0));

		}

		ret %= modulo;
		
		if(arr[i] == 1) one = true;
		else if(one && arr[i] == 3){
			ret = (ret - 1 + modulo) % modulo;
			break;
		}
		else one = false;
	}

	return ret;
}

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	dp[0][0][0] = 1;

	for(int i = 1; i <= 100000; i++){
		dp[0][i][0] = (dp[0][i - 1][0] * 9 + dp[0][i - 1][1] * 8) % modulo;
		dp[0][i][1] = (dp[0][i - 1][0] + dp[0][i - 1][1]) % modulo;
	}

	dp[1][0][1] = 1;

	for(int i = 1; i <= 100000; i++){
		dp[1][i][0] = (dp[1][i - 1][0] * 9 + dp[1][i - 1][1] * 8) % modulo;
		dp[1][i][1] = (dp[1][i - 1][0] + dp[1][i - 1][1]) % modulo;
	}

	int n, q;
	cin >> n >> q;

	string s;
	cin >> s;
	for(int i = 0; i < n; i++){
		arr[i + 1] = s[i] - '0';
	}

	cout << calculate(1, n) << "\n";

	while(q--){
		int t, x, y;
		cin >> t >> x >> y;
		if(t == 1){
			cout << calculate(x, y) << "\n";
		}
		else{
			arr[x] = y;
		}
	}
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 4 ms 4224 KB Output is correct
3 Correct 4 ms 4224 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 4 ms 4224 KB Output is correct
3 Correct 4 ms 4224 KB Output is correct
4 Correct 4 ms 4224 KB Output is correct
5 Correct 5 ms 4224 KB Output is correct
6 Correct 4 ms 4224 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 4352 KB Output is correct
2 Correct 13 ms 4352 KB Output is correct

Subtask #4
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 4352 KB Output is correct
2 Correct 13 ms 4352 KB Output is correct
3 Correct 15 ms 4608 KB Output is correct
4 Correct 14 ms 4480 KB Output is correct
5 Correct 15 ms 4584 KB Output is correct
6 Correct 14 ms 4608 KB Output is correct
7 Correct 15 ms 4608 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 4 ms 4224 KB Output is correct
3 Correct 4 ms 4224 KB Output is correct
4 Correct 4 ms 4224 KB Output is correct
5 Correct 5 ms 4224 KB Output is correct
6 Correct 4 ms 4224 KB Output is correct
7 Correct 11 ms 4352 KB Output is correct
8 Correct 13 ms 4352 KB Output is correct
9 Correct 8 ms 4352 KB Output is correct
10 Correct 11 ms 4372 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 4 ms 4224 KB Output is correct
3 Correct 4 ms 4224 KB Output is correct
4 Correct 4 ms 4224 KB Output is correct
5 Correct 5 ms 4224 KB Output is correct
6 Correct 4 ms 4224 KB Output is correct
7 Correct 11 ms 4352 KB Output is correct
8 Correct 13 ms 4352 KB Output is correct
9 Correct 15 ms 4608 KB Output is correct
10 Correct 14 ms 4480 KB Output is correct
11 Correct 15 ms 4584 KB Output is correct
12 Correct 14 ms 4608 KB Output is correct
13 Correct 15 ms 4608 KB Output is correct
14 Correct 8 ms 4352 KB Output is correct
15 Correct 11 ms 4372 KB Output is correct
16 Correct 11 ms 4480 KB Output is correct
17 Correct 10 ms 4608 KB Output is correct
18 Correct 10 ms 4480 KB Output is correct
19 Correct 10 ms 4480 KB Output is correct
20 Correct 11 ms 4480 KB Output is correct