oj.uz

Submission #826764

# Submission time Handle Problem Language Result Execution time Memory
826764 2023-08-16T03:00:58 Z kevinsogo Split the Attractions (IOI19_split) C++17
100 / 100
 304 ms 76408 KB 
#include <bits/stdc++.h>
using namespace std;
#include "split.h"
using ll = long long;
template<class T>
using vec = vector<T>;

vec<vec<int>> extract(int n, int a, int b, int c, const vec<pair<int,int>>& edges) {
    int e = edges.size();
    assert(1 <= a and a <= b and b <= c);
    assert(3*a <= n);
    assert(2*b <= n);
    assert(1*c <= n);
    
    vec<vec<int>> adj(n);
    vec<bool> vis(n);
    auto get_component = [&](const unordered_set<int>& nodes, int s) {
        for (int i : nodes) {
            vis[i] = false;
            adj[i].clear();
        }
        assert(nodes.count(s));
        for (auto [i, j] : edges) {
            if (nodes.count(i) and nodes.count(j)) {
                adj[i].push_back(j);
                adj[j].push_back(i);
            }
        }

        vis[s] = true;
        vec<int> que = {s};
        for (int f = 0; f < que.size(); f++) {
            int i = que[f];
            for (int j : adj[i]) {
                if (not vis[j]) {
                    vis[j] = true;
                    que.push_back(j);
                }
            }
        }
        return que;
    };

    auto get_bccs = [&]() {
        vec<vec<pair<int,int>>> adj(n);
        for (int idx = 0; idx < e; idx++) {
            auto [i, j] = edges[idx];
            adj[i].emplace_back(j, idx);
            adj[j].emplace_back(i, idx);
        }

        vec<int> low(n, -1), dsc(n, -1);
        vec<bool> evi(e);
        vec<int> eve;
        vec<vec<int>> bccs;
        int tm = 0;
        function<void(int)> dfs = [&](int i) {
            assert(dsc[i] == -1);
            dsc[i] = low[i] = tm++;
            for (auto [j, idx] : adj[i]) {
                if (evi[idx]) continue;
                eve.push_back(idx);
                evi[idx] = true;
                if (dsc[j] == -1) {
                    dfs(j);
                    low[i] = min(low[i], low[j]);
                    if (low[j] >= dsc[i]) {
                        bccs.emplace_back();
                        while (bccs.back().empty() or bccs.back().back() != idx) {
                            bccs.back().push_back(eve.back()); eve.pop_back();
                        }
                    }
                } else {
                    low[i] = min(low[i], dsc[j]);
                }
            }
        };

        dfs(0);
        assert(eve.empty());
        return bccs;
    };
    auto bccs = get_bccs();

    auto get_bctree = [&]() -> tuple<vec<vec<int>>,vec<int>,vec<int>> {
        vec<vec<int>> bcadj(n + bccs.size());
        vec<unordered_set<int>> bcedges(n);
        for (int bci = 0; bci < bccs.size(); bci++) {
            for (int idx : bccs[bci]) {
                auto [i, j] = edges[idx];
                bcedges[i].insert(n + bci);
                bcedges[j].insert(n + bci);
            }
        }

        int ct = 0;
        for (int i = 0; i < n; i++) {
            for (int j : bcedges[i]) {
                ct++;
                bcadj[i].push_back(j);
                bcadj[j].push_back(i);
            }
        }
        assert(ct == n + bccs.size() - 1);

        vec<int> bcsiz(n, 1);
        bcsiz.resize(n + bccs.size());
        vec<int> bcpar(n + bccs.size(), -1);
        function<void(int)> dfs = [&](int i) {
            for (int j : bcadj[i]) {
                if (j != bcpar[i]) {
                    bcpar[j] = i;
                    dfs(j);
                    bcsiz[i] += bcsiz[j];
                }
            }
        };
        dfs(0);
        assert(bcsiz[0] == n);
        return {bcadj, bcsiz, bcpar};
    };
    auto [bcadj, bcsiz, bcpar] = get_bctree();

    vec<int> low(n, -1), dsc(n, -1);
    vec<bool> evi(e);
    vec<vec<pair<int,int>>> iadj(n);
    vec<int> isize(n), dep(n);
    vec<bool> inseq(n), inaseq(n);
    vec<int> pare(n, -1);
    vec<vec<int>> igs(n);
    for (int bci = 0; bci < bccs.size(); bci++) {
        vec<int>& inodes = bcadj[n + bci];
        for (int i : inodes) isize[i] = bcsiz[i];
        isize[bcpar[n + bci]] = n - bcsiz[n + bci];
        assert(inodes.size() >= 2);

        int r = *max_element(inodes.begin(), inodes.end(), [&](int i, int j) { return isize[i] < isize[j]; });

        for (int i : inodes) {
            dsc[i] = -1;
            iadj[i].clear();
            inseq[i] = inaseq[i] = false;
        }
        
        for (int idx : bccs[bci]) {
            evi[idx] = false;
            auto [i, j] = edges[idx];
            iadj[i].emplace_back(j, idx);
            iadj[j].emplace_back(i, idx);
        }
        
        int tm = 0;
        dep[r] = 0;
        function<void(int)> dfs = [&](int i) {
            assert(dsc[i] == -1);
            dsc[i] = low[i] = tm++;
            for (auto [j, idx] : iadj[i]) {
                if (evi[idx]) continue;
                evi[idx] = true;
                if (dsc[j] == -1) {
                    dep[j] = dep[i] + 1;
                    pare[j] = idx;
                    dfs(j);
                    low[i] = min(low[i], low[j]);
                } else {
                    low[i] = min(low[i], dsc[j]);
                }
            }

            assert((low[i] == dsc[i]) == (i == r or inodes.size() == 2));
        };
        dfs(r);

        vec<int> aseq;
        if (inodes.size() == 2) {
            aseq = inodes;
            if (aseq.front() != r) reverse(aseq.begin(), aseq.end());
        } else {
            vec<int> fseq;
            auto add_all = [&](const vec<int>& s) {
                for (int i : s) inseq[i] = true;
                for (int i : s) {
                    igs[i].clear();
                    for (auto [j, idx] : iadj[i]) {
                        if (not inseq[j] and pare[j] == idx) igs[i].push_back(j);
                    }
                    fseq.push_back(i);
                }
            };
            add_all({r});
            while (not fseq.empty()) {
                int i = fseq.back(); fseq.pop_back();
                if (igs[i].empty()) {
                    aseq.push_back(i);
                    inaseq[i] = true;
                } else {
                    int j = igs[i].back(); igs[i].pop_back();
                    int targ = max(1, dsc[i]);
                    assert(low[j] < targ);
                    vec<int> seq = {j};
                    while (dsc[seq.back()] >= targ) {
                        for (auto [k, idx] : iadj[seq.back()]) {
                            if (dsc[k] < targ or pare[k] == idx and low[k] == low[seq.back()]) {
                                seq.push_back(k);
                                break;
                            }
                        }
                    }
                    int l = seq.back(); seq.pop_back();
                    if (inaseq[l]) {
                        fseq.push_back(i);
                        add_all(seq);
                    } else {
                        reverse(seq.begin(), seq.end());
                        add_all(seq);
                        fseq.push_back(i);
                    }
                }
            }
        }
        assert(aseq.front() == r);

        int sz = 0;
        vec<int> gr, rg(aseq.rbegin(), aseq.rend());
        while (sz < a) {
            gr.push_back(rg.back()); rg.pop_back();
            sz += isize[gr.back()];
        }
        assert(not gr.empty());
        assert(not rg.empty());

        if (a <= sz and b <= n - sz) {
            swap(gr, rg);
            sz = n - sz;
            assert(b <= sz and a <= n - sz);
        }

        if (b <= sz and a <= n - sz) {
            // get compa
            unordered_set<int> ns;
            for (int i = 0; i < n; i++) ns.insert(i);
            for (int i : gr) ns.erase(i);
            auto compa = get_component(ns, rg.front());
            assert(compa.size() == n - sz);

            // get compb
            ns.clear();
            for (int i = 0; i < n; i++) ns.insert(i);
            for (int i : compa) ns.erase(i);
            auto compb = get_component(ns, gr.front());
            assert(compb.size() == sz);

            // resize
            compa.resize(a);
            compb.resize(b);

            // get compc
            ns.clear();
            for (int i = 0; i < n; i++) ns.insert(i);
            for (int i : compa) ns.erase(i);
            for (int i : compb) ns.erase(i);
            return {compa, compb, {ns.begin(), ns.end()}};
        }
    }

    return {};
}

