oj.uz

Submission #739059

# Submission time Handle Problem Language Result Execution time Memory
739059 2023-05-09T19:58:20 Z Toxtaq Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 246 ms 19676 KB 
#include<bits/stdc++.h>
using namespace std;
struct SegmentTree{
     vector<int>segTree;
     vector<int>lazy;
     SegmentTree(int n){
        segTree.resize(4 * n);
        lazy.resize(4 * n);
     }
     void Propagate(int node, int l, int r){
        if(!lazy[node])return;
        if(l == r){
            segTree[node] = lazy[node];
        }
        else{
            lazy[node * 2] = lazy[node];
            lazy[node * 2 + 1] = lazy[node];
        }
        lazy[node] = 0;
     }
     void Build(int node, int l, int r, vector<int>&v){
        if(l == r){
            segTree[node] = v[l];
        }
        else{
            int mid = (l + r) >> 1;
            Build(node * 2, l, mid, v);
            Build(node * 2 + 1, mid + 1, r, v);
        }
     }
     void Update(int node, int l, int r, int ql, int qr, int val){
        Propagate(node, l, r);
        if(ql <= l && r <= qr){
            lazy[node] = val;
            Propagate(node, l, r);
            return;
        }
        if(ql > r || l > qr)return;
        int mid = (l + r) >> 1;
        Update(node * 2, l, mid, ql, qr, val);
        Update(node * 2 + 1, mid + 1, r, ql, qr, val);
     }
     void Print(int node, int l, int r){
        Propagate(node, l, r);
        if(l == r){
            cout << segTree[node] << "\n";
        }
        else{
            int mid = (l + r) >> 1;
            Print(node * 2, l, mid);
            Print(node * 2 + 1, mid + 1, r);
        }
     }
     int Query(int node, int l, int r, int pos){
        Propagate(node, l, r);
        if(l == r)return segTree[node];
        int mid = (l + r) >> 1;
        if(pos <= mid)return Query(node * 2, l, mid, pos);
        else return Query(node * 2 + 1, mid + 1, r, pos);
     }
};
int main()
{
    int n;
    cin >> n;
    vector<int>stones(n + 1);
    for(int i = 1;i <= n;++i){
        cin >> stones[i];
    }
    SegmentTree tree(n);
    tree.Build(1, 1, n, stones);
    map<int, int>last;
    for(int i = 1;i <= n;++i){
        int cur = stones[i];
        if(cur == tree.Query(1, 1, n, last[cur]))tree.Update(1, 1, n, last[cur], i, cur);
        last[cur] = i;
    }
    tree.Print(1, 1, n);
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 88 ms 7632 KB Output is correct
18 Correct 95 ms 7736 KB Output is correct
19 Correct 131 ms 7660 KB Output is correct
20 Correct 123 ms 7736 KB Output is correct
21 Correct 100 ms 7736 KB Output is correct
22 Correct 93 ms 7724 KB Output is correct
23 Correct 92 ms 7740 KB Output is correct
24 Correct 93 ms 7728 KB Output is correct
25 Correct 94 ms 7668 KB Output is correct
26 Correct 91 ms 7744 KB Output is correct
27 Correct 93 ms 7736 KB Output is correct
28 Correct 90 ms 7728 KB Output is correct
29 Correct 74 ms 7728 KB Output is correct
30 Correct 84 ms 7736 KB Output is correct
31 Correct 87 ms 7736 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 88 ms 7632 KB Output is correct
48 Correct 95 ms 7736 KB Output is correct
49 Correct 131 ms 7660 KB Output is correct
50 Correct 123 ms 7736 KB Output is correct
51 Correct 100 ms 7736 KB Output is correct
52 Correct 93 ms 7724 KB Output is correct
53 Correct 92 ms 7740 KB Output is correct
54 Correct 93 ms 7728 KB Output is correct
55 Correct 94 ms 7668 KB Output is correct
56 Correct 91 ms 7744 KB Output is correct
57 Correct 93 ms 7736 KB Output is correct
58 Correct 90 ms 7728 KB Output is correct
59 Correct 74 ms 7728 KB Output is correct
60 Correct 84 ms 7736 KB Output is correct
61 Correct 87 ms 7736 KB Output is correct
62 Correct 139 ms 9236 KB Output is correct
63 Correct 221 ms 18820 KB Output is correct
64 Correct 205 ms 18840 KB Output is correct
65 Correct 138 ms 9136 KB Output is correct
66 Correct 129 ms 9180 KB Output is correct
67 Correct 168 ms 10468 KB Output is correct
68 Correct 139 ms 9260 KB Output is correct
69 Correct 134 ms 9292 KB Output is correct
70 Correct 138 ms 9956 KB Output is correct
71 Correct 155 ms 9452 KB Output is correct
72 Correct 132 ms 9508 KB Output is correct
73 Correct 214 ms 14936 KB Output is correct
74 Correct 246 ms 15160 KB Output is correct
75 Correct 213 ms 19468 KB Output is correct
76 Correct 213 ms 19012 KB Output is correct
77 Correct 211 ms 19676 KB Output is correct
78 Correct 219 ms 18772 KB Output is correct