oj.uz

Submission #810841

# Submission time Handle Problem Language Result Execution time Memory
810841 2023-08-06T16:24:02 Z winter0101 Crossing (JOI21_crossing) C++14
100 / 100
 388 ms 17632 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
#define pll pair<long long,long long>
#define eb emplace_back
const long long du=1e9+7;
const long long base=311;
const int maxn=2e5+9;
int en(char r1){
if (r1=='J')return 1;
if (r1=='O')return 2;
return 3;
}
char b[4];
char conv(char p,char q){
if (p==q)return p;
bool pk[4];
memset(pk,0,sizeof(pk));
pk[en(p)]=1,pk[en(q)]=1;
for1(i,1,3){
if (pk[i])continue;
return b[i];
}
}
int n;
long long pw[maxn],st[maxn*4],lazy[maxn*4],dd[maxn];
void merge(int id,int l,int r){
int mid=(l+r)/2;
st[id]=(st[id*2]*pw[r-mid]+st[id*2+1])%du;
}
void push(int id,int l,int r){
if (lazy[id]){
    lazy[id*2]=lazy[id*2+1]=lazy[id];
    int rep=b[lazy[id]]-'A'+1;
    int mid=(l+r)/2;
    st[id*2]=(rep*dd[mid-l+1])%du;
    st[id*2+1]=(rep*dd[r-mid])%du;
    lazy[id]=0;
}
}
void update(int id,int l,int r,int u,int v,char val){
if (l>v||r<u||u>v)return;
if (u<=l&&r<=v){
    int rep=val-'A'+1;
    st[id]=(rep*dd[r-l+1])%du;
    lazy[id]=en(val);
    return;
}
push(id,l,r);
int mid=(l+r)/2;
update(id*2,l,mid,u,v,val);
update(id*2+1,mid+1,r,u,v,val);
merge(id,l,r);
}
string p,q,r;
vector<string>a;
void gen(){
    a.pb(p),a.pb(q),a.pb(r);
    map<string,bool>ck;
    ck[p]=1,ck[q]=1,ck[r]=1;
    while (true){
        bool fl=false;
        string nw="";
        for1(i,0,sz(a)-1){
        if (fl)break;
        for1(j,i+1,sz(a)-1){
        if (fl)break;
        for1(k,0,n-1){
        nw.pb(conv(a[i][k],a[j][k]));
        }
        if (!ck[nw]){
            ck[nw]=1;
            fl=true;
        }
        else nw="";
        }
        }
        if (!fl)break;
        a.pb(nw);
    }
}
vector<long long>has;
bool check(int vcl){
for (auto v:has)if (vcl==v)return true;
return false;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    b[1]='J',b[2]='O',b[3]='I';
    cin>>n>>p>>q>>r;
    gen();
    vector<string>::iterator it=unique(all(a));
    a.resize(distance(a.begin(),it));
    for (auto v:a){
        long long s=0;
        for (auto u:v){
            s=(s*base+u-'A'+1)%du;
        }
        has.pb(s);
    }
    vector<string>().swap(a);
    pw[0]=1;
    for1(i,1,n)pw[i]=(pw[i-1]*base)%du;
    for1(i,1,n)dd[i]=(dd[i-1]*base+1)%du;
    int q;
    cin>>q;
    string t;
    cin>>t;
    t=" "+t;
    for1(i,1,n){
    update(1,1,n,i,i,t[i]);
    }
    if (check(st[1]))cout<<"Yes"<<'\n';
    else cout<<"No"<<'\n';
    for1(i,1,q){
    int l,r;
    char val;
    cin>>l>>r>>val;
    update(1,1,n,l,r,val);
    if (check(st[1]))cout<<"Yes"<<'\n';
    else cout<<"No"<<'\n';
    }

}

Compilation message

