oj.uz

Submission #100264

# Submission time Handle Problem Language Result Execution time Memory
100264 2019-03-10T07:13:23 Z choikiwon Segments (IZhO18_segments) C++17
100 / 100
 4698 ms 10980 KB 
#include<bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

const int MN = 200010;
const int SQ = 2000;

int Q, T, N, n;
pii seg[MN], tmp1[MN], tmp2[MN];
int chk[MN], mn[MN], mx[MN];
vector<int> add, del;

bool cmp(pii a, pii b) {
    return a.second < b.second;
}

void relax() {
    if(add.size() > SQ || del.size() > SQ) {
        for(int i = 0; i < add.size(); i++) chk[ add[i] ] = 1;
        for(int i = 0; i < del.size(); i++) chk[ del[i] ] = 0;
        add.clear();
        del.clear();

        n = 0;
        for(int i = 0; i < N; i++) if(chk[i]) {
            tmp1[n] = pii(seg[i].second, seg[i].first);
            tmp2[n] = pii(seg[i].second - seg[i].first, seg[i].first);
            n++;
        }
        sort(tmp1, tmp1 + n, cmp);
        sort(tmp2, tmp2 + n, cmp);

        for(int i = 0; i < n; i += SQ) {
            int l = i;
            int r = min(n, i + SQ) - 1;
            mn[i] = tmp1[l].second;
            mx[i] = tmp1[r].second;
            sort(tmp1 + l, tmp1 + r + 1);
            sort(tmp2 + l, tmp2 + r + 1);
        }
    }
}

int main() {
    scanf("%d %d", &Q, &T);

    int ans = 0;
    while(Q--) {
        relax();

        int t; scanf("%d", &t);

        if(t == 1) {
            int a, b; scanf("%d %d", &a, &b);
            if(T) {
                a ^= ans;
                b ^= ans;
            }
            if(a > b) swap(a, b);

            //cout << "add : " << a << ' ' << b << endl;

            add.push_back(N);
            seg[N++] = pii(a, b);
        }
        if(t == 2) {
            int id; scanf("%d", &id);
            id--;
            del.push_back(id);
        }
        if(t == 3) {
            int a, b, k; scanf("%d %d %d", &a, &b, &k);
            k--;
            if(T) {
                a ^= ans;
                b ^= ans;
            }
            if(a > b) swap(a, b);

            //cout << "query : " << a << ' ' << b << ' ' << k << endl;

            if(b - a < k) {
                ans = 0;
                printf("%d\n", ans);
                continue;
            }

            ans = 0;
            for(int i = 0; i < add.size(); i++) if(min(b, seg[ add[i] ].second) - max(a, seg[ add[i] ].first) >= k) ans++;
            for(int i = 0; i < del.size(); i++) if(min(b, seg[ del[i] ].second) - max(a, seg[ del[i] ].first) >= k) ans--;

            if(k == -1) {
                ans += n;
                printf("%d\n", ans);
                continue;
            }

            for(int i = 0; i < n; i += SQ) {
                int l = i;
                int r = min(n, i + SQ) - 1;

                if(mx[i] < a) {
                    int x = lower_bound(tmp1 + l, tmp1 + r + 1, pii(a + k, -1)) - tmp1;
                    ans += r + 1 - x;
                }
                else {
                    for(int j = l; j <= r; j++) {
                        if(tmp1[j].second < a && tmp1[j].first >= a + k) ans++;
                    }
                    break;
                }
            }
            for(int i = 0; i < n; i += SQ) {
                int l = i;
                int r = min(n, i + SQ) - 1;

                if(b - k < mn[i] || mx[i] < a) continue;
                if(a <= mn[i] && mx[i] <= b - k) {
                    int x = lower_bound(tmp2 + l, tmp2 + r + 1, pii(k, -1)) - tmp2;
                    ans += r + 1 - x;
                }
                else {
                    for(int j = l; j <= r; j++) {
                        if(a <= tmp2[j].second && tmp2[j].second <= b - k && tmp2[j].first >= k) ans++;
                    }
                }
            }
            printf("%d\n", ans);
        }
    }
}

