oj.uz

Submission #705069

# Submission time Handle Problem Language Result Execution time Memory
705069 2023-03-03T10:47:24 Z MtSaka Crossing (JOI21_crossing) C++17
100 / 100
 559 ms 21096 KB 
#include<bits/stdc++.h>
#define rep(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rrep(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;i--)
using ll=long long;
using namespace std;
using ull=unsigned long long;
vector<ull>pw(400000),pw2(400000);
static constexpr ull MOD=(1LL<<61)-1;
static constexpr ull inv2=(1LL<<60);
static constexpr ull base=2199866433;
ull mul(ull a,ull b){
  return __uint128_t(a)*b%MOD;
}
ull add(ull a,ull b){
  a+=b;if(a>=MOD)a-=MOD;
  return a;
}
ull div2(ull a){
  return mul(a,inv2);
}
void init(){
  pw[0]=1;
  rep(i,1,pw.size())pw[i]=mul(base,pw[i-1]);
  pw2[0]=0;
  rep(i,1,pw2.size())pw2[i]=add(pw2[i-1],pw[i-1]);
}
int get_id(char c){
  if(c=='J')return 0;
  if(c=='O')return 1;
  return 2;
}
char from_id(int a){
  if(a==0)return 'J';
  if(a==1)return 'O';
  return 'I';
}
struct segment_rolling_hash{
  private:
  int n,sz,lg;
  vector<pair<ull,ll>>seg;
  vector<int>lazy;
  void all_apply(int k,int a){
    seg[k].first=mul(from_id(a),pw2[seg[k].second]);
    if(k<sz)lazy[k]=a;
  }
  void push(int k){
    if(lazy[k]==-1)return;
    all_apply(k<<1,lazy[k]);all_apply(k<<1|1,lazy[k]);
    lazy[k]=-1;
  }
  void update(int i){
    seg[i].first=add(mul(seg[i<<1].first,pw[seg[i<<1|1].second]),seg[i<<1|1].first);
    seg[i].second=seg[i<<1].second+seg[i<<1|1].second;
  }
  public:
  segment_rolling_hash(string s):n(s.size()){
    sz=1,lg=0;
    while(sz<n)sz<<=1,lg++;
    seg.resize(sz<<1);
    rep(i,0,n){
      seg[i+sz].second=1;
      seg[i+sz].first=s[i];
    }
    rrep(i,1,sz)update(i);
    lazy.assign(sz,-1);
  }
  void apply(int l,int r,int a){
    l+=sz,r+=sz;
   rrep(i,1,lg+1){
      if(((l>>i)<<i)!=l)push(l>>i);
      if(((r>>i)<<i)!=r)push((r-1)>>i);
    }
    for(int l2=l,r2=r;l2<r2;l2>>=1,r2>>=1){
      if(l2&1)all_apply(l2++,a);
      if(r2&1)all_apply(--r2,a);
    }
    rep(i,0,lg+1){
      if(((l>>i)<<i)!=l)update(l>>i);
      if(((r>>i)<<i)!=r)update((r-1)>>i);
    }
  }
  ull all_prod()const{return seg[1].first;}
};
ull get_hash(string a){
  ull hash=0;
  for(auto i:a){
    hash=mul(hash,base);
    hash=add(hash,i);
  }
  return hash;
}
string f(string a,string b){
  assert(a.size()==b.size());
  string ans(a.size(),'1');
  rep(i,0,a.size()){
    if(get_id(a[i])==get_id(b[i]))ans[i]=a[i];
    else ans[i]=from_id(3^get_id(a[i])^get_id(b[i]));
  }
  return ans;
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  init();
  int n;cin>>n;
  string a,b,c;cin>>a>>b>>c;
  //cerr<<a<<" "<<b<<" "<<c<<endl;
  string ab=f(a,b),bc=f(b,c),ac=f(a,c),abbc=f(ab,bc),abac=f(ab,ac),bcac=f(bc,ac);
  //cerr<<ab<<" "<<bc<<" "<<ac<<endl;
  //cerr<<abbc<<" "<<abac<<" "<<bcac<<endl;
  set<ull>st;
  st.insert(get_hash(a));
  st.insert(get_hash(b));
  st.insert(get_hash(c));
  st.insert(get_hash(ab));
  st.insert(get_hash(bc));
  st.insert(get_hash(ac));
  st.insert(get_hash(abbc));
  st.insert(get_hash(abac));
  st.insert(get_hash(bcac));
  //for(auto i:st)cerr<<i<<endl;
  int q;cin>>q;
  string t;cin>>t;
  segment_rolling_hash seg(t);
  if(st.count(seg.all_prod())){
    cout<<"Yes"<<endl;
  }
  else cout<<"No"<<endl;
  rep(i,0,q){
    int l,r;char c;
    cin>>l>>r>>c;
    l--;
    seg.apply(l,r,get_id(c));
    //cerr<<seg.all_prod()<<endl;
    if(st.count(seg.all_prod())){
      cout<<"Yes"<<endl;
    }
    else cout<<"No"<<endl;
  }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 7196 KB Output is correct
2 Correct 316 ms 7160 KB Output is correct
3 Correct 312 ms 7136 KB Output is correct
4 Correct 301 ms 7168 KB Output is correct
5 Correct 291 ms 7116 KB Output is correct
6 Correct 292 ms 7132 KB Output is correct
7 Correct 299 ms 7056 KB Output is correct
8 Correct 313 ms 7244 KB Output is correct
9 Correct 312 ms 7148 KB Output is correct
10 Correct 310 ms 7080 KB Output is correct
11 Correct 311 ms 7228 KB Output is correct
12 Correct 333 ms 7100 KB Output is correct
13 Correct 310 ms 7168 KB Output is correct
14 Correct 314 ms 7108 KB Output is correct
15 Correct 318 ms 7240 KB Output is correct
16 Correct 305 ms 7100 KB Output is correct
17 Correct 320 ms 7188 KB Output is correct
18 Correct 311 ms 7136 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 7196 KB Output is correct
2 Correct 316 ms 7160 KB Output is correct
3 Correct 312 ms 7136 KB Output is correct
4 Correct 301 ms 7168 KB Output is correct
5 Correct 291 ms 7116 KB Output is correct
6 Correct 292 ms 7132 KB Output is correct
7 Correct 299 ms 7056 KB Output is correct
8 Correct 313 ms 7244 KB Output is correct
9 Correct 312 ms 7148 KB Output is correct
10 Correct 310 ms 7080 KB Output is correct
11 Correct 311 ms 7228 KB Output is correct
12 Correct 333 ms 7100 KB Output is correct
13 Correct 310 ms 7168 KB Output is correct
14 Correct 314 ms 7108 KB Output is correct
15 Correct 318 ms 7240 KB Output is correct
16 Correct 305 ms 7100 KB Output is correct
17 Correct 320 ms 7188 KB Output is correct
18 Correct 311 ms 7136 KB Output is correct
19 Correct 548 ms 21096 KB Output is correct
20 Correct 537 ms 20592 KB Output is correct
21 Correct 441 ms 20300 KB Output is correct
22 Correct 451 ms 20112 KB Output is correct
23 Correct 400 ms 9572 KB Output is correct
24 Correct 390 ms 9536 KB Output is correct
25 Correct 473 ms 20432 KB Output is correct
26 Correct 501 ms 20524 KB Output is correct
27 Correct 487 ms 20460 KB Output is correct
28 Correct 496 ms 20376 KB Output is correct
29 Correct 487 ms 20520 KB Output is correct
30 Correct 377 ms 9568 KB Output is correct
31 Correct 523 ms 20528 KB Output is correct
32 Correct 469 ms 20268 KB Output is correct
33 Correct 391 ms 9548 KB Output is correct
34 Correct 488 ms 20548 KB Output is correct
35 Correct 441 ms 19844 KB Output is correct
36 Correct 373 ms 9564 KB Output is correct
37 Correct 388 ms 9692 KB Output is correct
38 Correct 501 ms 20496 KB Output is correct
39 Correct 498 ms 20464 KB Output is correct
40 Correct 442 ms 15052 KB Output is correct
41 Correct 545 ms 20660 KB Output is correct
42 Correct 345 ms 20644 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 7196 KB Output is correct
2 Correct 316 ms 7160 KB Output is correct
3 Correct 312 ms 7136 KB Output is correct
4 Correct 301 ms 7168 KB Output is correct
5 Correct 291 ms 7116 KB Output is correct
6 Correct 292 ms 7132 KB Output is correct
7 Correct 299 ms 7056 KB Output is correct
8 Correct 313 ms 7244 KB Output is correct
9 Correct 312 ms 7148 KB Output is correct
10 Correct 310 ms 7080 KB Output is correct
11 Correct 311 ms 7228 KB Output is correct
12 Correct 333 ms 7100 KB Output is correct
13 Correct 310 ms 7168 KB Output is correct
14 Correct 314 ms 7108 KB Output is correct
15 Correct 318 ms 7240 KB Output is correct
16 Correct 305 ms 7100 KB Output is correct
17 Correct 320 ms 7188 KB Output is correct
18 Correct 311 ms 7136 KB Output is correct
19 Correct 325 ms 8616 KB Output is correct
20 Correct 342 ms 8668 KB Output is correct
21 Correct 341 ms 8696 KB Output is correct
22 Correct 305 ms 8604 KB Output is correct
23 Correct 324 ms 8720 KB Output is correct
24 Correct 320 ms 8604 KB Output is correct
25 Correct 331 ms 8640 KB Output is correct
26 Correct 305 ms 8520 KB Output is correct
27 Correct 320 ms 8712 KB Output is correct
28 Correct 333 ms 8420 KB Output is correct
29 Correct 326 ms 8752 KB Output is correct
30 Correct 317 ms 8456 KB Output is correct
31 Correct 332 ms 8644 KB Output is correct
32 Correct 338 ms 8680 KB Output is correct
33 Correct 319 ms 8704 KB Output is correct
34 Correct 307 ms 8552 KB Output is correct
35 Correct 315 ms 8684 KB Output is correct
36 Correct 415 ms 8924 KB Output is correct
37 Correct 330 ms 8712 KB Output is correct
38 Correct 331 ms 8700 KB Output is correct
39 Correct 337 ms 8700 KB Output is correct
40 Correct 320 ms 8660 KB Output is correct
41 Correct 317 ms 8652 KB Output is correct
42 Correct 334 ms 8616 KB Output is correct
43 Correct 331 ms 8556 KB Output is correct
44 Correct 324 ms 8668 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 7196 KB Output is correct
2 Correct 316 ms 7160 KB Output is correct
3 Correct 312 ms 7136 KB Output is correct
4 Correct 301 ms 7168 KB Output is correct
5 Correct 291 ms 7116 KB Output is correct
6 Correct 292 ms 7132 KB Output is correct
7 Correct 299 ms 7056 KB Output is correct
8 Correct 313 ms 7244 KB Output is correct
9 Correct 312 ms 7148 KB Output is correct
10 Correct 310 ms 7080 KB Output is correct
11 Correct 311 ms 7228 KB Output is correct
12 Correct 333 ms 7100 KB Output is correct
13 Correct 310 ms 7168 KB Output is correct
14 Correct 314 ms 7108 KB Output is correct
15 Correct 318 ms 7240 KB Output is correct
16 Correct 305 ms 7100 KB Output is correct
17 Correct 320 ms 7188 KB Output is correct
18 Correct 311 ms 7136 KB Output is correct
19 Correct 548 ms 21096 KB Output is correct
20 Correct 537 ms 20592 KB Output is correct
21 Correct 441 ms 20300 KB Output is correct
22 Correct 451 ms 20112 KB Output is correct
23 Correct 400 ms 9572 KB Output is correct
24 Correct 390 ms 9536 KB Output is correct
25 Correct 473 ms 20432 KB Output is correct
26 Correct 501 ms 20524 KB Output is correct
27 Correct 487 ms 20460 KB Output is correct
28 Correct 496 ms 20376 KB Output is correct
29 Correct 487 ms 20520 KB Output is correct
30 Correct 377 ms 9568 KB Output is correct
31 Correct 523 ms 20528 KB Output is correct
32 Correct 469 ms 20268 KB Output is correct
33 Correct 391 ms 9548 KB Output is correct
34 Correct 488 ms 20548 KB Output is correct
35 Correct 441 ms 19844 KB Output is correct
36 Correct 373 ms 9564 KB Output is correct
37 Correct 388 ms 9692 KB Output is correct
38 Correct 501 ms 20496 KB Output is correct
39 Correct 498 ms 20464 KB Output is correct
40 Correct 442 ms 15052 KB Output is correct
41 Correct 545 ms 20660 KB Output is correct
42 Correct 345 ms 20644 KB Output is correct
43 Correct 325 ms 8616 KB Output is correct
44 Correct 342 ms 8668 KB Output is correct
45 Correct 341 ms 8696 KB Output is correct
46 Correct 305 ms 8604 KB Output is correct
47 Correct 324 ms 8720 KB Output is correct
48 Correct 320 ms 8604 KB Output is correct
49 Correct 331 ms 8640 KB Output is correct
50 Correct 305 ms 8520 KB Output is correct
51 Correct 320 ms 8712 KB Output is correct
52 Correct 333 ms 8420 KB Output is correct
53 Correct 326 ms 8752 KB Output is correct
54 Correct 317 ms 8456 KB Output is correct
55 Correct 332 ms 8644 KB Output is correct
56 Correct 338 ms 8680 KB Output is correct
57 Correct 319 ms 8704 KB Output is correct
58 Correct 307 ms 8552 KB Output is correct
59 Correct 315 ms 8684 KB Output is correct
60 Correct 415 ms 8924 KB Output is correct
61 Correct 330 ms 8712 KB Output is correct
62 Correct 331 ms 8700 KB Output is correct
63 Correct 337 ms 8700 KB Output is correct
64 Correct 320 ms 8660 KB Output is correct
65 Correct 317 ms 8652 KB Output is correct
66 Correct 334 ms 8616 KB Output is correct
67 Correct 331 ms 8556 KB Output is correct
68 Correct 324 ms 8668 KB Output is correct
69 Correct 526 ms 20032 KB Output is correct
70 Correct 555 ms 20540 KB Output is correct
71 Correct 387 ms 9572 KB Output is correct
72 Correct 378 ms 9548 KB Output is correct
73 Correct 379 ms 9664 KB Output is correct
74 Correct 424 ms 20032 KB Output is correct
75 Correct 365 ms 9480 KB Output is correct
76 Correct 463 ms 20300 KB Output is correct
77 Correct 450 ms 19824 KB Output is correct
78 Correct 384 ms 9176 KB Output is correct
79 Correct 372 ms 9276 KB Output is correct
80 Correct 421 ms 19552 KB Output is correct
81 Correct 383 ms 9344 KB Output is correct
82 Correct 465 ms 19992 KB Output is correct
83 Correct 446 ms 19804 KB Output is correct
84 Correct 382 ms 9032 KB Output is correct
85 Correct 393 ms 9264 KB Output is correct
86 Correct 521 ms 19500 KB Output is correct
87 Correct 481 ms 19952 KB Output is correct
88 Correct 382 ms 9068 KB Output is correct
89 Correct 443 ms 20016 KB Output is correct
90 Correct 523 ms 20340 KB Output is correct
91 Correct 385 ms 9224 KB Output is correct
92 Correct 421 ms 19512 KB Output is correct
93 Correct 385 ms 9348 KB Output is correct
94 Correct 379 ms 9248 KB Output is correct
95 Correct 378 ms 9236 KB Output is correct
96 Correct 486 ms 20140 KB Output is correct
97 Correct 431 ms 20088 KB Output is correct
98 Correct 461 ms 14640 KB Output is correct
99 Correct 559 ms 20372 KB Output is correct
100 Correct 345 ms 20176 KB Output is correct