#932653 (C++17(clang)) No.471 直列回転機

• 問題: No.471 直列回転機
• ユーザー: Taiki0715
• 提出日時: 2023-11-30 15:45:47
• 言語: C++17(clang) (17.0.6 + boost 1.83.0)
• 結果: AC
• 実行時間: 470 ms / 3,141 ms
• コード長: 2,922 bytes
• コンパイル時間: 3,912 ms
• コンパイル使用メモリ: 178,244 KB
• 実行使用メモリ: 24,012 KB
• 平均クエリ数: 19588.39
• 最終ジャッジ日時: 2023-11-30 15:46:09
• 合計ジャッジ時間: 21,463 ms
• ジャッジサーバーID （参考情報）: judge11 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	27 ms; 24,012 KB
testcase_01	AC	21 ms; 24,000 KB
testcase_02	AC	22 ms; 24,000 KB
testcase_03	AC	22 ms; 24,000 KB
testcase_04	AC	23 ms; 24,000 KB
testcase_05	AC	28 ms; 24,000 KB
testcase_06	AC	26 ms; 24,000 KB
testcase_07	AC	23 ms; 24,000 KB
testcase_08	AC	55 ms; 24,000 KB
testcase_09	AC	53 ms; 24,000 KB
testcase_10	AC	38 ms; 24,000 KB
testcase_11	AC	189 ms; 24,000 KB
testcase_12	AC	395 ms; 24,012 KB
testcase_13	AC	398 ms; 24,012 KB
testcase_14	AC	419 ms; 24,012 KB
testcase_15	AC	468 ms; 24,000 KB
testcase_16	AC	25 ms; 24,012 KB
testcase_17	AC	23 ms; 24,000 KB
testcase_18	AC	22 ms; 24,000 KB
testcase_19	AC	23 ms; 24,000 KB
testcase_20	AC	470 ms; 24,012 KB
testcase_21	AC	94 ms; 24,012 KB
testcase_22	AC	398 ms; 24,012 KB
testcase_23	AC	378 ms; 24,012 KB
testcase_24	AC	221 ms; 24,012 KB
testcase_25	AC	81 ms; 24,012 KB
testcase_26	AC	463 ms; 24,012 KB
testcase_27	AC	200 ms; 24,012 KB
testcase_28	AC	253 ms; 24,012 KB
testcase_29	AC	289 ms; 24,012 KB
testcase_30	AC	114 ms; 24,012 KB
testcase_31	AC	435 ms; 24,012 KB
testcase_32	AC	389 ms; 24,012 KB
testcase_33	AC	281 ms; 24,012 KB
testcase_34	AC	432 ms; 24,012 KB
testcase_35	AC	102 ms; 24,012 KB
testcase_36	AC	180 ms; 24,012 KB
testcase_37	AC	55 ms; 24,012 KB
testcase_38	AC	86 ms; 24,012 KB
testcase_39	AC	143 ms; 24,012 KB
testcase_40	AC	340 ms; 24,012 KB
testcase_41	AC	454 ms; 24,012 KB
testcase_42	AC	290 ms; 24,012 KB
testcase_43	AC	429 ms; 24,012 KB
testcase_44	AC	56 ms; 24,012 KB
testcase_45	AC	272 ms; 24,012 KB
testcase_46	AC	317 ms; 24,012 KB
testcase_47	AC	415 ms; 24,012 KB
testcase_48	AC	353 ms; 24,012 KB
testcase_49	AC	345 ms; 24,012 KB
testcase_50	AC	403 ms; 24,012 KB
testcase_51	AC	167 ms; 24,012 KB
testcase_52	AC	25 ms; 24,012 KB
testcase_53	AC	25 ms; 24,012 KB
testcase_54	AC	26 ms; 24,012 KB
testcase_55	AC	112 ms; 24,012 KB
testcase_56	AC	93 ms; 24,012 KB
testcase_57	AC	71 ms; 24,012 KB
testcase_58	AC	41 ms; 24,012 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcount(x)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
pair<int,int>out(pair<int,int>a){
  cout<<"? "<<a<<endl;
  pair<int,int>ret;
  cin>>ret;
  return ret;
}
void SOLVE(){
  int m;
  cin>>m;
  vector<pair<int,int>>a(m);
  cin>>a;
  pair<int,int>x=out({0,0});
  pair<int,int>y=out({0,1});
  cout<<"!\n";
  if(x.first==y.first){
    if(x.second+1==y.second){
      for(auto [i,j]:a){
        cout<<i+x.first<<' '<<j+x.second<<endl;
      }
    }
    else if(x.second==y.second+1){
      for(auto [i,j]:a){
        cout<<x.first-i<<' '<<x.second-j<<endl;
      }
    }
    else exit(1);
  }
  else if(x.second==y.second){
    if(x.first+1==y.first){
      for(auto [i,j]:a){
        cout<<x.first+j<<' '<<x.second-i<<endl;
      }
    }
    else if(x.first==y.first+1){
      for(auto [i,j]:a){
        cout<<x.first-j<<' '<<x.second+i<<endl;
      }
    }
    else exit(1);
  }
  else exit(1);
}