#588507 (C++17) No.1306 Exactly 2 Digits

提出ソース

結果

問題	No.1306 Exactly 2 Digits
ユーザー	👑 tute7627
提出日時	2020-12-03 01:36:29
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	513 ms / 2,000 ms
コード長	5,222 bytes
コンパイル時間	2,936 ms
コンパイル使用メモリ	225,052 KB
実行使用メモリ	25,580 KB
平均クエリ数	1236.78
最終ジャッジ日時	2024-07-17 08:06:45
合計ジャッジ時間	33,680 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	28 ms 25,196 KB
testcase_01	AC	25 ms 24,556 KB
testcase_02	AC	25 ms 25,220 KB
testcase_03	AC	25 ms 25,064 KB
testcase_04	AC	25 ms 24,836 KB
testcase_05	AC	24 ms 25,092 KB
testcase_06	AC	24 ms 24,836 KB
testcase_07	AC	25 ms 24,836 KB
testcase_08	AC	24 ms 24,836 KB
testcase_09	AC	25 ms 24,964 KB
testcase_10	AC	27 ms 24,836 KB
testcase_11	AC	26 ms 24,832 KB
testcase_12	AC	26 ms 24,580 KB
testcase_13	AC	26 ms 24,556 KB
testcase_14	AC	25 ms 24,812 KB
testcase_15	AC	27 ms 25,196 KB
testcase_16	AC	26 ms 24,812 KB
testcase_17	AC	26 ms 25,580 KB
testcase_18	AC	26 ms 24,940 KB
testcase_19	AC	25 ms 24,940 KB
testcase_20	AC	25 ms 24,796 KB
testcase_21	AC	25 ms 24,800 KB
testcase_22	AC	25 ms 24,812 KB
testcase_23	AC	28 ms 25,196 KB
testcase_24	AC	26 ms 25,196 KB
testcase_25	AC	26 ms 24,812 KB
testcase_26	AC	28 ms 24,812 KB
testcase_27	AC	29 ms 25,196 KB
testcase_28	AC	27 ms 24,940 KB
testcase_29	AC	27 ms 24,812 KB
testcase_30	AC	27 ms 24,556 KB
testcase_31	AC	29 ms 25,196 KB
testcase_32	AC	27 ms 25,196 KB
testcase_33	AC	27 ms 24,940 KB
testcase_34	AC	26 ms 25,196 KB
testcase_35	AC	26 ms 24,812 KB
testcase_36	AC	27 ms 25,452 KB
testcase_37	AC	29 ms 25,196 KB
testcase_38	AC	30 ms 25,196 KB
testcase_39	AC	26 ms 24,812 KB
testcase_40	AC	27 ms 24,812 KB
testcase_41	AC	26 ms 25,196 KB
testcase_42	AC	29 ms 25,196 KB
testcase_43	AC	31 ms 24,940 KB
testcase_44	AC	29 ms 24,940 KB
testcase_45	AC	29 ms 24,812 KB
testcase_46	AC	30 ms 24,940 KB
testcase_47	AC	30 ms 25,196 KB
testcase_48	AC	31 ms 25,196 KB
testcase_49	AC	31 ms 24,940 KB
testcase_50	AC	34 ms 24,940 KB
testcase_51	AC	35 ms 25,452 KB
testcase_52	AC	37 ms 24,940 KB
testcase_53	AC	41 ms 24,556 KB
testcase_54	AC	40 ms 24,940 KB
testcase_55	AC	44 ms 24,556 KB
testcase_56	AC	47 ms 25,196 KB
testcase_57	AC	51 ms 24,812 KB
testcase_58	AC	57 ms 25,196 KB
testcase_59	AC	59 ms 24,556 KB
testcase_60	AC	67 ms 24,940 KB
testcase_61	AC	72 ms 24,940 KB
testcase_62	AC	77 ms 24,812 KB
testcase_63	AC	86 ms 25,196 KB
testcase_64	AC	85 ms 24,556 KB
testcase_65	AC	94 ms 25,196 KB
testcase_66	AC	106 ms 25,196 KB
testcase_67	AC	114 ms 25,196 KB
testcase_68	AC	120 ms 24,556 KB
testcase_69	AC	134 ms 24,940 KB
testcase_70	AC	143 ms 24,556 KB
testcase_71	AC	162 ms 24,812 KB
testcase_72	AC	165 ms 25,196 KB
testcase_73	AC	174 ms 25,196 KB
testcase_74	AC	199 ms 24,940 KB
testcase_75	AC	207 ms 24,812 KB
testcase_76	AC	238 ms 24,796 KB
testcase_77	AC	255 ms 24,812 KB
testcase_78	AC	273 ms 24,812 KB
testcase_79	AC	303 ms 24,812 KB
testcase_80	AC	324 ms 24,812 KB
testcase_81	AC	326 ms 24,928 KB
testcase_82	AC	380 ms 24,812 KB
testcase_83	AC	429 ms 24,812 KB
testcase_84	AC	444 ms 24,940 KB
testcase_85	AC	499 ms 24,812 KB
testcase_86	AC	424 ms 24,812 KB
testcase_87	AC	452 ms 24,544 KB
testcase_88	AC	513 ms 24,940 KB
testcase_89	AC	428 ms 24,812 KB
testcase_90	AC	481 ms 24,812 KB
testcase_91	AC	400 ms 25,184 KB
testcase_92	AC	449 ms 24,556 KB
testcase_93	AC	435 ms 25,068 KB
testcase_94	AC	392 ms 25,196 KB
testcase_95	AC	422 ms 25,168 KB
testcase_96	AC	394 ms 24,940 KB
testcase_97	AC	442 ms 24,812 KB
testcase_98	AC	386 ms 24,812 KB
testcase_99	AC	401 ms 24,812 KB
testcase_100	AC	398 ms 24,812 KB
testcase_101	AC	434 ms 25,196 KB
testcase_102	AC	389 ms 25,196 KB
testcase_103	AC	391 ms 24,556 KB
testcase_104	AC	415 ms 24,812 KB
testcase_105	AC	475 ms 25,196 KB
testcase_106	AC	407 ms 24,928 KB
testcase_107	AC	481 ms 25,196 KB
testcase_108	AC	470 ms 24,556 KB
testcase_109	AC	492 ms 25,196 KB
testcase_110	AC	412 ms 25,052 KB
testcase_111	AC	476 ms 24,812 KB
testcase_112	AC	380 ms 24,940 KB
testcase_113	AC	492 ms 24,940 KB
testcase_114	AC	469 ms 24,812 KB
testcase_115	AC	448 ms 24,556 KB
testcase_116	AC	500 ms 24,812 KB
testcase_117	AC	461 ms 24,556 KB
testcase_118	AC	490 ms 24,812 KB
testcase_119	AC	470 ms 24,812 KB
testcase_120	AC	411 ms 25,196 KB
testcase_121	AC	428 ms 25,196 KB
testcase_122	AC	426 ms 24,812 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

