QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#578873#8338. Quad Kingdoms ChessOkuchiriWA 67ms9996kbC++202.2kb2024-09-20 22:09:032024-09-20 22:09:04

Judging History

This is the latest submission verdict.

  • [2024-09-20 22:09:04]
  • Judged
  • Verdict: WA
  • Time: 67ms
  • Memory: 9996kb
  • [2024-09-20 22:09:03]
  • Submitted

answer

#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
ll ksm(ll x,ll y)
{
    ll res=1;
    while(y)
    {
        if(y&1)res=res*x%mod;
        x=x*x%mod;
        y=y/2;
    }
    return res;
}
ll n,m,bas1,bas2;
ll mx[400010][2];
ll cnt[400010][2];
ll hsh1[400010][2];
ll hsh2[400010][2];
tuple<ll,ll,ll> getres(ll now,ll l,ll r,ll k,ll t)
{
    if(l==r)
    {
        if(mx[now][t]>=k)return{1,mx[now][t],mx[now][t]};
        return {0,0,0};
    }
    ll mid=(l+r)/2;
    if(mx[now*2][t]<k)return getres(now*2+1,mid+1,r,k,t);
    tuple<ll,ll,ll>res=getres(now*2,mid+1,r,k,t);
    auto [x,y,z]=res;
    return {cnt[now][t]-cnt[now*2][t]+x,((hsh1[now][t]-hsh1[now*2][t]+mod)%mod*ksm(ksm(bas1,cnt[now*2][t]),mod-2)%mod*ksm(bas1,x)%mod+y)%mod,((hsh2[now][t]-hsh2[now*2][t]+mod)%mod*ksm(ksm(bas2,cnt[now*2][t]),mod-2)%mod*ksm(bas2,x)%mod+z)%mod};
}
void change(ll now,ll l,ll r,ll k,ll x,ll t)
{
    if(l==r)
    {
        mx[now][t]=x;
        cnt[now][t]=1;
        hsh1[now][t]=x;
        hsh2[now][t]=x;
        return;
    }
    ll mid=(l+r)/2;
    if(k<=mid)change(now*2,l,mid,k,x,t);
    else change(now*2+1,mid+1,r,k,x,t);
    mx[now][t]=max(mx[now*2][t],mx[now*2+1][t]);
    tuple<ll,ll,ll>res=getres(now*2+1,mid+1,r,mx[now*2][t],t);
    auto [x1,y,z]=res;
    cnt[now][t]=cnt[now*2][t]+x1;
    hsh1[now][t]=(hsh1[now*2][t]+ksm(bas1,cnt[now*2][t])*y%mod)%mod;
    hsh2[now][t]=(hsh2[now*2][t]+ksm(bas2,cnt[now*2][t])*z%mod)%mod;
}

signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    srand(time(0));
    cin>>n;
    bas1=rand();
    bas2=rand();
    bas1=bas1*1145141ll%mod;
    bas2=bas2*1145141ll%mod;
    for(int i=1;i<=n;i++)
    {
        ll x;
        cin>>x;
        change(1,1,n,n-i+1,x,0);
    }
    cin>>m;
    for(int i=1;i<=m;i++)
    {
        ll x;
        cin>>x;
        change(1,1,m,m-i+1,x,1);
    }
    ll q;
    cin>>q;
    while(q--)
    {
        ll opt,x,y;
        cin>>opt>>x>>y;
        if(opt==1)
        {
            change(1,1,n,n-x+1,y,0);
        }
        else change(1,1,m,m-x+1,y,1);
        if(hsh1[1][0]==hsh1[1][1]&&hsh2[1][0]==hsh2[1][1])cout<<"YES\n";
        else cout<<"NO\n";
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 9852kb

input:

5
1 2 3 4 5
5
5 4 3 2 1
8
1 1 5
1 4 2
1 2 4
1 5 1
1 5 5
2 1 4
2 3 5
2 5 5

output:

NO
NO
NO
YES
NO
NO
NO
YES

result:

ok 8 tokens

Test #2:

score: 0
Accepted
time: 43ms
memory: 9996kb

input:

1
2
6
2 1 1 1 1 1
200000
2 6 2
1 1 1
1 1 1
1 1 2
2 1 1
1 1 2
1 1 1
2 4 1
2 1 2
1 1 1
1 1 2
2 5 1
1 1 1
1 1 2
1 1 1
2 6 1
1 1 2
1 1 2
1 1 2
2 3 1
1 1 1
2 1 1
2 6 2
1 1 2
2 4 1
1 1 2
2 6 1
1 1 2
1 1 1
2 5 2
2 6 2
1 1 1
2 4 2
2 5 2
2 6 2
1 1 1
2 5 1
2 6 2
1 1 2
1 1 1
1 1 1
2 4 1
1 1 2
1 1 2
1 1 2
2 3 2...

output:

NO
NO
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
N...

result:

ok 200000 tokens

Test #3:

score: 0
Accepted
time: 47ms
memory: 9848kb

input:

6
2 1 1 2 1 2
1
1
200000
2 1 1
1 1 2
1 1 1
2 1 2
2 1 1
2 1 1
2 1 2
2 1 2
1 1 2
1 3 1
1 6 2
1 5 2
1 4 2
1 3 1
2 1 2
1 4 2
1 4 2
2 1 2
2 1 2
1 3 1
1 6 1
1 1 2
2 1 1
1 6 1
1 3 1
1 5 2
1 6 2
1 5 2
2 1 2
1 2 1
1 5 2
2 1 1
2 1 1
1 6 1
2 1 2
2 1 1
1 3 2
2 1 1
1 6 1
1 4 2
1 2 1
1 1 1
2 1 1
1 2 1
1 6 2
1 6 2...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

ok 200000 tokens

Test #4:

score: -100
Wrong Answer
time: 67ms
memory: 9932kb

input:

6
1 3 1 2 1 2
6
2 1 3 3 3 1
200000
2 4 2
1 2 1
1 6 2
2 3 2
1 1 1
1 6 2
1 6 2
1 3 2
2 6 1
2 4 3
1 1 2
2 5 2
2 6 2
2 3 1
1 4 3
1 3 1
2 5 2
2 4 2
2 1 3
1 1 1
2 2 2
2 4 2
1 5 3
1 6 3
2 6 3
1 5 3
2 5 3
2 4 1
2 4 2
1 1 2
1 6 1
2 6 1
1 2 3
1 1 3
1 1 1
2 6 3
2 4 1
1 4 2
2 2 1
1 3 1
1 1 3
1 1 3
1 4 3
1 3 3
2...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
YES
YES
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
N...

result:

wrong answer 124th words differ - expected: 'NO', found: 'YES'