QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#791329	#5466. Permutation Compression	Tom22l	WA	0ms	13956kb	C++17	2.3kb	2024-11-28 18:07:06	2024-11-28 18:07:07

Judging History

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

[2024-11-28 18:07:07]
评测

测评结果：WA
用时：0ms
内存：13956kb

查看

[2024-11-28 18:07:06]
提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
int Read(){
	int x=0;
	char ch=getchar();bool f=0;
	while(ch<'0'||ch>'9') if(ch=='-')f=1,ch=getchar(); else if(ch==EOF)return 0; else ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return f?-x:x;
}
int a[200005];
int pos[200005];
int b[200005];
bool c[200005];
int pre[200005];
int aft[1000005];
set<int> l;
int stk[1000005];
set<int> sk;
int n;
int s[1000005];
int lowbit(int x){
	return x&(-x);
}
void update(int x){
	for(;x<=n;x+=lowbit(x))
		s[x]+=1;
}
int query(int x){
	int ans=0;
	for(;x;x-=lowbit(x)) ans+=s[x];
	return ans;
}
int res;
signed main(){
	set<int>::iterator it;
	int T=Read();
	while(T--){
		n=Read();int m=Read(),k=Read();
		for(int i=1;i<=n;i++)a[i]=Read(),pos[a[i]]=i,s[i]=0;
		for(int i=1;i<=m;i++)b[i]=Read();
		int p1=1;
		for(int i=1;i<=n;i++){
			if(a[i]==b[p1]) c[i]=1,p1++;
			else c[i]=0;
		}
		for(int i=1;i<=k;i++){
			int d=Read();l.insert(-d);
		}
		if(p1!=m+1){
			printf("NO\n");
			l.clear();
			continue;
		}
		sk.clear();
		res=1;
		stk[1]=0;
		sk.insert(0);
		for(int i=1;i<=n;i++){
			if(c[i]){
				while(stk[res]<a[i]&&res){
					sk.erase(stk[res]);
					res--;
				}
				stk[++res]=a[i];
				sk.insert(stk[res]);
			}else{
				it=lower_bound(sk.begin(),sk.end(),a[i]);
				if(it==sk.end()) pre[i]=0;
				else pre[i]=pos[*it];
			}
		}
		sk.clear();
		res=1;
		stk[1]=0;
		sk.insert(0);
		for(int i=n;i>=1;i--){
			if(c[i]){
				while(stk[res]<a[i]&&res){
					sk.erase(stk[res]);
					res--;
				}
				stk[++res]=a[i];
				sk.insert(stk[res]);
			}else{
				it=lower_bound(sk.begin(),sk.end(),a[i]);
				if(it==sk.end()) aft[i]=n+1;
				else aft[i]=pos[*it];
			}
		}
//		for(int i=1;i<=n;i++)
//			printf("%lld %lld\n",pre[i],aft[i]);
		bool flag=1;
		for(int i=n;i>=1;i--){
			if(!c[pos[i]]){
				int len=aft[pos[i]]-pre[pos[i]]-1;
				int mis=query(aft[pos[i]])-query(pre[pos[i]]);
				len-=mis;
//				cout<<pos[i]<<' '<<i<<' '<<len<<endl;
				it=lower_bound(l.begin(),l.end(),-len);
				if(it==l.end()){
					flag=0;
					printf("NO\n");
					break;
				}
				l.erase(it);
				update(pos[i]);
			}
		}if(flag)printf("YES\n");
		l.clear();
	}
	return 0; 
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 13956kb

input:

output:

YES
YES
NO

result:

ok 3 lines

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 13936kb

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
YES
YES
NO
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
NO
YES
YES
YES
YES
YES
NO
NO
YES
YES
YES
NO
NO
NO
NO
YES
NO
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
NO
YES
YES
YES
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
Y...

result:

wrong answer 4th lines differ - expected: 'YES', found: 'NO'