oj.uz

Submission #486701

# Submission time Handle Problem Language Result Execution time Memory
486701 2021-11-12T12:18:12 Z alextodoran Event Hopping 2 (JOI21_event2) C++17
100 / 100
 615 ms 29112 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 100000;

const int BITS = 17;

int N, K;

struct Segment
{
    int l, r;
};

bool operator < (const Segment &a, const Segment &b)
{
    if(a.l != b.l)
        return a.l < b.l;
    return a.r > b.r;
}

Segment seg[N_MAX + 2];

vector <Segment> sorted;

int anc[N_MAX + 2][BITS];

int sumMax;

set <int> del;
set <pair <int, int>> activeR;
set <pair <int, int>> activeL;

int getMax (int first, int last)
{
    if(first > last)
        return 0;
    int curr = last;
    int cnt = 1;
    for(int bit = BITS - 1; bit >= 0; bit--)
        if(first <= anc[curr][bit])
        {
            cnt += (1 << bit);
            curr = anc[curr][bit];
        }
    return cnt;
}

void init ()
{
    int j = -1;
    for(int i = 0; i < (int) sorted.size(); i++)
    {
        while(j < i - 1 && sorted[j + 1].r < sorted[i].l)
            j++;
        anc[i][0] = j;
    }

    for(int bit = 1; bit < BITS; bit++)
        for(int i = 0; i < (int) sorted.size(); i++)
        {
            if(anc[i][bit - 1] == -1)
                anc[i][bit] = -1;
            else
                anc[i][bit] = anc[anc[i][bit - 1]][bit - 1];
        }

    for(int i = 0; i < (int) sorted.size(); i++)
    {
        activeL.insert(make_pair(sorted[i].l, i));
        activeR.insert(make_pair(sorted[i].r, i));
    }
    del.insert(-1);
    del.insert((int) sorted.size());

    sumMax = getMax(0, (int) sorted.size() - 1);
}

int cnt[N_MAX + 2];

void delSeg (int i)
{
    cnt[i]++;
    if(del.find(i) != del.end())
        return;

    set <int> :: iterator itr = del.upper_bound(i);
    set <int> :: iterator itl = prev(itr);

    int il = *itl;
    int ir = *itr;

    sumMax -= getMax(il + 1, ir - 1);
    del.insert(i);
    activeL.erase(make_pair(sorted[i].l, i));
    activeR.erase(make_pair(sorted[i].r, i));
    sumMax += getMax(il + 1, i - 1);
    sumMax += getMax(i + 1, ir - 1);
}
void addSeg (int i)
{
    cnt[i]++;
    set <int> :: iterator it = del.find(i);
    if(it == del.end())
        return;

    set <int> :: iterator itr = next(it);
    set <int> :: iterator itl = prev(it);

    int il = *itl;
    int ir = *itr;

    sumMax -= getMax(il + 1, i - 1);
    sumMax -= getMax(i + 1, ir - 1);
    del.erase(it);
    activeL.insert(make_pair(sorted[i].l, i));
    activeR.insert(make_pair(sorted[i].r, i));
    sumMax += getMax(il + 1, ir - 1);
}

void delAll (int l, int r)
{
    set <pair <int, int>> :: iterator itl = activeR.upper_bound(make_pair(l, -1));
    set <pair <int, int>> :: iterator itr = activeL.upper_bound(make_pair(r, INT_MAX));
    if(itl == activeR.end())
        return;
    if(itr == activeL.begin())
        return;
    itr = prev(itr);
    int L = itl->second;
    int R = itr->second;
    for(int i = L; i <= R; i++)
        delSeg(i);
}

int delTest (int l, int r)
{
    set <pair <int, int>> :: iterator itl = activeR.upper_bound(make_pair(l, -1));
    set <pair <int, int>> :: iterator itr = activeL.upper_bound(make_pair(r, INT_MAX));
    if(itl == activeR.end())
        return sumMax;
    if(itr == activeL.begin())
        return sumMax;
    itr = prev(itr);
    int L = itl->second;
    int R = itr->second;
    if(L > R)
        return sumMax;
    delSeg(L);
    delSeg(R);
    int res = sumMax - getMax(L + 1, R - 1);
    addSeg(L);
    addSeg(R);
    return res;
}

