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

• 問題: No.1558 Derby Live
• ユーザー: abc3
• 提出日時: 2021-06-26 09:28:24
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 327 ms / 2,000 ms
• コード長: 2,954 bytes
• コンパイル時間: 3,099 ms
• コンパイル使用メモリ: 206,296 KB
• 最終ジャッジ日時: 2025-01-22 13:02:45
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
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
93
94
95
96
97
98
99
100
101
102
103
104
    #include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    using P=pair<ll,ll>;
    const int INF=INT_MAX;
    const int mod=1e9+7;
    
    struct SegmentTree {
    private:
        int n;
        vector<vector<int>> node;
    
    public:
        vector<int>comp(vector<int>l,vector<int>r){
            int sz=l.size();
            vector<int>s(sz);
            rep(i,sz){s[i]=r[l[i]];}
            return s;
        }
        SegmentTree(int m,int sz) {
            n = 1; while(n < m) n *= 2;
            vector<int>res(sz);
            iota(res.begin(),res.end(),0);
            node.resize(2*n-1,res);
            for(int i=0; i<n; i++) node[i+n-1] = res;
            for(int i=n-2; i>=0; i--) node[i] = comp(node[2*i+1],node[2*i+2]);
        }
    
        void update(int x, vector<int> val) {
            x += (n - 1);
            node[x] = val;
            while(x > 0) {
                x = (x - 1) / 2;
                int sz=val.size();
                node[x] = comp(node[2*x+1],node[2*x+2]);
            }
        }
    
        vector<int> get(int a, int b, int sz,int k=0, int l=0, int r=-1) {
            vector<int>res(sz);
            iota(res.begin(),res.end(),0);
            if(r < 0) r = n;
            if(r <= a || b <= l) return res;
            if(a <= l && r <= b) return node[k];
    
            auto vl = get(a, b,sz, 2*k+1, l, (l+r)/2);
            auto vr= get(a, b,sz, 2*k+2, (l+r)/2, r);
            res=comp(vl,vr);
            return res;
        }
    };
    void solve(){
        int n,m,q;
        cin>>n>>m>>q;
        SegmentTree seg(m,n);
        rep(Q,q){
            int t;
            cin>>t;
            if(t==1){
                int d;
                cin>>d;d--;
                vector<int>p(n);
                rep(j,n){cin>>p[j];p[j]--;}
                seg.update(d,p);
            }
            else if(t==2){
                int s;
                cin>>s;
                vector<int>p=seg.get(0,s,n);
                vector<int>res(n);
                rep(j,n){res[p[j]]=j;}
                rep(j,n){
                  if(j){cout<<" ";}
                  cout<<res[j]+1;
                }cout<<endl;
            }
            else if(t==3){
                int l,r;
                cin>>l>>r;
                vector<int> p=seg.get(l-1,r,n);
                int ans=0;
                rep(j,n){ans+=abs(p[j]-j);}
                cout<<ans<<endl;
            }
        }
    }
    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve(); 
        
        return 0;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX