結果
問題 | No.1306 Exactly 2 Digits |
ユーザー | rniya |
提出日時 | 2020-12-06 12:29:46 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 588 ms / 2,000 ms |
コード長 | 5,220 bytes |
コンパイル時間 | 2,255 ms |
コンパイル使用メモリ | 213,480 KB |
実行使用メモリ | 24,324 KB |
平均クエリ数 | 1236.78 |
最終ジャッジ日時 | 2023-09-24 09:14:16 |
合計ジャッジ時間 | 34,802 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
24,048 KB |
testcase_01 | AC | 25 ms
23,856 KB |
testcase_02 | AC | 25 ms
23,544 KB |
testcase_03 | AC | 25 ms
23,916 KB |
testcase_04 | AC | 25 ms
23,400 KB |
testcase_05 | AC | 24 ms
23,568 KB |
testcase_06 | AC | 25 ms
23,520 KB |
testcase_07 | AC | 25 ms
23,916 KB |
testcase_08 | AC | 24 ms
23,676 KB |
testcase_09 | AC | 24 ms
23,592 KB |
testcase_10 | AC | 25 ms
23,532 KB |
testcase_11 | AC | 25 ms
23,868 KB |
testcase_12 | AC | 23 ms
23,520 KB |
testcase_13 | AC | 24 ms
23,856 KB |
testcase_14 | AC | 24 ms
23,448 KB |
testcase_15 | AC | 24 ms
23,400 KB |
testcase_16 | AC | 24 ms
23,856 KB |
testcase_17 | AC | 25 ms
23,520 KB |
testcase_18 | AC | 24 ms
23,904 KB |
testcase_19 | AC | 24 ms
24,276 KB |
testcase_20 | AC | 25 ms
24,240 KB |
testcase_21 | AC | 25 ms
23,520 KB |
testcase_22 | AC | 25 ms
24,288 KB |
testcase_23 | AC | 25 ms
24,048 KB |
testcase_24 | AC | 25 ms
23,520 KB |
testcase_25 | AC | 24 ms
23,256 KB |
testcase_26 | AC | 23 ms
23,892 KB |
testcase_27 | AC | 24 ms
23,256 KB |
testcase_28 | AC | 25 ms
23,292 KB |
testcase_29 | AC | 25 ms
24,288 KB |
testcase_30 | AC | 25 ms
23,448 KB |
testcase_31 | AC | 24 ms
23,412 KB |
testcase_32 | AC | 25 ms
24,240 KB |
testcase_33 | AC | 24 ms
23,244 KB |
testcase_34 | AC | 25 ms
23,892 KB |
testcase_35 | AC | 25 ms
24,252 KB |
testcase_36 | AC | 24 ms
24,276 KB |
testcase_37 | AC | 24 ms
23,292 KB |
testcase_38 | AC | 24 ms
23,256 KB |
testcase_39 | AC | 25 ms
23,544 KB |
testcase_40 | AC | 25 ms
23,304 KB |
testcase_41 | AC | 25 ms
24,276 KB |
testcase_42 | AC | 25 ms
23,256 KB |
testcase_43 | AC | 25 ms
24,060 KB |
testcase_44 | AC | 26 ms
23,532 KB |
testcase_45 | AC | 28 ms
23,712 KB |
testcase_46 | AC | 28 ms
23,412 KB |
testcase_47 | AC | 29 ms
23,904 KB |
testcase_48 | AC | 31 ms
24,072 KB |
testcase_49 | AC | 31 ms
23,292 KB |
testcase_50 | AC | 32 ms
23,532 KB |
testcase_51 | AC | 35 ms
23,532 KB |
testcase_52 | AC | 38 ms
24,240 KB |
testcase_53 | AC | 43 ms
24,264 KB |
testcase_54 | AC | 41 ms
23,688 KB |
testcase_55 | AC | 45 ms
23,256 KB |
testcase_56 | AC | 49 ms
24,060 KB |
testcase_57 | AC | 53 ms
23,664 KB |
testcase_58 | AC | 58 ms
23,256 KB |
testcase_59 | AC | 59 ms
23,424 KB |
testcase_60 | AC | 69 ms
23,532 KB |
testcase_61 | AC | 78 ms
23,532 KB |
testcase_62 | AC | 81 ms
23,448 KB |
testcase_63 | AC | 89 ms
23,532 KB |
testcase_64 | AC | 92 ms
23,424 KB |
testcase_65 | AC | 103 ms
24,048 KB |
testcase_66 | AC | 116 ms
24,228 KB |
testcase_67 | AC | 123 ms
24,204 KB |
testcase_68 | AC | 132 ms
23,256 KB |
testcase_69 | AC | 148 ms
24,048 KB |
testcase_70 | AC | 160 ms
23,256 KB |
testcase_71 | AC | 176 ms
23,868 KB |
testcase_72 | AC | 185 ms
24,072 KB |
testcase_73 | AC | 199 ms
23,712 KB |
testcase_74 | AC | 223 ms
23,508 KB |
testcase_75 | AC | 237 ms
23,400 KB |
testcase_76 | AC | 261 ms
24,084 KB |
testcase_77 | AC | 286 ms
23,268 KB |
testcase_78 | AC | 320 ms
24,204 KB |
testcase_79 | AC | 351 ms
24,252 KB |
testcase_80 | AC | 374 ms
23,484 KB |
testcase_81 | AC | 377 ms
23,388 KB |
testcase_82 | AC | 433 ms
24,276 KB |
testcase_83 | AC | 494 ms
23,496 KB |
testcase_84 | AC | 511 ms
23,700 KB |
testcase_85 | AC | 578 ms
24,264 KB |
testcase_86 | AC | 485 ms
23,916 KB |
testcase_87 | AC | 532 ms
23,256 KB |
testcase_88 | AC | 588 ms
23,508 KB |
testcase_89 | AC | 495 ms
23,664 KB |
testcase_90 | AC | 547 ms
23,520 KB |
testcase_91 | AC | 470 ms
24,240 KB |
testcase_92 | AC | 516 ms
24,240 KB |
testcase_93 | AC | 503 ms
23,508 KB |
testcase_94 | AC | 453 ms
23,904 KB |
testcase_95 | AC | 488 ms
23,568 KB |
testcase_96 | AC | 439 ms
24,240 KB |
testcase_97 | AC | 508 ms
23,976 KB |
testcase_98 | AC | 439 ms
23,532 KB |
testcase_99 | AC | 460 ms
23,400 KB |
testcase_100 | AC | 463 ms
23,244 KB |
testcase_101 | AC | 507 ms
23,676 KB |
testcase_102 | AC | 450 ms
24,264 KB |
testcase_103 | AC | 457 ms
23,292 KB |
testcase_104 | AC | 482 ms
23,520 KB |
testcase_105 | AC | 560 ms
23,916 KB |
testcase_106 | AC | 480 ms
24,132 KB |
testcase_107 | AC | 559 ms
24,324 KB |
testcase_108 | AC | 545 ms
23,508 KB |
testcase_109 | AC | 564 ms
24,216 KB |
testcase_110 | AC | 481 ms
24,228 KB |
testcase_111 | AC | 549 ms
23,508 KB |
testcase_112 | AC | 450 ms
23,400 KB |
testcase_113 | AC | 585 ms
23,532 KB |
testcase_114 | AC | 548 ms
23,508 KB |
testcase_115 | AC | 531 ms
24,048 KB |
testcase_116 | AC | 585 ms
23,424 KB |
testcase_117 | AC | 532 ms
23,640 KB |
testcase_118 | AC | 574 ms
24,132 KB |
testcase_119 | AC | 558 ms
23,556 KB |
testcase_120 | AC | 481 ms
23,412 KB |
testcase_121 | AC | 494 ms
23,892 KB |
testcase_122 | AC | 496 ms
23,676 KB |
コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内: main.cpp:201:22: 警告: ‘other’ may be used uninitialized [-Wmaybe-uninitialized] 201 | if (query(other,pos[i][0])==calc(ans[other],i)) ans[pos[i][0]]=i; | ~~~~~^~~~~~~~~~~~~~~~~ main.cpp:185:9: 備考: ‘other’ はここで定義されています 185 | int other; | ^~~~~
ソースコード
#include <bits/stdc++.h> using namespace std; const long long MOD=1000000007; // const long long MOD=998244353; #define LOCAL #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(),(x).end() const int INF=1e9; const long long IINF=1e18; const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1}; const char dir[4]={'D','R','U','L'}; template<typename T> istream &operator>>(istream &is,vector<T> &v){ for (T &x:v) is >> x; return is; } template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const pair<T,U> &p){ os << '(' << p.first << ',' << p.second << ')'; return os; } template<typename T,typename U,typename V> ostream&operator<<(ostream &os,const tuple<T,U,V> &t){ os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template<typename T,typename U,typename V,typename W> ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){ os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; } os << '}'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const unordered_map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const multiset<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const unordered_set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const deque<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } void debug_out(){cerr << '\n';} template<class Head,class... Tail> void debug_out(Head&& head,Tail&&... tail){ cerr << head; if (sizeof...(Tail)>0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) cerr << " ";\ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\ cerr << " ";\ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;} template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;} template<class T1,class T2> inline bool chmin(T1 &a,T2 b){ if (a>b){a=b; return true;} return false; } template<class T1,class T2> inline bool chmax(T1 &a,T2 b){ if (a<b){a=b; return true;} return false; } #pragma endregion int N; pair<int,int> query(int i,int j){ cout << "? " << i+1 << ' ' << j+1 << endl; int p,q; cin >> p >> q; return {p,q}; } void answer(vector<int> v){ cout << '!'; for (int i=0;i<v.size();++i) cout << ' ' << v[i]; cout << endl; } pair<int,int> calc(int i,int j){ int p=i/N-j/N,q=i%N-j%N; if (p>q) swap(p,q); return {p,q}; } vector<pair<int,int>> gen(int x){ vector<pair<int,int>> res; for (int i=N;i<N*N;++i){ res.emplace_back(calc(x,i)); } sort(res.begin(),res.end()); return res; } int main(){ cin.tie(0); ios::sync_with_stdio(false); cin >> N; int n=N*N-N; vector<int> ans(n,-1); vector<pair<int,int>> ret; ret.emplace_back(0,0); for (int i=1;i<n;++i) ret.emplace_back(query(0,i)); vector<pair<int,int>> sorted(ret); sort(sorted.begin(),sorted.end()); for (int i=N;i<N*N;++i){ if (sorted==gen(i)){ ans[0]=i; } } vector<vector<int>> pos(N*N); for (int i=1;i<n;++i){ for (int j=N;j<N*N;++j){ if (calc(ans[0],j)==ret[i]){ pos[j].emplace_back(i); } } } int other; for (int i=0;i<N*N;++i){ if (pos[i].size()==1){ ans[pos[i][0]]=i; auto p=calc(ans[0],i); if (p.first!=p.second) other=pos[i][0]; } } for (int i=0;i<N*N;++i){ if (pos[i].size()<2) continue; if (~ans[pos[i][0]]){ ans[pos[i][1]]=i; } else if (~ans[pos[i][1]]){ ans[pos[i][0]]=i; } else { if (query(other,pos[i][0])==calc(ans[other],i)) ans[pos[i][0]]=i; else ans[pos[i][1]]=i; } } answer(ans); }