oj.uz

답안 #853715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853715 2023-09-25T05:54:36 Z divad Lucky Numbers (RMI19_lucky) C++14
14 / 100
 200 ms 1628 KB 
#include <bits/stdc++.h>
#define EQ 0
#define LE 1
using namespace std;
const int NMAX = 1e4+2;
const int SIGMA = 10;
int n,q,t,l,r,pos,val,dp[2][SIGMA][NMAX];
string s;

int countWays(string str){
    memset(dp, 0, sizeof(dp));
    dp[EQ][0][0] = 1;
    for(int i = 1; i < str.size(); i++){
        for(auto state : {EQ, LE}){
            if(state == EQ){
                for(int dig = 0; dig <= 9; dig++){
                    if(dig < str[i]-'0'){
                        /// LE
                        for(int lst = 0; lst <= 9; lst++){
                            if(lst == 1 && dig == 3){
                                continue;
                            }
                            dp[LE][dig][i] += dp[EQ][lst][i-1];
                        }
                    }else if(dig == str[i]-'0'){
                        /// EQ
                        for(int lst = 0; lst <= 9; lst++){
                            if(lst == 1 && dig == 3){
                                continue;
                            }
                            dp[EQ][dig][i] += dp[EQ][lst][i-1];
                        }
                    }
                }
            }else{
                for(int dig = 0; dig <= 9; dig++){
                    for(int lst = 0; lst <= 9; lst++){
                        if(lst == 1 && dig == 3){
                            continue;
                        }
                        dp[LE][dig][i] += dp[LE][lst][i-1];
                    }
                }
            }
        }
    }
    int ans = 0;
    for(int i = 0; i <= 9; i++){
        ans += dp[LE][i][str.size()-1] + dp[EQ][i][str.size()-1];
    }
    return ans;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> q;
    cin >> s;
    s = "$"+s;
    cout << countWays(s) << "\n";
    while(q--){
        cin >> t;
        if(t == 1){
            cin >> l >> r;
            int len = r-l+1;
            string str = s.substr(l, len);
            cout << countWays("$"+str) << "\n";
        }else{
            cin >> pos >> val;
            s[pos] = (val+'0');
        }
    }
    return 0;
}

Compilation message

lucky.cpp: In function 'int countWays(std::string)':
lucky.cpp:13:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i = 1; i < str.size(); i++){
      |                    ~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Incorrect 1 ms 1112 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1060 ms 1628 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1060 ms 1628 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Incorrect 1 ms 1112 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Incorrect 1 ms 1112 KB Output isn't correct
5 Halted 0 ms 0 KB -