結果

問題 No.1306 Exactly 2 Digits
コンテスト
ユーザー kiyoshi0205
提出日時 2020-12-03 01:49:42
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 147 ms / 2,000 ms
コード長 5,633 bytes
コンパイル時間 3,561 ms
コンパイル使用メモリ 216,652 KB
実行使用メモリ 25,476 KB
平均クエリ数 1236.78
最終ジャッジ日時 2024-07-17 08:08:25
合計ジャッジ時間 17,548 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 123
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
// const ll mod=998244353;
const ll inf=1LL<<60;
const double PI=acos(-1);
const double eps=1e-9;
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";ll i;
  rep(i,v.size()){
    if(i)os<<",";
    os<<v[i];
  }
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a,ll m=mod) {
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,ll m=mod){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}
ll N;
datas judge(ll i,ll j){
  ll a,b;
  a=i/N-j/N;
  b=i%N-j%N;
  return datas(min(a,b),max(a,b));
}
datas queli(ll i,ll j){
  cout<<"? "<<i+1<<" "<<j+1<<endl;
  ll a,b;
  cin>>a>>b;
  return datas(a,b);
}
int main(){
  // startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j;
  cin>>N;
  vec ans(N*N-N,-1),sum(N*N-N,0);
  pvec res(N*N-N);
  pvec ssum(N*N-N,datas(0,0));
  rep1(i,N*N-N){
    res[i]=queli(i,0);
    sum[i]=res[i].first+res[i].second;
    ssum[i]=datas(sum[i],i);
  }
  set<ll> constindexlist;
  vsort(ssum);
  for(auto& x:sum)x-=ssum[0].first-1;
  ans[i=ssum[0].second]=N;
  ans[j=ssum.back().second]=N*N-1;
  constindexlist.insert(i);
  constindexlist.insert(j);
  constindexlist.insert(0);
  if(i&&j){
    ans[0]=(-res[i].first+1)*N-res[i].second;
    vec checker1,checker2;
    for(auto x:res){checker1.eb(x.first);checker1.eb(x.second);}
    For(j,N,N*N){
      datas x=judge(j,ans[0]);
      checker2.eb(x.first);checker2.eb(x.second);
    }
    vsort(checker1);vsort(checker2);
    if(checker1!=checker2)ans[0]=(-res[i].second+1)*N-res[i].first;
  }
  debug(ans);
  map<datas,vec> checker;
  For(j,N,N*N)checker[judge(j,ans[0])].eb(j);
  set<ll> judgeindexlist;
  rep1(i,N*N-N){
    auto& x=checker[res[i]];
    assert(x.size());
    if(x.size()==1){
      constindexlist.insert(i);
      ans[i]=x[0];
    }else judgeindexlist.insert(i);
  }
  debug(ans);
  debug(res);
  while(!judgeindexlist.empty()){
    i=*judgeindexlist.begin();
    auto& v=checker[res[i]];
    assert(v.size()==2);
    for(auto p:constindexlist){
      if(judge(ans[p],v[0])!=judge(ans[p],v[1])){
        j=p;
        break;
      }
    }
    // jで試してみる
    int nowjudge=queli(j,i)==judge(ans[j],v[1]);
    ans[i]=v[nowjudge];
    judgeindexlist.erase(i);
    constindexlist.insert(i);
    // debug(i,res);
    rep(j,N*N-N)if(i!=j&&res[i]==res[j])break;
    // debug(j);
    judgeindexlist.erase(j);
    constindexlist.insert(j);
    ans[j]=v[nowjudge^1];
    debug(ans);
  }
  cout<<"! ";
  output(ans);
// }
}
0