結果
問題 | No.2771 Personal Space |
ユーザー |
👑 |
提出日時 | 2024-05-31 23:07:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 284 ms / 2,000 ms |
コード長 | 2,924 bytes |
コンパイル時間 | 4,707 ms |
コンパイル使用メモリ | 269,316 KB |
実行使用メモリ | 12,308 KB |
最終ジャッジ日時 | 2024-05-31 23:08:03 |
合計ジャッジ時間 | 9,248 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 70 ms
12,308 KB |
testcase_02 | AC | 71 ms
11,624 KB |
testcase_03 | AC | 74 ms
11,980 KB |
testcase_04 | AC | 77 ms
12,232 KB |
testcase_05 | AC | 73 ms
11,496 KB |
testcase_06 | AC | 81 ms
11,244 KB |
testcase_07 | AC | 59 ms
6,940 KB |
testcase_08 | AC | 284 ms
6,940 KB |
testcase_09 | AC | 63 ms
6,940 KB |
testcase_10 | AC | 71 ms
6,944 KB |
testcase_11 | AC | 75 ms
8,268 KB |
testcase_12 | AC | 72 ms
7,540 KB |
testcase_13 | AC | 66 ms
6,940 KB |
testcase_14 | AC | 64 ms
6,940 KB |
testcase_15 | AC | 65 ms
6,940 KB |
testcase_16 | AC | 64 ms
6,940 KB |
testcase_17 | AC | 65 ms
6,940 KB |
testcase_18 | AC | 62 ms
6,940 KB |
testcase_19 | AC | 63 ms
6,940 KB |
testcase_20 | AC | 74 ms
7,456 KB |
testcase_21 | AC | 72 ms
7,292 KB |
testcase_22 | AC | 74 ms
7,404 KB |
testcase_23 | AC | 75 ms
11,024 KB |
testcase_24 | AC | 80 ms
7,600 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} int solve(){ int n, m; cin >> n >> m; m--; vector<int> ans(n); using T = tuple<int, int, int>; priority_queue<T> pq; auto divide = [&](int l, int r, int pos){ pq.emplace((pos - l + 1) / 2, -l, -pos); pq.emplace((r - (pos + 1) + 1) / 2, -(pos + 1), -r); }; ans[m] = 1; pq.emplace(m, -0, -m); pq.emplace((n - 1) - m, -(m + 1), -n); for(int num = 2; num <= n; num++){ auto [tmp, _l, _r] = pq.top(); pq.pop(); int l = -_l; int r = -_r; if(l == 0){ ans[l] = num; divide(l, r, l); }else if(r == n){ ans[r - 1] = num; divide(l, r, r - 1); }else{ int pos = l + (r - l - 1) / 2; ans[pos] = num; divide(l, r, pos); } // cout << tmp << ' '<< l << ' ' << r << "\n"; } cout << ans; return 0; } int main(){ int t; cin >> t; rep(i, t) solve(); return 0; }