結果
問題 | No.2124 Guess the Permutation |
ユーザー |
![]() |
提出日時 | 2022-11-18 22:01:06 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 56 ms / 2,000 ms |
コード長 | 13,238 bytes |
コンパイル時間 | 1,379 ms |
コンパイル使用メモリ | 136,776 KB |
最終ジャッジ日時 | 2025-02-08 21:42:25 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 9 |
ソースコード
// #include <bits/stdc++.h>#include <algorithm>#include <chrono>#include <cmath>#include <deque>#include <iomanip>#include <iostream>#include <limits>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <vector>using namespace std;using ll = long long;using VI = vector<int>;using VL = vector<ll>;using VD = vector<double>;using VS = vector<string>;using VB = vector<bool>;using VVB = vector<vector<bool>>;using VVI = vector<VI>;using VVL = vector<VL>;using VVD = vector<VD>;using VVVI = vector<VVI>;using VVVL = vector<VVL>;using VVVD = vector<VVD>;using PII = std::pair<int, int>;using VPII = std::vector<std::pair<int, int>>;using PLL = std::pair<ll, ll>;using VPLL = std::vector<std::pair<ll, ll>>;using TI3 = std::tuple<int, int, int>;using TI4 = std::tuple<int, int, int, int>;using TL3 = std::tuple<ll, ll, ll>;using TL4 = std::tuple<ll, ll, ll, 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 rep2(i, s, n) for (int i = (s); i < (int)(n); i++)#define repr2(i, g, n) for (int i = (int)(n)-1; i >= (g); i--)#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))#define repr3(i, g, n, d) for (int i = (int)(n)-1; i >= (g); i -= (d))#define allpt(v) (v).begin(), (v).end()#define allpt_c(v) (v).cbegin(), (v).cend()#define allpt_r(v) (v).rbegin(), (v).rend()#define allpt_cr(v) (v).crbegin(), (v).crend()const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;const int mod = mod1;const ll inf = 1e18;const int infint = 1e9;const string wsp = " ";const string tb = "\t";const string rt = "\n";const string alphabets = "abcdefghijklmnopqrstuvwxyz";// std::random_device seed_gen;// std::mt19937 engine(seed_gen());// 乱数生成用メルセンヌ・ツイスタエンジンtemplate <typename T>void show1dvec(const vector<T> &v) {if (v.size() == 0) return;int n = v.size() - 1;rep(i, n) cout << v[i] << wsp;cout << v[n] << rt;return;}int get1dcoodinate(int w, int i, int j) { return i * w + j; }template <typename T, typename S>istream &operator>>(istream &is, pair<T, S> &v) {is >> v.first >> v.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) {if (v.size() == 0) return os;int n = (int)v.size() - 1;rep(i, n) os << v[i] << wsp;os << v[n] << rt;return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {if (v.size() == 0) return is;int n = v.size();rep(i, n) is >> v[i];return is;}template <typename T>ostream &operator<<(ostream &os, const vector<vector<T>> &v) {if (v.size() == 0) return os;int n = (int)v.size();rep(i, n) os << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<vector<T>> &v) {if (v.size() == 0) return is;int n = v.size();rep(i, n) is >> v[i];return is;}template <typename T, typename S>istream &operator>>(istream &is, vector<pair<T, S>> &v) {if (v.size() == 0) return is;int n = v.size();rep(i, n) is >> v[i].first >> v[i].second;return is;}template <typename T, typename S>ostream &operator<<(ostream &os, const vector<pair<T, S>> &v) {if (v.size() == 0) return os;int n = v.size();rep(i, n) os << v[i].first << wsp << v[i].second << rt;return os;}void show2dvec(const vector<string> &v) {int n = (int)v.size();rep(i, n) cout << v[i] << rt;}template <typename T>void show2dvec(const vector<vector<T>> &v) {int n = v.size();rep(i, n) show1dvec(v[i]);}template <typename T>void range_sort(vector<T> &arr, int l, int r) {sort(arr.begin() + l, arr.begin() + r);}template <typename T, typename S>void show1dpair(const vector<pair<T, S>> &v) {int n = v.size();rep(i, n) cout << v[i].first << v[i].second << rt;return;}template <typename T, typename S>void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) {int n = v.size();rep(i, n) {t.push_back(v[i].first);s.push_back(v[i].second);}return;}template <typename T>void maxvec(vector<T> &v) {T s = v[0];int n = v.size();rep(i, n - 1) {if (s > v[i + 1]) {v[i + 1] = s;}s = v[i + 1];}}template <typename T, typename S>bool myfind(T t, S s) {return find(t.cbegin(), t.cend(), s) != t.cend();}bool check(int y, int x, int h, int w) {return 0 <= y && y < h && 0 <= x && x < w;}bool check(int y, int x, int h1, int h2, int w1, int w2) {return h1 <= y && y < h2 && w1 <= x && x < w2;}bool iskadomatsu(int a, int b, int c) {return (a != b && b != c && c != a) &&((a > b && b < c) || (a < b && b > c));}template <typename T>bool iskadomatsu(vector<T> v) {T a = v[0], b = v[1], c = v[2];return (a != b && b != c && c != a) &&((a > b && b < c) || (a < b && b > c));}double euc_dist(PII a, PII b) {return sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2));}// VS split(string s, char c) {// VS ret;// string part;// s += c;// rep(i, s.length()) {// if (s[i] == c) {// if (part != "") ret.emplace_back(part);// part = "";// } else if (s[i] != c) {// part += s[i];// }// }// return ret;// }VS split(string s, char c, char d = ' ') {VS ret;// reverse(allpt(s));string part;s += c;rep(i, s.length()) {if (s[i] == c) {if (part != "") {// string t;// t += c;// ret.emplace_back(t);ret.emplace_back(part);}part = "";} else {part += s[i];}}return ret;}template <typename T, typename S, typename R>ll pow_mod(T p, S q, R _mod = 1ll) {ll ret = 1, r = p;while (q) {if (q % 2) ret *= r, ret %= _mod;r = (r * r) % _mod, q /= 2;}return ret % _mod;}template <typename T, typename S>ll pow_no_mod(T p, S q) {ll ret = 1, r = p;while (q) {if (q % 2) ret *= r;r = (r * r), q /= 2;}return ret;}void make_frac_tables(VL &frac_list, VL &frac_inv_list) {rep(i, frac_list.size() - 1) {frac_list[i + 1] *= frac_list[i] * (i + 1);frac_list[i + 1] %= mod;frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);frac_inv_list[i + 1] %= mod;}}pair<VL, VL> make_frac_tables(int n) {VL frac_list(n + 1, 1), frac_inv_list(n + 1, 1);rep(i, n) {frac_list[i + 1] *= frac_list[i] * (i + 1);frac_list[i + 1] %= mod;frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);frac_inv_list[i + 1] %= mod;}return make_pair(frac_list, frac_inv_list);}ll perm(int a, int b, const VL &frac_list, const VL &frac_inv_list) {if (a < b) return 0;if (b < 0) return 0;ll ret = frac_list[a];ret *= frac_inv_list[a - b];ret %= mod;return ret;}ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) {if (a < b) return 0;if (b < 0) return 0;ll ret = frac_list[a];ret *= frac_inv_list[b];ret %= mod;ret *= frac_inv_list[a - b];ret %= mod;return ret;}struct vec2d {ll x;ll y;vec2d(ll _x, ll _y) {x = _x;y = _y;}ll dot(vec2d p) { return x * p.x + y * p.y; }vec2d diff(vec2d p) { return vec2d(x - p.x, y - p.y); }};struct node {int parent = -1;ll weight = 0;int depth = 0;int degree = 0;int subtree = 1;int check = 0;int scc = -1;int use_leaf;priority_queue<int> coins;VPLL children;VI parent_list;VPLL connect;node() {parent = -1;weight = 0;depth = 0;degree = 0;subtree = 1;check = 0;children;parent_list;connect;}};struct graph {int _n;int root = 0;vector<node> nodes;graph(int n) {_n = n;rep(i, _n) nodes.emplace_back(node());}void getconnect_nocost() {ll a, b;cin >> a >> b;nodes[a].connect.emplace_back(b, 1);nodes[b].connect.emplace_back(a, 1);}void getconnect_cost() {ll a, b, c;cin >> a >> b >> c;nodes[a].connect.emplace_back(b, c);nodes[b].connect.emplace_back(a, c);}void getconnect_increment_nocost() {ll a, b;cin >> a >> b;a--, b--;nodes[a].connect.emplace_back(b, 1);nodes[b].connect.emplace_back(a, 1);}void getconnect_increment_cost() {ll a, b, c;cin >> a >> b >> c;a--, b--;nodes[a].connect.emplace_back(b, c);nodes[b].connect.emplace_back(a, c);}void showparent() {rep(i, _n - 1) cout << nodes[i].parent << wsp;cout << nodes[_n - 1].parent << rt;}void showweight() {rep(i, _n - 1) cout << nodes[i].weight << wsp;cout << nodes[_n - 1].weight << rt;}void showsubtree() {rep(i, _n - 1) cout << nodes[i].subtree << wsp;cout << nodes[_n - 1].subtree << rt;}void showdepth() {rep(i, _n - 1) cout << nodes[i].depth << wsp;cout << nodes[_n - 1].depth << rt;}};struct point {int x;int y;point() {x = 0;y = 0;}point(int _x, int _y) {x = _x;y = _y;}void pointinput() {int _x, _y;cin >> _x >> _y;x = _x;y = _y;}void pointinv() { swap(x, y); }};istream &operator>>(istream &is, point &p) {is >> p.x >> p.y;return is;}ostream &operator<<(ostream &os, point &p) {os << p.x << wsp << p.y << rt;return os;}double pointseuc(point a, point b) {ll ax = a.x, bx = b.x, ay = a.y, by = b.y;return sqrt(pow(ax - bx, 2) + pow(ay - by, 2));}ll pointseucsquare(point a, point b) {ll ax = a.x, bx = b.x, ay = a.y, by = b.y;return (ax - bx) * (ax - bx) + (ay - by) * (ay - by);}int pointsmanhattan(point a, point b) {return abs(a.x - b.x) + abs(a.y - b.y);}double dist_segment_point(TL3 segment, point p) {double a = get<0>(segment);double b = get<1>(segment);double c = get<2>(segment);return abs(a * p.x + b * p.y - c) / sqrt(a * a + b * b);}TL3 segment_parameter(point p, point q) {ll a, b, c;a = q.y - p.y;b = p.x - q.x;c = a * p.x + b * p.y;TL3 ret = (TL3){a, b, c};// cout << a << b << c << rt;return ret;}int cross_check(TL3 segment, point p) {ll a = get<0>(segment);ll b = get<1>(segment);ll c = get<2>(segment);auto f = a * p.x + b * p.y - c;int ret;if (f > 0) ret = 1;if (f == 0) ret = 0;if (f < 0) ret = -1;return ret;}VI shave(int n) {VI v;if (n <= 1) return v;vector<bool> w(n + 1, true);int x;w[0] = w[1] = false;rep2(i, 2, n + 1) {if (w[i]) {x = i * 2;while (x <= n) {w[x] = false;x += i;}}}rep(i, n + 1) if (w[i]) v.emplace_back(i);return v;}bool iscross(point p1, point p2, point p3, point p4) {auto segment_1 = segment_parameter(p1, p2);auto segment_2 = segment_parameter(p3, p4);const double eps = 1e-6;bool ans{false};if (cross_check(segment_1, p3) * cross_check(segment_1, p4) == 0 &&cross_check(segment_2, p1) * cross_check(segment_2, p2) == 0) {auto xmin_1 = min(p1.x, p2.x) - eps;auto xmin_2 = min(p3.x, p4.x) - eps;auto xmax_1 = max(p1.x, p2.x) + eps;auto xmax_2 = max(p3.x, p4.x) + eps;auto ymin_1 = min(p1.y, p2.y) - eps;auto ymin_2 = min(p3.y, p4.y) - eps;auto ymax_1 = max(p1.y, p2.y) + eps;auto ymax_2 = max(p3.y, p4.y) + eps;if (xmin_1 <= p3.x && p3.x <= xmax_1 && ymin_1 <= p3.y &&p3.y <= ymax_1)ans = true;if (xmin_1 <= p4.x && p4.x <= xmax_1 && ymin_1 <= p4.y &&p4.y <= ymax_1)ans = true;if (xmin_2 <= p1.x && p1.x <= xmax_2 && ymin_2 <= p1.y &&p1.y <= ymax_2)ans = true;if (xmin_2 <= p2.x && p2.x <= xmax_2 && ymin_2 <= p2.y &&p2.y <= ymax_2)ans = true;} else if (cross_check(segment_1, p3) * cross_check(segment_1, p4) <= 0 &&cross_check(segment_2, p1) * cross_check(segment_2, p2) <= 0) {ans = true;}return ans;}int main() {int n;cin >> n;int s = n * (n + 1) / 2;VI ans(n);ans[n - 1] = s;cout << "? " << 2 << wsp << n << endl;cin >> ans[0];ans[0] = s - ans[0];rep2(i, 2, n) {cout << "? " << 1 << wsp << i << endl;cin >> ans[i - 1];}repr(i, n - 1) ans[i + 1] -= ans[i];cout << "! " << ans << endl;return 0;}