oj.uz

답안 #376158

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376158 2021-03-11T02:18:08 Z ijxjdjd Segments (IZhO18_segments) C++14
100 / 100
 4864 ms 9932 KB 
#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using namespace std;

using ll = long long;

const int MAXN = (int)(3e5) + 5;
const int K = 600;
const int LIM = 1500;

int curAdd = 0;
int sz = 0;
int e[MAXN][2];
int  mnSz[MAXN];
int mxL[MAXN];
bool del[MAXN];

vector<int> L;
vector<int> Sz;
vector<int> curdel;
void rebuild() {
    auto byL = [&] (const int& lhs, const int& rhs) {
        return e[lhs][0] < e[rhs][0];
    };
    auto byR = [&] (const int& lhs, const int& rhs) {
        return e[lhs][1] < e[rhs][1];
    };
    auto bySz = [&] (const int& lhs, const int& rhs) {
        return (e[lhs][1] - e[lhs][0]) < (e[rhs][1] - e[rhs][0]);
    };
    curdel.clear();
    L.clear();
    Sz.clear();
    curAdd = 0;
    for (int i = 0; i < sz; i++) {
        if (!del[i]) {
            L.push_back(i);
            Sz.push_back(i);
        }
    }

    sort(all(Sz), bySz);
    for (int i = 0; i < Sz.size(); i+=K) {
        mnSz[i] = e[Sz[i]][1] - e[Sz[i]][0] + 1;
        if (i + K >= Sz.size()) {
            sort(Sz.begin()+i, Sz.end(), byL);
        }
        else {
            sort(Sz.begin()+i, Sz.begin()+i+K, byL);
        }
    }

    sort(all(L), byL);
    for (int i = 0; i < L.size(); i+=K) {
        if (i + K >= L.size()) {
            mxL[i] = e[*L.rbegin()][0];
            sort(L.begin()+i, L.end(), byR);
        }
        else {
            mxL[i] = e[*(L.begin()+i+K-1)][0];
            sort(L.begin()+i, L.begin()+i+K, byR);
        }
    }
}
void add(int l, int r) {
    e[sz][0] = l;
    e[sz][1] = r;
    sz++;
    curAdd++;
}
void rem(int i) {
    del[i] = true;
    curdel.push_back(i);
}
bool good(int l, int r, int id, int s) {
    int l2 = max(e[id][0], l);
    int r2 = min(e[id][1], r);
    if (r2 - l2 + 1 >= s) {
        return true;
    }
    return false;
}
int getSz(int l1, int l2, int s) {
    int cnt = 0;
    if (sz(Sz) > 0) {
        for (int j = (sz(Sz)-1)/K * K; j >= 0; j-=K) {
            if (mnSz[j] < s) {
                for (int i = 0; j + i < Sz.size() && i < K; i++) {
                    if (e[Sz[j+i]][1] - e[Sz[j+i]][0] + 1 >= s && l1 <= e[Sz[j+i]][0] && e[Sz[j+i]][0] <= l2) {
                        cnt++;
                    }
                }
                return cnt;
            }
            else {
                int low = j;
                int high = min(sz(Sz)-1, j+K-1);
                if (e[Sz[low]][0] > l2 || e[Sz[high]][0] < l1) {

                }
                else {
                    while (low < high) {
                        int mid = (low + high)/2;
                        if (l1 <= e[Sz[mid]][0]) {
                            high = mid;
                        }
                        else {
                            low = mid+1;
                        }
                    }
                    int bot = high;
                    if (e[Sz[bot]][0] <= l2) {
                        low = j;
                        high = min(sz(Sz)-1, j+K-1);
                        while (low < high) {
                            int mid = (low + high+1)/2;
                            if (e[Sz[mid]][0] <= l2) {
                                low = mid;
                            }
                            else {
                                high = mid-1;
                            }
                        }
                        cnt +=(low - bot + 1);
                    }
                }
            }
        }
    }
    return cnt;
}
int getL(int lb, int rb) {
    int cnt = 0;
    if (sz(L) > 0) {
        for (int j = 0; j < sz(L); j += K) {
            if (mxL[j] >= lb) {
                for (int i = 0; j + i < L.size() && i < K; i++) {
                    if (e[L[j+i]][0] < lb && e[L[j+i]][1] >= rb) {
                        cnt++;
                    }
                }
                return cnt;
            }
            else {
                int low = j;
                int high = min(j+K-1, sz(L)-1);
                if (e[L[high]][1] < rb) {

                }
                else {
                    int h = min(j+K-1, sz(L)-1);
                    while (low < high) {
                        int mid = (low + high)/2;
                        if (e[L[mid]][1] >= rb) {
                            high = mid;
                        }
                        else {
                            low = mid+1;
                        }
                    }
                    cnt += (h - high + 1);
                }
            }
        }
    }
    return cnt;
}

