oj.uz

답안 #620031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
620031 2022-08-02T19:19:44 Z APROHACK Crossing (JOI21_crossing) C++14
3 / 100
 297 ms 20756 KB 
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
string a, b, c, x;
ll n, q;
struct crossing
{
    int dd, ht, mid;
    char toProp;
    bool faltaprop;
    bool allJ, allO, allI, iscorrect;
    crossing *L, *R;
    crossing(){}
    crossing(int l, int r){
        dd = l, ht = r;
        mid = (dd+ht)/2;
        if(l!=r){
            L = new crossing(l, mid);
            R = new crossing(mid+1, r);
            allJ = L->allJ && R->allJ;
            allO = L->allO && R->allO;
            allI = L->allI && R->allI;
            iscorrect = L->iscorrect && R->iscorrect;
        }else{
            allJ = a[dd] == 'J';
            allO = a[dd] == 'O';
            allI = a[dd] == 'I';
            if(a[dd]==x[dd])iscorrect = true;
        }
    }
    void propagate(){
        if(!faltaprop)return;
        L->insert(dd, mid, toProp);
        R->insert(mid+1, ht, toProp);
        iscorrect = L->iscorrect && R->iscorrect;
        faltaprop=false;
    }
    void insert(int l, int r, char cual){
        if(dd == l && r==ht ){
            if(cual == 'J' && allJ)iscorrect = true;
            else if(cual == 'O'&&allO)iscorrect=true;
            else if(cual == 'I' && allI)iscorrect = true;
            else iscorrect=false;
            //no hace falta propagar lo que hay aca
            toProp = cual;
            faltaprop = true;
            return ;
        }
        propagate();
        if(r<=mid)L->insert(l, r, cual);
        else if(mid<l)R->insert(l, r, cual);
        else {
            L->insert(l, mid, cual);
            R->insert(mid+1, r, cual);
        }
        iscorrect = L->iscorrect && R->iscorrect;
    }
 
};
crossing *seg;
void input(){
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(false);
    cin>>n;
    cin>>a>>b>>c;
    cin>>q;
    cin>>x;
}
bool askforX(){
    seg = new crossing(0, n-1);
    return seg->iscorrect;
}
int main(){
    input();
    if(askforX())cout << "Yes\n";
    else cout << "No\n";
    ll l, r;
    char value;
    for(int i = 0 ; i < q ; i++){
        cin>>l>>r>>value;
        seg->insert(l-1, r-1, value);
        if(seg->iscorrect)cout<<"Yes\n";
        else cout << "No\n";
    }
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 1004 KB Output is correct
2 Correct 67 ms 1064 KB Output is correct
3 Correct 64 ms 1092 KB Output is correct
4 Correct 55 ms 1036 KB Output is correct
5 Correct 55 ms 1060 KB Output is correct
6 Correct 54 ms 984 KB Output is correct
7 Correct 56 ms 1028 KB Output is correct
8 Correct 60 ms 1200 KB Output is correct
9 Correct 58 ms 1120 KB Output is correct
10 Correct 56 ms 1116 KB Output is correct
11 Correct 58 ms 1084 KB Output is correct
12 Correct 62 ms 1200 KB Output is correct
13 Correct 58 ms 1040 KB Output is correct
14 Correct 56 ms 1068 KB Output is correct
15 Correct 58 ms 1100 KB Output is correct
16 Correct 59 ms 1256 KB Output is correct
17 Correct 73 ms 1140 KB Output is correct
18 Correct 59 ms 1044 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 1004 KB Output is correct
2 Correct 67 ms 1064 KB Output is correct
3 Correct 64 ms 1092 KB Output is correct
4 Correct 55 ms 1036 KB Output is correct
5 Correct 55 ms 1060 KB Output is correct
6 Correct 54 ms 984 KB Output is correct
7 Correct 56 ms 1028 KB Output is correct
8 Correct 60 ms 1200 KB Output is correct
9 Correct 58 ms 1120 KB Output is correct
10 Correct 56 ms 1116 KB Output is correct
11 Correct 58 ms 1084 KB Output is correct
12 Correct 62 ms 1200 KB Output is correct
13 Correct 58 ms 1040 KB Output is correct
14 Correct 56 ms 1068 KB Output is correct
15 Correct 58 ms 1100 KB Output is correct
16 Correct 59 ms 1256 KB Output is correct
17 Correct 73 ms 1140 KB Output is correct
18 Correct 59 ms 1044 KB Output is correct
19 Correct 297 ms 20728 KB Output is correct
20 Correct 202 ms 20664 KB Output is correct
21 Correct 163 ms 19672 KB Output is correct
22 Correct 194 ms 17756 KB Output is correct
23 Correct 87 ms 2140 KB Output is correct
24 Correct 88 ms 2152 KB Output is correct
25 Correct 177 ms 20720 KB Output is correct
26 Correct 198 ms 20716 KB Output is correct
27 Correct 225 ms 20648 KB Output is correct
28 Correct 225 ms 20720 KB Output is correct
29 Correct 185 ms 20132 KB Output is correct
30 Correct 99 ms 2164 KB Output is correct
31 Correct 207 ms 20640 KB Output is correct
32 Correct 208 ms 18900 KB Output is correct
33 Correct 89 ms 2144 KB Output is correct
34 Correct 222 ms 20724 KB Output is correct
35 Correct 152 ms 15612 KB Output is correct
36 Correct 87 ms 2104 KB Output is correct
37 Correct 103 ms 2048 KB Output is correct
38 Correct 180 ms 20756 KB Output is correct
39 Incorrect 93 ms 20628 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 1004 KB Output is correct
2 Correct 67 ms 1064 KB Output is correct
3 Correct 64 ms 1092 KB Output is correct
4 Correct 55 ms 1036 KB Output is correct
5 Correct 55 ms 1060 KB Output is correct
6 Correct 54 ms 984 KB Output is correct
7 Correct 56 ms 1028 KB Output is correct
8 Correct 60 ms 1200 KB Output is correct
9 Correct 58 ms 1120 KB Output is correct
10 Correct 56 ms 1116 KB Output is correct
11 Correct 58 ms 1084 KB Output is correct
12 Correct 62 ms 1200 KB Output is correct
13 Correct 58 ms 1040 KB Output is correct
14 Correct 56 ms 1068 KB Output is correct
15 Correct 58 ms 1100 KB Output is correct
16 Correct 59 ms 1256 KB Output is correct
17 Correct 73 ms 1140 KB Output is correct
18 Correct 59 ms 1044 KB Output is correct
19 Correct 66 ms 996 KB Output is correct
20 Correct 62 ms 992 KB Output is correct
21 Incorrect 57 ms 1100 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 1004 KB Output is correct
2 Correct 67 ms 1064 KB Output is correct
3 Correct 64 ms 1092 KB Output is correct
4 Correct 55 ms 1036 KB Output is correct
5 Correct 55 ms 1060 KB Output is correct
6 Correct 54 ms 984 KB Output is correct
7 Correct 56 ms 1028 KB Output is correct
8 Correct 60 ms 1200 KB Output is correct
9 Correct 58 ms 1120 KB Output is correct
10 Correct 56 ms 1116 KB Output is correct
11 Correct 58 ms 1084 KB Output is correct
12 Correct 62 ms 1200 KB Output is correct
13 Correct 58 ms 1040 KB Output is correct
14 Correct 56 ms 1068 KB Output is correct
15 Correct 58 ms 1100 KB Output is correct
16 Correct 59 ms 1256 KB Output is correct
17 Correct 73 ms 1140 KB Output is correct
18 Correct 59 ms 1044 KB Output is correct
19 Correct 297 ms 20728 KB Output is correct
20 Correct 202 ms 20664 KB Output is correct
21 Correct 163 ms 19672 KB Output is correct
22 Correct 194 ms 17756 KB Output is correct
23 Correct 87 ms 2140 KB Output is correct
24 Correct 88 ms 2152 KB Output is correct
25 Correct 177 ms 20720 KB Output is correct
26 Correct 198 ms 20716 KB Output is correct
27 Correct 225 ms 20648 KB Output is correct
28 Correct 225 ms 20720 KB Output is correct
29 Correct 185 ms 20132 KB Output is correct
30 Correct 99 ms 2164 KB Output is correct
31 Correct 207 ms 20640 KB Output is correct
32 Correct 208 ms 18900 KB Output is correct
33 Correct 89 ms 2144 KB Output is correct
34 Correct 222 ms 20724 KB Output is correct
35 Correct 152 ms 15612 KB Output is correct
36 Correct 87 ms 2104 KB Output is correct
37 Correct 103 ms 2048 KB Output is correct
38 Correct 180 ms 20756 KB Output is correct
39 Incorrect 93 ms 20628 KB Output isn't correct
40 Halted 0 ms 0 KB -