QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#488836 | #8819. CNOI Knowledge | xinhaowen | WA | 0ms | 1268kb | C++14 | 1.4kb | 2024-07-24 15:40:51 | 2024-07-24 15:40:51 |
Judging History
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];
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);
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);
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]=(i-j+1)*(i-+2)/2;
}
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;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 1268kb
input:
12 3 1 6 3 6 3 1 10 15 10 10 6 15 27 21 20 15 14 6 3 20 34 26 43 34 19 9 5 2 25 8 5 25 19 9 6 3
output:
? 1 2 ? 1 1 ? 1 3 ? 1 2 ? 2 4 ? 3 4 ? 3 3 ? 2 5 ? 1 5 ? 1 4 ? 3 6 ? 4 6 ? 3 7 ? 1 7 ? 1 6 ? 2 7 ? 2 6 ? 4 8 ? 6 8 ? 7 8 ? 4 9 ? 2 9 ? 2 8 ? 1 9 ? 1 8 ? 5 10 ? 7 10 ? 8 10 ? 9 10 ? 5 11 ? 8 11 ? 9 11 ? 6 12 ? 6 11 ? 9 12 ? 10 12 ? 11 12 ! 1 2 3 2 4 3 2 2 5 5 2 2
result:
wrong answer Wrong Answer.