結果
問題 | No.1306 Exactly 2 Digits |
ユーザー | KKT89 |
提出日時 | 2020-12-04 15:29:16 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,774 bytes |
コンパイル時間 | 2,511 ms |
コンパイル使用メモリ | 221,688 KB |
実行使用メモリ | 24,492 KB |
平均クエリ数 | 1295.02 |
最終ジャッジ日時 | 2023-09-24 09:06:16 |
合計ジャッジ時間 | 23,138 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
23,796 KB |
testcase_01 | AC | 24 ms
23,400 KB |
testcase_02 | AC | 25 ms
23,688 KB |
testcase_03 | AC | 24 ms
24,000 KB |
testcase_04 | AC | 25 ms
23,532 KB |
testcase_05 | AC | 26 ms
23,376 KB |
testcase_06 | AC | 24 ms
24,324 KB |
testcase_07 | AC | 25 ms
24,216 KB |
testcase_08 | AC | 24 ms
23,280 KB |
testcase_09 | WA | - |
testcase_10 | AC | 24 ms
24,372 KB |
testcase_11 | AC | 24 ms
23,784 KB |
testcase_12 | AC | 25 ms
23,508 KB |
testcase_13 | AC | 25 ms
23,712 KB |
testcase_14 | AC | 25 ms
24,228 KB |
testcase_15 | WA | - |
testcase_16 | AC | 24 ms
23,388 KB |
testcase_17 | AC | 25 ms
23,232 KB |
testcase_18 | AC | 25 ms
23,532 KB |
testcase_19 | WA | - |
testcase_20 | AC | 26 ms
24,000 KB |
testcase_21 | AC | 25 ms
24,240 KB |
testcase_22 | WA | - |
testcase_23 | AC | 25 ms
23,664 KB |
testcase_24 | AC | 26 ms
24,024 KB |
testcase_25 | WA | - |
testcase_26 | AC | 25 ms
23,232 KB |
testcase_27 | AC | 25 ms
23,256 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 26 ms
24,216 KB |
testcase_31 | WA | - |
testcase_32 | AC | 26 ms
24,240 KB |
testcase_33 | AC | 25 ms
24,252 KB |
testcase_34 | AC | 26 ms
24,240 KB |
testcase_35 | WA | - |
testcase_36 | AC | 26 ms
23,400 KB |
testcase_37 | WA | - |
testcase_38 | AC | 26 ms
24,024 KB |
testcase_39 | AC | 25 ms
23,880 KB |
testcase_40 | AC | 26 ms
23,412 KB |
testcase_41 | AC | 25 ms
23,880 KB |
testcase_42 | WA | - |
testcase_43 | AC | 27 ms
23,376 KB |
testcase_44 | AC | 27 ms
23,820 KB |
testcase_45 | AC | 27 ms
23,496 KB |
testcase_46 | WA | - |
testcase_47 | AC | 28 ms
24,204 KB |
testcase_48 | AC | 29 ms
24,108 KB |
testcase_49 | AC | 31 ms
24,108 KB |
testcase_50 | AC | 32 ms
23,880 KB |
testcase_51 | WA | - |
testcase_52 | AC | 33 ms
23,832 KB |
testcase_53 | AC | 36 ms
23,880 KB |
testcase_54 | WA | - |
testcase_55 | AC | 38 ms
24,084 KB |
testcase_56 | WA | - |
testcase_57 | AC | 41 ms
23,292 KB |
testcase_58 | AC | 42 ms
23,616 KB |
testcase_59 | WA | - |
testcase_60 | AC | 49 ms
24,228 KB |
testcase_61 | WA | - |
testcase_62 | AC | 52 ms
23,400 KB |
testcase_63 | AC | 55 ms
23,280 KB |
testcase_64 | AC | 53 ms
23,844 KB |
testcase_65 | AC | 56 ms
23,256 KB |
testcase_66 | AC | 62 ms
23,796 KB |
testcase_67 | AC | 64 ms
23,892 KB |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | AC | 72 ms
24,012 KB |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | AC | 82 ms
23,232 KB |
testcase_75 | WA | - |
testcase_76 | AC | 89 ms
24,024 KB |
testcase_77 | AC | 93 ms
23,700 KB |
testcase_78 | AC | 103 ms
24,240 KB |
testcase_79 | AC | 110 ms
23,640 KB |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | WA | - |
testcase_83 | WA | - |
testcase_84 | AC | 129 ms
23,508 KB |
testcase_85 | AC | 137 ms
23,232 KB |
testcase_86 | WA | - |
testcase_87 | AC | 115 ms
23,664 KB |
testcase_88 | AC | 150 ms
23,244 KB |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | WA | - |
testcase_93 | AC | 125 ms
23,652 KB |
testcase_94 | AC | 105 ms
23,364 KB |
testcase_95 | WA | - |
testcase_96 | WA | - |
testcase_97 | AC | 102 ms
23,688 KB |
testcase_98 | AC | 96 ms
23,376 KB |
testcase_99 | WA | - |
testcase_100 | AC | 120 ms
23,628 KB |
testcase_101 | AC | 129 ms
23,400 KB |
testcase_102 | WA | - |
testcase_103 | WA | - |
testcase_104 | AC | 110 ms
24,240 KB |
testcase_105 | WA | - |
testcase_106 | WA | - |
testcase_107 | WA | - |
testcase_108 | WA | - |
testcase_109 | AC | 128 ms
24,228 KB |
testcase_110 | AC | 104 ms
23,808 KB |
testcase_111 | AC | 105 ms
23,880 KB |
testcase_112 | AC | 98 ms
23,616 KB |
testcase_113 | AC | 137 ms
23,352 KB |
testcase_114 | AC | 138 ms
24,012 KB |
testcase_115 | AC | 111 ms
23,880 KB |
testcase_116 | WA | - |
testcase_117 | WA | - |
testcase_118 | WA | - |
testcase_119 | WA | - |
testcase_120 | AC | 99 ms
24,024 KB |
testcase_121 | AC | 120 ms
23,700 KB |
testcase_122 | AC | 119 ms
24,252 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long int ll; int main(){ int n; cin >> n; if(n==2){ // 出力周り確認 cout << "? 1 2" << endl; int a,b; cin >> a >> b; if(a==-1){ cout << "! 2 3" << endl; } else{ cout << "! 3 2" << endl; } return 0; } vector<pair<int,int>> v; for(int i=2;i<=n*n-n;i++){ cout << "? 1 " << i << endl; int a,b; cin >> a >> b; if(a>b)swap(a,b); v.push_back({a,b}); } vector<int> res(n*n-n,-1); set<int> used; { int a=0,b=0; vector<int> vv; for(int i=0;i<v.size();i++){ if(v[i].first==0){ vv.push_back(v[i].second); } } sort(vv.rbegin(), vv.rend()); if(vv.size()>0){ a=vv[0]; for(int i=1;i<vv.size();i++){ if(vv[i]==vv[i-1]){ b=vv[i]; break; } } } int one=a+(b+1)*n; used.insert(one); res[0]=one; } int cnt=0; auto query=[&](int base,int a,int b)->pair<int,int>{ cnt++; a*=-1; b*=-1; int f=base/n,s=base%n; int c=-1; int d=-1; if(1<=f+a and f+a<n){ if(0<=s+b and s+b<=n-1){ c=(f+a)*n+(s+b); } } if(1<=f+b and f+b<n){ if(0<=s+a and s+a<=n-1){ d=(f+b)*n+(s+a); } } if(n<=c and c<=n*n-1){ if(used.find(c)!=used.end()){ c=-1; } } else{ c=-1; } swap(c,d); if(n<=c and c<=n*n-1){ if(used.find(c)!=used.end()){ c=-1; } } else{ c=-1; } if(c==d)c=-1; return make_pair(c,d); }; int id=-1; int mx=0; for(int i=0;i<v.size();i++){ pair<int,int> p=query(res[0],v[i].first,v[i].second); if(p.first==-1 or p.second==-1){ if(abs(v[i].first)!=abs(v[i].second)){ if(id==-1){ id=i+1; mx=max(abs(v[i].first),abs(v[i].second)); } else if(mx<max(abs(v[i].first),abs(v[i].second))){ id=i+1; mx=max(abs(v[i].first),abs(v[i].second)); } } res[i+1]=max(p.first,p.second); used.insert(res[i+1]); } } auto check=[&]()->void{ for(int i=0;i<v.size();i++){ if(res[i+1]!=-1)continue; pair<int,int> p=query(res[0],v[i].first,v[i].second); if(p.first==-1 or p.second==-1){ res[i+1]=max(p.first,p.second); used.insert(res[i+1]); } } }; for(int i=0;i<v.size();i++){ if(res[i+1]!=-1)continue; pair<int,int> p=query(res[0],v[i].first,v[i].second); if(p.first==-1 or p.second==-1){ res[i+1]=max(p.first,p.second); used.insert(res[i+1]); check(); } else{ cout << "? " << id+1 << " " << i+2 << endl; int a,b; cin >> a >> b; if(a>b)swap(a,b); pair<int,int> pp=query(res[id],a,b); map<int,int> mp; mp[p.first]++; mp[p.second]++; mp[pp.first]++; mp[pp.second]++; for(auto p:mp){ if(p.second>1){ res[i+1]=p.first; used.insert(p.first); } } } } // assert(cnt<=(n-1)*n/2*3); cout << "!"; for(int i:res){ cout << " " << i; } cout << endl; }