int count(int l, int r, int k) {
    if (r - l + 1 < k) {
        return 0;
    }
    int temp = getSz(l, r-k+1, k) + getL(l, l+k-1);
    for (int ed : curdel) {
        if (good(l, r, ed, k)) {
            temp--;
        }
    }
    for (int i = 1; i <= curAdd; i++) {
        if (good(l, r, sz-i, k)) {
            temp++;
        }
    }
    return temp;
}
int main() {
    L.reserve(MAXN);
    Sz.reserve(MAXN);
    curdel.reserve(K);
	cin.tie(0);
	cin.sync_with_stdio(0);
	int N, t;
	cin >> N >> t;
	int lst = 0;
	FR(iter, N) {
	    if (curdel.size() + curAdd >= LIM) {
            rebuild();
	    }
        int id;
        cin >> id;
        if (id == 1) {
            int l, r;
            cin >> l >> r;
            l = l^(lst*t);
            r = r^(lst*t);
            if (l > r) {
                swap(l, r);
            }
            add(l, r);
        }
        else if (id == 2) {
            int i;
            cin >> i;
            i--;
            rem(i);
        }
        else if (id == 3) {
            int l, r, k;
            cin >> l >> r >> k;
            l = l^(lst*t);
            r = r^(lst*t);
            if (l > r) {
                swap(l, r);
            }
            lst = count(l, r, k);
            cout << lst << '\n';
        }
	}
	return 0;
}

Compilation message

