結果
問題 | No.2124 Guess the Permutation |
ユーザー |
👑 ![]() |
提出日時 | 2022-11-18 21:28:40 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 55 ms / 2,000 ms |
コード長 | 2,847 bytes |
コンパイル時間 | 3,978 ms |
コンパイル使用メモリ | 252,080 KB |
最終ジャッジ日時 | 2025-02-08 21:26:13 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 9 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int,int>#define pil pair<int,ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int,int>>#define vpll vector<pair<ll,ll>>#define vvpii vector<vector<pair<int,int>>>#define vvpll vector<vector<pair<ll,ll>>>template<typename T> void debug(T e){cerr << e << endl;}template<typename T> void debug(vector<T> &v){rep(i, v.size()){cerr << v[i] << " ";}cerr << endl;}template<typename T> void debug(vector<vector<T>> &v){rep(i, v.size()){rep(j, v[i].size()){cerr << v[i][j] << " ";}cerr << endl;}}template<typename T> void debug(vector<pair<T, T>> &v){rep(i,v.size()){cerr << v[i].first << " " << v[i].second << endl;}}template<typename T> void debug(set<T> &st){for (auto itr = st.begin(); itr != st.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(multiset<T> &ms){for (auto itr = ms.begin(); itr != ms.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(map<T, T> &mp){for (auto itr = mp.begin(); itr != mp.end(); itr++){cerr << itr->first << " " << itr->second << endl;}}void debug_out(){cerr << endl;}template <typename Head, typename... Tail>void debug_out(Head H, Tail... T){cerr << H << " ";debug_out(T...);}int main(){int N;cin >> N;vector<int> ans(N);int all_sum = N * (N + 1) / 2;int sum;for (int i = 2; i <= N - 1; i++){cout << "? 1 " << i << endl;int sum2;cin >> sum2;if (i >= 3){ans[i - 1] = sum2 - sum;}sum = sum2;}ans[N - 1] = all_sum - sum;//debug(ans);cout << "? 2 " << N << endl;cin >> sum;ans[0] = all_sum - sum;vector<int> has(N + 1, false);has[ans[0]] = true;for (int i = 2; i < N; i++){has[ans[i]] = true;}for (int i = 1; i <= N; i++){if (!has[i]) ans[1] = i;}cout << "!";for (int i = 0; i < N; i++){cout << " " << ans[i];}cout << endl;}