結果

問題 No.1558 Derby Live
ユーザー leaf_1415
提出日時 2021-06-25 21:50:34
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
AC  
実行時間 149 ms / 2,000 ms
コード長 7,152 bytes
コンパイル時間 1,626 ms
コンパイル使用メモリ 89,004 KB
実行使用メモリ 8,320 KB
最終ジャッジ日時 2024-06-25 08:23:31
合計ジャッジ時間 7,566 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(llint (x) = (s); (x) >= (t); (x)--)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18
using namespace std;
typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{
    ll to, cost;
    edge(){}
    edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const ll mod = 1000000007;
//const ll mod = 998244353;
struct mint{
    ll x = 0;
    mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
    mint(const mint &ope) {x = ope.x;}
    
    mint operator-(){return mint(-x);}
    mint operator+(const mint &ope){return mint(x) += ope;}
    mint operator-(const mint &ope){return mint(x) -= ope;}
    mint operator*(const mint &ope){return mint(x) *= ope;}
    mint operator/(const mint &ope){return mint(x) /= ope;}
    mint& operator+=(const mint &ope){
        x += ope.x;
        if(x >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint &ope){
        x += mod - ope.x;
        if(x >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint &ope){
        x *= ope.x, x %= mod;
        return *this;
    }
    mint& operator/=(const mint &ope){
        ll n = mod-2; mint mul = ope;
        while(n){
            if(n & 1) *this *= mul;
            mul *= mul;
            n >>= 1;
        }
        return *this;
    }
    mint inverse(){return mint(1) / *this;}
    bool operator ==(const mint &ope){return x == ope.x;}
    bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
    if(n == 0) return mint(1);
    if(n % 2) return a * modpow(a, n-1);
    else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
    ll t; is >> t, ope.x = t;
    return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}
bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}
template<class S, class T> pair<S,T>& operator+=(pair<S,T> &s, const pair<S,T> &t){
    s.first += t.first, s.second += t.second;
    return s;
}
template<class S, class T> pair<S,T>& operator-=(pair<S,T> &s, const pair<S,T> &t){
    s.first -= t.first, s.second -= t.second;
    return s;
}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){
    return pair<S,T>(s.first+t.first, s.second+t.second);
}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){
    return pair<S,T>(s.first-t.first, s.second-t.second);
}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
    for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
    for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");
    return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
    for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++; if(itr != map_var.end()) os << ","; itr--;
    }
    return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
    for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
    }
    return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
    for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
    }
    return os;
}
template<typename T>
void outa(T a[], ll s, ll t){
    for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
    cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    cout << head;
    if(sizeof...(Tail) > 0) cout << " ";
    dump_func(std::move(tail)...);
}
struct perm
{
    ll a[20];
    perm(){rep(i, 1, 18) a[i] = i;}
};
perm mul(perm &a, perm &b)
{
    perm ret;
    rep(i, 1, 18) ret.a[i] = b.a[a.a[i]];
    return ret;
}
struct SegTree{
    typedef perm SEG;
    
    int size;
    vector<SEG> seg;
    
    SegTree(){}
    SegTree(int size){
        this->size = size;
        seg.resize(1<<(size+1));
    }
    
    SEG Ident(){  //identity element
        return perm();
    }
    SEG ope(SEG a, SEG b){ //operator
        return mul(a, b);
    }
    
    void init()
    {
        for(int i = 0; i < (1<<(size+1)); i++) seg[i] = Ident();
    }
    
    void update(int i, SEG val)
    {
        i += (1 << size);
        seg[i] = val;
        while(i > 1){
            i /= 2;
            seg[i] = ope(seg[i*2], seg[i*2+1]);
        }
    }
    SEG query(int a, int b, int k, int l, int r)
    {
        if(b < l || r < a) return Ident();
        if(a <= l && r <= b) return seg[k];
        SEG lval = query(a, b, k*2, l, (l+r)/2);
        SEG rval = query(a, b, k*2+1, (l+r)/2+1, r);
        return ope(lval, rval);
    }
    SEG query(int a, int b)
    {
        if(a > b) return Ident();
        return query(a, b, 1, 0, (1<<size)-1);
    }
};
ll n, m, Q;
SegTree seg(14);
ll a[20];
int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n >> m >> Q;
    seg.init();
    
    ll t, d, p, s, l, r;
    rep(q, 1, Q){
        cin >> t;
        //outl("t" , t);
        if(t == 1){
            perm pm;
            cin >> d;
            rep(i, 1, n) cin >> p, pm.a[i] = p;
            seg.update(d, pm);
        }
        if(t == 2){
            cin >> s;
            perm res = seg.query(1, s);
            rep(i, 1, n) a[res.a[i]] = i;
            outa(a, 1, n);
        }
        if(t == 3){
            cin >> l >> r;
            perm res = seg.query(l, r); ll ans = 0;
            rep(i, 1, n) ans += abs(i-res.a[i]);
            outl(ans);
        }
    }
    
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0