QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#489684 | #8819. CNOI Knowledge | Jryno1 | WA | 190ms | 22176kb | C++14 | 978b | 2024-07-24 22:48:14 | 2024-07-24 22:48:14 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
const int maxn=5005,bas=998244353;
int cha[maxn],s[maxn],n,cnt[maxn];
map<ull,int>lst;
int qr(int l,int r){
cout<<"? "<<l<<" "<<r<<"\n";
cout.flush();
int x;
cin>>x;
return x;
}
signed main(){
cin>>n;
cnt[1]=1,s[1]=1,lst[1]=1;
for(int i=2;i<=n;i++){
for(int j=1;j<=n;j++)cha[j]=0;
int l=1,r=i-1,res=0;
while(l<=r){
int mid=(l+r)>>1;
if(qr(mid,i)==cnt[mid]+i-mid+1)r=mid-1;
else l=mid+1,res=mid;
}
if(res!=0)s[i]=s[res];
else s[i]=i;
ull hsh=0;
for(int j=i;j>=1;j--){
hsh=hsh*bas+s[j];
cha[lst[hsh]+1]++;
cha[j+1]--;
lst[hsh]=j;
}
for(int j=1;j<=i;j++)cha[j]+=cha[j-1],cnt[j]+=cha[j];
}
cout<<"!"<<"\n";
for(int i=1;i<=n;i++)cout<<s[i]<<" ";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3572kb
input:
12 3 6 6 10 10 15 10 21 15 27 20 14 6 9 20 34 43 19 9 5 2 25 8 5 25 9 19
output:
? 1 2 ? 1 3 ? 2 4 ? 1 4 ? 2 5 ? 1 5 ? 3 6 ? 1 6 ? 3 7 ? 1 7 ? 2 7 ? 4 8 ? 6 8 ? 5 8 ? 4 9 ? 2 9 ? 1 9 ? 5 10 ? 7 10 ? 8 10 ? 9 10 ? 5 11 ? 8 11 ? 9 11 ? 6 12 ? 9 12 ? 7 12 ! 1 2 3 4 5 6 2 5 9 9 5 6
result:
ok Accepted. 27 queries used.
Test #2:
score: -100
Wrong Answer
time: 190ms
memory: 22176kb
input:
1000 3 5 2 3 2 7 11 8 5 2 11 3 2 11 5 7 15 8 5 3 15 8 5 2 19 7 3 2 19 4 3 2 23 5 3 2 20 5 3 2 23 5 3 2 23 9 13 15 31 14 8 5 3 31 15 7 5 3 41 16 8 5 2 45 15 7 3 2 55 20 7 15 11 58 21 8 5 2 68 21 8 5 69 21 8 5 2 80 26 12 5 8 79 24 12 5 2 89 24 12 5 8 87 26 11 5 3 100 32 11 5 2 100 31 11 5 8 112 31 12 ...
output:
? 1 2 ? 1 3 ? 2 3 ? 2 4 ? 3 4 ? 2 5 ? 1 5 ? 3 6 ? 4 6 ? 5 6 ? 3 7 ? 5 7 ? 6 7 ? 4 8 ? 6 8 ? 5 8 ? 4 9 ? 6 9 ? 7 9 ? 8 9 ? 5 10 ? 7 10 ? 8 10 ? 9 10 ? 5 11 ? 8 11 ? 9 11 ? 10 11 ? 6 12 ? 9 12 ? 10 12 ? 11 12 ? 6 13 ? 9 13 ? 11 13 ? 12 13 ? 7 14 ? 10 14 ? 12 14 ? 13 14 ? 7 15 ? 11 15 ? 13 15 ? 14 15 ?...
result:
wrong answer Wrong Answer.