vec<int> find_split(int n, int a, int b, int c, vec<int> p, vec<int> q) {
    assert(p.size() == q.size());
    vec<pair<int,int>> edges(p.size());
    for (int i = 0; i < p.size(); i++) edges[i] = {p[i], q[i]};
    vec<pair<int,int>> abci = {{a, 1}, {b, 2}, {c, 3}};
    sort(abci.begin(), abci.end());
    vec<int> res(n);
    if (auto abcs = extract(n, abci[0].first, abci[1].first, abci[2].first, edges); not abcs.empty()) {
        assert(abci.size() == abcs.size());
        for (int x = 0; x < abci.size(); x++) {
            auto [sz, vl] = abci[x];
            assert(abcs[x].size() == sz);
            for (int i : abcs[x]) res[i] = vl;
        }
    }
    return res;
}

Compilation message

split.cpp: In lambda function:
split.cpp:32:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for (int f = 0; f < que.size(); f++) {
      |                         ~~^~~~~~~~~~~~
split.cpp: In lambda function:
split.cpp:88:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int>, std::allocator<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         for (int bci = 0; bci < bccs.size(); bci++) {
      |                           ~~~~^~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from split.cpp:1:
split.cpp:104:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int>, std::allocator<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         assert(ct == n + bccs.size() - 1);
      |                ~~~^~~~~~~~~~~~~~~~~~~~~~
split.cpp: In function 'vec<std::vector<int> > extract(int, int, int, int, vec<std::pair<int, int> >&)':
split.cpp:131:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int>, std::allocator<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |     for (int bci = 0; bci < bccs.size(); bci++) {
      |                       ~~~~^~~~~~~~~~~~~
split.cpp:203:65: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  203 |                             if (dsc[k] < targ or pare[k] == idx and low[k] == low[seq.back()]) {
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from split.cpp:1:
split.cpp:244:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  244 |             assert(compa.size() == n - sz);
      |                    ~~~~~~~~~~~~~^~~~~~~~~
split.cpp:251:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  251 |             assert(compb.size() == sz);
      |                    ~~~~~~~~~~~~~^~~~~
split.cpp: In function 'vec<int> find_split(int, int, int, int, vec<int>, vec<int>)':
split.cpp:272:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  272 |     for (int i = 0; i < p.size(); i++) edges[i] = {p[i], q[i]};
      |                     ~~^~~~~~~~~~
split.cpp:278:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  278 |         for (int x = 0; x < abci.size(); x++) {
      |                         ~~^~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from split.cpp:1:
split.cpp:280:35: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'std::tuple_element<0, std::pair<int, int> >::type' {aka 'int'} [-Wsign-compare]
  280 |             assert(abcs[x].size() == sz);
      |                    ~~~~~~~~~~~~~~~^~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 340 KB ok, correct split
6 Correct 0 ms 340 KB ok, correct split
7 Correct 238 ms 76408 KB ok, correct split
8 Correct 224 ms 71068 KB ok, correct split
9 Correct 217 ms 69316 KB ok, correct split
10 Correct 176 ms 46464 KB ok, correct split
11 Correct 176 ms 46400 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 195 ms 47876 KB ok, correct split
5 Correct 215 ms 58812 KB ok, correct split
6 Correct 188 ms 46440 KB ok, correct split
7 Correct 221 ms 70604 KB ok, correct split
8 Correct 213 ms 43536 KB ok, correct split
9 Correct 149 ms 38792 KB ok, correct split
10 Correct 185 ms 60664 KB ok, correct split
11 Correct 188 ms 60844 KB ok, correct split
12 Correct 188 ms 60748 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 235 ms 58684 KB ok, correct split
3 Correct 63 ms 23700 KB ok, correct split
4 Correct 0 ms 340 KB ok, correct split
5 Correct 227 ms 64900 KB ok, correct split
6 Correct 221 ms 64228 KB ok, correct split
7 Correct 241 ms 63764 KB ok, correct split
8 Correct 238 ms 66976 KB ok, correct split
9 Correct 246 ms 63384 KB ok, correct split
10 Correct 49 ms 19688 KB ok, no valid answer
11 Correct 87 ms 29512 KB ok, no valid answer
12 Correct 184 ms 59788 KB ok, no valid answer
13 Correct 195 ms 58928 KB ok, no valid answer
14 Correct 179 ms 60668 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, no valid answer
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 0 ms 212 KB ok, correct split
8 Correct 0 ms 212 KB ok, correct split
9 Correct 4 ms 1236 KB ok, correct split
10 Correct 4 ms 1364 KB ok, correct split
11 Correct 1 ms 340 KB ok, correct split
12 Correct 4 ms 1364 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 1 ms 340 KB ok, correct split
16 Correct 1 ms 340 KB ok, correct split
17 Correct 0 ms 212 KB ok, correct split
18 Correct 0 ms 212 KB ok, correct split
19 Correct 1 ms 468 KB ok, correct split
20 Correct 2 ms 700 KB ok, correct split
21 Correct 4 ms 1876 KB ok, correct split
22 Correct 4 ms 1876 KB ok, correct split
23 Correct 4 ms 1876 KB ok, correct split
24 Correct 4 ms 1876 KB ok, correct split
25 Correct 4 ms 1876 KB ok, correct split
26 Correct 3 ms 1236 KB ok, correct split
27 Correct 3 ms 1236 KB ok, correct split
28 Correct 4 ms 1236 KB ok, correct split
29 Correct 1 ms 340 KB ok, correct split
30 Correct 3 ms 1236 KB ok, correct split
31 Correct 1 ms 468 KB ok, correct split
32 Correct 1 ms 468 KB ok, correct split
33 Correct 1 ms 340 KB ok, correct split
34 Correct 4 ms 1492 KB ok, correct split
35 Correct 4 ms 1492 KB ok, correct split
36 Correct 4 ms 1620 KB ok, correct split
37 Correct 4 ms 1236 KB ok, correct split
38 Correct 4 ms 1364 KB ok, correct split
39 Correct 6 ms 1232 KB ok, correct split
40 Correct 4 ms 1236 KB ok, correct split
41 Correct 2 ms 724 KB ok, correct split
42 Correct 2 ms 724 KB ok, correct split
43 Correct 4 ms 1236 KB ok, correct split
44 Correct 4 ms 1236 KB ok, correct split
45 Correct 5 ms 1236 KB ok, correct split
46 Correct 3 ms 1236 KB ok, correct split
47 Correct 2 ms 1236 KB ok, no valid answer
48 Correct 3 ms 1236 KB ok, correct split
49 Correct 3 ms 1364 KB ok, correct split
50 Correct 0 ms 212 KB ok, no valid answer
51 Correct 0 ms 212 KB ok, no valid answer
52 Correct 3 ms 1748 KB ok, no valid answer
53 Correct 4 ms 1364 KB ok, no valid answer
54 Correct 3 ms 1748 KB ok, no valid answer
55 Correct 3 ms 1492 KB ok, no valid answer
56 Correct 3 ms 1620 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 340 KB ok, correct split
6 Correct 0 ms 340 KB ok, correct split
7 Correct 238 ms 76408 KB ok, correct split
8 Correct 224 ms 71068 KB ok, correct split
9 Correct 217 ms 69316 KB ok, correct split
10 Correct 176 ms 46464 KB ok, correct split
11 Correct 176 ms 46400 KB ok, correct split
12 Correct 0 ms 212 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 195 ms 47876 KB ok, correct split
16 Correct 215 ms 58812 KB ok, correct split
17 Correct 188 ms 46440 KB ok, correct split
18 Correct 221 ms 70604 KB ok, correct split
19 Correct 213 ms 43536 KB ok, correct split
20 Correct 149 ms 38792 KB ok, correct split
21 Correct 185 ms 60664 KB ok, correct split
22 Correct 188 ms 60844 KB ok, correct split
23 Correct 188 ms 60748 KB ok, correct split
24 Correct 0 ms 212 KB ok, correct split
25 Correct 235 ms 58684 KB ok, correct split
26 Correct 63 ms 23700 KB ok, correct split
27 Correct 0 ms 340 KB ok, correct split
28 Correct 227 ms 64900 KB ok, correct split
29 Correct 221 ms 64228 KB ok, correct split
30 Correct 241 ms 63764 KB ok, correct split
31 Correct 238 ms 66976 KB ok, correct split
32 Correct 246 ms 63384 KB ok, correct split
33 Correct 49 ms 19688 KB ok, no valid answer
34 Correct 87 ms 29512 KB ok, no valid answer
35 Correct 184 ms 59788 KB ok, no valid answer
36 Correct 195 ms 58928 KB ok, no valid answer
37 Correct 179 ms 60668 KB ok, no valid answer
38 Correct 0 ms 212 KB ok, correct split
39 Correct 0 ms 212 KB ok, no valid answer
40 Correct 0 ms 212 KB ok, correct split
41 Correct 0 ms 212 KB ok, correct split
42 Correct 0 ms 212 KB ok, correct split
43 Correct 0 ms 212 KB ok, correct split
44 Correct 0 ms 212 KB ok, correct split
45 Correct 0 ms 212 KB ok, correct split
46 Correct 4 ms 1236 KB ok, correct split
47 Correct 4 ms 1364 KB ok, correct split
48 Correct 1 ms 340 KB ok, correct split
49 Correct 4 ms 1364 KB ok, correct split
50 Correct 0 ms 212 KB ok, correct split
51 Correct 0 ms 212 KB ok, correct split
52 Correct 1 ms 340 KB ok, correct split
53 Correct 1 ms 340 KB ok, correct split
54 Correct 0 ms 212 KB ok, correct split
55 Correct 0 ms 212 KB ok, correct split
56 Correct 1 ms 468 KB ok, correct split
57 Correct 2 ms 700 KB ok, correct split
58 Correct 4 ms 1876 KB ok, correct split
59 Correct 4 ms 1876 KB ok, correct split
60 Correct 4 ms 1876 KB ok, correct split
61 Correct 4 ms 1876 KB ok, correct split
62 Correct 4 ms 1876 KB ok, correct split
63 Correct 3 ms 1236 KB ok, correct split
64 Correct 3 ms 1236 KB ok, correct split
65 Correct 4 ms 1236 KB ok, correct split
66 Correct 1 ms 340 KB ok, correct split
67 Correct 3 ms 1236 KB ok, correct split
68 Correct 1 ms 468 KB ok, correct split
69 Correct 1 ms 468 KB ok, correct split
70 Correct 1 ms 340 KB ok, correct split
71 Correct 4 ms 1492 KB ok, correct split
72 Correct 4 ms 1492 KB ok, correct split
73 Correct 4 ms 1620 KB ok, correct split
74 Correct 4 ms 1236 KB ok, correct split
75 Correct 4 ms 1364 KB ok, correct split
76 Correct 6 ms 1232 KB ok, correct split
77 Correct 4 ms 1236 KB ok, correct split
78 Correct 2 ms 724 KB ok, correct split
79 Correct 2 ms 724 KB ok, correct split
80 Correct 4 ms 1236 KB ok, correct split
81 Correct 4 ms 1236 KB ok, correct split
82 Correct 5 ms 1236 KB ok, correct split
83 Correct 3 ms 1236 KB ok, correct split
84 Correct 2 ms 1236 KB ok, no valid answer
85 Correct 3 ms 1236 KB ok, correct split
86 Correct 3 ms 1364 KB ok, correct split
87 Correct 0 ms 212 KB ok, no valid answer
88 Correct 0 ms 212 KB ok, no valid answer
89 Correct 3 ms 1748 KB ok, no valid answer
90 Correct 4 ms 1364 KB ok, no valid answer
91 Correct 3 ms 1748 KB ok, no valid answer
92 Correct 3 ms 1492 KB ok, no valid answer
93 Correct 3 ms 1620 KB ok, no valid answer
94 Correct 237 ms 50636 KB ok, correct split
95 Correct 304 ms 47524 KB ok, correct split
96 Correct 279 ms 47376 KB ok, correct split
97 Correct 62 ms 23660 KB ok, correct split
98 Correct 67 ms 20396 KB ok, correct split
99 Correct 68 ms 14648 KB ok, correct split
100 Correct 248 ms 43852 KB ok, correct split
101 Correct 231 ms 44404 KB ok, correct split
102 Correct 242 ms 46880 KB ok, correct split
103 Correct 233 ms 48316 KB ok, correct split
104 Correct 205 ms 41432 KB ok, correct split
105 Correct 136 ms 34212 KB ok, correct split
106 Correct 235 ms 41428 KB ok, correct split
107 Correct 246 ms 58608 KB ok, correct split
108 Correct 283 ms 58704 KB ok, correct split
109 Correct 293 ms 43432 KB ok, correct split
110 Correct 228 ms 41332 KB ok, correct split
111 Correct 228 ms 41460 KB ok, correct split
112 Correct 231 ms 41320 KB ok, correct split
113 Correct 255 ms 41436 KB ok, correct split
114 Correct 18 ms 4668 KB ok, correct split
115 Correct 17 ms 4468 KB ok, correct split
116 Correct 220 ms 41360 KB ok, correct split
117 Correct 219 ms 41316 KB ok, correct split
118 Correct 163 ms 38812 KB ok, correct split
119 Correct 145 ms 39052 KB ok, correct split
120 Correct 157 ms 42792 KB ok, correct split
121 Correct 184 ms 55096 KB ok, no valid answer
122 Correct 194 ms 59032 KB ok, no valid answer
123 Correct 196 ms 43932 KB ok, no valid answer
124 Correct 207 ms 43988 KB ok, no valid answer
125 Correct 182 ms 54396 KB ok, no valid answer
126 Correct 155 ms 54836 KB ok, no valid answer
127 Correct 208 ms 50364 KB ok, no valid answer