oj.uz

답안 #430438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430438 2021-06-16T13:47:42 Z 2fat2code Crossing (JOI21_crossing) C++17
26 / 100
 6635 ms 17500 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define fr first
#define sc second
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)

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

const int nmax = 200005;
const int mod = 998244353;
const int p = 37;

int n, q, pw[nmax], tree[4*nmax], lazy[4*nmax], sump[nmax];
string Sa, Sb, Sc, T0;

map<int,int>mp;

int generatehash(string aux){
    int hsh = 0;
    for(int i=0;i<(int)aux.size();i++){
        hsh = (hsh + pw[i] * (aux[i] - '0') % mod) % mod;
    }
    return hsh;
}

vector<pair<string, int>>vecc;

void calc(){
    for(auto it : vecc){
        mp[it.sc] = 1;
    }
    for(int i=0;i<(int)vecc.size();i++){
        for(int j=0;j<i;j++){
            string aux;
            for(int t=0;t<n;t++){
                if(vecc[i].fr[t] == vecc[j].fr[t]){
                    aux += vecc[i].fr[t];
                }
                else if(vecc[i].fr[t] != '1' && vecc[j].fr[t] != '1'){
                    aux += '1';
                }
                else if(vecc[i].fr[t] != '0' && vecc[j].fr[t] != '0'){
                    aux += '0';
                }
                else{
                    aux += '2';
                }
            }
            int curr = generatehash(aux);
            if(mp.count(curr) == 0){
                mp[curr] = 1;
                vecc.push_back({aux, curr});
            }
        }
    }
}

void build(int l, int r, int nod){
    if(l == r){
        tree[nod] = (T0[l - 1] - '0');
    }
    else{
        int mid = l + (r - l) / 2;
        build(l, mid, 2*nod);
        build(mid+1, r, 2*nod+1);
        tree[nod] = (tree[2*nod] + pw[(mid - l + 1)] * tree[2*nod + 1] % mod) % mod;
    }
}

void push(int l, int r, int nod){
    if(lazy[nod] >= 1){
        tree[nod] = (lazy[nod] - 1LL) * sump[r - l];
        if(l != r){
            lazy[2*nod] = lazy[nod];
            lazy[2*nod+1] = lazy[nod];
        }
        lazy[nod] = 0;
    }
}

void update(int l, int r, int le, int ri, int val, int nod){
    push(l, r, nod);
    if(l > ri || r < le){
        return;
    }
    else if(l >= le && r <= ri){
        lazy[nod] = val;
        push(l, r, nod);
    }
    else{
        int mid = l + (r - l) / 2;
        update(l, mid, le, ri, val, 2*nod);
        update(mid + 1, r, le, ri, val, 2*nod + 1);
        tree[nod] = (tree[2*nod] + pw[(mid - l + 1)] * tree[2*nod + 1] % mod) % mod;
    }
}

bool check(){
    push(1, n, 1);
    for(auto it : vecc){
        if(it.sc == tree[1]){
            return true;
        }
    }
    return false;
}


int32_t main(){
    //ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
  //  freopen("input.in", "r", stdin);
    pw[0] = 1;
    sump[0] = 1;
    for(int i=1;i<nmax;i++){
        pw[i] = pw[i-1] * p % mod;
        sump[i] = (sump[i-1] + pw[i]) % mod;
    }
    cin >> n >> Sa >> Sb >> Sc >> q >> T0;
    for(auto &it : Sa){
        if(it == 'J') it = '0';
        else if(it == 'O') it = '1';
        else it = '2';
    }
    for(auto &it : Sb){
        if(it == 'J') it = '0';
        else if(it == 'O') it = '1';
        else it = '2';
    }
    for(auto &it : Sc){
        if(it == 'J') it = '0';
        else if(it == 'O') it = '1';
        else it = '2';
    }
    for(auto &it : T0){
        if(it == 'J') it = '0';
        else if(it == 'O') it = '1';
        else it = '2';
    }
    vecc.push_back({Sa, generatehash(Sa)});
    vecc.push_back({Sb, generatehash(Sb)});
    vecc.push_back({Sc, generatehash(Sc)});
    calc();
    build(1, n, 1);
    cout << (check() == true ? "Yes" : "No") << '\n';
    for(int i=1;i<=q;i++){
        int l, r;
        char c;
        cin >> l >> r >> c;
        int val;
        if(c == 'J') val = 1;
        else if(c == 'O') val = 2;
        else val = 3;
        update(1, n, l, r, val, 1);
        cout << (check() == true ? "Yes" : "No") << '\n';
    }
}

