結果

問題 No.1558 Derby Live
コンテスト
ユーザー noya2
提出日時 2021-05-08 12:51:52
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 282 ms / 2,000 ms
コード長 3,852 bytes
コンパイル時間 4,922 ms
コンパイル使用メモリ 260,828 KB
最終ジャッジ日時 2025-01-21 09:15:36
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using bint = mp::cpp_int;
*/
#include <atcoder/all>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
using namespace std;
using namespace atcoder;
using namespace internal;
//alias g++='g++ -I/mnt/c/Users/Owner/Desktop/ac-library'
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PI = pair<pair<int,int>,int>;
using PL = pair<long long, long long>;
using PLL = pair<pair<long long, long long>, long long>;
using Pxy = pair<long double, long double>;
const int INF = 1001001007;
const int modd = 1000000007;
const long long modl = 1000000007LL;
const long long mod = 998244353LL;
const ll inf = 2e18;

template <typename SA>
void priv(vector<SA> &ar){
    if (ar.size() == 0) cout << endl;
    else {
        rep(i,int(ar.size()-1)) cout << ar[i] << " ";
        cout << ar[ar.size()-1] << endl;
    }
}
template <typename SB>
void privv(vector<vector<SB>> &ar){
    rep(i,int(ar.size())){
        priv(ar[i]);
    }
}
template <typename SC>
bool range(SC a, SC b, SC x){return (a <= x && x < b);}
bool rrange(P a, P b, P xy){
    return (range(a.first,b.first,xy.first) && range(a.second,b.second,xy.second));
}
template <typename SD>
void sor(vector<SD> &ar){sort(ar.begin(),ar.end());}
template <typename SE>
void rev(vector<SE> &ar){reverse(ar.begin(),ar.end());}
template <typename SF>
bool chmin(SF &a, const SF &b){if(a>b){a = b; return true;} return false;}
template <typename SG>
bool chmax(SG &a, const SG &b){if(a<b){a = b; return true;} return false;}
template <typename SH>
void eru(vector<SH> &ar){sor(ar);ar.erase(unique(ar.begin(),ar.end()),ar.end());}
template <typename SI>
SI   last(vector<SI> &ar){return ar[ar.size()-1];}
template <typename SJ>
SJ   cel(SJ a, SJ b){if (a % b == 0) return a/b; return a/b +1;}
template <typename SK, typename SL>
void pout(pair<SK,SL> p) {cout << p.first << " " << p.second << endl;}

void yes(){cout << "Yes" << endl;}
void no (){cout << "No" << endl;}
void yn (bool t){if(t)yes();else no();}
void Yes(){cout << "YES" << endl;}
void No (){cout << "NO" << endl;}
void YN (bool t){if(t)Yes();else No();}
void dout() {cout << setprecision(20);}

vector<int> dx = {0,1,0,-1};
vector<int> dy = {1,0,-1,0};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";

ll gcds(ll a, ll b){
    ll c = a % b;
    while (c != 0){
        a = b;
        b = c;
        c = a % b;
    }
    return b;
}


int n = 0;
vector<int> res;

vector<int> op(vector<int> a, vector<int> b){
    vector<int> ans(n);
    rep(i,n) ans[i] = b[a[i]];
    return ans;
}

vector<int> e(){
    return res;
}

int main(){
    int m, q; cin >> n >> m >> q;
    res.resize(n);
    rep(i,n) res[i] = i;
    segtree<vector<int>,op,e> seg(m);
    vector<vector<int>> ans;
    rep(i,q){
        int t; cin >> t;
        if (t == 1){
            int b; cin >> b;
            b--;
            vector<int> p(n);
            rep(j,n) {
                cin >> p[j];
                p[j]--;
            }
            seg.set(b,p);
        }
        else if (t == 2){
            int s; cin >> s;
            vector<int> rec = seg.prod(0,s);
            vector<int> add(n);
            rep(j,n) add[rec[j]] = j+1;
            ans.emplace_back(add);
        }
        else if (t == 3){
            int l, r; cin >> l >> r;
            vector<int> rec = seg.prod(l-1,r);
            vector<int> excite = {0};
            rep(j,n) excite[0] += abs(j - rec[j]);
            ans.emplace_back(excite);
        }
    }
    privv(ans);
}
0