結果

問題 No.1306 Exactly 2 Digits
ユーザー hotman78hotman78
提出日時 2020-12-03 09:55:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 583 ms / 2,000 ms
コード長 7,008 bytes
コンパイル時間 5,604 ms
コンパイル使用メモリ 273,376 KB
実行使用メモリ 25,580 KB
平均クエリ数 1238.20
最終ジャッジ日時 2024-07-17 08:32:55
合計ジャッジ時間 37,718 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
25,196 KB
testcase_01 AC 24 ms
24,812 KB
testcase_02 AC 22 ms
25,204 KB
testcase_03 AC 24 ms
25,220 KB
testcase_04 AC 24 ms
25,092 KB
testcase_05 AC 23 ms
25,220 KB
testcase_06 AC 23 ms
24,836 KB
testcase_07 AC 24 ms
25,220 KB
testcase_08 AC 23 ms
24,836 KB
testcase_09 AC 24 ms
25,220 KB
testcase_10 AC 24 ms
24,580 KB
testcase_11 AC 24 ms
25,220 KB
testcase_12 AC 24 ms
25,220 KB
testcase_13 AC 25 ms
25,196 KB
testcase_14 AC 23 ms
24,812 KB
testcase_15 AC 24 ms
24,940 KB
testcase_16 AC 23 ms
25,196 KB
testcase_17 AC 24 ms
24,812 KB
testcase_18 AC 23 ms
24,940 KB
testcase_19 AC 24 ms
24,892 KB
testcase_20 AC 23 ms
24,812 KB
testcase_21 AC 23 ms
24,812 KB
testcase_22 AC 24 ms
24,940 KB
testcase_23 AC 23 ms
25,196 KB
testcase_24 AC 24 ms
25,196 KB
testcase_25 AC 25 ms
24,556 KB
testcase_26 AC 24 ms
24,556 KB
testcase_27 AC 23 ms
25,196 KB
testcase_28 AC 23 ms
24,556 KB
testcase_29 AC 24 ms
24,812 KB
testcase_30 AC 24 ms
25,452 KB
testcase_31 AC 24 ms
24,812 KB
testcase_32 AC 24 ms
24,940 KB
testcase_33 AC 25 ms
25,196 KB
testcase_34 AC 24 ms
24,812 KB
testcase_35 AC 24 ms
24,940 KB
testcase_36 AC 24 ms
24,556 KB
testcase_37 AC 25 ms
24,940 KB
testcase_38 AC 25 ms
24,556 KB
testcase_39 AC 24 ms
25,196 KB
testcase_40 AC 25 ms
25,196 KB
testcase_41 AC 27 ms
25,168 KB
testcase_42 AC 25 ms
24,556 KB
testcase_43 AC 26 ms
24,812 KB
testcase_44 AC 27 ms
25,196 KB
testcase_45 AC 27 ms
25,052 KB
testcase_46 AC 28 ms
25,196 KB
testcase_47 AC 28 ms
24,556 KB
testcase_48 AC 30 ms
24,836 KB
testcase_49 AC 31 ms
24,812 KB
testcase_50 AC 33 ms
25,196 KB
testcase_51 AC 35 ms
25,324 KB
testcase_52 AC 38 ms
25,196 KB
testcase_53 AC 42 ms
24,812 KB
testcase_54 AC 42 ms
24,812 KB
testcase_55 AC 46 ms
25,196 KB
testcase_56 AC 51 ms
25,580 KB
testcase_57 AC 54 ms
24,556 KB
testcase_58 AC 59 ms
24,556 KB
testcase_59 AC 62 ms
24,812 KB
testcase_60 AC 73 ms
25,196 KB
testcase_61 AC 81 ms
24,556 KB
testcase_62 AC 85 ms
25,196 KB
testcase_63 AC 94 ms
24,812 KB
testcase_64 AC 100 ms
25,196 KB
testcase_65 AC 107 ms
25,196 KB
testcase_66 AC 121 ms
24,556 KB
testcase_67 AC 132 ms
25,196 KB
testcase_68 AC 139 ms
25,196 KB
testcase_69 AC 153 ms
25,324 KB
testcase_70 AC 167 ms
24,812 KB
testcase_71 AC 181 ms
24,940 KB
testcase_72 AC 195 ms
25,196 KB
testcase_73 AC 209 ms
24,812 KB
testcase_74 AC 235 ms
24,812 KB
testcase_75 AC 251 ms
24,940 KB
testcase_76 AC 275 ms
24,544 KB
testcase_77 AC 302 ms
24,556 KB
testcase_78 AC 327 ms
25,452 KB
testcase_79 AC 358 ms
24,812 KB
testcase_80 AC 384 ms
24,556 KB
testcase_81 AC 390 ms
24,812 KB
testcase_82 AC 434 ms
24,812 KB
testcase_83 AC 495 ms
24,812 KB
testcase_84 AC 504 ms
24,940 KB
testcase_85 AC 582 ms
25,196 KB
testcase_86 AC 494 ms
24,556 KB
testcase_87 AC 530 ms
25,196 KB
testcase_88 AC 583 ms
25,196 KB
testcase_89 AC 496 ms
24,556 KB
testcase_90 AC 550 ms
25,452 KB
testcase_91 AC 467 ms
24,812 KB
testcase_92 AC 519 ms
24,940 KB
testcase_93 AC 506 ms
25,184 KB
testcase_94 AC 456 ms
24,812 KB
testcase_95 AC 495 ms
24,556 KB
testcase_96 AC 455 ms
24,800 KB
testcase_97 AC 516 ms
25,160 KB
testcase_98 AC 448 ms
25,196 KB
testcase_99 AC 469 ms
24,940 KB
testcase_100 AC 466 ms
24,556 KB
testcase_101 AC 506 ms
25,196 KB
testcase_102 AC 454 ms
25,184 KB
testcase_103 AC 456 ms
25,052 KB
testcase_104 AC 492 ms
24,812 KB
testcase_105 AC 555 ms
24,812 KB
testcase_106 AC 478 ms
25,196 KB
testcase_107 AC 558 ms
24,556 KB
testcase_108 AC 550 ms
25,452 KB
testcase_109 AC 579 ms
25,196 KB
testcase_110 AC 485 ms
24,556 KB
testcase_111 AC 554 ms
24,812 KB
testcase_112 AC 449 ms
25,196 KB
testcase_113 AC 581 ms
25,180 KB
testcase_114 AC 541 ms
25,196 KB
testcase_115 AC 523 ms
24,940 KB
testcase_116 AC 580 ms
25,196 KB
testcase_117 AC 527 ms
24,812 KB
testcase_118 AC 573 ms
25,452 KB
testcase_119 AC 554 ms
25,184 KB
testcase_120 AC 478 ms
24,812 KB
testcase_121 AC 497 ms
24,556 KB
testcase_122 AC 495 ms
24,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)output(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define rep(i,...) for(auto i:range(__VA_ARGS__)) 
#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
//#include "../graph_tree/graph_template.hpp"
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
#line 2 "code.cpp"

// template<typename T>
// struct poly{
//     valarray<T> v;
//     using P=poly<T>;
//     poly(int sz=0,T x=T()){
//         v.resize(sz,x);
//     }
//     int size()const{return v.size();}
//     P& operator+=(const P& x){v.resize(max(size(),x.size()));v+=x.v;return *this;}
//     P& operator-=(const P& x){v.resize(max(size(),x.size()));v-=x.v;return *this;}
//     P& operator*=(const P& x){v.resize(max(size(),x.size()));v*=x.v;return *this;}
//     P& operator/=(const P& x){v.resize(max(size(),x.size()));v/=x.v;return *this;}
//     P& operator%=(const P& x){v.resize(max(size(),x.size()));v%=x.v;return *this;}
//     P& operator^=(const P& x){v.resize(max(size(),x.size()));v^=x.v;return *this;}
//     P& operator&=(const P& x){v.resize(max(size(),x.size()));v&=x.v;return *this;}
//     P& operator|=(const P& x){v.resize(max(size(),x.size()));v|=x.v;return *this;}
//     T& operator[](int x){return v[x];}
//     T operator[](int x)const{return v[x];}
//     friend P min(const P& s,const P& t){
//         if(s.size()>t.size()){
//             P res=s;
//             for(int i=0;i<t.size();++i)res[i]=min(res[i],t[i]);
//             return res;
//         }else{
//             P res=t;
//             for(int i=0;i<s.size();++i)res[i]=min(res[i],s[i]);
//             return res;
//         }
//     }
//     friend P max(const P& s,const P& t){
//         if(s.size()>t.size()){
//             P res=s;
//             for(int i=0;i<t.size();++i)res[i]=max(res[i],t[i]);
//             return res;
//         }else{
//             P res=t;
//             for(int i=0;i<s.size();++i)res[i]=max(res[i],s[i]);
//             return res;
//         }
//     }
//     P& shift(int x){v.shift(x);return *this;}
//     template<typename F>P& apply(F f){for(auto& e:v)f(e);return *this;}
//     iterator begin(){return begin(v);}
//     iterator end(){return end(v);}
// };

int main(){
    lint n;
    cin>>n;
    map<int,map<int,vector<int>>>m;
    map<int,map<int,vector<int>>>m2;
    map<int,int>tmp2;
    map<int,vector<pair<int,int>>>tmp;
    rep(i,n*n-n){
        cout<<"?"<<" "<<(i+1)<<" "<<1<<endl<<flush;
        lint p,q;
        cin>>p>>q;
        m[p][q].emplace_back(i);
        tmp[p+q].emplace_back(p,q);
        tmp2[p+q]=i;
    }
    for(auto& [s,t]:tmp){
        sort(all(t));
    }
    lint s=0;
    rep(i,n,n*n){
        map<int,vector<pair<int,int>>>m2;
        rep(j,n,n*n){
            lint p=j/n-i/n;
            lint q=j%n-i%n;
            if(p>q)swap(p,q);
            m2[p+q].emplace_back(p,q);
        }
        for(auto& [s,t]:m2){
            sort(all(t));
        }
        if(tmp==m2){
            s=i;
        }
    }
    assert(s);
    rep(i,n,n*n){
        lint p=i/n-s/n;
        lint q=i%n-s%n;
        if(p>q)swap(p,q);
        m2[p][q].emplace_back(i);
    }
    lint n2=0;
    {
        lint p=(n-1)-s/n;
        lint q=0-s%n;
        if(p>q)swap(p,q);
        assert(m[p][q].size()>=1);
        if(m[p][q].size()>=2){
            lint k=tmp2.rbegin()->second;
            cout<<"? "<<m[p][q][0]+1<<" "<<(k+1)<<endl<<flush;
            lint s,t;
            cin>>s>>t;
            lint p2=1-n;
            lint q2=0;
            if(p2==s&&q2==t){
                n2=m[p][q][0];   
            }else{
                n2=m[p][q][1];
            }
        }else{
            n2=m[p][q][0];
        }
    }
    vector<int>ans(n*n-n);
    for(auto [p,e]:m)for(auto [q,d]:e){
        if(d.size()==1){
            ans[d[0]]=m2[p][q][0];
        }else{
            cout<<"? "<<(d[0]+1)<<" "<<(n2+1)<<endl<<flush;
            lint s,t;
            cin>>s>>t;
            lint k=m2[p][q][0];
            lint p2=k/n-(n-1),q2=k%n;
            if(p2>q2)swap(p2,q2);
            if(p2==s&&q2==t){
                ans[d[0]]=m2[p][q][0];
                ans[d[1]]=m2[p][q][1];
            }else{
                ans[d[0]]=m2[p][q][1];
                ans[d[1]]=m2[p][q][0];
            }
        }
    }
    cout<<"! ";
    output(ans);
    cout<<flush;
}
0