QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#488833	#8819. CNOI Knowledge	xinhaowen	WA	0ms	1268kb	C++14	1.4kb	2024-07-24 15:39:18	2024-07-24 15:39:19

Judging History

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

[2024-07-24 15:39:19]
评测

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

查看

[2024-07-24 15:39:18]
提交

answer

#include<cstdio>
#include<algorithm>
//#define getchar getchar_unlocked
//#define putchar putchar_unlocked
template<typename T>void read(T &x){
	x=0;bool f=0;char ch=getchar();
	for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=1;
	for(;ch>='0'&&ch<='9';ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	if(f)x=-x;
}
void write(char x){putchar(x);}
template<typename T>void write(T x){
	if(x<0)putchar('-'),x=-x;
	char stk[24];int cnt=0;
	do stk[++cnt]=x%10+48,x/=10;while(x);
	for(;cnt;)putchar(stk[cnt--]);
}
template<typename T,typename ...Args>void read(T &x,Args &...args){read(x);read(args...);}
template<typename T,typename ...Args>void write(T x,Args ...args){write(x);write(args...);}
template<typename T>T min(T x,T y){return x<y?x:y;}
template<typename T>T max(T x,T y){return x>y?x:y;}
int n,last[1004],tot,ans[1004][1004],cnt;
signed main(){
	read(n);
	for(int i=1;i<=n;++i){
		int l=1,r=i-1,jk=0;
		for(;l<=r;){
			int mid=(l+r)>>1;
			write('?',' ',mid,' ',i,'\n');fflush(stdout);cnt++;
			int tmp,op;read(tmp);ans[mid][i]=tmp;
			if(ans[mid][i-1])op=ans[mid][i-1];
			else write('?',' ',mid,' ',i-1,'\n'),fflush(stdout),read(op),cnt++;
			if(tmp-op==i-mid+1)r=mid-1;
			else jk=mid,l=mid+1;
		}
		last[i]=jk;
		for(int j=jk+1;j<=i;++j)ans[j][i]=(j-i+1)*(j-i+2)/2;
	}
	write(cnt,'\n');
	write('!',' ');
	for(int i=1;i<=n;++i)
		if(!last[i])write(last[i]=++tot,' ');
		else write(last[i]=last[last[i]],' ');
	fflush(stdout);
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0

Wrong Answer

time: 0ms

memory: 1268kb

input:

output:

? 1 2
? 1 3
? 1 2
? 2 4
? 2 3
? 1 4
? 1 3
? 2 5
? 2 4
? 1 5
? 3 6
? 3 5
? 1 6
? 3 7
? 5 7
? 5 6
? 4 7
? 4 6
? 4 8
? 6 8
? 6 7
? 5 8
? 5 7
? 4 9
? 2 9
? 2 8
? 1 9
? 1 8
? 5 10
? 7 10
? 7 9
? 8 10
? 8 9
? 9 10
? 5 11
? 8 11
? 9 11
? 6 12
? 6 11
? 9 12
? 9 11
? 7 12
? 7 11
43
! 1 2 3 4 1 5 3 1 6 6 1 5

result:

wrong answer Invalid output.