oj.uz

Submission #441031

# Submission time Handle Problem Language Result Execution time Memory
441031 2021-07-03T23:22:58 Z Redhood Segments (IZhO18_segments) C++14
100 / 100
 4955 ms 18508 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 = 400;
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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 10 ms 712 KB Output is correct
6 Correct 11 ms 760 KB Output is correct
7 Correct 7 ms 460 KB Output is correct
8 Correct 21 ms 716 KB Output is correct
9 Correct 8 ms 588 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 12 ms 652 KB Output is correct
12 Correct 12 ms 588 KB Output is correct
13 Correct 9 ms 716 KB Output is correct
14 Correct 9 ms 648 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 5 ms 332 KB Output is correct
17 Correct 8 ms 460 KB Output is correct
18 Correct 12 ms 716 KB Output is correct
19 Correct 11 ms 460 KB Output is correct
20 Correct 9 ms 588 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 789 ms 5604 KB Output is correct
2 Correct 718 ms 5624 KB Output is correct
3 Correct 746 ms 5540 KB Output is correct
4 Correct 791 ms 5928 KB Output is correct
5 Correct 1050 ms 9640 KB Output is correct
6 Correct 1304 ms 9828 KB Output is correct
7 Correct 725 ms 5492 KB Output is correct
8 Correct 725 ms 5460 KB Output is correct
9 Correct 697 ms 5532 KB Output is correct
10 Correct 530 ms 2660 KB Output is correct
11 Correct 644 ms 3376 KB Output is correct
12 Correct 926 ms 7452 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 1060 KB Output is correct
2 Correct 64 ms 1028 KB Output is correct
3 Correct 114 ms 1176 KB Output is correct
4 Correct 65 ms 1112 KB Output is correct
5 Correct 839 ms 7584 KB Output is correct
6 Correct 690 ms 6452 KB Output is correct
7 Correct 810 ms 6972 KB Output is correct
8 Correct 1106 ms 9560 KB Output is correct
9 Correct 1051 ms 9244 KB Output is correct
10 Correct 844 ms 7236 KB Output is correct
11 Correct 165 ms 1440 KB Output is correct
12 Correct 770 ms 7208 KB Output is correct
13 Correct 732 ms 6488 KB Output is correct
14 Correct 433 ms 3776 KB Output is correct
15 Correct 388 ms 3284 KB Output is correct
16 Correct 321 ms 2628 KB Output is correct
17 Correct 706 ms 5528 KB Output is correct
18 Correct 603 ms 5628 KB Output is correct
19 Correct 687 ms 5644 KB Output is correct
20 Correct 644 ms 5568 KB Output is correct
21 Correct 199 ms 1608 KB Output is correct
22 Correct 530 ms 4476 KB Output is correct
23 Correct 604 ms 5548 KB Output is correct
24 Correct 506 ms 4676 KB Output is correct
25 Correct 120 ms 1092 KB Output is correct
26 Correct 71 ms 1092 KB Output is correct
27 Correct 117 ms 1156 KB Output is correct
28 Correct 77 ms 1152 KB Output is correct
29 Correct 700 ms 6084 KB Output is correct
30 Correct 702 ms 5920 KB Output is correct
31 Correct 1148 ms 9308 KB Output is correct
32 Correct 742 ms 7052 KB Output is correct
33 Correct 927 ms 6488 KB Output is correct
34 Correct 383 ms 3332 KB Output is correct
35 Correct 568 ms 5408 KB Output is correct
36 Correct 721 ms 6864 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1020 KB Output is correct
2 Correct 94 ms 1216 KB Output is correct
3 Correct 67 ms 1048 KB Output is correct
4 Correct 75 ms 1104 KB Output is correct
5 Correct 973 ms 8056 KB Output is correct
6 Correct 476 ms 2116 KB Output is correct
7 Correct 1049 ms 8616 KB Output is correct
8 Correct 529 ms 2772 KB Output is correct
9 Correct 559 ms 4336 KB Output is correct
10 Correct 954 ms 7540 KB Output is correct
11 Correct 301 ms 2296 KB Output is correct
12 Correct 1034 ms 9848 KB Output is correct
13 Correct 768 ms 6360 KB Output is correct
14 Correct 500 ms 3976 KB Output is correct
15 Correct 945 ms 9148 KB Output is correct
16 Correct 729 ms 6768 KB Output is correct
17 Correct 723 ms 5572 KB Output is correct
18 Correct 706 ms 5664 KB Output is correct
19 Correct 701 ms 5464 KB Output is correct
20 Correct 754 ms 5552 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 10 ms 712 KB Output is correct
6 Correct 11 ms 760 KB Output is correct
7 Correct 7 ms 460 KB Output is correct
8 Correct 21 ms 716 KB Output is correct
9 Correct 8 ms 588 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 12 ms 652 KB Output is correct
12 Correct 12 ms 588 KB Output is correct
13 Correct 9 ms 716 KB Output is correct
14 Correct 9 ms 648 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 5 ms 332 KB Output is correct
17 Correct 8 ms 460 KB Output is correct
18 Correct 12 ms 716 KB Output is correct
19 Correct 11 ms 460 KB Output is correct
20 Correct 9 ms 588 KB Output is correct
21 Correct 789 ms 5604 KB Output is correct
22 Correct 718 ms 5624 KB Output is correct
23 Correct 746 ms 5540 KB Output is correct
24 Correct 791 ms 5928 KB Output is correct
25 Correct 1050 ms 9640 KB Output is correct
26 Correct 1304 ms 9828 KB Output is correct
27 Correct 725 ms 5492 KB Output is correct
28 Correct 725 ms 5460 KB Output is correct
29 Correct 697 ms 5532 KB Output is correct
30 Correct 530 ms 2660 KB Output is correct
31 Correct 644 ms 3376 KB Output is correct
32 Correct 926 ms 7452 KB Output is correct
33 Correct 63 ms 1020 KB Output is correct
34 Correct 94 ms 1216 KB Output is correct
35 Correct 67 ms 1048 KB Output is correct
36 Correct 75 ms 1104 KB Output is correct
37 Correct 973 ms 8056 KB Output is correct
38 Correct 476 ms 2116 KB Output is correct
39 Correct 1049 ms 8616 KB Output is correct
40 Correct 529 ms 2772 KB Output is correct
41 Correct 559 ms 4336 KB Output is correct
42 Correct 954 ms 7540 KB Output is correct
43 Correct 301 ms 2296 KB Output is correct
44 Correct 1034 ms 9848 KB Output is correct
45 Correct 768 ms 6360 KB Output is correct
46 Correct 500 ms 3976 KB Output is correct
47 Correct 945 ms 9148 KB Output is correct
48 Correct 729 ms 6768 KB Output is correct
49 Correct 723 ms 5572 KB Output is correct
50 Correct 706 ms 5664 KB Output is correct
51 Correct 701 ms 5464 KB Output is correct
52 Correct 754 ms 5552 KB Output is correct
53 Correct 79 ms 1100 KB Output is correct
54 Correct 82 ms 1040 KB Output is correct
55 Correct 66 ms 1124 KB Output is correct
56 Correct 68 ms 1092 KB Output is correct
57 Correct 640 ms 3784 KB Output is correct
58 Correct 447 ms 1672 KB Output is correct
59 Correct 768 ms 6500 KB Output is correct
60 Correct 432 ms 1532 KB Output is correct
61 Correct 729 ms 6364 KB Output is correct
62 Correct 1072 ms 8992 KB Output is correct
63 Correct 984 ms 9508 KB Output is correct
64 Correct 1020 ms 9272 KB Output is correct
65 Correct 353 ms 2884 KB Output is correct
66 Correct 336 ms 2520 KB Output is correct
67 Correct 788 ms 6828 KB Output is correct
68 Correct 603 ms 5400 KB Output is correct
69 Correct 704 ms 5600 KB Output is correct
70 Correct 704 ms 5572 KB Output is correct
71 Correct 708 ms 5624 KB Output is correct
72 Correct 701 ms 5660 KB Output is correct
73 Correct 380 ms 3196 KB Output is correct
74 Correct 564 ms 5472 KB Output is correct
75 Correct 1026 ms 9972 KB Output is correct
76 Correct 987 ms 9668 KB Output is correct
77 Correct 73 ms 1092 KB Output is correct
78 Correct 70 ms 1080 KB Output is correct
79 Correct 80 ms 1096 KB Output is correct
80 Correct 69 ms 1040 KB Output is correct
81 Correct 542 ms 5292 KB Output is correct
82 Correct 383 ms 3268 KB Output is correct
83 Correct 292 ms 2244 KB Output is correct
84 Correct 555 ms 5376 KB Output is correct
85 Correct 714 ms 6964 KB Output is correct
86 Correct 749 ms 7144 KB Output is correct
87 Correct 541 ms 4420 KB Output is correct
88 Correct 285 ms 2324 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 10 ms 712 KB Output is correct
6 Correct 11 ms 760 KB Output is correct
7 Correct 7 ms 460 KB Output is correct
8 Correct 21 ms 716 KB Output is correct
9 Correct 8 ms 588 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 12 ms 652 KB Output is correct
12 Correct 12 ms 588 KB Output is correct
13 Correct 9 ms 716 KB Output is correct
14 Correct 9 ms 648 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 5 ms 332 KB Output is correct
17 Correct 8 ms 460 KB Output is correct
18 Correct 12 ms 716 KB Output is correct
19 Correct 11 ms 460 KB Output is correct
20 Correct 9 ms 588 KB Output is correct
21 Correct 789 ms 5604 KB Output is correct
22 Correct 718 ms 5624 KB Output is correct
23 Correct 746 ms 5540 KB Output is correct
24 Correct 791 ms 5928 KB Output is correct
25 Correct 1050 ms 9640 KB Output is correct
26 Correct 1304 ms 9828 KB Output is correct
27 Correct 725 ms 5492 KB Output is correct
28 Correct 725 ms 5460 KB Output is correct
29 Correct 697 ms 5532 KB Output is correct
30 Correct 530 ms 2660 KB Output is correct
31 Correct 644 ms 3376 KB Output is correct
32 Correct 926 ms 7452 KB Output is correct
33 Correct 86 ms 1060 KB Output is correct
34 Correct 64 ms 1028 KB Output is correct
35 Correct 114 ms 1176 KB Output is correct
36 Correct 65 ms 1112 KB Output is correct
37 Correct 839 ms 7584 KB Output is correct
38 Correct 690 ms 6452 KB Output is correct
39 Correct 810 ms 6972 KB Output is correct
40 Correct 1106 ms 9560 KB Output is correct
41 Correct 1051 ms 9244 KB Output is correct
42 Correct 844 ms 7236 KB Output is correct
43 Correct 165 ms 1440 KB Output is correct
44 Correct 770 ms 7208 KB Output is correct
45 Correct 732 ms 6488 KB Output is correct
46 Correct 433 ms 3776 KB Output is correct
47 Correct 388 ms 3284 KB Output is correct
48 Correct 321 ms 2628 KB Output is correct
49 Correct 706 ms 5528 KB Output is correct
50 Correct 603 ms 5628 KB Output is correct
51 Correct 687 ms 5644 KB Output is correct
52 Correct 644 ms 5568 KB Output is correct
53 Correct 199 ms 1608 KB Output is correct
54 Correct 530 ms 4476 KB Output is correct
55 Correct 604 ms 5548 KB Output is correct
56 Correct 506 ms 4676 KB Output is correct
57 Correct 120 ms 1092 KB Output is correct
58 Correct 71 ms 1092 KB Output is correct
59 Correct 117 ms 1156 KB Output is correct
60 Correct 77 ms 1152 KB Output is correct
61 Correct 700 ms 6084 KB Output is correct
62 Correct 702 ms 5920 KB Output is correct
63 Correct 1148 ms 9308 KB Output is correct
64 Correct 742 ms 7052 KB Output is correct
65 Correct 927 ms 6488 KB Output is correct
66 Correct 383 ms 3332 KB Output is correct
67 Correct 568 ms 5408 KB Output is correct
68 Correct 721 ms 6864 KB Output is correct
69 Correct 63 ms 1020 KB Output is correct
70 Correct 94 ms 1216 KB Output is correct
71 Correct 67 ms 1048 KB Output is correct
72 Correct 75 ms 1104 KB Output is correct
73 Correct 973 ms 8056 KB Output is correct
74 Correct 476 ms 2116 KB Output is correct
75 Correct 1049 ms 8616 KB Output is correct
76 Correct 529 ms 2772 KB Output is correct
77 Correct 559 ms 4336 KB Output is correct
78 Correct 954 ms 7540 KB Output is correct
79 Correct 301 ms 2296 KB Output is correct
80 Correct 1034 ms 9848 KB Output is correct
81 Correct 768 ms 6360 KB Output is correct
82 Correct 500 ms 3976 KB Output is correct
83 Correct 945 ms 9148 KB Output is correct
84 Correct 729 ms 6768 KB Output is correct
85 Correct 723 ms 5572 KB Output is correct
86 Correct 706 ms 5664 KB Output is correct
87 Correct 701 ms 5464 KB Output is correct
88 Correct 754 ms 5552 KB Output is correct
89 Correct 79 ms 1100 KB Output is correct
90 Correct 82 ms 1040 KB Output is correct
91 Correct 66 ms 1124 KB Output is correct
92 Correct 68 ms 1092 KB Output is correct
93 Correct 640 ms 3784 KB Output is correct
94 Correct 447 ms 1672 KB Output is correct
95 Correct 768 ms 6500 KB Output is correct
96 Correct 432 ms 1532 KB Output is correct
97 Correct 729 ms 6364 KB Output is correct
98 Correct 1072 ms 8992 KB Output is correct
99 Correct 984 ms 9508 KB Output is correct
100 Correct 1020 ms 9272 KB Output is correct
101 Correct 353 ms 2884 KB Output is correct
102 Correct 336 ms 2520 KB Output is correct
103 Correct 788 ms 6828 KB Output is correct
104 Correct 603 ms 5400 KB Output is correct
105 Correct 704 ms 5600 KB Output is correct
106 Correct 704 ms 5572 KB Output is correct
107 Correct 708 ms 5624 KB Output is correct
108 Correct 701 ms 5660 KB Output is correct
109 Correct 380 ms 3196 KB Output is correct
110 Correct 564 ms 5472 KB Output is correct
111 Correct 1026 ms 9972 KB Output is correct
112 Correct 987 ms 9668 KB Output is correct
113 Correct 73 ms 1092 KB Output is correct
114 Correct 70 ms 1080 KB Output is correct
115 Correct 80 ms 1096 KB Output is correct
116 Correct 69 ms 1040 KB Output is correct
117 Correct 542 ms 5292 KB Output is correct
118 Correct 383 ms 3268 KB Output is correct
119 Correct 292 ms 2244 KB Output is correct
120 Correct 555 ms 5376 KB Output is correct
121 Correct 714 ms 6964 KB Output is correct
122 Correct 749 ms 7144 KB Output is correct
123 Correct 541 ms 4420 KB Output is correct
124 Correct 285 ms 2324 KB Output is correct
125 Correct 155 ms 1892 KB Output is correct
126 Correct 164 ms 1860 KB Output is correct
127 Correct 221 ms 1916 KB Output is correct
128 Correct 182 ms 1848 KB Output is correct
129 Correct 139 ms 1788 KB Output is correct
130 Correct 182 ms 1860 KB Output is correct
131 Correct 1122 ms 3272 KB Output is correct
132 Correct 2239 ms 9704 KB Output is correct
133 Correct 3210 ms 13640 KB Output is correct
134 Correct 1327 ms 4428 KB Output is correct
135 Correct 3496 ms 14520 KB Output is correct
136 Correct 710 ms 1580 KB Output is correct
137 Correct 4604 ms 17848 KB Output is correct
138 Correct 2552 ms 11756 KB Output is correct
139 Correct 3607 ms 14792 KB Output is correct
140 Correct 4350 ms 16888 KB Output is correct
141 Correct 3293 ms 13332 KB Output is correct
142 Correct 592 ms 3012 KB Output is correct
143 Correct 1086 ms 5316 KB Output is correct
144 Correct 442 ms 2628 KB Output is correct
145 Correct 4198 ms 16940 KB Output is correct
146 Correct 1673 ms 8260 KB Output is correct
147 Correct 1096 ms 5572 KB Output is correct
148 Correct 1012 ms 5196 KB Output is correct
149 Correct 2440 ms 10884 KB Output is correct
150 Correct 2547 ms 10792 KB Output is correct
151 Correct 2403 ms 11036 KB Output is correct
152 Correct 2514 ms 10768 KB Output is correct
153 Correct 2397 ms 10824 KB Output is correct
154 Correct 2425 ms 10768 KB Output is correct
155 Correct 789 ms 4028 KB Output is correct
156 Correct 1186 ms 5816 KB Output is correct
157 Correct 4308 ms 17312 KB Output is correct
158 Correct 4576 ms 17868 KB Output is correct
159 Correct 2670 ms 12232 KB Output is correct
160 Correct 1732 ms 8448 KB Output is correct
161 Correct 209 ms 1860 KB Output is correct
162 Correct 192 ms 1864 KB Output is correct
163 Correct 201 ms 1864 KB Output is correct
164 Correct 282 ms 2208 KB Output is correct
165 Correct 206 ms 1992 KB Output is correct
166 Correct 172 ms 1920 KB Output is correct
167 Correct 4777 ms 18404 KB Output is correct
168 Correct 4955 ms 18508 KB Output is correct
169 Correct 4150 ms 16984 KB Output is correct
170 Correct 4481 ms 16084 KB Output is correct
171 Correct 3140 ms 13168 KB Output is correct
172 Correct 1516 ms 7272 KB Output is correct
173 Correct 4469 ms 17188 KB Output is correct
174 Correct 1740 ms 7736 KB Output is correct
175 Correct 3839 ms 13852 KB Output is correct
176 Correct 996 ms 5060 KB Output is correct
177 Correct 2692 ms 11924 KB Output is correct
178 Correct 2487 ms 11132 KB Output is correct