Compilation message

segments.cpp: In function 'void relax()':
segments.cpp:20:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < add.size(); i++) chk[ add[i] ] = 1;
                        ~~^~~~~~~~~~~~
segments.cpp:21:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < del.size(); i++) chk[ del[i] ] = 0;
                        ~~^~~~~~~~~~~~
segments.cpp: In function 'int main()':
segments.cpp:90:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < add.size(); i++) if(min(b, seg[ add[i] ].second) - max(a, seg[ add[i] ].first) >= k) ans++;
                            ~~^~~~~~~~~~~~
segments.cpp:91:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < del.size(); i++) if(min(b, seg[ del[i] ].second) - max(a, seg[ del[i] ].first) >= k) ans--;
                            ~~^~~~~~~~~~~~
segments.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &Q, &T);
     ~~~~~^~~~~~~~~~~~~~~~~
segments.cpp:52:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int t; scanf("%d", &t);
                ~~~~~^~~~~~~~~~
segments.cpp:55:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             int a, b; scanf("%d %d", &a, &b);
                       ~~~~~^~~~~~~~~~~~~~~~~
segments.cpp:68:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             int id; scanf("%d", &id);
                     ~~~~~^~~~~~~~~~~
segments.cpp:73:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             int a, b, k; scanf("%d %d %d", &a, &b, &k);
                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 356 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 11 ms 512 KB Output is correct
