oj.uz

Submission #683096

# Submission time Handle Problem Language Result Execution time Memory
683096 2023-01-17T16:42:44 Z Alcabel Segments (IZhO18_segments) C++17
100 / 100
 2969 ms 13928 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5, perBlock = 448, maxBlocks = (maxn + perBlock - 1) / perBlock;
int prefL[maxBlocks + 1][maxBlocks + 1], prefR[maxBlocks + 1][maxBlocks + 1], blocks;
int l[maxn], r[maxn], len[maxn], lId[maxn], rId[maxn], lenId[maxn];
char isDel[maxn];
vector<int> toIns, toDel, byLen, byL, byR;

bool cmpLen(const int& A, const int& B) {
    return len[A] < len[B];
}

bool cmpL(const int& A, const int& B) {
    return l[A] < l[B];
}

bool cmpR(const int& A, const int& B) {
    return r[A] < r[B];
}

void rebuild() {
    static vector<int> tmp;
    tmp.resize(byLen.size() + toIns.size());
    // byLen
    sort(toIns.begin(), toIns.end(), cmpLen);
    merge(byLen.begin(), byLen.end(), toIns.begin(), toIns.end(), tmp.begin(), cmpLen);
    byLen.clear();
    for (const int& i : tmp) {
        if (!isDel[i]) {
            byLen.emplace_back(i);
        }
    }
    // byL
    sort(toIns.begin(), toIns.end(), cmpL);
    merge(byL.begin(), byL.end(), toIns.begin(), toIns.end(), tmp.begin(), cmpL);
    byL.clear();
    for (const int& i : tmp) {
        if (!isDel[i]) {
            byL.emplace_back(i);
        }
    }
    // byR
    sort(toIns.begin(), toIns.end(), cmpR);
    merge(byR.begin(), byR.end(), toIns.begin(), toIns.end(), tmp.begin(), cmpR);
    byR.clear();
    for (const int& i : tmp) {
        if (!isDel[i]) {
            byR.emplace_back(i);
        }
    }
    toIns.clear();
    toDel.clear();
    blocks = ((int)byLen.size() + perBlock - 1) / perBlock;
    for (int i = 1; i <= blocks; ++i) {
        for (int j = 1; j <= blocks; ++j) {
            prefL[i][j] = prefR[i][j] = 0;
        }
    }
    // byLen
    for (int bId = 0, i = 0; bId < blocks; ++bId) {
        for (int j = 0; j < perBlock && i < (int)byLen.size(); ++j, ++i) {
            lenId[byLen[i]] = bId;
        }
    }
    // byL
    for (int bId = 0, i = 0; bId < blocks; ++bId) {
        for (int j = 0; j < perBlock && i < (int)byL.size(); ++j, ++i) {
            lId[byL[i]] = bId;
        }
    }
    // byR
    for (int bId = 0, i = 0; bId < blocks; ++bId) {
        for (int j = 0; j < perBlock && i < (int)byR.size(); ++j, ++i) {
            rId[byR[i]] = bId;
        }
    }
    for (const int& i : byLen) {
        ++prefL[lenId[i] + 1][lId[i] + 1];
        ++prefR[lenId[i] + 1][rId[i] + 1];
    }
    for (int i = 1; i <= blocks; ++i) {
        for (int j = 1; j <= blocks; ++j) {
            prefL[i][j] += prefL[i - 1][j] + prefL[i][j - 1] - prefL[i - 1][j - 1];
            prefR[i][j] += prefR[i - 1][j] + prefR[i][j - 1] - prefR[i - 1][j - 1];
        }
    }
}

