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

• 問題: No.1558 Derby Live
• ユーザー: bayashiko
• 提出日時: 2021-06-25 23:14:28
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 214 ms / 2,000 ms
• コード長: 2,435 bytes
• コンパイル時間: 6,128 ms
• コンパイル使用メモリ: 275,480 KB
• 最終ジャッジ日時: 2025-01-22 12:39:53
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 2
other	AC * 33

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define flc(x) __builtin_popcountll(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define vec vector<lint>
#define nep(x) next_permutation(all(x))
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=3e5+5;
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//vector<int> bucket[MAX_N/1000];
constexpr int MOD=1000000007;
//constexpr int MOD=998244353;
#include<atcoder/all>
using namespace atcoder;
typedef __int128_t llint;
int N,M,Q;
vector<int> ei;
vector<int> op(vector<int> a,vector<int> b){
    vector<int> res(N);
    rep(i,N) res[i]=b[a[i]];
    return res;
}
vector<int> e(){
    return ei;
}
int fix(int p){
    return M-1-p;
}
int main(void){
    cin >> N >> M >> Q;
    ei.resize(N);
    rep(i,N) ei[i]=i;
    segtree<vector<int>,op,e> seg(M);
    while(Q--){
        int t;
        cin >> t;
        if(t==1){
            int D;
            cin >> D;
            D--;
            D=fix(D);
            vector<int> P(N);
            rep(j,N) cin >> P[j],P[j]--;
            vector<int> st(N);
            rep(j,N) st[P[j]]=j;
            seg.set(D,st);
        }
        else if(t==2){
            int S;
            cin >> S;
            S--;
            vector<int> res=seg.prod(fix(S),M);
            rep(i,N) cout << res[i]+1 << " ";
            cout << endl;
        }
        else{
            int L,R;
            cin >> L >> R;
            L--,R--;
            vector<int> res=seg.prod(fix(R),fix(L)+1);
            int ans2=0;
            rep(i,N) ans2+=abs(i-res[i]);
            cout << ans2 << endl;
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX