結果
| 問題 | No.1306 Exactly 2 Digits |
| ユーザー |
 hotman78
|
| 提出日時 | 2020-12-03 09:55:14 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 698 ms / 2,000 ms |
| コード長 | 7,008 bytes |
| コンパイル時間 | 21,529 ms |
| コンパイル使用メモリ | 330,376 KB |
| 最終ジャッジ日時 | 2025-01-16 14:18:23 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 123 |
ソースコード
#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 returnvector(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;}