oj.uz

Submission #441030

# Submission time Handle Problem Language Result Execution time Memory
441030 2021-07-03T23:21:22 Z Redhood Segments (IZhO18_segments) C++14
100 / 100
 2673 ms 18456 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define len(x) (int)(x).size()
using namespace std;

/// x,y
const int N = (int)2e5 + 10;
const int buben = 1000;
const int C = buben*2;
int L[N], R[N];
int memory[N];
int oukek[N/buben+1];
    vector<int>ID[N/buben+1],X[N/buben+1],Y[N/buben+1],Ylen[N/buben+1];
    set < pair < int , int > > have;
    int numofblock[N], YV[N], YVlen[N];
    int done = 0;
    int blocks=1;
    void rebuild(){
//        cerr << "rebuild start\n";
        ///i love this trick, yup
        for(int x = 0; x < blocks; ++x)
            ID[x].clear(), X[x].clear(), Y[x].clear(), Ylen[x].clear();
        int n = len(have);


        assert(n >= 1);
        n = max(n , 1);
        blocks = (n-1)/buben+1;
        for(int i = 0; i <= (n-1)/buben; ++i){
            oukek[i]=0;
            if(i < (n-1)/buben){
                X[i].resize(buben);
                ID[i].resize(buben);
                Y[i].resize(buben);
                Ylen[i].resize(buben);
            }else{
                int left = n - max(0,((n-1)/buben-1)+1)*buben;
                X[i].resize(left);
                ID[i].resize(left);
                Y[i].resize(left);
                Ylen[i].resize(left);
            }
        }


        int ind=0;
        for(auto u : have){
            X[ind/buben][ind%buben] = L[u.se];
            ID[ind/buben][ind%buben] = u.se;
            Y[ind/buben][ind%buben] = R[u.se];
            Ylen[ind/buben][ind%buben] = R[u.se]-L[u.se]+1;
            numofblock[u.se] = ind/buben;
            ind++;
        }
        for(int i = 0 ; i <= (n-1)/buben; ++i)
            sort(all(Y[i])), sort(all(Ylen[i]));
    }
    void add(int id, int y, int Len){
        int x = L[id];
        have.insert({x , id});
        YV[id] = y;
        YVlen[id] = Len;
        for(int idb = 0; idb < blocks; ++idb){
            if(idb == blocks-1 || X[idb+1][0] >= x){
                int pos = lower_bound(all(X[idb]), x) - X[idb].begin();
                X[idb].insert(X[idb].begin()+pos, x);
                ID[idb].insert(ID[idb].begin()+pos, id);
                int ps1 = lower_bound(all(Y[idb]), y) - Y[idb].begin();
                Y[idb].insert(Y[idb].begin()+ps1, y);
                int ps2 = lower_bound(all(Ylen[idb]), Len) - Ylen[idb].begin();
                Ylen[idb].insert(Ylen[idb].begin()+ps2, Len);

                numofblock[id] = idb;
                break;
            }
        }
        done++;
        if(done == C){
            done = 0;
            rebuild();
        }
    }
    void del(int id, int y, int Len){
        int x = L[id];
        have.erase({x ,id});
        int idb = numofblock[id];
        bool found=0;
        for(int i=0;i<len(ID[idb]);++i){
            if(ID[idb][i] == id){
                found=1;
                X[idb].erase(lower_bound(all(X[idb]),x));
                Y[idb].erase(lower_bound(all(Y[idb]),y));
                Ylen[idb].erase(lower_bound(all(Ylen[idb]), Len));
                ID[idb].erase(ID[idb].begin()+i);
                break;
            }
        }
        assert(found);
    }
    int qryR(int Lx, int Rx, int Yl){
        if(Lx > Rx)
            return 0;
        int ans = 0;
        for(int idb = 0 ; idb < blocks; ++idb){
            if(X[idb][0] >= Lx && X[idb].back() <= Rx){
                ans += Y[idb].end() - lower_bound(all(Y[idb]), Yl);
            }else{
                if(X[idb][0] > Rx)
                    break;
                if(X[idb].back() < Lx)
                    continue;
                for(int i = 0 ; i < len(X[idb]); ++i){
                    if(X[idb][i] >= Lx && X[idb][i] <= Rx && YV[ID[idb][i]] >= Yl)
                        ans++;
                }
            }
        }
        return ans;
    }
    int qryLen(int Lx, int Rx, int Yl){
        if(Lx > Rx)
            return 0;
        int ans = 0;
        for(int idb = 0 ; idb < blocks; ++idb){
            if(X[idb][0] >= Lx && X[idb].back() <= Rx){
                ans += Ylen[idb].end() - lower_bound(all(Ylen[idb]), Yl);
            }else{
                if(X[idb][0] > Rx)
                    break;
                if(X[idb].back() < Lx)
                    continue;
                for(int i = 0 ; i < len(X[idb]); ++i){
                    if(X[idb][i] >= Lx && X[idb][i] <= Rx && YVlen[ID[idb][i]] >= Yl)
                        ans++;
                }
            }
        }
        return ans;
    }

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int n, t;
    cin >> n >> t;
    int lst = 1;
    int lastans = 0;
    for(int i = 0 ; i < n; ++i){
        int type;cin >> type;
        if(type == 1){
            int a,b;cin >> a >> b;
            a = a ^ (t * lastans);
            b = b ^ (t * lastans);
            if(a > b)swap(a , b);
            L[lst] = a, R[lst] = b;
            add(lst, R[lst], R[lst]-L[lst]+1);
            lst++;
        }
        if(type == 2){
            int id;cin >> id;
            del(id, R[id], R[id]-L[id]+1);
        }
        if(type == 3){
            int a,b,k;cin >> a >> b >> k;
            a = a ^ (t * lastans);
            b = b ^ (t * lastans);
            if(a > b)swap(a,b);
            int answer = qryLen(a, b-k+1, k) + qryR(0, a-1, a+k-1);
            cout << answer << '\n';
            lastans = answer;
        }
    }
    return 0;
}
/*
6 1
1 1 2
3 2 4 2
1 3 5
3 2 3 1
2 1
3 0 3 1

6 0
1 3 10
1 3 5
3 6 10 6
2 1
1 3 10
3 6 4 2
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 396 KB Output is correct
5 Correct 15 ms 792 KB Output is correct
6 Correct 18 ms 696 KB Output is correct
7 Correct 9 ms 452 KB Output is correct
8 Correct 12 ms 624 KB Output is correct
9 Correct 15 ms 620 KB Output is correct
10 Correct 9 ms 716 KB Output is correct
11 Correct 20 ms 608 KB Output is correct
12 Correct 27 ms 616 KB Output is correct
13 Correct 12 ms 684 KB Output is correct
14 Correct 12 ms 588 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 15 ms 524 KB Output is correct
18 Correct 10 ms 732 KB Output is correct
19 Correct 11 ms 460 KB Output is correct
20 Correct 12 ms 516 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 753 ms 5492 KB Output is correct
2 Correct 781 ms 5520 KB Output is correct
3 Correct 764 ms 5540 KB Output is correct
4 Correct 748 ms 5956 KB Output is correct
5 Correct 635 ms 9616 KB Output is correct
6 Correct 564 ms 9844 KB Output is correct
7 Correct 760 ms 5444 KB Output is correct
8 Correct 766 ms 5488 KB Output is correct
9 Correct 780 ms 5444 KB Output is correct
10 Correct 803 ms 2740 KB Output is correct
11 Correct 821 ms 3408 KB Output is correct
12 Correct 689 ms 7364 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 1172 KB Output is correct
2 Correct 62 ms 1080 KB Output is correct
3 Correct 124 ms 1124 KB Output is correct
4 Correct 65 ms 1092 KB Output is correct
5 Correct 564 ms 7512 KB Output is correct
6 Correct 536 ms 6512 KB Output is correct
7 Correct 539 ms 6972 KB Output is correct
8 Correct 596 ms 9620 KB Output is correct
9 Correct 599 ms 9280 KB Output is correct
10 Correct 458 ms 6952 KB Output is correct
11 Correct 237 ms 1408 KB Output is correct
12 Correct 468 ms 7160 KB Output is correct
13 Correct 480 ms 6312 KB Output is correct
14 Correct 352 ms 3756 KB Output is correct
15 Correct 345 ms 3436 KB Output is correct
16 Correct 313 ms 2628 KB Output is correct
17 Correct 582 ms 5572 KB Output is correct
18 Correct 524 ms 5444 KB Output is correct
19 Correct 554 ms 5576 KB Output is correct
20 Correct 531 ms 5548 KB Output is correct
21 Correct 257 ms 1632 KB Output is correct
22 Correct 377 ms 4356 KB Output is correct
23 Correct 428 ms 5552 KB Output is correct
24 Correct 396 ms 4616 KB Output is correct
25 Correct 89 ms 1132 KB Output is correct
26 Correct 68 ms 1092 KB Output is correct
27 Correct 86 ms 1268 KB Output is correct
28 Correct 73 ms 1104 KB Output is correct
29 Correct 472 ms 5956 KB Output is correct
30 Correct 496 ms 6012 KB Output is correct
31 Correct 615 ms 9260 KB Output is correct
32 Correct 504 ms 6980 KB Output is correct
33 Correct 487 ms 6520 KB Output is correct
34 Correct 344 ms 3256 KB Output is correct
35 Correct 422 ms 5688 KB Output is correct
36 Correct 481 ms 6840 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1060 KB Output is correct
2 Correct 72 ms 1008 KB Output is correct
3 Correct 67 ms 1012 KB Output is correct
4 Correct 75 ms 1092 KB Output is correct
5 Correct 660 ms 7980 KB Output is correct
6 Correct 837 ms 2132 KB Output is correct
7 Correct 689 ms 8568 KB Output is correct
8 Correct 790 ms 2904 KB Output is correct
9 Correct 464 ms 4292 KB Output is correct
10 Correct 566 ms 7516 KB Output is correct
11 Correct 397 ms 2316 KB Output is correct
12 Correct 596 ms 9744 KB Output is correct
13 Correct 508 ms 6308 KB Output is correct
14 Correct 436 ms 3908 KB Output is correct
15 Correct 607 ms 9132 KB Output is correct
16 Correct 512 ms 6724 KB Output is correct
17 Correct 778 ms 5456 KB Output is correct
18 Correct 768 ms 5560 KB Output is correct
19 Correct 750 ms 5520 KB Output is correct
20 Correct 769 ms 5540 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 396 KB Output is correct
5 Correct 15 ms 792 KB Output is correct
6 Correct 18 ms 696 KB Output is correct
7 Correct 9 ms 452 KB Output is correct
8 Correct 12 ms 624 KB Output is correct
9 Correct 15 ms 620 KB Output is correct
10 Correct 9 ms 716 KB Output is correct
11 Correct 20 ms 608 KB Output is correct
12 Correct 27 ms 616 KB Output is correct
13 Correct 12 ms 684 KB Output is correct
14 Correct 12 ms 588 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 15 ms 524 KB Output is correct
18 Correct 10 ms 732 KB Output is correct
19 Correct 11 ms 460 KB Output is correct
20 Correct 12 ms 516 KB Output is correct
21 Correct 753 ms 5492 KB Output is correct
22 Correct 781 ms 5520 KB Output is correct
23 Correct 764 ms 5540 KB Output is correct
24 Correct 748 ms 5956 KB Output is correct
25 Correct 635 ms 9616 KB Output is correct
26 Correct 564 ms 9844 KB Output is correct
27 Correct 760 ms 5444 KB Output is correct
28 Correct 766 ms 5488 KB Output is correct
29 Correct 780 ms 5444 KB Output is correct
30 Correct 803 ms 2740 KB Output is correct
31 Correct 821 ms 3408 KB Output is correct
32 Correct 689 ms 7364 KB Output is correct
33 Correct 63 ms 1060 KB Output is correct
34 Correct 72 ms 1008 KB Output is correct
35 Correct 67 ms 1012 KB Output is correct
36 Correct 75 ms 1092 KB Output is correct
37 Correct 660 ms 7980 KB Output is correct
38 Correct 837 ms 2132 KB Output is correct
39 Correct 689 ms 8568 KB Output is correct
40 Correct 790 ms 2904 KB Output is correct
41 Correct 464 ms 4292 KB Output is correct
42 Correct 566 ms 7516 KB Output is correct
43 Correct 397 ms 2316 KB Output is correct
44 Correct 596 ms 9744 KB Output is correct
45 Correct 508 ms 6308 KB Output is correct
46 Correct 436 ms 3908 KB Output is correct
47 Correct 607 ms 9132 KB Output is correct
48 Correct 512 ms 6724 KB Output is correct
49 Correct 778 ms 5456 KB Output is correct
50 Correct 768 ms 5560 KB Output is correct
51 Correct 750 ms 5520 KB Output is correct
52 Correct 769 ms 5540 KB Output is correct
53 Correct 95 ms 1124 KB Output is correct
54 Correct 80 ms 1012 KB Output is correct
55 Correct 66 ms 1012 KB Output is correct
56 Correct 71 ms 1108 KB Output is correct
57 Correct 815 ms 4016 KB Output is correct
58 Correct 805 ms 1728 KB Output is correct
59 Correct 720 ms 6592 KB Output is correct
60 Correct 815 ms 1476 KB Output is correct
61 Correct 512 ms 6256 KB Output is correct
62 Correct 595 ms 8896 KB Output is correct
63 Correct 619 ms 9460 KB Output is correct
64 Correct 563 ms 8960 KB Output is correct
65 Correct 372 ms 2780 KB Output is correct
66 Correct 363 ms 2444 KB Output is correct
67 Correct 539 ms 6860 KB Output is correct
68 Correct 480 ms 5356 KB Output is correct
69 Correct 756 ms 5536 KB Output is correct
70 Correct 768 ms 5616 KB Output is correct
71 Correct 777 ms 5472 KB Output is correct
72 Correct 754 ms 5468 KB Output is correct
73 Correct 449 ms 3236 KB Output is correct
74 Correct 485 ms 5376 KB Output is correct
75 Correct 577 ms 9976 KB Output is correct
76 Correct 603 ms 9672 KB Output is correct
77 Correct 73 ms 1036 KB Output is correct
78 Correct 68 ms 1028 KB Output is correct
79 Correct 81 ms 1092 KB Output is correct
80 Correct 69 ms 1092 KB Output is correct
81 Correct 500 ms 5068 KB Output is correct
82 Correct 437 ms 3352 KB Output is correct
83 Correct 405 ms 2104 KB Output is correct
84 Correct 525 ms 5212 KB Output is correct
85 Correct 527 ms 6808 KB Output is correct
86 Correct 509 ms 7076 KB Output is correct
87 Correct 451 ms 4328 KB Output is correct
88 Correct 357 ms 2244 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 396 KB Output is correct
5 Correct 15 ms 792 KB Output is correct
6 Correct 18 ms 696 KB Output is correct
7 Correct 9 ms 452 KB Output is correct
8 Correct 12 ms 624 KB Output is correct
9 Correct 15 ms 620 KB Output is correct
10 Correct 9 ms 716 KB Output is correct
11 Correct 20 ms 608 KB Output is correct
12 Correct 27 ms 616 KB Output is correct
13 Correct 12 ms 684 KB Output is correct
14 Correct 12 ms 588 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 15 ms 524 KB Output is correct
18 Correct 10 ms 732 KB Output is correct
19 Correct 11 ms 460 KB Output is correct
20 Correct 12 ms 516 KB Output is correct
21 Correct 753 ms 5492 KB Output is correct
22 Correct 781 ms 5520 KB Output is correct
23 Correct 764 ms 5540 KB Output is correct
24 Correct 748 ms 5956 KB Output is correct
25 Correct 635 ms 9616 KB Output is correct
26 Correct 564 ms 9844 KB Output is correct
27 Correct 760 ms 5444 KB Output is correct
28 Correct 766 ms 5488 KB Output is correct
29 Correct 780 ms 5444 KB Output is correct
30 Correct 803 ms 2740 KB Output is correct
31 Correct 821 ms 3408 KB Output is correct
32 Correct 689 ms 7364 KB Output is correct
33 Correct 83 ms 1172 KB Output is correct
34 Correct 62 ms 1080 KB Output is correct
35 Correct 124 ms 1124 KB Output is correct
36 Correct 65 ms 1092 KB Output is correct
37 Correct 564 ms 7512 KB Output is correct
38 Correct 536 ms 6512 KB Output is correct
39 Correct 539 ms 6972 KB Output is correct
40 Correct 596 ms 9620 KB Output is correct
41 Correct 599 ms 9280 KB Output is correct
42 Correct 458 ms 6952 KB Output is correct
43 Correct 237 ms 1408 KB Output is correct
44 Correct 468 ms 7160 KB Output is correct
45 Correct 480 ms 6312 KB Output is correct
46 Correct 352 ms 3756 KB Output is correct
47 Correct 345 ms 3436 KB Output is correct
48 Correct 313 ms 2628 KB Output is correct
49 Correct 582 ms 5572 KB Output is correct
50 Correct 524 ms 5444 KB Output is correct
51 Correct 554 ms 5576 KB Output is correct
52 Correct 531 ms 5548 KB Output is correct
53 Correct 257 ms 1632 KB Output is correct
54 Correct 377 ms 4356 KB Output is correct
55 Correct 428 ms 5552 KB Output is correct
56 Correct 396 ms 4616 KB Output is correct
57 Correct 89 ms 1132 KB Output is correct
58 Correct 68 ms 1092 KB Output is correct
59 Correct 86 ms 1268 KB Output is correct
60 Correct 73 ms 1104 KB Output is correct
61 Correct 472 ms 5956 KB Output is correct
62 Correct 496 ms 6012 KB Output is correct
63 Correct 615 ms 9260 KB Output is correct
64 Correct 504 ms 6980 KB Output is correct
65 Correct 487 ms 6520 KB Output is correct
66 Correct 344 ms 3256 KB Output is correct
67 Correct 422 ms 5688 KB Output is correct
68 Correct 481 ms 6840 KB Output is correct
69 Correct 63 ms 1060 KB Output is correct
70 Correct 72 ms 1008 KB Output is correct
71 Correct 67 ms 1012 KB Output is correct
72 Correct 75 ms 1092 KB Output is correct
73 Correct 660 ms 7980 KB Output is correct
74 Correct 837 ms 2132 KB Output is correct
75 Correct 689 ms 8568 KB Output is correct
76 Correct 790 ms 2904 KB Output is correct
77 Correct 464 ms 4292 KB Output is correct
78 Correct 566 ms 7516 KB Output is correct
79 Correct 397 ms 2316 KB Output is correct
80 Correct 596 ms 9744 KB Output is correct
81 Correct 508 ms 6308 KB Output is correct
82 Correct 436 ms 3908 KB Output is correct
83 Correct 607 ms 9132 KB Output is correct
84 Correct 512 ms 6724 KB Output is correct
85 Correct 778 ms 5456 KB Output is correct
86 Correct 768 ms 5560 KB Output is correct
87 Correct 750 ms 5520 KB Output is correct
88 Correct 769 ms 5540 KB Output is correct
89 Correct 95 ms 1124 KB Output is correct
90 Correct 80 ms 1012 KB Output is correct
91 Correct 66 ms 1012 KB Output is correct
92 Correct 71 ms 1108 KB Output is correct
93 Correct 815 ms 4016 KB Output is correct
94 Correct 805 ms 1728 KB Output is correct
95 Correct 720 ms 6592 KB Output is correct
96 Correct 815 ms 1476 KB Output is correct
97 Correct 512 ms 6256 KB Output is correct
98 Correct 595 ms 8896 KB Output is correct
99 Correct 619 ms 9460 KB Output is correct
100 Correct 563 ms 8960 KB Output is correct
101 Correct 372 ms 2780 KB Output is correct
102 Correct 363 ms 2444 KB Output is correct
103 Correct 539 ms 6860 KB Output is correct
104 Correct 480 ms 5356 KB Output is correct
105 Correct 756 ms 5536 KB Output is correct
106 Correct 768 ms 5616 KB Output is correct
107 Correct 777 ms 5472 KB Output is correct
108 Correct 754 ms 5468 KB Output is correct
109 Correct 449 ms 3236 KB Output is correct
110 Correct 485 ms 5376 KB Output is correct
111 Correct 577 ms 9976 KB Output is correct
112 Correct 603 ms 9672 KB Output is correct
113 Correct 73 ms 1036 KB Output is correct
114 Correct 68 ms 1028 KB Output is correct
115 Correct 81 ms 1092 KB Output is correct
116 Correct 69 ms 1092 KB Output is correct
117 Correct 500 ms 5068 KB Output is correct
118 Correct 437 ms 3352 KB Output is correct
119 Correct 405 ms 2104 KB Output is correct
120 Correct 525 ms 5212 KB Output is correct
121 Correct 527 ms 6808 KB Output is correct
122 Correct 509 ms 7076 KB Output is correct
123 Correct 451 ms 4328 KB Output is correct
124 Correct 357 ms 2244 KB Output is correct
125 Correct 167 ms 1780 KB Output is correct
126 Correct 164 ms 1756 KB Output is correct
127 Correct 225 ms 1828 KB Output is correct
128 Correct 182 ms 1876 KB Output is correct
129 Correct 142 ms 1744 KB Output is correct
130 Correct 184 ms 1888 KB Output is correct
131 Correct 1797 ms 3156 KB Output is correct
132 Correct 2083 ms 9456 KB Output is correct
133 Correct 2177 ms 13500 KB Output is correct
134 Correct 1822 ms 4452 KB Output is correct
135 Correct 2405 ms 14344 KB Output is correct
136 Correct 1662 ms 1436 KB Output is correct
137 Correct 2529 ms 17872 KB Output is correct
138 Correct 1688 ms 11452 KB Output is correct
139 Correct 2033 ms 14728 KB Output is correct
140 Correct 2316 ms 17052 KB Output is correct
141 Correct 1943 ms 13080 KB Output is correct
142 Correct 812 ms 2888 KB Output is correct
143 Correct 985 ms 5276 KB Output is correct
144 Correct 603 ms 2500 KB Output is correct
145 Correct 2673 ms 16820 KB Output is correct
146 Correct 1451 ms 7992 KB Output is correct
147 Correct 1235 ms 5624 KB Output is correct
148 Correct 1103 ms 5076 KB Output is correct
149 Correct 2216 ms 10648 KB Output is correct
150 Correct 2191 ms 10732 KB Output is correct
151 Correct 2326 ms 10768 KB Output is correct
152 Correct 2201 ms 10704 KB Output is correct
153 Correct 2225 ms 10660 KB Output is correct
154 Correct 2187 ms 10692 KB Output is correct
155 Correct 984 ms 3948 KB Output is correct
156 Correct 1216 ms 5764 KB Output is correct
157 Correct 2411 ms 17056 KB Output is correct
158 Correct 2595 ms 17624 KB Output is correct
159 Correct 1854 ms 12148 KB Output is correct
160 Correct 1551 ms 8324 KB Output is correct
161 Correct 219 ms 1860 KB Output is correct
162 Correct 236 ms 1864 KB Output is correct
163 Correct 233 ms 1768 KB Output is correct
164 Correct 379 ms 1920 KB Output is correct
165 Correct 241 ms 1912 KB Output is correct
166 Correct 182 ms 1852 KB Output is correct
167 Correct 2633 ms 18456 KB Output is correct
168 Correct 2438 ms 18404 KB Output is correct
169 Correct 2349 ms 16844 KB Output is correct
170 Correct 2544 ms 16032 KB Output is correct
171 Correct 1858 ms 13040 KB Output is correct
172 Correct 1327 ms 7180 KB Output is correct
173 Correct 2347 ms 17244 KB Output is correct
174 Correct 1245 ms 7792 KB Output is correct
175 Correct 1966 ms 13876 KB Output is correct
176 Correct 977 ms 5240 KB Output is correct
177 Correct 1732 ms 11980 KB Output is correct
178 Correct 1671 ms 11216 KB Output is correct