QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#628032	#5466. Permutation Compression	laonongmin	WA	1ms	3624kb	C++17	2.0kb	2024-10-10 18:19:08	2024-10-10 18:19:08

Judging History

你现在查看的是最新测评结果

[2024-10-10 18:19:08]
评测

测评结果：WA
用时：1ms
内存：3624kb

查看

[2024-10-10 18:19:08]
提交

answer

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define N 200005
#define MOD 998244353
using namespace std;
int n,m,k;
int a[N];
int st[N];
ll c[N];
inline int lowbit(int x){ return x&-x; }
void update(int i, int x) // 单点修改
{
    while(i<=n)
    {
        c[i]+=x;
        i+=lowbit(i);
    }
}
int sum(int i) // 区间查询 sum[1,i]
{
    int res=0;
    while(i>0)
    {
        res+=c[i];
        i-=lowbit(i);
    }
    return res;
}
void solve()
{
    cin>>n>>m>>k;
    priority_queue<pii> q;
    multiset<int> ms;
    set<pii> s;
    s.insert({1,n});
    bool ok = true;
    for(int i=1;i<=n;++i) {cin>>a[i]; q.push({a[i], i}); st[i]=0;}
    for(int i=1,j=1;i<=m;++i,++j)
    {
        int b; cin>>b;
        while(j<=n && b!=a[j]) ++j;
        if(j>n) ok = false;
        if(j<=n) st[j]=1;
    }
    for(int i=1;i<=k;++i)
    {
        int x; cin>>x;
        ms.insert(x);
    }
    if(!ok) {cout<<"NO\n"; return;}

    while(!q.empty())
    {
        int i = q.top().second;
        q.pop();
        // cout<<st[i]<<' ';
        if(st[i])
        {
            auto it = s.upper_bound({i,i});
            if(it==s.begin()) continue;
            --it;
            auto [l,r] = *it;
            s.erase(it);
            if(i<r) s.insert({i+1,r});
            if(i>l) s.insert({l,i-1});
        }
        else
        {
            auto [l,r] = *(--s.upper_bound({i,i}));
            int num = (r-l+1)-(sum(r)-sum(l-1));
            // cout<<l<<r<<num<<'\n';
            // if(l==1 && r==0){for(auto [x,y]:s) cout<<"d"<<x<<' '<<y<<'\n';}
            auto it = ms.upper_bound(num);
            if(it==ms.begin()) {cout<<"NO\n"; return;}
            --it;
            ms.erase(it);
            update(i,1);
        }
    }
    cout<<"YES\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3572kb

input:

output:

YES
YES
NO

result:

ok 3 lines

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3624kb

input:

100
2 1 2
2 1
2
1 1
2 1 2
1 2
1
2 2
2 1 1
1 2
1
2
6 1 5
3 4 2 5 6 1
3
5 2 1 1 1
6 1 6
2 1 3 6 4 5
1
4 1 2 2 1 4
3 3 2
2 1 3
2 1 3
2 2
1 1 1
1
1
1
1 1 1
1
1
1
2 1 2
2 1
2
1 2
4 4 3
2 1 3 4
2 1 3 4
4 3 1
1 1 1
1
1
1
6 5 1
6 2 5 4 3 1
6 2 4 3 1
4
1 1 1
1
1
1
6 5 3
3 6 1 4 5 2
3 6 1 4 2
3 3 4
4 3 4
3 4 ...

output:

YES
NO
NO
YES
NO
YES
YES
YES
NO
YES
YES
NO
YES
NO
NO
NO
NO
YES
NO
YES
YES
YES
NO
YES
NO
NO
YES
NO
YES
NO
NO
YES
YES
NO
NO
YES
YES
YES
NO
NO
NO
NO
YES
NO
NO
YES
NO
YES
NO
NO
NO
NO
NO
YES
NO
YES
NO
NO
YES
YES
YES
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
YES
NO
YES
NO
NO
YES
YES
YES
YES
YES
NO
NO
YES
YES
NO
NO...

result:

wrong answer 2nd lines differ - expected: 'YES', found: 'NO'