struct SGTNode
{
    ll sum;
    int lazy;
};

SGTNode operator + (const SGTNode &u, const SGTNode &v)
{
    return SGTNode{u.sum + v.sum, 0};
}

SGTNode SGT[N_MAX * 2 * 4 + 2];

void split (int node, int l, int r)
{
    int mid = (l + r) / 2;
    int lSon = node * 2, rSon = node * 2 + 1;
    SGT[lSon].sum += (ll) SGT[node].lazy * (mid - l + 1);
    SGT[rSon].sum += (ll) SGT[node].lazy * (r - mid);
    SGT[lSon].lazy += SGT[node].lazy;
    SGT[rSon].lazy += SGT[node].lazy;
    SGT[node].lazy = 0;
}

void update (int node, int l, int r, int ul, int ur, int uval)
{
    if(ul <= l && r <= ur)
    {
        SGT[node].sum += (ll) uval * (r - l + 1);
        SGT[node].lazy += uval;
        return;
    }

    split(node, l, r);

    int mid = (l + r) / 2;
    int lSon = node * 2, rSon = node * 2 + 1;
    if(ul <= mid)
        update(lSon, l, mid, ul, ur, uval);
    if(mid + 1 <= ur)
        update(rSon, mid + 1, r, ul, ur, uval);

    SGT[node] = SGT[lSon] + SGT[rSon];
}
void update (int ul, int ur, int uval)
{
    update(1, 1, N * 2, ul, ur, uval);
}