//#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
struct RandomNumberGenerator {
  mt19937_64 mt;

  RandomNumberGenerator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}

  ll operator()(ll a, ll b) { // [a, b)
    uniform_int_distribution< ll > dist(a, b - 1);
    return dist(mt);
  }

  ll operator()(ll b) { // [0, b)
    return (*this)(0, b);
  }
};
//#define _DEBUG

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  vector<ll>a;
  ll n;cin>>n;
  auto ask=[&](ll i,ll j){
    ll p,q;
    #ifdef _DEBUG
    p=a[i]/n-a[j]/n;
    q=a[i]%n-a[j]%n;
    if(p>q)swap(p,q);
    cout<<"?" spa i+1 spa j+1<<endl;
    cout<<p spa q<<endl;
    #else
    cout<<"?" spa i+1 spa j+1<<endl;
    cin>>p>>q;
    #endif
    return MP(p,q);
  };
  map<ll,ll>mp;
  ll sz=n*n-n;
  #ifdef _DEBUG
  a.assign(sz,0);
  rep(i,0,sz)cin>>a[i];
  #endif
  ll k=0;
  //RandomNumberGenerator rng;
  //k=rng(0,sz);
  vector<P>p(sz);
  rep(i,0,sz){
    if(i==k)continue;
    p[i]=ask(k,i);
    mp[p[i].fi]++;
    mp[p[i].se]++;
  }
  ll xr=-1,yr=-1;
  vector<P>tmp(p.begin(),p.end());
  sort(ALL(tmp));
  rep(x,1,n)rep(y,0,n){
    vector<P>v;
    rep(i,1,n)rep(j,0,n){
      v.EB(x-i,y-j);
      if(v.back().fi>v.back().se)swap(v.back().fi,v.back().se);
    }
    sort(ALL(v));
    //debug(tmp,tmp.size());
    //debug(v,v.size());
    if(v==tmp){
      assert(xr==-1&&yr==-1);
      xr=x,yr=y;
    }
  }
  //return 0;
  assert(xr!=-1);
  //cout<<xr spa yr<<endl;
  vector<bool>dame(sz);
  rep(i,0,sz)rep(j,i+1,sz){
    if(p[i]==p[j]){
      dame[i]=true;
      dame[j]=true;
    }
  }
  rep(i,0,sz){
    if(!dame[i]){
      if(xr-p[i].fi<1||xr-p[i].fi>=n||yr-p[i].se<0||yr-p[i].se>=n){
        swap(p[i].fi,p[i].se);
      }
    }
  }
  ll s=-1,sx=-1,sy=-1;
  rep(i,0,sz){
    if(i!=k&&!dame[i]&&(p[i].fi==0||p[i].se==0)){
      s=i;
      sx=xr-p[i].fi;
      sy=yr-p[i].se;
    }
  }
  //cout<<p<<endl;
  rep(i,0,sz)rep(j,i+1,sz){
    if(p[i]==p[j]){
      assert(s!=-1);
      //cout<<i spa j spa s spa sx spa sy<<endl;
      auto tp=ask(s,i);
      auto xi=MP(xr-p[i].fi,yr-p[i].se);
      auto xj=MP(xr-p[i].se,yr-p[i].fi);
      auto si=MP(sx-xi.fi,sy-xi.se);
      if(si.fi>si.se)swap(si.fi,si.se);
      if(tp!=si)swap(p[i].fi,p[i].se);
      else swap(p[j].fi,p[j].se);
    }
  }
  vector<ll>ret(sz);
  rep(i,0,sz){
    ll x=xr-p[i].fi,y=yr-p[i].se;
    //cout<<x spa y spa x*n+y<<endl;
    ret[i]=x*n+y;
  }
  cout<<"! ";
  debug(ret,sz);
  return 0;
}

yukicoder

結果

テストケース

ソースコード