// 1. Solve the problem
// 2. ???
// 3. Profit

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 463 ms 5220 KB Output is correct
2 Correct 494 ms 5416 KB Output is correct
3 Correct 497 ms 5396 KB Output is correct
4 Correct 480 ms 5440 KB Output is correct
5 Correct 467 ms 5244 KB Output is correct
6 Correct 487 ms 5540 KB Output is correct
7 Correct 497 ms 5444 KB Output is correct
8 Correct 499 ms 5220 KB Output is correct
9 Correct 497 ms 5452 KB Output is correct
10 Correct 509 ms 5320 KB Output is correct
11 Correct 490 ms 5204 KB Output is correct
12 Correct 495 ms 5240 KB Output is correct
13 Correct 522 ms 5408 KB Output is correct
14 Correct 493 ms 5436 KB Output is correct
15 Correct 561 ms 5472 KB Output is correct
16 Correct 501 ms 5648 KB Output is correct
17 Correct 507 ms 5440 KB Output is correct
18 Correct 490 ms 5604 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 463 ms 5220 KB Output is correct
2 Correct 494 ms 5416 KB Output is correct
3 Correct 497 ms 5396 KB Output is correct
4 Correct 480 ms 5440 KB Output is correct
5 Correct 467 ms 5244 KB Output is correct
6 Correct 487 ms 5540 KB Output is correct
7 Correct 497 ms 5444 KB Output is correct
8 Correct 499 ms 5220 KB Output is correct
9 Correct 497 ms 5452 KB Output is correct
10 Correct 509 ms 5320 KB Output is correct
11 Correct 490 ms 5204 KB Output is correct
12 Correct 495 ms 5240 KB Output is correct
13 Correct 522 ms 5408 KB Output is correct
14 Correct 493 ms 5436 KB Output is correct
15 Correct 561 ms 5472 KB Output is correct
16 Correct 501 ms 5648 KB Output is correct
17 Correct 507 ms 5440 KB Output is correct
18 Correct 490 ms 5604 KB Output is correct
19 Correct 6400 ms 17416 KB Output is correct
20 Correct 6612 ms 14124 KB Output is correct
21 Correct 5875 ms 17044 KB Output is correct
22 Correct 5349 ms 16588 KB Output is correct
23 Correct 907 ms 6792 KB Output is correct
24 Correct 927 ms 6904 KB Output is correct
25 Correct 6425 ms 17328 KB Output is correct
26 Correct 6626 ms 17096 KB Output is correct
27 Correct 6511 ms 16860 KB Output is correct
28 Correct 6630 ms 17316 KB Output is correct
29 Correct 6351 ms 16668 KB Output is correct
30 Correct 940 ms 6832 KB Output is correct
31 Correct 6527 ms 17500 KB Output is correct
32 Correct 6206 ms 17076 KB Output is correct
33 Correct 948 ms 6992 KB Output is correct
34 Correct 6635 ms 17360 KB Output is correct
35 Correct 4480 ms 16388 KB Output is correct
36 Correct 937 ms 6732 KB Output is correct
37 Correct 890 ms 6836 KB Output is correct
38 Incorrect 6274 ms 14064 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 463 ms 5220 KB Output is correct
2 Correct 494 ms 5416 KB Output is correct
3 Correct 497 ms 5396 KB Output is correct
4 Correct 480 ms 5440 KB Output is correct
5 Correct 467 ms 5244 KB Output is correct
6 Correct 487 ms 5540 KB Output is correct
7 Correct 497 ms 5444 KB Output is correct
8 Correct 499 ms 5220 KB Output is correct
9 Correct 497 ms 5452 KB Output is correct
10 Correct 509 ms 5320 KB Output is correct
11 Correct 490 ms 5204 KB Output is correct
12 Correct 495 ms 5240 KB Output is correct
13 Correct 522 ms 5408 KB Output is correct
14 Correct 493 ms 5436 KB Output is correct
15 Correct 561 ms 5472 KB Output is correct
16 Correct 501 ms 5648 KB Output is correct
17 Correct 507 ms 5440 KB Output is correct
18 Correct 490 ms 5604 KB Output is correct
19 Correct 551 ms 5476 KB Output is correct
20 Correct 563 ms 5316 KB Output is correct
21 Correct 519 ms 5348 KB Output is correct
22 Correct 488 ms 4932 KB Output is correct
23 Correct 548 ms 5464 KB Output is correct
24 Correct 512 ms 5364 KB Output is correct
25 Correct 495 ms 5416 KB Output is correct
26 Correct 540 ms 5260 KB Output is correct
27 Correct 491 ms 5444 KB Output is correct
28 Correct 449 ms 5188 KB Output is correct
29 Correct 503 ms 5356 KB Output is correct
30 Correct 493 ms 5316 KB Output is correct
31 Correct 571 ms 5232 KB Output is correct
32 Correct 550 ms 5248 KB Output is correct
33 Correct 647 ms 5296 KB Output is correct
34 Correct 506 ms 5096 KB Output is correct
35 Correct 617 ms 4576 KB Output is correct
36 Correct 535 ms 4840 KB Output is correct
37 Correct 547 ms 5248 KB Output is correct
38 Correct 592 ms 5364 KB Output is correct
39 Correct 557 ms 5416 KB Output is correct
40 Correct 528 ms 5444 KB Output is correct
41 Correct 567 ms 5504 KB Output is correct
42 Correct 541 ms 5604 KB Output is correct
43 Correct 569 ms 5308 KB Output is correct
44 Correct 547 ms 5304 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 463 ms 5220 KB Output is correct
2 Correct 494 ms 5416 KB Output is correct
3 Correct 497 ms 5396 KB Output is correct
4 Correct 480 ms 5440 KB Output is correct
5 Correct 467 ms 5244 KB Output is correct
6 Correct 487 ms 5540 KB Output is correct
7 Correct 497 ms 5444 KB Output is correct
8 Correct 499 ms 5220 KB Output is correct
9 Correct 497 ms 5452 KB Output is correct
10 Correct 509 ms 5320 KB Output is correct
11 Correct 490 ms 5204 KB Output is correct
12 Correct 495 ms 5240 KB Output is correct
13 Correct 522 ms 5408 KB Output is correct
14 Correct 493 ms 5436 KB Output is correct
15 Correct 561 ms 5472 KB Output is correct
16 Correct 501 ms 5648 KB Output is correct
17 Correct 507 ms 5440 KB Output is correct
18 Correct 490 ms 5604 KB Output is correct
19 Correct 6400 ms 17416 KB Output is correct
20 Correct 6612 ms 14124 KB Output is correct
21 Correct 5875 ms 17044 KB Output is correct
22 Correct 5349 ms 16588 KB Output is correct
23 Correct 907 ms 6792 KB Output is correct
24 Correct 927 ms 6904 KB Output is correct
25 Correct 6425 ms 17328 KB Output is correct
26 Correct 6626 ms 17096 KB Output is correct
27 Correct 6511 ms 16860 KB Output is correct
28 Correct 6630 ms 17316 KB Output is correct
29 Correct 6351 ms 16668 KB Output is correct
30 Correct 940 ms 6832 KB Output is correct
31 Correct 6527 ms 17500 KB Output is correct
32 Correct 6206 ms 17076 KB Output is correct
33 Correct 948 ms 6992 KB Output is correct
34 Correct 6635 ms 17360 KB Output is correct
35 Correct 4480 ms 16388 KB Output is correct
36 Correct 937 ms 6732 KB Output is correct
37 Correct 890 ms 6836 KB Output is correct
38 Incorrect 6274 ms 14064 KB Output isn't correct
39 Halted 0 ms 0 KB -