QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#297598 | #6303. Inversion | 552Hz | WA | 31ms | 3564kb | C++14 | 2.3kb | 2024-01-04 19:54:00 | 2024-01-04 19:54:01 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const int N=2010;
const ll mod=998244353;
//const ll mod=1e9+7;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define vi vector <int>
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long
#define i128 __int128
#define pb emplace_back
#define pii pair<int,int>
#define debug(x) std::cout<<x<<endl
//#define endl '\n'
#define mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
template<typename type>
inline void read(type &x)
{
x=0;bool flag(0);char ch=getchar();
while(!isdigit(ch)) flag=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
flag?x=-x:0;
}
template<typename type>
inline void write(type x,bool mode=1)//0为空格,1为换行
{
x<0?x=-x,putchar('-'):0;static short Stack[50],top(0);
do Stack[++top]=x%10,x/=10; while(x);
while(top) putchar(Stack[top--]|48);
mode?putchar('\n'):putchar(' ');
}
//head~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//begin~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//end~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ll a[N],n,dis[N][N];
bool query(int l,int r){
if(l==r){
return 0;
}
cout<<"? "<<l<<" "<<r<<endl;
int ans;cin>>ans;
return ans;
}
int ans[N],pos[N];
void solve(){
cin>>n;
pos[1]=1;
for(int i=2;i<=n;i++){
int l=1,r=i-1;
while(l<r){
int mid=(l+r)>>1;
int x=0;
for(int j=1;j<mid;j++){
if(pos[mid]<pos[j]){
x++;
}
}
if(query(pos[mid],i)!=(query(pos[mid]+1,i)+x)%2){
r=mid;
}else{
l=mid+1;
}
}
if(query(i-1,i)==0&&l==i-1){
l=i;
}
for(int j=i;j>l;j--){
pos[j]=pos[j-1];
}
pos[l]=i;
}
cout<<"! ";
for(int i=1;i<=n;i++){
ans[pos[i]]=i;
}
for(int i=1;i<=n;i++){
cout<<ans[i]<<" ";
}
}
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int _=1;
while(_--){
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3560kb
input:
3 0 0 1 1
output:
? 1 2 ? 1 3 ? 2 3 ? 2 3 ! 2 3 1
result:
ok OK, guesses=4
Test #2:
score: -100
Wrong Answer
time: 31ms
memory: 3564kb
input:
1993 0 0 0 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 1 1 0 1 1 0 1 0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 1 0 1 1 0 1 1 1 1 1 1 0 0 0 0 1 0 1 1 0 0 1 0 0 0 0 1 0 1 1 0 0 1 0 0 0 1 0 1 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 0 0 0 1 0 1 1 1 0 1 1 0 0 0 1 1 0...
output:
? 1 2 ? 1 3 ? 2 3 ? 2 3 ? 2 4 ? 3 4 ? 3 4 ? 2 5 ? 3 5 ? 1 5 ? 2 5 ? 4 5 ? 2 6 ? 3 6 ? 1 6 ? 2 6 ? 5 6 ? 5 6 ? 1 7 ? 2 7 ? 6 7 ? 5 7 ? 6 7 ? 6 7 ? 1 8 ? 2 8 ? 3 8 ? 4 8 ? 2 8 ? 3 8 ? 7 8 ? 1 9 ? 2 9 ? 8 9 ? 2 9 ? 3 9 ? 8 9 ? 9 10 ? 6 10 ? 7 10 ? 5 10 ? 6 10 ? 7 10 ? 8 10 ? 9 10 ? 1 11 ? 2 11 ? 8 11 ?...
result:
wrong output format Unexpected end of file - int32 expected