5 Correct 19 ms 640 KB Output is correct
6 Correct 30 ms 640 KB Output is correct
7 Correct 10 ms 520 KB Output is correct
8 Correct 16 ms 640 KB Output is correct
9 Correct 14 ms 512 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
11 Correct 39 ms 640 KB Output is correct
12 Correct 38 ms 512 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 19 ms 512 KB Output is correct
15 Correct 12 ms 512 KB Output is correct
16 Correct 10 ms 512 KB Output is correct
17 Correct 13 ms 512 KB Output is correct
18 Correct 12 ms 640 KB Output is correct
19 Correct 13 ms 512 KB Output is correct
20 Correct 13 ms 512 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1552 ms 2744 KB Output is correct
2 Correct 1516 ms 2680 KB Output is correct
3 Correct 1571 ms 2704 KB Output is correct
4 Correct 1320 ms 2812 KB Output is correct
5 Correct 888 ms 4112 KB Output is correct
6 Correct 928 ms 4196 KB Output is correct
7 Correct 1510 ms 2972 KB Output is correct
8 Correct 1508 ms 2912 KB Output is correct
9 Correct 1490 ms 3016 KB Output is correct
10 Correct 1755 ms 2168 KB Output is correct
11 Correct 1718 ms 2372 KB Output is correct
12 Correct 1132 ms 3492 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 1448 KB Output is correct
2 Correct 261 ms 1592 KB Output is correct
3 Correct 297 ms 1476 KB Output is correct
4 Correct 230 ms 1632 KB Output is correct
5 Correct 1265 ms 3616 KB Output is correct
6 Correct 1343 ms 3244 KB Output is correct
7 Correct 1257 ms 3236 KB Output is correct
8 Correct 965 ms 4192 KB Output is correct
9 Correct 889 ms 4016 KB Output is correct
10 Correct 860 ms 3340 KB Output is correct
11 Correct 644 ms 1872 KB Output is correct
12 Correct 908 ms 3448 KB Output is correct
13 Correct 757 ms 3368 KB Output is correct
14 Correct 772 ms 2552 KB Output is correct
15 Correct 848 ms 2552 KB Output is correct
16 Correct 799 ms 2296 KB Output is correct
17 Correct 1597 ms 3080 KB Output is correct
18 Correct 1528 ms 3080 KB Output is correct
19 Correct 1576 ms 3200 KB Output is correct
20 Correct 1543 ms 3140 KB Output is correct
21 Correct 652 ms 1884 KB Output is correct
22 Correct 909 ms 2680 KB Output is correct
23 Correct 852 ms 2936 KB Output is correct
24 Correct 850 ms 2872 KB Output is correct
25 Correct 238 ms 1656 KB Output is correct
26 Correct 184 ms 1672 KB Output is correct
27 Correct 201 ms 1684 KB Output is correct
28 Correct 183 ms 1624 KB Output is correct
29 Correct 892 ms 3164 KB Output is correct
30 Correct 993 ms 3124 KB Output is correct
31 Correct 897 ms 4276 KB Output is correct
32 Correct 859 ms 3524 KB Output is correct
33 Correct 790 ms 3448 KB Output is correct
34 Correct 713 ms 2424 KB Output is correct
35 Correct 878 ms 3192 KB Output is correct
36 Correct 872 ms 3496 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 1416 KB Output is correct
2 Correct 204 ms 1464 KB Output is correct
3 Correct 214 ms 1400 KB Output is correct
4 Correct 207 ms 1404 KB Output is correct
5 Correct 1122 ms 3892 KB Output is correct
6 Correct 1861 ms 1996 KB Output is correct
7 Correct 1102 ms 3832 KB Output is correct
8 Correct 1660 ms 2296 KB Output is correct
9 Correct 797 ms 2552 KB Output is correct
10 Correct 873 ms 3664 KB Output is correct
11 Correct 823 ms 2168 KB Output is correct
12 Correct 889 ms 4344 KB Output is correct
13 Correct 802 ms 3276 KB Output is correct
14 Correct 720 ms 2524 KB Output is correct
15 Correct 815 ms 4132 KB Output is correct
16 Correct 851 ms 3448 KB Output is correct
17 Correct 1521 ms 3192 KB Output is correct
18 Correct 1593 ms 3064 KB Output is correct
19 Correct 1550 ms 3124 KB Output is correct
20 Correct 1614 ms 3000 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 356 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 11 ms 512 KB Output is correct
5 Correct 19 ms 640 KB Output is correct
6 Correct 30 ms 640 KB Output is correct
7 Correct 10 ms 520 KB Output is correct
8 Correct 16 ms 640 KB Output is correct
9 Correct 14 ms 512 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
11 Correct 39 ms 640 KB Output is correct
12 Correct 38 ms 512 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 19 ms 512 KB Output is correct
15 Correct 12 ms 512 KB Output is correct
16 Correct 10 ms 512 KB Output is correct
17 Correct 13 ms 512 KB Output is correct
18 Correct 12 ms 640 KB Output is correct
19 Correct 13 ms 512 KB Output is correct
20 Correct 13 ms 512 KB Output is correct
21 Correct 1552 ms 2744 KB Output is correct
22 Correct 1516 ms 2680 KB Output is correct
23 Correct 1571 ms 2704 KB Output is correct
24 Correct 1320 ms 2812 KB Output is correct
25 Correct 888 ms 4112 KB Output is correct
26 Correct 928 ms 4196 KB Output is correct
27 Correct 1510 ms 2972 KB Output is correct
28 Correct 1508 ms 2912 KB Output is correct
29 Correct 1490 ms 3016 KB Output is correct
30 Correct 1755 ms 2168 KB Output is correct
31 Correct 1718 ms 2372 KB Output is correct
32 Correct 1132 ms 3492 KB Output is correct
33 Correct 197 ms 1416 KB Output is correct
34 Correct 204 ms 1464 KB Output is correct
35 Correct 214 ms 1400 KB Output is correct
36 Correct 207 ms 1404 KB Output is correct
37 Correct 1122 ms 3892 KB Output is correct
38 Correct 1861 ms 1996 KB Output is correct
39 Correct 1102 ms 3832 KB Output is correct
40 Correct 1660 ms 2296 KB Output is correct
41 Correct 797 ms 2552 KB Output is correct
42 Correct 873 ms 3664 KB Output is correct
43 Correct 823 ms 2168 KB Output is correct
44 Correct 889 ms 4344 KB Output is correct
45 Correct 802 ms 3276 KB Output is correct
46 Correct 720 ms 2524 KB Output is correct
47 Correct 815 ms 4132 KB Output is correct
48 Correct 851 ms 3448 KB Output is correct
49 Correct 1521 ms 3192 KB Output is correct
50 Correct 1593 ms 3064 KB Output is correct
51 Correct 1550 ms 3124 KB Output is correct
52 Correct 1614 ms 3000 KB Output is correct
53 Correct 205 ms 1556 KB Output is correct
54 Correct 218 ms 1628 KB Output is correct
55 Correct 205 ms 1688 KB Output is correct
56 Correct 180 ms 1656 KB Output is correct
57 Correct 1840 ms 4860 KB Output is correct
58 Correct 1752 ms 1784 KB Output is correct
59 Correct 1293 ms 3448 KB Output is correct
60 Correct 1682 ms 1784 KB Output is correct
61 Correct 869 ms 3204 KB Output is correct
62 Correct 891 ms 4124 KB Output is correct
63 Correct 968 ms 4064 KB Output is correct
64 Correct 833 ms 3960 KB Output is correct
65 Correct 719 ms 2136 KB Output is correct
66 Correct 712 ms 2092 KB Output is correct
67 Correct 843 ms 3356 KB Output is correct
68 Correct 827 ms 2984 KB Output is correct
69 Correct 1567 ms 2964 KB Output is correct
70 Correct 1584 ms 2944 KB Output is correct
71 Correct 1617 ms 3124 KB Output is correct
72 Correct 1626 ms 2980 KB Output is correct
73 Correct 914 ms 2296 KB Output is correct
74 Correct 930 ms 2992 KB Output is correct
75 Correct 952 ms 3988 KB Output is correct
76 Correct 930 ms 3876 KB Output is correct
77 Correct 184 ms 1404 KB Output is correct
78 Correct 293 ms 1444 KB Output is correct
79 Correct 222 ms 1624 KB Output is correct
80 Correct 243 ms 1552 KB Output is correct
81 Correct 951 ms 2892 KB Output is correct
82 Correct 823 ms 2368 KB Output is correct
83 Correct 806 ms 1968 KB Output is correct
84 Correct 855 ms 2940 KB Output is correct
85 Correct 777 ms 3428 KB Output is correct
86 Correct 789 ms 3576 KB Output is correct
87 Correct 738 ms 2552 KB Output is correct
88 Correct 620 ms 1912 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 356 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 11 ms 512 KB Output is correct
5 Correct 19 ms 640 KB Output is correct
6 Correct 30 ms 640 KB Output is correct
7 Correct 10 ms 520 KB Output is correct
8 Correct 16 ms 640 KB Output is correct
9 Correct 14 ms 512 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
11 Correct 39 ms 640 KB Output is correct
12 Correct 38 ms 512 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 19 ms 512 KB Output is correct
15 Correct 12 ms 512 KB Output is correct
16 Correct 10 ms 512 KB Output is correct
17 Correct 13 ms 512 KB Output is correct
18 Correct 12 ms 640 KB Output is correct
19 Correct 13 ms 512 KB Output is correct
20 Correct 13 ms 512 KB Output is correct
21 Correct 1552 ms 2744 KB Output is correct
22 Correct 1516 ms 2680 KB Output is correct
23 Correct 1571 ms 2704 KB Output is correct
24 Correct 1320 ms 2812 KB Output is correct
25 Correct 888 ms 4112 KB Output is correct
26 Correct 928 ms 4196 KB Output is correct
27 Correct 1510 ms 2972 KB Output is correct
28 Correct 1508 ms 2912 KB Output is correct
29 Correct 1490 ms 3016 KB Output is correct
30 Correct 1755 ms 2168 KB Output is correct
31 Correct 1718 ms 2372 KB Output is correct
32 Correct 1132 ms 3492 KB Output is correct
33 Correct 231 ms 1448 KB Output is correct
34 Correct 261 ms 1592 KB Output is correct
35 Correct 297 ms 1476 KB Output is correct
36 Correct 230 ms 1632 KB Output is correct
37 Correct 1265 ms 3616 KB Output is correct
38 Correct 1343 ms 3244 KB Output is correct
39 Correct 1257 ms 3236 KB Output is correct
40 Correct 965 ms 4192 KB Output is correct
41 Correct 889 ms 4016 KB Output is correct
42 Correct 860 ms 3340 KB Output is correct
43 Correct 644 ms 1872 KB Output is correct
44 Correct 908 ms 3448 KB Output is correct
45 Correct 757 ms 3368 KB Output is correct
46 Correct 772 ms 2552 KB Output is correct
47 Correct 848 ms 2552 KB Output is correct
48 Correct 799 ms 2296 KB Output is correct
49 Correct 1597 ms 3080 KB Output is correct
50 Correct 1528 ms 3080 KB Output is correct
51 Correct 1576 ms 3200 KB Output is correct
52 Correct 1543 ms 3140 KB Output is correct
53 Correct 652 ms 1884 KB Output is correct
54 Correct 909 ms 2680 KB Output is correct
55 Correct 852 ms 2936 KB Output is correct
56 Correct 850 ms 2872 KB Output is correct
57 Correct 238 ms 1656 KB Output is correct
58 Correct 184 ms 1672 KB Output is correct
59 Correct 201 ms 1684 KB Output is correct
60 Correct 183 ms 1624 KB Output is correct
61 Correct 892 ms 3164 KB Output is correct
62 Correct 993 ms 3124 KB Output is correct
63 Correct 897 ms 4276 KB Output is correct
64 Correct 859 ms 3524 KB Output is correct
65 Correct 790 ms 3448 KB Output is correct
66 Correct 713 ms 2424 KB Output is correct
67 Correct 878 ms 3192 KB Output is correct
68 Correct 872 ms 3496 KB Output is correct
69 Correct 197 ms 1416 KB Output is correct
70 Correct 204 ms 1464 KB Output is correct
71 Correct 214 ms 1400 KB Output is correct
72 Correct 207 ms 1404 KB Output is correct
73 Correct 1122 ms 3892 KB Output is correct
74 Correct 1861 ms 1996 KB Output is correct
75 Correct 1102 ms 3832 KB Output is correct
76 Correct 1660 ms 2296 KB Output is correct
77 Correct 797 ms 2552 KB Output is correct
78 Correct 873 ms 3664 KB Output is correct
79 Correct 823 ms 2168 KB Output is correct
80 Correct 889 ms 4344 KB Output is correct
81 Correct 802 ms 3276 KB Output is correct
82 Correct 720 ms 2524 KB Output is correct
83 Correct 815 ms 4132 KB Output is correct
84 Correct 851 ms 3448 KB Output is correct
85 Correct 1521 ms 3192 KB Output is correct
86 Correct 1593 ms 3064 KB Output is correct
87 Correct 1550 ms 3124 KB Output is correct
88 Correct 1614 ms 3000 KB Output is correct
89 Correct 205 ms 1556 KB Output is correct
90 Correct 218 ms 1628 KB Output is correct
91 Correct 205 ms 1688 KB Output is correct
92 Correct 180 ms 1656 KB Output is correct
93 Correct 1840 ms 4860 KB Output is correct
94 Correct 1752 ms 1784 KB Output is correct
95 Correct 1293 ms 3448 KB Output is correct
96 Correct 1682 ms 1784 KB Output is correct
97 Correct 869 ms 3204 KB Output is correct
98 Correct 891 ms 4124 KB Output is correct
99 Correct 968 ms 4064 KB Output is correct
100 Correct 833 ms 3960 KB Output is correct
101 Correct 719 ms 2136 KB Output is correct
102 Correct 712 ms 2092 KB Output is correct
103 Correct 843 ms 3356 KB Output is correct
104 Correct 827 ms 2984 KB Output is correct
105 Correct 1567 ms 2964 KB Output is correct
106 Correct 1584 ms 2944 KB Output is correct
107 Correct 1617 ms 3124 KB Output is correct
108 Correct 1626 ms 2980 KB Output is correct
109 Correct 914 ms 2296 KB Output is correct
110 Correct 930 ms 2992 KB Output is correct
111 Correct 952 ms 3988 KB Output is correct
112 Correct 930 ms 3876 KB Output is correct
113 Correct 184 ms 1404 KB Output is correct
114 Correct 293 ms 1444 KB Output is correct
115 Correct 222 ms 1624 KB Output is correct
116 Correct 243 ms 1552 KB Output is correct
117 Correct 951 ms 2892 KB Output is correct
118 Correct 823 ms 2368 KB Output is correct
119 Correct 806 ms 1968 KB Output is correct
120 Correct 855 ms 2940 KB Output is correct
121 Correct 777 ms 3428 KB Output is correct
122 Correct 789 ms 3576 KB Output is correct
123 Correct 738 ms 2552 KB Output is correct
124 Correct 620 ms 1912 KB Output is correct
125 Correct 405 ms 1916 KB Output is correct
126 Correct 409 ms 1948 KB Output is correct
127 Correct 496 ms 2004 KB Output is correct
128 Correct 508 ms 1912 KB Output is correct
129 Correct 425 ms 1956 KB Output is correct
130 Correct 406 ms 2044 KB Output is correct
131 Correct 4698 ms 2712 KB Output is correct
132 Correct 3781 ms 4564 KB Output is correct
133 Correct 3512 ms 5720 KB Output is correct
134 Correct 3663 ms 3068 KB Output is correct
135 Correct 3537 ms 6008 KB Output is correct
136 Correct 3030 ms 2044 KB Output is correct
137 Correct 3162 ms 10744 KB Output is correct
138 Correct 2530 ms 8696 KB Output is correct
139 Correct 2980 ms 9716 KB Output is correct
140 Correct 3334 ms 10228 KB Output is correct
141 Correct 2928 ms 9128 KB Output is correct
142 Correct 1627 ms 5984 KB Output is correct
143 Correct 1882 ms 6696 KB Output is correct
144 Correct 1208 ms 5948 KB Output is correct
145 Correct 3109 ms 10368 KB Output is correct
146 Correct 2302 ms 7620 KB Output is correct
147 Correct 1828 ms 7000 KB Output is correct
148 Correct 1715 ms 6748 KB Output is correct
149 Correct 3899 ms 9612 KB Output is correct
150 Correct 3616 ms 9708 KB Output is correct
151 Correct 3901 ms 9428 KB Output is correct
152 Correct 3700 ms 9576 KB Output is correct
153 Correct 3908 ms 9556 KB Output is correct
154 Correct 3840 ms 9720 KB Output is correct
155 Correct 1772 ms 6400 KB Output is correct
156 Correct 2144 ms 7032 KB Output is correct
157 Correct 3323 ms 10424 KB Output is correct
158 Correct 3325 ms 10488 KB Output is correct
159 Correct 2757 ms 8952 KB Output is correct
160 Correct 2313 ms 7760 KB Output is correct
161 Correct 604 ms 5624 KB Output is correct
162 Correct 486 ms 5580 KB Output is correct
163 Correct 449 ms 5752 KB Output is correct
164 Correct 684 ms 5800 KB Output is correct
165 Correct 464 ms 5544 KB Output is correct
166 Correct 459 ms 5604 KB Output is correct
167 Correct 3319 ms 10980 KB Output is correct
168 Correct 3374 ms 10944 KB Output is correct
169 Correct 3127 ms 10276 KB Output is correct
170 Correct 3068 ms 10096 KB Output is correct
171 Correct 2686 ms 9288 KB Output is correct
172 Correct 2075 ms 7404 KB Output is correct
173 Correct 3216 ms 10492 KB Output is correct
174 Correct 2245 ms 7504 KB Output is correct
175 Correct 3207 ms 9476 KB Output is correct
176 Correct 1832 ms 6904 KB Output is correct
177 Correct 2593 ms 8976 KB Output is correct
178 Correct 2545 ms 8692 KB Output is correct