ll query (int node, int l, int r, int ql, int qr)
{
    if(ql <= l && r <= qr)
        return SGT[node].sum;

    split(node, l, r);

    int mid = (l + r) / 2;
    int lSon = node * 2, rSon = node * 2 + 1;

    ll sum = 0;
    if(ql <= mid)
        sum += query(lSon, l, mid, ql, qr);
    if(mid + 1 <= qr)
        sum += query(rSon, mid + 1, r, ql, qr);
    return sum;
}
ll query (int ql, int qr)
{
    return query(1, 1, N * 2, ql, qr);
}

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

    cin >> N >> K;
    for(int i = 1; i <= N; i++)
    {
        cin >> seg[i].l >> seg[i].r;
    }

    {
        vector <int> aux;
        for(int i = 1; i <= N; i++)
        {
            aux.push_back(seg[i].l);
            aux.push_back(seg[i].r);
        }
        sort(aux.begin(), aux.end());
        aux.resize(unique(aux.begin(), aux.end()) - aux.begin());

        unordered_map <int, int> mp;
        for(int i = 0; i < (int) aux.size(); i++)
            mp[aux[i]] = i + 1;

        for(int i = 1; i <= N; i++)
        {
            seg[i].l = mp[seg[i].l];
            seg[i].r = mp[seg[i].r];
        }
    }

    for(int i = 1; i <= N; i++)
        seg[i].r--;

    {
        for(int i = 1; i <= N; i++)
            sorted.push_back(seg[i]);
        sort(sorted.begin(), sorted.end());

        vector <Segment> newSorted;
        for(Segment s : sorted)
        {
            while(newSorted.empty() == false && s.r <= newSorted.back().r)
                newSorted.pop_back();
            newSorted.push_back(s);
        }
        sorted = newSorted;
    }

    init();

    if(sumMax < K)
    {
        cout << "-1\n";
        return 0;
    }

    int curr = 1;
    for(int i = 1; i <= K; i++)
    {
        while(curr <= N)
        {
            if(query(seg[curr].l, seg[curr].r) > 0)
            {
                curr++;
                continue;
            }
            update(seg[curr].l, seg[curr].r, + 1);
            if(delTest(seg[curr].l, seg[curr].r) < K - i)
            {
                update(seg[curr].l, seg[curr].r, - 1);
                curr++;
                continue;
            }
            delAll(seg[curr].l, seg[curr].r);
            break;
        }
        cout << curr << "\n";
        curr++;
    }

    return 0;
}

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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 348 ms 27112 KB Output is correct
5 Correct 395 ms 26620 KB Output is correct
6 Correct 333 ms 26236 KB Output is correct
7 Correct 308 ms 25340 KB Output is correct
8 Correct 386 ms 27064 KB Output is correct
9 Correct 350 ms 26720 KB Output is correct
10 Correct 376 ms 26164 KB Output is correct
11 Correct 360 ms 25344 KB Output is correct
12 Correct 301 ms 25824 KB Output is correct
13 Correct 370 ms 25340 KB Output is correct
14 Correct 296 ms 24944 KB Output is correct
15 Correct 314 ms 24120 KB Output is correct
16 Correct 237 ms 19356 KB Output is correct
17 Correct 218 ms 19196 KB Output is correct
18 Correct 219 ms 18364 KB Output is correct
19 Correct 152 ms 16796 KB Output is correct
20 Correct 131 ms 16760 KB Output is correct
21 Correct 129 ms 16712 KB Output is correct
22 Correct 132 ms 15908 KB Output is correct
23 Correct 143 ms 15900 KB Output is correct
24 Correct 156 ms 15916 KB Output is correct
25 Correct 130 ms 15568 KB Output is correct
26 Correct 146 ms 15576 KB Output is correct
27 Correct 126 ms 15724 KB Output is correct
28 Correct 131 ms 17912 KB Output is correct
29 Correct 149 ms 16828 KB Output is correct
30 Correct 126 ms 11292 KB Output is correct
31 Correct 96 ms 11320 KB Output is correct
32 Correct 91 ms 11408 KB Output is correct
33 Correct 108 ms 11296 KB Output is correct
34 Correct 243 ms 22304 KB Output is correct
35 Correct 214 ms 20524 KB Output is correct
36 Correct 170 ms 18712 KB Output is correct
37 Correct 245 ms 19300 KB Output is correct
38 Correct 242 ms 18932 KB Output is correct
39 Correct 257 ms 18748 KB Output is correct
40 Correct 231 ms 18356 KB Output is correct
41 Correct 219 ms 18124 KB Output is correct
42 Correct 140 ms 11380 KB Output is correct
43 Correct 256 ms 19336 KB Output is correct
44 Correct 255 ms 21232 KB Output is correct
45 Correct 249 ms 21384 KB Output is correct
46 Correct 254 ms 21240 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 4 ms 812 KB Output is correct
29 Correct 4 ms 812 KB Output is correct
30 Correct 5 ms 812 KB Output is correct
31 Correct 3 ms 812 KB Output is correct
32 Correct 3 ms 812 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 2 ms 588 KB Output is correct
35 Correct 11 ms 1068 KB Output is correct
36 Correct 12 ms 1152 KB Output is correct
37 Correct 9 ms 1068 KB Output is correct
38 Correct 4 ms 812 KB Output is correct
39 Correct 11 ms 1152 KB Output is correct
40 Correct 10 ms 1068 KB Output is correct
41 Correct 9 ms 1068 KB Output is correct
42 Correct 3 ms 840 KB Output is correct
43 Correct 8 ms 1072 KB Output is correct
44 Correct 7 ms 1068 KB Output is correct
45 Correct 7 ms 1068 KB Output is correct
46 Correct 3 ms 684 KB Output is correct
47 Correct 6 ms 940 KB Output is correct
48 Correct 5 ms 940 KB Output is correct
49 Correct 5 ms 972 KB Output is correct
50 Correct 3 ms 684 KB Output is correct
51 Correct 7 ms 812 KB Output is correct
52 Correct 5 ms 816 KB Output is correct
53 Correct 3 ms 812 KB Output is correct
54 Correct 3 ms 588 KB Output is correct
55 Correct 8 ms 972 KB Output is correct
56 Correct 8 ms 936 KB Output is correct
57 Correct 7 ms 972 KB Output is correct
58 Correct 8 ms 972 KB Output is correct
59 Correct 8 ms 972 KB Output is correct
60 Correct 7 ms 972 KB Output is correct
61 Correct 7 ms 972 KB Output is correct
62 Correct 7 ms 984 KB Output is correct
63 Correct 6 ms 972 KB Output is correct
64 Correct 2 ms 844 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 348 ms 27112 KB Output is correct
5 Correct 395 ms 26620 KB Output is correct
6 Correct 333 ms 26236 KB Output is correct
7 Correct 308 ms 25340 KB Output is correct
8 Correct 386 ms 27064 KB Output is correct
9 Correct 350 ms 26720 KB Output is correct
10 Correct 376 ms 26164 KB Output is correct
11 Correct 360 ms 25344 KB Output is correct
12 Correct 301 ms 25824 KB Output is correct
13 Correct 370 ms 25340 KB Output is correct
14 Correct 296 ms 24944 KB Output is correct
15 Correct 314 ms 24120 KB Output is correct
16 Correct 237 ms 19356 KB Output is correct
17 Correct 218 ms 19196 KB Output is correct
18 Correct 219 ms 18364 KB Output is correct
19 Correct 152 ms 16796 KB Output is correct
20 Correct 131 ms 16760 KB Output is correct
21 Correct 129 ms 16712 KB Output is correct
22 Correct 132 ms 15908 KB Output is correct
23 Correct 143 ms 15900 KB Output is correct
24 Correct 156 ms 15916 KB Output is correct
25 Correct 130 ms 15568 KB Output is correct
26 Correct 146 ms 15576 KB Output is correct
27 Correct 126 ms 15724 KB Output is correct
28 Correct 131 ms 17912 KB Output is correct
29 Correct 149 ms 16828 KB Output is correct
30 Correct 126 ms 11292 KB Output is correct
31 Correct 96 ms 11320 KB Output is correct
32 Correct 91 ms 11408 KB Output is correct
33 Correct 108 ms 11296 KB Output is correct
34 Correct 243 ms 22304 KB Output is correct
35 Correct 214 ms 20524 KB Output is correct
36 Correct 170 ms 18712 KB Output is correct
37 Correct 245 ms 19300 KB Output is correct
38 Correct 242 ms 18932 KB Output is correct
39 Correct 257 ms 18748 KB Output is correct
40 Correct 231 ms 18356 KB Output is correct
41 Correct 219 ms 18124 KB Output is correct
42 Correct 140 ms 11380 KB Output is correct
43 Correct 256 ms 19336 KB Output is correct
44 Correct 255 ms 21232 KB Output is correct
45 Correct 249 ms 21384 KB Output is correct
46 Correct 254 ms 21240 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 0 ms 332 KB Output is correct
56 Correct 0 ms 332 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 0 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 1 ms 332 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 0 ms 332 KB Output is correct
70 Correct 0 ms 332 KB Output is correct
71 Correct 0 ms 332 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 0 ms 332 KB Output is correct
74 Correct 4 ms 812 KB Output is correct
75 Correct 4 ms 812 KB Output is correct
76 Correct 5 ms 812 KB Output is correct
77 Correct 3 ms 812 KB Output is correct
78 Correct 3 ms 812 KB Output is correct
79 Correct 3 ms 588 KB Output is correct
80 Correct 2 ms 588 KB Output is correct
81 Correct 11 ms 1068 KB Output is correct
82 Correct 12 ms 1152 KB Output is correct
83 Correct 9 ms 1068 KB Output is correct
84 Correct 4 ms 812 KB Output is correct
85 Correct 11 ms 1152 KB Output is correct
86 Correct 10 ms 1068 KB Output is correct
87 Correct 9 ms 1068 KB Output is correct
88 Correct 3 ms 840 KB Output is correct
89 Correct 8 ms 1072 KB Output is correct
90 Correct 7 ms 1068 KB Output is correct
91 Correct 7 ms 1068 KB Output is correct
92 Correct 3 ms 684 KB Output is correct
93 Correct 6 ms 940 KB Output is correct
94 Correct 5 ms 940 KB Output is correct
95 Correct 5 ms 972 KB Output is correct
96 Correct 3 ms 684 KB Output is correct
97 Correct 7 ms 812 KB Output is correct
98 Correct 5 ms 816 KB Output is correct
99 Correct 3 ms 812 KB Output is correct
100 Correct 3 ms 588 KB Output is correct
101 Correct 8 ms 972 KB Output is correct
102 Correct 8 ms 936 KB Output is correct
103 Correct 7 ms 972 KB Output is correct
104 Correct 8 ms 972 KB Output is correct
105 Correct 8 ms 972 KB Output is correct
106 Correct 7 ms 972 KB Output is correct
107 Correct 7 ms 972 KB Output is correct
108 Correct 7 ms 984 KB Output is correct
109 Correct 6 ms 972 KB Output is correct
110 Correct 2 ms 844 KB Output is correct
111 Correct 158 ms 17456 KB Output is correct
112 Correct 186 ms 17524 KB Output is correct
113 Correct 161 ms 17560 KB Output is correct
114 Correct 159 ms 17448 KB Output is correct
115 Correct 151 ms 17416 KB Output is correct
116 Correct 102 ms 13256 KB Output is correct
117 Correct 115 ms 13220 KB Output is correct
118 Correct 612 ms 29112 KB Output is correct
119 Correct 615 ms 28924 KB Output is correct
120 Correct 409 ms 27584 KB Output is correct
121 Correct 140 ms 18836 KB Output is correct
122 Correct 492 ms 27696 KB Output is correct
123 Correct 471 ms 27768 KB Output is correct
124 Correct 464 ms 27640 KB Output is correct
125 Correct 149 ms 18764 KB Output is correct
126 Correct 330 ms 21336 KB Output is correct
127 Correct 286 ms 21412 KB Output is correct
128 Correct 265 ms 21368 KB Output is correct
129 Correct 147 ms 13220 KB Output is correct
130 Correct 252 ms 18776 KB Output is correct
131 Correct 234 ms 18752 KB Output is correct
132 Correct 178 ms 18656 KB Output is correct
133 Correct 113 ms 13380 KB Output is correct
134 Correct 231 ms 17876 KB Output is correct
135 Correct 190 ms 17788 KB Output is correct
136 Correct 178 ms 17864 KB Output is correct
137 Correct 116 ms 13328 KB Output is correct
138 Correct 177 ms 17632 KB Output is correct
139 Correct 150 ms 17528 KB Output is correct
140 Correct 112 ms 17624 KB Output is correct
141 Correct 106 ms 13320 KB Output is correct
142 Correct 356 ms 25164 KB Output is correct
143 Correct 328 ms 25140 KB Output is correct
144 Correct 356 ms 25152 KB Output is correct
145 Correct 285 ms 25148 KB Output is correct
146 Correct 298 ms 25148 KB Output is correct
147 Correct 297 ms 25004 KB Output is correct
148 Correct 283 ms 24856 KB Output is correct
149 Correct 308 ms 24848 KB Output is correct
150 Correct 299 ms 24740 KB Output is correct
151 Correct 295 ms 24332 KB Output is correct
152 Correct 95 ms 20036 KB Output is correct
153 Correct 303 ms 25148 KB Output is correct
154 Correct 314 ms 25232 KB Output is correct
155 Correct 295 ms 25020 KB Output is correct
156 Correct 300 ms 24924 KB Output is correct
157 Correct 291 ms 24820 KB Output is correct
158 Correct 290 ms 24776 KB Output is correct
159 Correct 289 ms 24112 KB Output is correct
160 Correct 93 ms 20028 KB Output is correct
161 Correct 464 ms 27064 KB Output is correct
162 Correct 451 ms 26940 KB Output is correct
163 Correct 421 ms 26876 KB Output is correct
164 Correct 424 ms 26924 KB Output is correct
165 Correct 415 ms 26868 KB Output is correct
166 Correct 117 ms 13344 KB Output is correct
167 Correct 260 ms 21432 KB Output is correct
168 Correct 244 ms 21368 KB Output is correct
169 Correct 253 ms 21228 KB Output is correct
170 Correct 239 ms 21216 KB Output is correct
171 Correct 291 ms 28284 KB Output is correct
172 Correct 311 ms 28944 KB Output is correct
173 Correct 521 ms 24964 KB Output is correct
174 Correct 498 ms 24856 KB Output is correct
175 Correct 488 ms 24892 KB Output is correct
176 Correct 388 ms 24904 KB Output is correct