segments.cpp: In function 'void rebuild()':
segments.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int i = 0; i < Sz.size(); i+=K) {
      |                     ~~^~~~~~~~~~~
segments.cpp:47:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         if (i + K >= Sz.size()) {
      |             ~~~~~~^~~~~~~~~~~~
segments.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < L.size(); i+=K) {
      |                     ~~^~~~~~~~~~
segments.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         if (i + K >= L.size()) {
      |             ~~~~~~^~~~~~~~~~~
segments.cpp: In function 'int getSz(int, int, int)':
segments.cpp:90:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |                 for (int i = 0; j + i < Sz.size() && i < K; i++) {
      |                                 ~~~~~~^~~~~~~~~~~
segments.cpp: In function 'int getL(int, int)':
segments.cpp:139:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |                 for (int i = 0; j + i < L.size() && i < K; i++) {
      |                                 ~~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 5 ms 364 KB Output is correct
4 Correct 5 ms 364 KB Output is correct
5 Correct 10 ms 492 KB Output is correct
6 Correct 12 ms 492 KB Output is correct
7 Correct 8 ms 364 KB Output is correct
8 Correct 8 ms 492 KB Output is correct
9 Correct 8 ms 492 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 19 ms 364 KB Output is correct
12 Correct 19 ms 492 KB Output is correct
13 Correct 6 ms 492 KB Output is correct
14 Correct 9 ms 492 KB Output is correct
15 Correct 7 ms 364 KB Output is correct
16 Correct 5 ms 372 KB Output is correct
17 Correct 10 ms 476 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 9 ms 476 KB Output is correct
20 Correct 9 ms 476 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1288 ms 2124 KB Output is correct
2 Correct 1255 ms 1940 KB Output is correct
3 Correct 1267 ms 2028 KB Output is correct
4 Correct 1314 ms 2156 KB Output is correct
5 Correct 1150 ms 3028 KB Output is correct
6 Correct 1118 ms 2668 KB Output is correct
7 Correct 1256 ms 2028 KB Output is correct
8 Correct 1286 ms 1900 KB Output is correct
9 Correct 1273 ms 1900 KB Output is correct
10 Correct 1080 ms 1632 KB Output is correct
11 Correct 1024 ms 1772 KB Output is correct
12 Correct 1316 ms 2372 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 748 KB Output is correct
2 Correct 95 ms 748 KB Output is correct
3 Correct 144 ms 892 KB Output is correct
4 Correct 94 ms 748 KB Output is correct
5 Correct 1380 ms 2412 KB Output is correct
6 Correct 1363 ms 2220 KB Output is correct
7 Correct 1416 ms 2232 KB Output is correct
8 Correct 1193 ms 2796 KB Output is correct
9 Correct 1155 ms 2796 KB Output is correct
10 Correct 1101 ms 2540 KB Output is correct
11 Correct 255 ms 876 KB Output is correct
12 Correct 1137 ms 2356 KB Output is correct
13 Correct 1014 ms 2284 KB Output is correct
14 Correct 663 ms 1388 KB Output is correct
15 Correct 603 ms 1552 KB Output is correct
16 Correct 470 ms 1260 KB Output is correct
17 Correct 1297 ms 1916 KB Output is correct
18 Correct 1298 ms 1924 KB Output is correct
19 Correct 1297 ms 2156 KB Output is correct
20 Correct 1296 ms 1908 KB Output is correct
21 Correct 300 ms 876 KB Output is correct
22 Correct 829 ms 1772 KB Output is correct
23 Correct 997 ms 2096 KB Output is correct
24 Correct 867 ms 1772 KB Output is correct
25 Correct 111 ms 748 KB Output is correct
26 Correct 98 ms 876 KB Output is correct
27 Correct 111 ms 748 KB Output is correct
28 Correct 105 ms 748 KB Output is correct
29 Correct 1032 ms 1988 KB Output is correct
30 Correct 1043 ms 2160 KB Output is correct
31 Correct 1132 ms 2948 KB Output is correct
32 Correct 1099 ms 2344 KB Output is correct
33 Correct 1037 ms 2252 KB Output is correct
34 Correct 593 ms 1288 KB Output is correct
35 Correct 927 ms 1992 KB Output is correct
36 Correct 1066 ms 2100 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 824 KB Output is correct
2 Correct 103 ms 876 KB Output is correct
3 Correct 103 ms 748 KB Output is correct
4 Correct 111 ms 748 KB Output is correct
5 Correct 1288 ms 2528 KB Output is correct
6 Correct 898 ms 1120 KB Output is correct
7 Correct 1238 ms 2540 KB Output is correct
8 Correct 1071 ms 1416 KB Output is correct
9 Correct 820 ms 1772 KB Output is correct
10 Correct 1118 ms 2540 KB Output is correct
11 Correct 507 ms 1260 KB Output is correct
12 Correct 1120 ms 2820 KB Output is correct
13 Correct 1050 ms 2116 KB Output is correct
14 Correct 765 ms 1644 KB Output is correct
15 Correct 1133 ms 2796 KB Output is correct
16 Correct 1081 ms 2052 KB Output is correct
17 Correct 1267 ms 1900 KB Output is correct
18 Correct 1259 ms 2156 KB Output is correct
19 Correct 1258 ms 2072 KB Output is correct
20 Correct 1263 ms 1952 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 5 ms 364 KB Output is correct
4 Correct 5 ms 364 KB Output is correct
5 Correct 10 ms 492 KB Output is correct
6 Correct 12 ms 492 KB Output is correct
7 Correct 8 ms 364 KB Output is correct
8 Correct 8 ms 492 KB Output is correct
9 Correct 8 ms 492 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 19 ms 364 KB Output is correct
12 Correct 19 ms 492 KB Output is correct
13 Correct 6 ms 492 KB Output is correct
14 Correct 9 ms 492 KB Output is correct
15 Correct 7 ms 364 KB Output is correct
16 Correct 5 ms 372 KB Output is correct
17 Correct 10 ms 476 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 9 ms 476 KB Output is correct
20 Correct 9 ms 476 KB Output is correct
21 Correct 1288 ms 2124 KB Output is correct
22 Correct 1255 ms 1940 KB Output is correct
23 Correct 1267 ms 2028 KB Output is correct
24 Correct 1314 ms 2156 KB Output is correct
25 Correct 1150 ms 3028 KB Output is correct
26 Correct 1118 ms 2668 KB Output is correct
27 Correct 1256 ms 2028 KB Output is correct
28 Correct 1286 ms 1900 KB Output is correct
29 Correct 1273 ms 1900 KB Output is correct
30 Correct 1080 ms 1632 KB Output is correct
31 Correct 1024 ms 1772 KB Output is correct
32 Correct 1316 ms 2372 KB Output is correct
33 Correct 97 ms 824 KB Output is correct
34 Correct 103 ms 876 KB Output is correct
35 Correct 103 ms 748 KB Output is correct
36 Correct 111 ms 748 KB Output is correct
37 Correct 1288 ms 2528 KB Output is correct
38 Correct 898 ms 1120 KB Output is correct
39 Correct 1238 ms 2540 KB Output is correct
40 Correct 1071 ms 1416 KB Output is correct
41 Correct 820 ms 1772 KB Output is correct
42 Correct 1118 ms 2540 KB Output is correct
43 Correct 507 ms 1260 KB Output is correct
44 Correct 1120 ms 2820 KB Output is correct
45 Correct 1050 ms 2116 KB Output is correct
46 Correct 765 ms 1644 KB Output is correct
47 Correct 1133 ms 2796 KB Output is correct
48 Correct 1081 ms 2052 KB Output is correct
49 Correct 1267 ms 1900 KB Output is correct
50 Correct 1259 ms 2156 KB Output is correct
51 Correct 1258 ms 2072 KB Output is correct
52 Correct 1263 ms 1952 KB Output is correct
53 Correct 114 ms 748 KB Output is correct
54 Correct 116 ms 748 KB Output is correct
55 Correct 98 ms 748 KB Output is correct
56 Correct 101 ms 748 KB Output is correct
57 Correct 1108 ms 1572 KB Output is correct
58 Correct 791 ms 1172 KB Output is correct
59 Correct 1368 ms 2156 KB Output is correct
60 Correct 938 ms 1228 KB Output is correct
61 Correct 1048 ms 2028 KB Output is correct
62 Correct 1127 ms 2668 KB Output is correct
63 Correct 1112 ms 3052 KB Output is correct
64 Correct 1118 ms 2668 KB Output is correct
65 Correct 590 ms 1260 KB Output is correct
66 Correct 530 ms 1184 KB Output is correct
67 Correct 1085 ms 2360 KB Output is correct
68 Correct 977 ms 2028 KB Output is correct
69 Correct 1260 ms 2048 KB Output is correct
70 Correct 1267 ms 2056 KB Output is correct
71 Correct 1257 ms 2028 KB Output is correct
72 Correct 1258 ms 1936 KB Output is correct
73 Correct 665 ms 1388 KB Output is correct
74 Correct 947 ms 2028 KB Output is correct
75 Correct 1118 ms 2924 KB Output is correct
76 Correct 1137 ms 2728 KB Output is correct
77 Correct 105 ms 748 KB Output is correct
78 Correct 100 ms 748 KB Output is correct
79 Correct 113 ms 876 KB Output is correct
80 Correct 107 ms 748 KB Output is correct
81 Correct 940 ms 1772 KB Output is correct
82 Correct 673 ms 1516 KB Output is correct
83 Correct 491 ms 1224 KB Output is correct
84 Correct 945 ms 2028 KB Output is correct
85 Correct 1085 ms 2152 KB Output is correct
86 Correct 1084 ms 2412 KB Output is correct
87 Correct 834 ms 1664 KB Output is correct
88 Correct 497 ms 1132 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 5 ms 364 KB Output is correct
4 Correct 5 ms 364 KB Output is correct
5 Correct 10 ms 492 KB Output is correct
6 Correct 12 ms 492 KB Output is correct
7 Correct 8 ms 364 KB Output is correct
8 Correct 8 ms 492 KB Output is correct
9 Correct 8 ms 492 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 19 ms 364 KB Output is correct
12 Correct 19 ms 492 KB Output is correct
13 Correct 6 ms 492 KB Output is correct
14 Correct 9 ms 492 KB Output is correct
15 Correct 7 ms 364 KB Output is correct
16 Correct 5 ms 372 KB Output is correct
17 Correct 10 ms 476 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 9 ms 476 KB Output is correct
20 Correct 9 ms 476 KB Output is correct
21 Correct 1288 ms 2124 KB Output is correct
22 Correct 1255 ms 1940 KB Output is correct
23 Correct 1267 ms 2028 KB Output is correct
24 Correct 1314 ms 2156 KB Output is correct
25 Correct 1150 ms 3028 KB Output is correct
26 Correct 1118 ms 2668 KB Output is correct
27 Correct 1256 ms 2028 KB Output is correct
28 Correct 1286 ms 1900 KB Output is correct
29 Correct 1273 ms 1900 KB Output is correct
30 Correct 1080 ms 1632 KB Output is correct
31 Correct 1024 ms 1772 KB Output is correct
32 Correct 1316 ms 2372 KB Output is correct
33 Correct 108 ms 748 KB Output is correct
34 Correct 95 ms 748 KB Output is correct
35 Correct 144 ms 892 KB Output is correct
36 Correct 94 ms 748 KB Output is correct
37 Correct 1380 ms 2412 KB Output is correct
38 Correct 1363 ms 2220 KB Output is correct
39 Correct 1416 ms 2232 KB Output is correct
40 Correct 1193 ms 2796 KB Output is correct
41 Correct 1155 ms 2796 KB Output is correct
42 Correct 1101 ms 2540 KB Output is correct
43 Correct 255 ms 876 KB Output is correct
44 Correct 1137 ms 2356 KB Output is correct
45 Correct 1014 ms 2284 KB Output is correct
46 Correct 663 ms 1388 KB Output is correct
47 Correct 603 ms 1552 KB Output is correct
48 Correct 470 ms 1260 KB Output is correct
49 Correct 1297 ms 1916 KB Output is correct
50 Correct 1298 ms 1924 KB Output is correct
51 Correct 1297 ms 2156 KB Output is correct
52 Correct 1296 ms 1908 KB Output is correct
53 Correct 300 ms 876 KB Output is correct
54 Correct 829 ms 1772 KB Output is correct
55 Correct 997 ms 2096 KB Output is correct
56 Correct 867 ms 1772 KB Output is correct
57 Correct 111 ms 748 KB Output is correct
58 Correct 98 ms 876 KB Output is correct
59 Correct 111 ms 748 KB Output is correct
60 Correct 105 ms 748 KB Output is correct
61 Correct 1032 ms 1988 KB Output is correct
62 Correct 1043 ms 2160 KB Output is correct
63 Correct 1132 ms 2948 KB Output is correct
64 Correct 1099 ms 2344 KB Output is correct
65 Correct 1037 ms 2252 KB Output is correct
66 Correct 593 ms 1288 KB Output is correct
67 Correct 927 ms 1992 KB Output is correct
68 Correct 1066 ms 2100 KB Output is correct
69 Correct 97 ms 824 KB Output is correct
70 Correct 103 ms 876 KB Output is correct
71 Correct 103 ms 748 KB Output is correct
72 Correct 111 ms 748 KB Output is correct
73 Correct 1288 ms 2528 KB Output is correct
74 Correct 898 ms 1120 KB Output is correct
75 Correct 1238 ms 2540 KB Output is correct
76 Correct 1071 ms 1416 KB Output is correct
77 Correct 820 ms 1772 KB Output is correct
78 Correct 1118 ms 2540 KB Output is correct
79 Correct 507 ms 1260 KB Output is correct
80 Correct 1120 ms 2820 KB Output is correct
81 Correct 1050 ms 2116 KB Output is correct
82 Correct 765 ms 1644 KB Output is correct
83 Correct 1133 ms 2796 KB Output is correct
84 Correct 1081 ms 2052 KB Output is correct
85 Correct 1267 ms 1900 KB Output is correct
86 Correct 1259 ms 2156 KB Output is correct
87 Correct 1258 ms 2072 KB Output is correct
88 Correct 1263 ms 1952 KB Output is correct
89 Correct 114 ms 748 KB Output is correct
90 Correct 116 ms 748 KB Output is correct
91 Correct 98 ms 748 KB Output is correct
92 Correct 101 ms 748 KB Output is correct
93 Correct 1108 ms 1572 KB Output is correct
94 Correct 791 ms 1172 KB Output is correct
95 Correct 1368 ms 2156 KB Output is correct
96 Correct 938 ms 1228 KB Output is correct
97 Correct 1048 ms 2028 KB Output is correct
98 Correct 1127 ms 2668 KB Output is correct
99 Correct 1112 ms 3052 KB Output is correct
100 Correct 1118 ms 2668 KB Output is correct
101 Correct 590 ms 1260 KB Output is correct
102 Correct 530 ms 1184 KB Output is correct
103 Correct 1085 ms 2360 KB Output is correct
104 Correct 977 ms 2028 KB Output is correct
105 Correct 1260 ms 2048 KB Output is correct
106 Correct 1267 ms 2056 KB Output is correct
107 Correct 1257 ms 2028 KB Output is correct
108 Correct 1258 ms 1936 KB Output is correct
109 Correct 665 ms 1388 KB Output is correct
110 Correct 947 ms 2028 KB Output is correct
111 Correct 1118 ms 2924 KB Output is correct
112 Correct 1137 ms 2728 KB Output is correct
113 Correct 105 ms 748 KB Output is correct
114 Correct 100 ms 748 KB Output is correct
115 Correct 113 ms 876 KB Output is correct
116 Correct 107 ms 748 KB Output is correct
117 Correct 940 ms 1772 KB Output is correct
118 Correct 673 ms 1516 KB Output is correct
119 Correct 491 ms 1224 KB Output is correct
120 Correct 945 ms 2028 KB Output is correct
121 Correct 1085 ms 2152 KB Output is correct
122 Correct 1084 ms 2412 KB Output is correct
123 Correct 834 ms 1664 KB Output is correct
124 Correct 497 ms 1132 KB Output is correct
125 Correct 229 ms 1388 KB Output is correct
126 Correct 245 ms 1172 KB Output is correct
127 Correct 328 ms 1132 KB Output is correct
128 Correct 283 ms 1132 KB Output is correct
129 Correct 221 ms 1152 KB Output is correct
130 Correct 269 ms 1260 KB Output is correct
131 Correct 2131 ms 1980 KB Output is correct
132 Correct 4284 ms 3532 KB Output is correct
133 Correct 4864 ms 4244 KB Output is correct
134 Correct 2738 ms 8520 KB Output is correct
135 Correct 4836 ms 9400 KB Output is correct
136 Correct 1405 ms 7660 KB Output is correct
137 Correct 4633 ms 9484 KB Output is correct
138 Correct 3918 ms 8176 KB Output is correct
139 Correct 4422 ms 8540 KB Output is correct
140 Correct 4616 ms 9364 KB Output is correct
141 Correct 4211 ms 8500 KB Output is correct
142 Correct 1071 ms 5868 KB Output is correct
143 Correct 2055 ms 6508 KB Output is correct
144 Correct 772 ms 5612 KB Output is correct
145 Correct 4642 ms 9012 KB Output is correct
146 Correct 3007 ms 6960 KB Output is correct
147 Correct 2132 ms 6700 KB Output is correct
148 Correct 1959 ms 6632 KB Output is correct
149 Correct 4548 ms 8952 KB Output is correct
150 Correct 4537 ms 8944 KB Output is correct
151 Correct 4544 ms 9112 KB Output is correct
152 Correct 4526 ms 8904 KB Output is correct
153 Correct 4533 ms 8792 KB Output is correct
154 Correct 4520 ms 9096 KB Output is correct
155 Correct 1445 ms 6056 KB Output is correct
156 Correct 2233 ms 6712 KB Output is correct
157 Correct 4667 ms 9232 KB Output is correct
158 Correct 4657 ms 9464 KB Output is correct
159 Correct 4035 ms 8040 KB Output is correct
160 Correct 3119 ms 7288 KB Output is correct
161 Correct 312 ms 5484 KB Output is correct
162 Correct 278 ms 5356 KB Output is correct
163 Correct 279 ms 5356 KB Output is correct
164 Correct 470 ms 5356 KB Output is correct
165 Correct 319 ms 5356 KB Output is correct
166 Correct 271 ms 5356 KB Output is correct
167 Correct 4633 ms 9564 KB Output is correct
168 Correct 4740 ms 9932 KB Output is correct
169 Correct 4620 ms 9468 KB Output is correct
170 Correct 4552 ms 8932 KB Output is correct
171 Correct 4215 ms 8400 KB Output is correct
172 Correct 2743 ms 6788 KB Output is correct
173 Correct 4705 ms 9208 KB Output is correct
174 Correct 3020 ms 6968 KB Output is correct
175 Correct 4527 ms 8480 KB Output is correct
176 Correct 1978 ms 6380 KB Output is correct
177 Correct 4054 ms 8016 KB Output is correct
178 Correct 3883 ms 8000 KB Output is correct