#589830 (C++17) No.1306 Exactly 2 Digits

提出ソース

結果

問題	No.1306 Exactly 2 Digits
ユーザー	rniya
提出日時	2020-12-06 12:29:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	595 ms / 2,000 ms
コード長	5,220 bytes
コンパイル時間	2,495 ms
コンパイル使用メモリ	215,316 KB
実行使用メモリ	25,476 KB
平均クエリ数	1236.78
最終ジャッジ日時	2024-07-17 09:46:32
合計ジャッジ時間	35,315 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	26 ms 24,812 KB
testcase_01	AC	23 ms 24,800 KB
testcase_02	AC	23 ms 25,064 KB
testcase_03	AC	22 ms 24,964 KB
testcase_04	AC	23 ms 25,208 KB
testcase_05	AC	22 ms 24,836 KB
testcase_06	AC	23 ms 24,976 KB
testcase_07	AC	22 ms 24,836 KB
testcase_08	AC	23 ms 24,836 KB
testcase_09	AC	22 ms 24,836 KB
testcase_10	AC	22 ms 25,476 KB
testcase_11	AC	22 ms 25,220 KB
testcase_12	AC	22 ms 24,836 KB
testcase_13	AC	23 ms 25,196 KB
testcase_14	AC	23 ms 25,196 KB
testcase_15	AC	24 ms 25,196 KB
testcase_16	AC	23 ms 24,556 KB
testcase_17	AC	23 ms 25,196 KB
testcase_18	AC	23 ms 24,812 KB
testcase_19	AC	23 ms 24,812 KB
testcase_20	AC	22 ms 25,068 KB
testcase_21	AC	24 ms 24,812 KB
testcase_22	AC	23 ms 25,196 KB
testcase_23	AC	24 ms 25,196 KB
testcase_24	AC	24 ms 24,812 KB
testcase_25	AC	24 ms 25,196 KB
testcase_26	AC	24 ms 25,196 KB
testcase_27	AC	26 ms 25,068 KB
testcase_28	AC	23 ms 24,556 KB
testcase_29	AC	23 ms 25,196 KB
testcase_30	AC	23 ms 25,196 KB
testcase_31	AC	23 ms 25,452 KB
testcase_32	AC	23 ms 24,940 KB
testcase_33	AC	24 ms 25,196 KB
testcase_34	AC	24 ms 25,424 KB
testcase_35	AC	23 ms 24,940 KB
testcase_36	AC	24 ms 25,196 KB
testcase_37	AC	24 ms 24,556 KB
testcase_38	AC	24 ms 24,556 KB
testcase_39	AC	23 ms 25,196 KB
testcase_40	AC	23 ms 25,196 KB
testcase_41	AC	23 ms 24,812 KB
testcase_42	AC	23 ms 25,196 KB
testcase_43	AC	24 ms 25,196 KB
testcase_44	AC	26 ms 24,556 KB
testcase_45	AC	30 ms 24,556 KB
testcase_46	AC	26 ms 24,812 KB
testcase_47	AC	27 ms 24,800 KB
testcase_48	AC	29 ms 24,812 KB
testcase_49	AC	31 ms 24,812 KB
testcase_50	AC	31 ms 25,196 KB
testcase_51	AC	33 ms 25,196 KB
testcase_52	AC	36 ms 24,556 KB
testcase_53	AC	40 ms 25,196 KB
testcase_54	AC	43 ms 24,556 KB
testcase_55	AC	44 ms 24,940 KB
testcase_56	AC	47 ms 25,196 KB
testcase_57	AC	51 ms 25,196 KB
testcase_58	AC	55 ms 24,940 KB
testcase_59	AC	57 ms 24,812 KB
testcase_60	AC	68 ms 25,196 KB
testcase_61	AC	76 ms 24,940 KB
testcase_62	AC	80 ms 24,556 KB
testcase_63	AC	90 ms 25,276 KB
testcase_64	AC	94 ms 25,196 KB
testcase_65	AC	101 ms 25,196 KB
testcase_66	AC	115 ms 25,196 KB
testcase_67	AC	131 ms 25,196 KB
testcase_68	AC	130 ms 25,196 KB
testcase_69	AC	147 ms 24,808 KB
testcase_70	AC	158 ms 24,812 KB
testcase_71	AC	172 ms 24,940 KB
testcase_72	AC	184 ms 24,812 KB
testcase_73	AC	197 ms 24,940 KB
testcase_74	AC	223 ms 24,812 KB
testcase_75	AC	237 ms 25,196 KB
testcase_76	AC	263 ms 25,196 KB
testcase_77	AC	290 ms 24,556 KB
testcase_78	AC	317 ms 25,184 KB
testcase_79	AC	347 ms 24,812 KB
testcase_80	AC	375 ms 25,196 KB
testcase_81	AC	380 ms 24,556 KB
testcase_82	AC	436 ms 24,940 KB
testcase_83	AC	501 ms 25,452 KB
testcase_84	AC	509 ms 25,196 KB
testcase_85	AC	582 ms 25,196 KB
testcase_86	AC	491 ms 25,196 KB
testcase_87	AC	530 ms 24,940 KB
testcase_88	AC	595 ms 25,196 KB
testcase_89	AC	500 ms 24,428 KB
testcase_90	AC	549 ms 25,440 KB
testcase_91	AC	466 ms 25,196 KB
testcase_92	AC	517 ms 24,812 KB
testcase_93	AC	504 ms 24,812 KB
testcase_94	AC	454 ms 24,428 KB
testcase_95	AC	492 ms 24,812 KB
testcase_96	AC	451 ms 24,940 KB
testcase_97	AC	513 ms 25,196 KB
testcase_98	AC	444 ms 24,556 KB
testcase_99	AC	464 ms 25,452 KB
testcase_100	AC	473 ms 25,184 KB
testcase_101	AC	509 ms 25,424 KB
testcase_102	AC	450 ms 24,812 KB
testcase_103	AC	465 ms 25,196 KB
testcase_104	AC	490 ms 25,196 KB
testcase_105	AC	564 ms 24,812 KB
testcase_106	AC	479 ms 24,812 KB
testcase_107	AC	562 ms 25,068 KB
testcase_108	AC	562 ms 25,184 KB
testcase_109	AC	576 ms 25,068 KB
testcase_110	AC	482 ms 25,196 KB
testcase_111	AC	553 ms 24,812 KB
testcase_112	AC	443 ms 25,196 KB
testcase_113	AC	583 ms 25,196 KB
testcase_114	AC	546 ms 24,556 KB
testcase_115	AC	527 ms 24,940 KB
testcase_116	AC	590 ms 25,452 KB
testcase_117	AC	531 ms 25,196 KB
testcase_118	AC	575 ms 24,812 KB
testcase_119	AC	553 ms 25,452 KB
testcase_120	AC	478 ms 24,556 KB
testcase_121	AC	502 ms 24,812 KB
testcase_122	AC	498 ms 24,812 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

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;
      |         ^~~~~

ソースコード

raw source code

#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);
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード