oj.uz

답안 #865737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
865737 2023-10-24T15:00:05 Z Cookie Lucky Numbers (RMI19_lucky) C++14
100 / 100
 42 ms 25696 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("nondec.in");
ofstream fout("nondec.out");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
using u128 = __uint128_t;
const int x[4] = {1, -1, 0, 0};
const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 7;
const ll mxn = 1e5 + 5, mxq = 2e5 + 5, sq = 500, mxv = 1e7 + 5;
const ll inf = 1e9;
const ld prec = 1e-5;
//const int base= (1 << 18);
struct Node{
    ll sm[2][2] = {}, eq[2][2] = {}, bg[2][2] = {};
    // [one][three] one at end,  three at beginning
    void init(int x){
        sm[0][0] = x - (x > 1) - (x > 3);
        sm[0][1] = x > 3;
        sm[1][0] = x > 1;
        eq[0][0] = (x != 1) && (x != 3);
        eq[0][1] = (x == 3); 
        eq[1][0] = (x == 1);
        bg[0][0] = 9 - x - (x < 3) - (x < 1);
        bg[0][1] = x < 3;
        bg[1][0] = x < 1;
    }
};
Node st[4 * mxn + 1];
char c[mxn + 1];
void add(ll &a, ll b){
    a += b;
    if(a >= mod)a %= mod;
}
Node comb(Node a, Node b){
    Node res; 
    forr(i, 0, 2){
        forr(j, 0, 2){
            forr(k, 0, 2){
                forr(l, 0, 2){
                    if(i == 1 && l == 1)continue;
                    add(res.sm[k][j], a.sm[i][j] * (b.sm[k][l] + b.eq[k][l] + b.bg[k][l]));
                    add(res.sm[k][j], a.eq[i][j] * b.sm[k][l]);
                    add(res.eq[k][j], a.eq[i][j] * b.eq[k][l]);
                    add(res.bg[k][j], a.bg[i][j] * (b.sm[k][l] + b.eq[k][l] + b.bg[k][l]));
                    add(res.bg[k][j], a.eq[i][j] * b.bg[k][l]);
                }
            }
        }
    }
    return(res);
}
int n, q;
void build(int nd, int l, int r){
    if(l == r){
        st[nd].init(c[l] - '0');
        return;
    }
    int mid = (l + r) >> 1;
    build(nd << 1, l, mid); build(nd << 1 | 1, mid + 1, r);
    st[nd] = comb(st[nd << 1], st[nd << 1 | 1]);
}
void upd(int nd, int l, int r, int id, int x){
    if(l == r){
        st[nd].init(x);
        return;
    }
    int mid = (l + r) >> 1;
    if(id <= mid)upd(nd << 1, l, mid, id, x); 
    else upd(nd << 1 | 1, mid + 1, r, id, x);
    st[nd] = comb(st[nd << 1], st[nd << 1 | 1]);
}
Node get(int nd, int l, int r, int ql, int qr){
    
    if(ql <= l && qr >= r)return(st[nd]);
    int mid = (l + r) >> 1;
    if(qr <= mid)return(get(nd << 1, l, mid, ql, qr));
    else if(ql > mid)return(get(nd << 1 | 1, mid + 1, r, ql, qr));
    return(comb(get(nd << 1, l, mid, ql, qr), get(nd << 1 | 1, mid + 1, r, ql, qr)));
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
        cin >> c[i];
    }
    build(1, 1, n);
    ll ans = 0;
    forr(i, 0, 2){
        forr(j, 0, 2){
            add(ans, st[1].sm[i][j]);
            add(ans, st[1].eq[i][j]);
            
        }
    }
    Node curr = get(1, 1, n, 1, 2);
   
    cout << ans << "\n";
    while(q--){
        int idq; cin >> idq;
        if(idq == 2){
            int id, x; cin >> id >> x;
            upd(1, 1, n, id, x);
        }else{
            int l, r; cin >> l >> r;
            
            Node res = get(1, 1, n, l, r);
            
            ans = 0;
            forr(i, 0, 2){
                forr(j, 0, 2){
                    
                    add(ans, res.sm[i][j]);
                    add(ans, res.eq[i][j]);
                }
                
            }
            cout << ans << "\n";
            
        }
    }
    return(0);
}

Compilation message

lucky.cpp: In function 'int main()':
lucky.cpp:109:10: warning: variable 'curr' set but not used [-Wunused-but-set-variable]
  109 |     Node curr = get(1, 1, n, 1, 2);
      |          ^~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 2752 KB Output is correct
2 Correct 22 ms 4868 KB Output is correct

Subtask #4
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 2752 KB Output is correct
2 Correct 22 ms 4868 KB Output is correct
3 Correct 36 ms 25432 KB Output is correct
4 Correct 27 ms 25448 KB Output is correct
5 Correct 28 ms 25500 KB Output is correct
6 Correct 31 ms 25432 KB Output is correct
7 Correct 36 ms 25580 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 15 ms 2752 KB Output is correct
8 Correct 22 ms 4868 KB Output is correct
9 Correct 13 ms 2732 KB Output is correct
10 Correct 16 ms 4700 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 15 ms 2752 KB Output is correct
8 Correct 22 ms 4868 KB Output is correct
9 Correct 36 ms 25432 KB Output is correct
10 Correct 27 ms 25448 KB Output is correct
11 Correct 28 ms 25500 KB Output is correct
12 Correct 31 ms 25432 KB Output is correct
13 Correct 36 ms 25580 KB Output is correct
14 Correct 13 ms 2732 KB Output is correct
15 Correct 16 ms 4700 KB Output is correct
16 Correct 37 ms 25436 KB Output is correct
17 Correct 25 ms 25432 KB Output is correct
18 Correct 42 ms 25436 KB Output is correct
19 Correct 32 ms 25436 KB Output is correct
20 Correct 32 ms 25696 KB Output is correct