結果

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

ソースコード

diff # 

#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(const auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll,ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

int main()
{
    int n, u, v, w, x, s, t;
    cin >> n;
    vp res(n*n-n);
    int cnt1 = 0, cnt2 = 0, mx1 = 0, mx2 = 0, mem1 = 0, mem2 = 0;
    srep(i,1,n*n-n){
        cout << "? 1 " << i + 1 << endl;
        cin >> u >> v;
        res[i] = {u, v};
        if(v <= 0 && mx1 < abs(u) + abs(v)){
            mx1 = abs(u) + abs(v), mem1 = i;
        }
        if(u >= 0 && mx2 < abs(u) + abs(v)){
            mx2 = abs(u) + abs(v), mem2 = i;
        }
        if(u == 0) ++cnt1;
        else if(u > 0) ++cnt2;
    }
    assert(mem1 >= 0 && mem2 >= 0);
    if(mem1 == 0) res[0] = {n-1, n-1};
    else if(mem2 == 0) res[0] = {1, 0};
    else{
        res[0] = {0, 0};
        srep(i,1,n){
            int j = cnt1 - (i - 1);
            if(j < 0 || j >= n) continue;
            if((i - 1) * j == cnt2 && (i - res[mem1].fi == n - 1 || i - res[mem1].se == n - 1)){
                res[0].fi = i, res[0].se = j;
                break;
            }
        }
        assert(res[0].fi > 0);
    }
    auto in = [&](const int i, const int j){
        return (i >= 1 && i < n && j >= 0 && j < n);
    };
    map<P, bool> mp;
    if(res[0].fi == res[0].se){
        srep(i,1,n*n-n){
            u = res[0].fi - res[i].fi, v = res[0].se - res[i].se;
            w = res[0].fi - res[i].se, x = res[0].se - res[i].fi;
            if(in(u, v)){
                if(res[i].fi != res[i].se && in(w, x)){
                    auto it = mp.find(res[i]);
                    if(it == mp.end()){
                        cout << "? " << i + 1 << " " << mem2 + 1 << endl;
                        cin >> s >> t;
                        if(u == s + 1 || u == t + 1) mp[res[i]] = false, res[i] = {u, v};
                        else mp[res[i]] = true, res[i] = {w, x};
                    }else{
                        if(it->se) res[i] = {u, v};
                        else res[i] = {w, x};
                    }
                }else{
                    res[i] = {u, v};
                }
            }else{
                assert(in(w, x));
                res[i] = {w, x};
            }
        }
    }else{
        srep(i,1,n*n-n){
            u = res[0].fi - res[i].fi, v = res[0].se - res[i].se;
            w = res[0].fi - res[i].se, x = res[0].se - res[i].fi;
            if(in(u, v)){
                if(res[i].fi != res[i].se && in(w, x)){
                    auto it = mp.find(res[i]);
                    if(it == mp.end()){
                        cout << "? " << i + 1 << " " << mem1 + 1 << endl;
                        cin >> s >> t;
                        if(u == s + (n - 1) || u == t + (n - 1)) mp[res[i]] = false, res[i] = {u, v};
                        else mp[res[i]] = true, res[i] = {w, x};
                    }else{
                        if(it->se) res[i] = {u, v};
                        else res[i] = {w, x};
                    }
                }else{
                    res[i] = {u, v};
                }
            }else{
                assert(in(w, x));
                res[i] = {w, x};
            }
        }
    }
    cout << "!";
    rep(i,n*n-n){
        cout << " " << res[i].fi * n + res[i].se;
    }
    cout << endl;
    return 0;
}
0