void solve() {
    int n, t, lastans = 0;
    cin >> n >> t;
    blocks = 0;
    for (int iter = 0, iterRest = 0, nxtIdx = 0; iter < n; ++iter, ++iterRest) {
        if (iterRest == perBlock) {
            rebuild();
            iterRest = 0;
        }
        int type;
        cin >> type;
        if (type == 1) {
            int a, b;
            cin >> a >> b;
            a ^= (t * lastans);
            b ^= (t * lastans);
            if (a > b) { swap(a, b); }
            l[nxtIdx] = a, r[nxtIdx] = b, len[nxtIdx] = b - a + 1;
            toIns.emplace_back(nxtIdx++);
        } else if (type == 2) {
            int i;
            cin >> i;
            --i;
            toDel.emplace_back(i);
            isDel[i] = true;
        } else {
            int a, b, k;
            cin >> a >> b >> k;
            a ^= (t * lastans);
            b ^= (t * lastans);
            if (a > b) { swap(a, b); }
            lastans = 0;
            if (b - a + 1 >= k) {
                // all that len[i] >= k
                int bLen = 0, bId = 0, ptrLen = 0, ptr = 0;
                // ptrLen -> start of the first block where all is good
                while (bLen < blocks && len[byLen[ptrLen]] < k) {
                    ++bLen;
                    ptrLen += perBlock;
                }
                int goodK = 0;
                goodK += prefL[blocks][blocks] - prefL[bLen][blocks];
                for (int i = max(0, ptrLen - perBlock); i < (int)byLen.size() && i < ptrLen; ++i) {
                    if (len[byLen[i]] >= k) {
                        ++goodK;
                    }
                }
                // L <= b - k + 1
                bId = 0, ptr = 0;
                // ptr -> start of the first block where smth is bad
                while (bId < blocks && l[byL[min(ptr + perBlock, (int)byL.size()) - 1]] <= b - k + 1) {
                    ++bId;
                    ptr += perBlock;
                }
                int goodKL = 0;
                goodKL += prefL[blocks][bId] - prefL[bLen][bId];
                for (int i = ptr; i < (int)byL.size() && i < ptr + perBlock; ++i) {
                    if (len[byL[i]] >= k && l[byL[i]] <= b - k + 1) {
                        ++goodKL;
                    }
                }
                for (int i = max(0, ptrLen - perBlock); i < (int)byLen.size() && i < ptrLen; ++i) {
                    if (len[byLen[i]] >= k && l[byLen[i]] <= b - k + 1) {
                        ++goodKL;
                        if (lId[byLen[i]] == bId) {
                            --goodKL;
                        }
                    }
                }
                // R >= a + k - 1
                bId = 0, ptr = 0;
                // ptr -> start of the first block where all is good
                while (bId < blocks && r[byR[ptr]] < a + k - 1) {
                    ++bId;
                    ptr += perBlock;
                }
                int goodKR = 0;
                goodKR += prefR[blocks][blocks] - prefR[bLen][blocks] - prefR[blocks][bId] + prefR[bLen][bId];
                for (int i = max(0, ptr - perBlock); i < (int)byR.size() && i < ptr; ++i) {
                    if (len[byR[i]] >= k && r[byR[i]] >= a + k - 1) {
                        ++goodKR;
                    }
                }
                for (int i = max(0, ptrLen - perBlock); i < (int)byLen.size() && i < ptrLen; ++i) {
                    if (len[byLen[i]] >= k && r[byLen[i]] >= a + k - 1) {
                        ++goodKR;
                        if (rId[byLen[i]] == bId - 1) {
                            --goodKR;
                        }
                    }
                }
                // cerr << "goodKL: " << goodKL << ", goodKR: " << goodKR << ", goodK: " << goodK << '\n';
                lastans = goodKL + goodKR - goodK;
                // fix with updates
                for (const int& i : toIns) {
                    if (l[i] <= b - k + 1 && r[i] >= a + k - 1 && len[i] >= k) {
                        ++lastans;
                    }
                }
                for (const int& i : toDel) {
                    if (l[i] <= b - k + 1 && r[i] >= a + k - 1 && len[i] >= k) {
                        --lastans;
                    }
                }
            }
            cout << lastans << '\n';
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 9 ms 752 KB Output is correct
6 Correct 12 ms 724 KB Output is correct
7 Correct 11 ms 544 KB Output is correct
8 Correct 9 ms 684 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 20 ms 596 KB Output is correct
12 Correct 19 ms 668 KB Output is correct
13 Correct 6 ms 724 KB Output is correct
14 Correct 9 ms 596 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 5 ms 464 KB Output is correct
17 Correct 12 ms 596 KB Output is correct
18 Correct 8 ms 732 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 10 ms 596 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 803 ms 5844 KB Output is correct
2 Correct 804 ms 5916 KB Output is correct
3 Correct 809 ms 5816 KB Output is correct
4 Correct 782 ms 5976 KB Output is correct
5 Correct 709 ms 7200 KB Output is correct
6 Correct 661 ms 7264 KB Output is correct
7 Correct 808 ms 5928 KB Output is correct
8 Correct 801 ms 5764 KB Output is correct
9 Correct 790 ms 5748 KB Output is correct
10 Correct 711 ms 4864 KB Output is correct
11 Correct 779 ms 5152 KB Output is correct
12 Correct 776 ms 6504 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 3092 KB Output is correct
2 Correct 61 ms 3096 KB Output is correct
3 Correct 84 ms 3144 KB Output is correct
4 Correct 62 ms 3108 KB Output is correct
5 Correct 629 ms 6244 KB Output is correct
6 Correct 565 ms 5816 KB Output is correct
7 Correct 580 ms 6276 KB Output is correct
8 Correct 656 ms 7208 KB Output is correct
9 Correct 659 ms 7088 KB Output is correct
10 Correct 571 ms 6120 KB Output is correct
11 Correct 124 ms 3360 KB Output is correct
12 Correct 581 ms 6364 KB Output is correct
13 Correct 544 ms 5728 KB Output is correct
14 Correct 342 ms 4720 KB Output is correct
15 Correct 304 ms 4380 KB Output is correct
16 Correct 233 ms 3948 KB Output is correct
17 Correct 499 ms 5440 KB Output is correct
18 Correct 502 ms 5468 KB Output is correct
19 Correct 494 ms 5628 KB Output is correct
20 Correct 507 ms 5452 KB Output is correct
21 Correct 144 ms 3376 KB Output is correct
22 Correct 408 ms 4844 KB Output is correct
23 Correct 488 ms 5464 KB Output is correct
24 Correct 424 ms 4912 KB Output is correct
25 Correct 76 ms 3148 KB Output is correct
26 Correct 62 ms 3040 KB Output is correct
27 Correct 70 ms 3040 KB Output is correct
28 Correct 65 ms 3060 KB Output is correct
29 Correct 506 ms 5684 KB Output is correct
30 Correct 515 ms 5600 KB Output is correct
31 Correct 636 ms 7120 KB Output is correct
32 Correct 569 ms 6080 KB Output is correct
33 Correct 544 ms 5772 KB Output is correct
34 Correct 294 ms 4452 KB Output is correct
35 Correct 486 ms 5280 KB Output is correct
36 Correct 570 ms 5832 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 3252 KB Output is correct
2 Correct 85 ms 3236 KB Output is correct
3 Correct 85 ms 3268 KB Output is correct
4 Correct 101 ms 3320 KB Output is correct
5 Correct 756 ms 6652 KB Output is correct
6 Correct 703 ms 4608 KB Output is correct
7 Correct 724 ms 6880 KB Output is correct
8 Correct 714 ms 4940 KB Output is correct
9 Correct 514 ms 4832 KB Output is correct
10 Correct 662 ms 6396 KB Output is correct
11 Correct 371 ms 4044 KB Output is correct
12 Correct 657 ms 7340 KB Output is correct
13 Correct 629 ms 5812 KB Output is correct
14 Correct 500 ms 4940 KB Output is correct
15 Correct 665 ms 7060 KB Output is correct
16 Correct 638 ms 5944 KB Output is correct
17 Correct 787 ms 5872 KB Output is correct
18 Correct 782 ms 5688 KB Output is correct
19 Correct 786 ms 5772 KB Output is correct
20 Correct 790 ms 5824 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 9 ms 752 KB Output is correct
6 Correct 12 ms 724 KB Output is correct
7 Correct 11 ms 544 KB Output is correct
8 Correct 9 ms 684 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 20 ms 596 KB Output is correct
12 Correct 19 ms 668 KB Output is correct
13 Correct 6 ms 724 KB Output is correct
14 Correct 9 ms 596 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 5 ms 464 KB Output is correct
17 Correct 12 ms 596 KB Output is correct
18 Correct 8 ms 732 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 10 ms 596 KB Output is correct
21 Correct 803 ms 5844 KB Output is correct
22 Correct 804 ms 5916 KB Output is correct
23 Correct 809 ms 5816 KB Output is correct
24 Correct 782 ms 5976 KB Output is correct
25 Correct 709 ms 7200 KB Output is correct
26 Correct 661 ms 7264 KB Output is correct
27 Correct 808 ms 5928 KB Output is correct
28 Correct 801 ms 5764 KB Output is correct
29 Correct 790 ms 5748 KB Output is correct
30 Correct 711 ms 4864 KB Output is correct
31 Correct 779 ms 5152 KB Output is correct
32 Correct 776 ms 6504 KB Output is correct
33 Correct 83 ms 3252 KB Output is correct
34 Correct 85 ms 3236 KB Output is correct
35 Correct 85 ms 3268 KB Output is correct
36 Correct 101 ms 3320 KB Output is correct
37 Correct 756 ms 6652 KB Output is correct
38 Correct 703 ms 4608 KB Output is correct
39 Correct 724 ms 6880 KB Output is correct
40 Correct 714 ms 4940 KB Output is correct
41 Correct 514 ms 4832 KB Output is correct
42 Correct 662 ms 6396 KB Output is correct
43 Correct 371 ms 4044 KB Output is correct
44 Correct 657 ms 7340 KB Output is correct
45 Correct 629 ms 5812 KB Output is correct
46 Correct 500 ms 4940 KB Output is correct
47 Correct 665 ms 7060 KB Output is correct
48 Correct 638 ms 5944 KB Output is correct
49 Correct 787 ms 5872 KB Output is correct
50 Correct 782 ms 5688 KB Output is correct
51 Correct 786 ms 5772 KB Output is correct
52 Correct 790 ms 5824 KB Output is correct
53 Correct 109 ms 3264 KB Output is correct
54 Correct 110 ms 3312 KB Output is correct
55 Correct 83 ms 3228 KB Output is correct
56 Correct 89 ms 3280 KB Output is correct
57 Correct 764 ms 5376 KB Output is correct
58 Correct 678 ms 4492 KB Output is correct
59 Correct 781 ms 6224 KB Output is correct
60 Correct 667 ms 4308 KB Output is correct
61 Correct 621 ms 6036 KB Output is correct
62 Correct 695 ms 6892 KB Output is correct
63 Correct 646 ms 7212 KB Output is correct
64 Correct 666 ms 6904 KB Output is correct
65 Correct 391 ms 4492 KB Output is correct
66 Correct 362 ms 4088 KB Output is correct
67 Correct 631 ms 6152 KB Output is correct
68 Correct 575 ms 5352 KB Output is correct
69 Correct 831 ms 5740 KB Output is correct
70 Correct 795 ms 5720 KB Output is correct
71 Correct 771 ms 5808 KB Output is correct
72 Correct 786 ms 5812 KB Output is correct
73 Correct 446 ms 4556 KB Output is correct
74 Correct 583 ms 5412 KB Output is correct
75 Correct 673 ms 7444 KB Output is correct
76 Correct 676 ms 7384 KB Output is correct
77 Correct 99 ms 3268 KB Output is correct
78 Correct 87 ms 3332 KB Output is correct
79 Correct 109 ms 3312 KB Output is correct
80 Correct 89 ms 3264 KB Output is correct
81 Correct 573 ms 5296 KB Output is correct
82 Correct 444 ms 4556 KB Output is correct
83 Correct 366 ms 4040 KB Output is correct
84 Correct 581 ms 5356 KB Output is correct
85 Correct 632 ms 6040 KB Output is correct
86 Correct 650 ms 6148 KB Output is correct
87 Correct 502 ms 4872 KB Output is correct
88 Correct 343 ms 3916 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 9 ms 752 KB Output is correct
6 Correct 12 ms 724 KB Output is correct
7 Correct 11 ms 544 KB Output is correct
8 Correct 9 ms 684 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 20 ms 596 KB Output is correct
12 Correct 19 ms 668 KB Output is correct
13 Correct 6 ms 724 KB Output is correct
14 Correct 9 ms 596 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 5 ms 464 KB Output is correct
17 Correct 12 ms 596 KB Output is correct
18 Correct 8 ms 732 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 10 ms 596 KB Output is correct
21 Correct 803 ms 5844 KB Output is correct
22 Correct 804 ms 5916 KB Output is correct
23 Correct 809 ms 5816 KB Output is correct
24 Correct 782 ms 5976 KB Output is correct
25 Correct 709 ms 7200 KB Output is correct
26 Correct 661 ms 7264 KB Output is correct
27 Correct 808 ms 5928 KB Output is correct
28 Correct 801 ms 5764 KB Output is correct
29 Correct 790 ms 5748 KB Output is correct
30 Correct 711 ms 4864 KB Output is correct
31 Correct 779 ms 5152 KB Output is correct
32 Correct 776 ms 6504 KB Output is correct
33 Correct 72 ms 3092 KB Output is correct
34 Correct 61 ms 3096 KB Output is correct
35 Correct 84 ms 3144 KB Output is correct
36 Correct 62 ms 3108 KB Output is correct
37 Correct 629 ms 6244 KB Output is correct
38 Correct 565 ms 5816 KB Output is correct
39 Correct 580 ms 6276 KB Output is correct
40 Correct 656 ms 7208 KB Output is correct
41 Correct 659 ms 7088 KB Output is correct
42 Correct 571 ms 6120 KB Output is correct
43 Correct 124 ms 3360 KB Output is correct
44 Correct 581 ms 6364 KB Output is correct
45 Correct 544 ms 5728 KB Output is correct
46 Correct 342 ms 4720 KB Output is correct
47 Correct 304 ms 4380 KB Output is correct
48 Correct 233 ms 3948 KB Output is correct
49 Correct 499 ms 5440 KB Output is correct
50 Correct 502 ms 5468 KB Output is correct
51 Correct 494 ms 5628 KB Output is correct
52 Correct 507 ms 5452 KB Output is correct
53 Correct 144 ms 3376 KB Output is correct
54 Correct 408 ms 4844 KB Output is correct
55 Correct 488 ms 5464 KB Output is correct
56 Correct 424 ms 4912 KB Output is correct
57 Correct 76 ms 3148 KB Output is correct
58 Correct 62 ms 3040 KB Output is correct
59 Correct 70 ms 3040 KB Output is correct
60 Correct 65 ms 3060 KB Output is correct
61 Correct 506 ms 5684 KB Output is correct
62 Correct 515 ms 5600 KB Output is correct
63 Correct 636 ms 7120 KB Output is correct
64 Correct 569 ms 6080 KB Output is correct
65 Correct 544 ms 5772 KB Output is correct
66 Correct 294 ms 4452 KB Output is correct
67 Correct 486 ms 5280 KB Output is correct
68 Correct 570 ms 5832 KB Output is correct
69 Correct 83 ms 3252 KB Output is correct
70 Correct 85 ms 3236 KB Output is correct
71 Correct 85 ms 3268 KB Output is correct
72 Correct 101 ms 3320 KB Output is correct
73 Correct 756 ms 6652 KB Output is correct
74 Correct 703 ms 4608 KB Output is correct
75 Correct 724 ms 6880 KB Output is correct
76 Correct 714 ms 4940 KB Output is correct
77 Correct 514 ms 4832 KB Output is correct
78 Correct 662 ms 6396 KB Output is correct
79 Correct 371 ms 4044 KB Output is correct
80 Correct 657 ms 7340 KB Output is correct
81 Correct 629 ms 5812 KB Output is correct
82 Correct 500 ms 4940 KB Output is correct
83 Correct 665 ms 7060 KB Output is correct
84 Correct 638 ms 5944 KB Output is correct
85 Correct 787 ms 5872 KB Output is correct
86 Correct 782 ms 5688 KB Output is correct
87 Correct 786 ms 5772 KB Output is correct
88 Correct 790 ms 5824 KB Output is correct
89 Correct 109 ms 3264 KB Output is correct
90 Correct 110 ms 3312 KB Output is correct
91 Correct 83 ms 3228 KB Output is correct
92 Correct 89 ms 3280 KB Output is correct
93 Correct 764 ms 5376 KB Output is correct
94 Correct 678 ms 4492 KB Output is correct
95 Correct 781 ms 6224 KB Output is correct
96 Correct 667 ms 4308 KB Output is correct
97 Correct 621 ms 6036 KB Output is correct
98 Correct 695 ms 6892 KB Output is correct
99 Correct 646 ms 7212 KB Output is correct
100 Correct 666 ms 6904 KB Output is correct
101 Correct 391 ms 4492 KB Output is correct
102 Correct 362 ms 4088 KB Output is correct
103 Correct 631 ms 6152 KB Output is correct
104 Correct 575 ms 5352 KB Output is correct
105 Correct 831 ms 5740 KB Output is correct
106 Correct 795 ms 5720 KB Output is correct
107 Correct 771 ms 5808 KB Output is correct
108 Correct 786 ms 5812 KB Output is correct
109 Correct 446 ms 4556 KB Output is correct
110 Correct 583 ms 5412 KB Output is correct
111 Correct 673 ms 7444 KB Output is correct
112 Correct 676 ms 7384 KB Output is correct
113 Correct 99 ms 3268 KB Output is correct
114 Correct 87 ms 3332 KB Output is correct
115 Correct 109 ms 3312 KB Output is correct
116 Correct 89 ms 3264 KB Output is correct
117 Correct 573 ms 5296 KB Output is correct
118 Correct 444 ms 4556 KB Output is correct
119 Correct 366 ms 4040 KB Output is correct
120 Correct 581 ms 5356 KB Output is correct
121 Correct 632 ms 6040 KB Output is correct
122 Correct 650 ms 6148 KB Output is correct
123 Correct 502 ms 4872 KB Output is correct
124 Correct 343 ms 3916 KB Output is correct
125 Correct 218 ms 6316 KB Output is correct
126 Correct 231 ms 6332 KB Output is correct
127 Correct 345 ms 6488 KB Output is correct
128 Correct 253 ms 6260 KB Output is correct
129 Correct 182 ms 6264 KB Output is correct
130 Correct 266 ms 6312 KB Output is correct
131 Correct 1563 ms 8648 KB Output is correct
132 Correct 2502 ms 10936 KB Output is correct
133 Correct 2898 ms 12232 KB Output is correct
134 Correct 1773 ms 9264 KB Output is correct
135 Correct 2969 ms 12436 KB Output is correct
136 Correct 1476 ms 7656 KB Output is correct
137 Correct 2832 ms 13668 KB Output is correct
138 Correct 2372 ms 11004 KB Output is correct
139 Correct 2746 ms 12264 KB Output is correct
140 Correct 2872 ms 13100 KB Output is correct
141 Correct 2593 ms 11588 KB Output is correct
142 Correct 817 ms 7116 KB Output is correct
143 Correct 1236 ms 8120 KB Output is correct
144 Correct 639 ms 6672 KB Output is correct
145 Correct 2834 ms 13172 KB Output is correct
146 Correct 1761 ms 9260 KB Output is correct
147 Correct 1282 ms 8100 KB Output is correct
148 Correct 1185 ms 7924 KB Output is correct
149 Correct 2672 ms 11308 KB Output is correct
150 Correct 2638 ms 11152 KB Output is correct
151 Correct 2624 ms 11188 KB Output is correct
152 Correct 2663 ms 11068 KB Output is correct
153 Correct 2664 ms 11160 KB Output is correct
154 Correct 2622 ms 11112 KB Output is correct
155 Correct 1012 ms 7640 KB Output is correct
156 Correct 1384 ms 8356 KB Output is correct
157 Correct 2801 ms 13384 KB Output is correct
158 Correct 2910 ms 13520 KB Output is correct
159 Correct 2484 ms 11040 KB Output is correct
160 Correct 1899 ms 9548 KB Output is correct
161 Correct 324 ms 6308 KB Output is correct
162 Correct 274 ms 6284 KB Output is correct
163 Correct 278 ms 6268 KB Output is correct
164 Correct 505 ms 6336 KB Output is correct
165 Correct 330 ms 6372 KB Output is correct
166 Correct 256 ms 6268 KB Output is correct
167 Correct 2898 ms 13928 KB Output is correct
168 Correct 2914 ms 13852 KB Output is correct
169 Correct 2858 ms 13168 KB Output is correct
170 Correct 2804 ms 12856 KB Output is correct
171 Correct 2711 ms 11560 KB Output is correct
172 Correct 1800 ms 8868 KB Output is correct
173 Correct 2897 ms 13292 KB Output is correct
174 Correct 1767 ms 9044 KB Output is correct
175 Correct 2682 ms 11824 KB Output is correct
176 Correct 1198 ms 7980 KB Output is correct
177 Correct 2416 ms 10876 KB Output is correct
178 Correct 2305 ms 10812 KB Output is correct