結果
問題 | No.1306 Exactly 2 Digits |
ユーザー |
![]() |
提出日時 | 2020-12-06 12:29:46 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 611 ms / 2,000 ms |
コード長 | 5,220 bytes |
コンパイル時間 | 2,578 ms |
コンパイル使用メモリ | 207,028 KB |
最終ジャッジ日時 | 2025-01-16 18:21:55 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 123 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:201:22: warning: ‘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: note: ‘other’ was declared here 185 | int other; | ^~~~~
ソースコード
#include <bits/stdc++.h>using namespace std;const long long MOD=1000000007;// const long long MOD=998244353;#define LOCAL#pragma region Macrostypedef 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#endiftemplate<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 endregionint 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);}