Main.cpp: In function 'char conv(char, char)':
Main.cpp:38:1: warning: control reaches end of non-void function [-Wreturn-type]
   38 | }
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2264 KB Output is correct
2 Correct 63 ms 2416 KB Output is correct
3 Correct 61 ms 2336 KB Output is correct
4 Correct 53 ms 2320 KB Output is correct
5 Correct 52 ms 2344 KB Output is correct
6 Correct 52 ms 2284 KB Output is correct
7 Correct 53 ms 2388 KB Output is correct
8 Correct 55 ms 2480 KB Output is correct
9 Correct 56 ms 2432 KB Output is correct
10 Correct 55 ms 2380 KB Output is correct
11 Correct 56 ms 2388 KB Output is correct
12 Correct 55 ms 2372 KB Output is correct
13 Correct 56 ms 2376 KB Output is correct
14 Correct 55 ms 2452 KB Output is correct
15 Correct 57 ms 2484 KB Output is correct
16 Correct 55 ms 2484 KB Output is correct
17 Correct 57 ms 2380 KB Output is correct
18 Correct 57 ms 2388 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2264 KB Output is correct
2 Correct 63 ms 2416 KB Output is correct
3 Correct 61 ms 2336 KB Output is correct
4 Correct 53 ms 2320 KB Output is correct
5 Correct 52 ms 2344 KB Output is correct
6 Correct 52 ms 2284 KB Output is correct
7 Correct 53 ms 2388 KB Output is correct
8 Correct 55 ms 2480 KB Output is correct
9 Correct 56 ms 2432 KB Output is correct
10 Correct 55 ms 2380 KB Output is correct
11 Correct 56 ms 2388 KB Output is correct
12 Correct 55 ms 2372 KB Output is correct
13 Correct 56 ms 2376 KB Output is correct
14 Correct 55 ms 2452 KB Output is correct
15 Correct 57 ms 2484 KB Output is correct
16 Correct 55 ms 2484 KB Output is correct
17 Correct 57 ms 2380 KB Output is correct
18 Correct 57 ms 2388 KB Output is correct
19 Correct 210 ms 17072 KB Output is correct
20 Correct 219 ms 16080 KB Output is correct
21 Correct 161 ms 16392 KB Output is correct
22 Correct 155 ms 15900 KB Output is correct
23 Correct 92 ms 4024 KB Output is correct
24 Correct 90 ms 3976 KB Output is correct
25 Correct 177 ms 17000 KB Output is correct
26 Correct 172 ms 17024 KB Output is correct
27 Correct 188 ms 16992 KB Output is correct
28 Correct 188 ms 16996 KB Output is correct
29 Correct 182 ms 16884 KB Output is correct
30 Correct 96 ms 3976 KB Output is correct
31 Correct 189 ms 16936 KB Output is correct
32 Correct 182 ms 16300 KB Output is correct
33 Correct 92 ms 4032 KB Output is correct
34 Correct 191 ms 17000 KB Output is correct
35 Correct 144 ms 15440 KB Output is correct
36 Correct 89 ms 4000 KB Output is correct
37 Correct 88 ms 4016 KB Output is correct
38 Correct 198 ms 15984 KB Output is correct
39 Correct 149 ms 16048 KB Output is correct
40 Correct 145 ms 11004 KB Output is correct
41 Correct 233 ms 17168 KB Output is correct
42 Correct 101 ms 15476 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2264 KB Output is correct
2 Correct 63 ms 2416 KB Output is correct
3 Correct 61 ms 2336 KB Output is correct
4 Correct 53 ms 2320 KB Output is correct
5 Correct 52 ms 2344 KB Output is correct
6 Correct 52 ms 2284 KB Output is correct
7 Correct 53 ms 2388 KB Output is correct
8 Correct 55 ms 2480 KB Output is correct
9 Correct 56 ms 2432 KB Output is correct
10 Correct 55 ms 2380 KB Output is correct
11 Correct 56 ms 2388 KB Output is correct
12 Correct 55 ms 2372 KB Output is correct
13 Correct 56 ms 2376 KB Output is correct
14 Correct 55 ms 2452 KB Output is correct
15 Correct 57 ms 2484 KB Output is correct
16 Correct 55 ms 2484 KB Output is correct
17 Correct 57 ms 2380 KB Output is correct
18 Correct 57 ms 2388 KB Output is correct
19 Correct 61 ms 2352 KB Output is correct
20 Correct 61 ms 2304 KB Output is correct
21 Correct 55 ms 2380 KB Output is correct
22 Correct 48 ms 2252 KB Output is correct
23 Correct 55 ms 2468 KB Output is correct
24 Correct 53 ms 2368 KB Output is correct
25 Correct 56 ms 2360 KB Output is correct
26 Correct 52 ms 2380 KB Output is correct
27 Correct 55 ms 2476 KB Output is correct
28 Correct 52 ms 2268 KB Output is correct
29 Correct 64 ms 2420 KB Output is correct
30 Correct 49 ms 2284 KB Output is correct
31 Correct 57 ms 2476 KB Output is correct
32 Correct 55 ms 2356 KB Output is correct
33 Correct 56 ms 2480 KB Output is correct
34 Correct 51 ms 2268 KB Output is correct
35 Correct 56 ms 2432 KB Output is correct
36 Correct 57 ms 2500 KB Output is correct
37 Correct 56 ms 2464 KB Output is correct
38 Correct 57 ms 2412 KB Output is correct
39 Correct 56 ms 2416 KB Output is correct
40 Correct 57 ms 2428 KB Output is correct
41 Correct 57 ms 2380 KB Output is correct
42 Correct 57 ms 2456 KB Output is correct
43 Correct 55 ms 2356 KB Output is correct
44 Correct 57 ms 2368 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2264 KB Output is correct
2 Correct 63 ms 2416 KB Output is correct
3 Correct 61 ms 2336 KB Output is correct
4 Correct 53 ms 2320 KB Output is correct
5 Correct 52 ms 2344 KB Output is correct
6 Correct 52 ms 2284 KB Output is correct
7 Correct 53 ms 2388 KB Output is correct
8 Correct 55 ms 2480 KB Output is correct
9 Correct 56 ms 2432 KB Output is correct
10 Correct 55 ms 2380 KB Output is correct
11 Correct 56 ms 2388 KB Output is correct
12 Correct 55 ms 2372 KB Output is correct
13 Correct 56 ms 2376 KB Output is correct
14 Correct 55 ms 2452 KB Output is correct
15 Correct 57 ms 2484 KB Output is correct
16 Correct 55 ms 2484 KB Output is correct
17 Correct 57 ms 2380 KB Output is correct
18 Correct 57 ms 2388 KB Output is correct
19 Correct 210 ms 17072 KB Output is correct
20 Correct 219 ms 16080 KB Output is correct
21 Correct 161 ms 16392 KB Output is correct
22 Correct 155 ms 15900 KB Output is correct
23 Correct 92 ms 4024 KB Output is correct
24 Correct 90 ms 3976 KB Output is correct
25 Correct 177 ms 17000 KB Output is correct
26 Correct 172 ms 17024 KB Output is correct
27 Correct 188 ms 16992 KB Output is correct
28 Correct 188 ms 16996 KB Output is correct
29 Correct 182 ms 16884 KB Output is correct
30 Correct 96 ms 3976 KB Output is correct
31 Correct 189 ms 16936 KB Output is correct
32 Correct 182 ms 16300 KB Output is correct
33 Correct 92 ms 4032 KB Output is correct
34 Correct 191 ms 17000 KB Output is correct
35 Correct 144 ms 15440 KB Output is correct
36 Correct 89 ms 4000 KB Output is correct
37 Correct 88 ms 4016 KB Output is correct
38 Correct 198 ms 15984 KB Output is correct
39 Correct 149 ms 16048 KB Output is correct
40 Correct 145 ms 11004 KB Output is correct
41 Correct 233 ms 17168 KB Output is correct
42 Correct 101 ms 15476 KB Output is correct
43 Correct 61 ms 2352 KB Output is correct
44 Correct 61 ms 2304 KB Output is correct
45 Correct 55 ms 2380 KB Output is correct
46 Correct 48 ms 2252 KB Output is correct
47 Correct 55 ms 2468 KB Output is correct
48 Correct 53 ms 2368 KB Output is correct
49 Correct 56 ms 2360 KB Output is correct
50 Correct 52 ms 2380 KB Output is correct
51 Correct 55 ms 2476 KB Output is correct
52 Correct 52 ms 2268 KB Output is correct
53 Correct 64 ms 2420 KB Output is correct
54 Correct 49 ms 2284 KB Output is correct
55 Correct 57 ms 2476 KB Output is correct
56 Correct 55 ms 2356 KB Output is correct
57 Correct 56 ms 2480 KB Output is correct
58 Correct 51 ms 2268 KB Output is correct
59 Correct 56 ms 2432 KB Output is correct
60 Correct 57 ms 2500 KB Output is correct
61 Correct 56 ms 2464 KB Output is correct
62 Correct 57 ms 2412 KB Output is correct
63 Correct 56 ms 2416 KB Output is correct
64 Correct 57 ms 2428 KB Output is correct
65 Correct 57 ms 2380 KB Output is correct
66 Correct 57 ms 2456 KB Output is correct
67 Correct 55 ms 2356 KB Output is correct
68 Correct 57 ms 2368 KB Output is correct
69 Correct 331 ms 16368 KB Output is correct
70 Correct 388 ms 16584 KB Output is correct
71 Correct 91 ms 3980 KB Output is correct
72 Correct 91 ms 4052 KB Output is correct
73 Correct 90 ms 4056 KB Output is correct
74 Correct 159 ms 16656 KB Output is correct
75 Correct 90 ms 4048 KB Output is correct
76 Correct 181 ms 17116 KB Output is correct
77 Correct 165 ms 16044 KB Output is correct
78 Correct 90 ms 3968 KB Output is correct
79 Correct 92 ms 4084 KB Output is correct
80 Correct 262 ms 15992 KB Output is correct
81 Correct 98 ms 4112 KB Output is correct
82 Correct 339 ms 17504 KB Output is correct
83 Correct 319 ms 17408 KB Output is correct
84 Correct 99 ms 4180 KB Output is correct
85 Correct 98 ms 4196 KB Output is correct
86 Correct 221 ms 16408 KB Output is correct
87 Correct 265 ms 17512 KB Output is correct
88 Correct 102 ms 4124 KB Output is correct
89 Correct 230 ms 16620 KB Output is correct
90 Correct 260 ms 17508 KB Output is correct
91 Correct 101 ms 4080 KB Output is correct
92 Correct 269 ms 16328 KB Output is correct
93 Correct 101 ms 4072 KB Output is correct
94 Correct 97 ms 4096 KB Output is correct
95 Correct 103 ms 4304 KB Output is correct
96 Correct 198 ms 16052 KB Output is correct
97 Correct 192 ms 16480 KB Output is correct
98 Correct 251 ms 12196 KB Output is correct
99 Correct 363 ms 17632 KB Output is correct
100 Correct 226 ms 15948 KB Output is correct