#672836 (C++17) No.1558 Derby Live

提出ソース

結果

問題	No.1558 Derby Live
ユーザー	hitonanode
提出日時	2021-07-03 12:30:19
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	97 ms / 2,000 ms
コード長	6,593 bytes
コンパイル時間	1,621 ms
コンパイル使用メモリ	145,904 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-30 04:21:31
合計ジャッジ時間	8,354 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	66 ms 6,812 KB
testcase_01	AC	97 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	62 ms 6,940 KB
testcase_04	AC	31 ms 6,940 KB
testcase_05	AC	37 ms 6,944 KB
testcase_06	AC	57 ms 6,940 KB
testcase_07	AC	5 ms 6,940 KB
testcase_08	AC	59 ms 6,940 KB
testcase_09	AC	62 ms 6,944 KB
testcase_10	AC	65 ms 6,940 KB
testcase_11	AC	66 ms 6,940 KB
testcase_12	AC	67 ms 6,940 KB
testcase_13	AC	69 ms 6,940 KB
testcase_14	AC	72 ms 6,940 KB
testcase_15	AC	75 ms 6,944 KB
testcase_16	AC	80 ms 6,940 KB
testcase_17	AC	82 ms 6,944 KB
testcase_18	AC	88 ms 6,940 KB
testcase_19	AC	89 ms 6,944 KB
testcase_20	AC	90 ms 6,944 KB
testcase_21	AC	84 ms 6,940 KB
testcase_22	AC	88 ms 6,940 KB
testcase_23	AC	92 ms 6,940 KB
testcase_24	AC	85 ms 6,944 KB
testcase_25	AC	89 ms 6,944 KB
testcase_26	AC	90 ms 6,944 KB
testcase_27	AC	86 ms 6,940 KB
testcase_28	AC	86 ms 6,940 KB
testcase_29	AC	92 ms 6,940 KB
testcase_30	AC	83 ms 6,940 KB
testcase_31	AC	84 ms 6,944 KB
testcase_32	AC	91 ms 6,940 KB
testcase_33	AC	2 ms 6,944 KB
testcase_34	AC	2 ms 6,944 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif

#include <atcoder/segtree>
int N, M, Q;

struct S {
    array<int, 18> permutation;
    S(const vector<int> &v) {
        iota(permutation.begin(), permutation.end(), 0);
        copy(v.begin(), v.end(), permutation.begin());
    }
};
S op(S l, S r) {
    vector<int> p(l.permutation.size());
    REP(i, p.size()) p[i] = r.permutation[l.permutation[i]];
    return S(p);
}
S e() {
    vector<int> v(N);
    iota(v.begin(), v.end(), 0);
    return S(v);
}

int main() {
    cin >> N >> M >> Q;
    vector<S> initial;
    REP(i, M) initial.emplace_back(e());
    atcoder::segtree<S, op, e> tree(initial);
    while (Q--) {
        int type;
        cin >> type;
        if (type == 1) {
            int D;
            vector<int> P(N);
            cin >> D >> P;
            D--;
            for (auto &x : P) x--;
            tree.set(D, S(P));
        }
        if (type == 2) {
            int S;
            cin >> S;
            auto ret = tree.prod(0, S);
            vector<int> V(N);
            REP(i, N) V[ret.permutation[i]] = i;
            for (auto x : V) cout << x + 1 << ' ';
            cout << '\n';
        }
        if (type == 3) {
            int L, R;
            cin >> L >> R;
            L--;
            auto ret = tree.prod(L, R);
            int sum = 0;
            REP(i, N) sum += abs(ret.permutation[i] - i);
            cout << sum << '\n';
        }
    }
}

yukicoder

結果

テストケース

ソースコード