oj.uz

답안 #848800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848800 2023-09-13T13:59:38 Z danikoynov Jail (JOI22_jail) C++14
100 / 100
 1101 ms 240752 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 2e5 + 10;

int n, m, s[maxn], t[maxn], parent[maxn];
vector < int > adj[maxn], children[maxn];
void input()
{
    cin >> n;
    for (int i = 1; i < n; i ++)
    {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    cin >> m;
    for (int i = 1; i <= m; i ++)
    {
        cin >> s[i] >> t[i];
    }

}

int tin[maxn], tout[maxn], occ[2 * maxn], depth[maxn], timer;
int sub[maxn], heavy[maxn];
void euler(int v = 1, int p = -1)
{
    tin[v] = ++ timer;
    occ[timer] = v;
    sub[v] = 1;
    heavy[v] = -1;
    parent[v] = p;
    for (int u : adj[v])
    {
        if (u == p)
            continue;
        children[v].push_back(u);
        depth[u] = depth[v] + 1;
        euler(u, v);
        if (heavy[v] == -1 || sub[u] > sub[heavy[v]])
            heavy[v] = u;
        sub[v] += sub[u];
        occ[++ timer] = v;
    }
    tout[v] = timer;
}

const int maxlog = 20;
int dp[maxlog][maxn * 2], lg[2 * maxn];

void build_sparse_table()
{
    for (int i = 1; i <= timer; i ++)
    {
        dp[0][i] = occ[i];
        lg[i] = lg[i / 2] + 1;
    }

    for (int j = 1; j < lg[timer]; j ++)
    {
        for (int i = 1; i <= timer - (1 << j) + 1; i ++)
        {
            dp[j][i] = dp[j - 1][i + (1 << (j - 1))];
            if (depth[dp[j - 1][i]] < depth[dp[j][i]])
                dp[j][i] = dp[j - 1][i];
        }
    }
}

int get_lca(int v, int u)
{
    int l = tin[v], r = tin[u];
    if (l > r)
        swap(l, r);
    int len = lg[r - l + 1] - 1;
    int lca = dp[len][r - (1 << len) + 1];
    if (depth[dp[len][l]] < depth[lca])
        lca = dp[len][l];
    return lca;
}

vector < int > graph[10 * maxn];
bool is_cycle;

bool in_subtree(int v, int u)
{
    return (tin[v] <= tin[u] && tout[v] >= tout[u]);
}

bool on_path(int v, int u, int w)
{

    int lca = get_lca(v, u);
    if (in_subtree(lca, w) && in_subtree(w, v))
        return true;
    if (in_subtree(lca, w) && in_subtree(w, u))
        return true;
    return false;
}

void check_prisoners(int i, int j)
{
    /**if (on_path(s[i], t[i], s[j]) && on_path(s[i], t[i], t[j]))
    {
        is_cycle = true;
        return;
    }*/

    if (on_path(s[i], t[i], s[j]))
    {
        graph[i].push_back(j);
        return;
    }

    if (on_path(s[i], t[i], t[j]))
    {
        graph[j].push_back(i);
        return;
    }
}

vector < pair < int, int > > link[maxn];
set < pair < int, int > > loc_set[maxn];

bool cmp(pair < int, int > di, pair < int, int > dj)
{
    int i = di.second, j = dj.second;
    int d1 = depth[s[i]] + depth[t[i]] - 2 * depth[get_lca(s[i], t[i])];
    int d2 = depth[s[j]] + depth[t[j]] - 2 * depth[get_lca(s[j], t[j])];
    return d1 > d2;
}

bool check_range(int idx, int left, int right)
{
    pair < int, int > cur = {left, -1};
    set < pair < int, int > > :: iterator it = loc_set[idx].lower_bound(cur);
    if (it == loc_set[idx].end())
        return false;
    if (it -> first <= right)
        return true;
    return false;
}

int find_child(int v, int u)
{
    int lf = 0, rf = (int)(children[v].size()) - 1;
    while(lf <= rf)
    {
        int mf = (lf + rf) / 2;
        if (tout[children[v][mf]] < tin[u])
            lf = mf + 1;
        else
            rf = mf - 1;
    }
    return children[v][lf];

}

struct chain
{
    int top, left, right;

} ch[maxn];

int ord[maxn], ch_idx[maxn], ch_cnt, to, ch_pos[maxn];


void hld(int v)
{
    ch_idx[v] = ch_cnt;
    ord[++ to] = v;
    ch[ch_idx[v]].right = to;
    ch_pos[v] = to;
    if (heavy[v] != -1)
        hld(heavy[v]);

    for (int u : children[v])
    {
        if (u == heavy[v])
            continue;

        ch_cnt ++;
        ch[ch_cnt].top = v;
        ch[ch_cnt].left = to + 1;
        ch[ch_cnt].right = to;
        hld(u);
    }
}

vector < int > ver_start[maxn], ver_end[maxn]; /// might be replaced
void add_edge(int v, int u)
{
    graph[v].push_back(u);
    ///cout << "edge " << v << " " << u << endl;
}
void build_forward_tree(int root, int left, int right)
{
    ///cout << root + m << " : " << left << " " << right << endl;
    if (left == right)
    {
        for (int v : ver_start[left])
            add_edge(root + m, v);
        ///graph[root + m].push_back(v);
        return;
    }

    int mid = (left + right) / 2;
    add_edge(root + m, root * 2 + m);
    add_edge(root + m, root * 2 + 1 + m);
    ///graph[root + m].push_back(root * 2 + m);
    ///graph[root + m].push_back(root * 2  + 1 + m);

    build_forward_tree(root * 2, left, mid);
    build_forward_tree(root * 2 + 1, mid + 1, right);
}

vector < int > bkt[maxn * 4];
void build_backward_tree(int root, int left, int right)
{
    bkt[root].clear();
    if (left == right)
    {
        for (int v : ver_end[left])
        {
            bkt[root].push_back(v);
            add_edge(v, root + m + 4 * n);
            ///graph[v].push_back(root + m + 4 * n);
            ///cout << v << " here " << left << endl;
        }
        return;
    }

    int mid = (left + right) / 2;
    ///add_edge(root * 2 + m + 4 * n, root + m + 4 * n);
    ///add_edge(root * 2 + 1 + m + 4 * n, root + m + 4 * n);

    ///graph[root * 2 + m + 4 * n].push_back(root + m + 4 * n);
    ///graph[root * 2  + 1 + m + 4 * n].push_back(root + m + 4 * n);

    build_backward_tree(root * 2, left, mid);
    build_backward_tree(root * 2 + 1, mid + 1, right);

    for (int v : bkt[root * 2])
        bkt[root].push_back(v);
    for (int v : bkt[root * 2 + 1])
        bkt[root].push_back(v);
    for (int v : bkt[root])
        add_edge(v, root + m + 4 * n);

}

void add_forward(int root, int left, int right, int qleft, int qright, int val)
{
    if (left > qright || right < qleft)
        return;

    if (left >= qleft && right <= qright)
    {
        add_edge(val, root + m);
        ///graph[val].push_back(root + m);
        return;
    }

    int mid = (left + right) / 2;
    add_forward(root * 2, left, mid, qleft, qright, val);
    add_forward(root * 2 + 1, mid + 1, right, qleft, qright, val);
}

void add_backward(int root, int left, int right, int qleft, int qright, int val)
{
    if (left > qright || right < qleft)
        return;

    if (left >= qleft && right <= qright)
    {
        add_edge(root + m + 4 * n, val);

        return;
    }

    int mid = (left + right) / 2;
    add_backward(root * 2, left, mid, qleft, qright, val);
    add_backward(root * 2 + 1, mid + 1, right, qleft, qright, val);
}

void add_path_forward(int v, int lca, int idx)
{

    while(ch_idx[v] != ch_idx[lca])
    {

        add_forward(1, 1, n, ch[ch_idx[v]].left, ch_pos[v], idx);
        ///add_backward(1, 1, n, ch[ch_idx[v]].left, ch_pos[v], idx);
        v = ch[ch_idx[v]].top;
    }
    ///cout << "idx " << idx << " " << ch_pos[lca] << " " << ch_pos[v] << endl;

    add_forward(1, 1, n, ch_pos[lca], ch_pos[v], idx);
    ///add_backward(1, 1, n, ch_pos[lca], ch_pos[v], idx);
}

void add_path_backward(int v, int lca, int idx)
{

    while(ch_idx[v] != ch_idx[lca])
    {

        ///add_forward(1, 1, n, ch[ch_idx[v]].left, ch_pos[v], idx);
        add_backward(1, 1, n, ch[ch_idx[v]].left, ch_pos[v], idx);
        v = ch[ch_idx[v]].top;
    }
    ///cout << "idx " << idx << " " << ch_pos[lca] << " " << ch_pos[v] << endl;

    ///add_forward(1, 1, n, ch_pos[lca], ch_pos[v], idx);
    add_backward(1, 1, n, ch_pos[lca], ch_pos[v], idx);
}
void build_graph()
{


    for (int i = 1; i <= m; i ++)
    {
        link[s[i]].push_back({tin[t[i]], i});
        link[t[i]].push_back({tin[s[i]], i});

    }


    ch_cnt = 0;
    to = 0;
    ch[++ ch_cnt].top = 0;
    ch[ch_cnt].left = 1;
    ch[ch_cnt].right = 0;
    hld(1);
    /**for (int i = 1; i <= n; i ++)
        cout << ch_pos[i] << " ";
    cout << endl;*/
    for (int i = 1; i <= m; i ++)
    {
                ver_start[ch_pos[s[i]]].push_back(i);
        ver_end[ch_pos[t[i]]].push_back(i);
    }
    build_backward_tree(1, 1, n);
    build_forward_tree(1, 1, n);

    for (int i = 1; i <= m; i ++)
    {
        int lca = get_lca(s[i], t[i]);

        if (depth[s[i]] + depth[t[i]] - 2 * depth[lca] != 1)
        {

            int v = s[i], u = t[i];
            if (lca != v && lca != u)
            {
                v = parent[v];
                u = parent[u];
            }
            else if (lca == v)
            {
                v = find_child(v, u);
                u = parent[u];
            }
            else if (lca == u)
            {
                u = find_child(u, v);
                v = parent[v];

            }
            lca = get_lca(v, u);
            ///cout << "path " << v << " : " << u << endl;
            add_path_forward(v, lca, i);
            add_path_forward(u, lca, i);
            add_path_backward(v, lca, i);
            add_path_backward(u, lca, i);
        }

        for (pair < int, int > cur : link[s[i]])
        {
            if (i != cur.second)
                check_prisoners(i, cur.second);
        }

        for (pair < int, int > cur : link[t[i]])
        {
            if (i != cur.second)
                check_prisoners(i, cur.second);
        }



    }
    /**for (int i = 1; i <= m; i ++)
    {
        for (int j = 1; j <= m; j ++)
        {
            if (i != j)
                check_prisoners(i, j);
        }
    }*/
}

int used[maxn];

void check_dag(int v)
{
    used[v] = 1;
    for (int u : graph[v])
    {
        if (used[u] == 2)
            continue;
        ///cout << v << " : " << u << endl;
        if (used[u] == 1)
            is_cycle = 1;
        else
        {
            check_dag(u);
        }
    }
    used[v] = 2;
}

void check_graph()
{
    for (int i = 1; i <= m + 8 * n; i ++)
    {
        if (!used[i])
            check_dag(i);
    }

    if (is_cycle)
        cout << "No" << endl;
    else
        cout << "Yes" << endl;
}

void clear_data()
{
    is_cycle = false;
    for (int i = 1; i <= m + 8 * n; i ++)
    {
        bkt[i].clear();

        graph[i].clear(), used[i] = 0;
    }

    for (int i = 1; i <= ch_cnt; i ++)
    {
        ch[i].top = ch[i].left = ch[i].right = 0;
    }


    for (int i = 0; i <= n; i ++)
    {
        tin[i] = 0;
        tout[i] = 0;
        adj[i].clear();
        link[i].clear();
        ver_start[i].clear();
        ver_end[i].clear();
        children[i].clear();
        loc_set[i].clear();
    }


    timer = 0;
}

int test_num;
void solve()
{
    test_num ++;
    /**if (test_num <= 6)
    {
        cout << "SKIPPED" << endl;
        return;
    }*/
    input();
    euler();
    build_sparse_table();
    build_graph();
    check_graph();
    clear_data();

}

int main()
{
    speed();
    //freopen("test.txt", "r", stdin);
    int q;
    cin >> q;
    while(q --)
        solve();
    return 0;
}
/**
1
7
1 2
2 3
3 4
4 5
3 6
6 7
2
4 1
5 7

1
4
1 2
2 3
3 4
2
1 3
2 4


1
5
1 2
1 3
2 4
2 5
1
4 5

*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 117340 KB Output is correct
2 Correct 23 ms 117340 KB Output is correct
3 Correct 22 ms 113264 KB Output is correct
4 Correct 35 ms 123484 KB Output is correct
5 Correct 47 ms 123484 KB Output is correct
6 Correct 25 ms 123484 KB Output is correct
7 Correct 26 ms 123704 KB Output is correct
8 Correct 27 ms 123740 KB Output is correct
9 Correct 68 ms 134484 KB Output is correct
10 Correct 82 ms 164180 KB Output is correct
11 Correct 30 ms 119388 KB Output is correct
12 Correct 73 ms 123484 KB Output is correct
13 Correct 198 ms 193376 KB Output is correct
14 Correct 187 ms 193188 KB Output is correct
15 Correct 327 ms 198740 KB Output is correct
16 Correct 706 ms 240752 KB Output is correct
17 Correct 224 ms 204488 KB Output is correct
18 Correct 200 ms 211056 KB Output is correct
19 Correct 214 ms 201200 KB Output is correct
20 Correct 224 ms 201268 KB Output is correct
21 Correct 266 ms 204212 KB Output is correct
22 Correct 144 ms 190916 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 117340 KB Output is correct
2 Correct 23 ms 113204 KB Output is correct
3 Correct 25 ms 123484 KB Output is correct
4 Correct 25 ms 123484 KB Output is correct
5 Correct 25 ms 123624 KB Output is correct
6 Correct 25 ms 123484 KB Output is correct
7 Correct 25 ms 123484 KB Output is correct
8 Correct 24 ms 123480 KB Output is correct
9 Correct 29 ms 123484 KB Output is correct
10 Correct 25 ms 123492 KB Output is correct
11 Correct 24 ms 123612 KB Output is correct
12 Correct 26 ms 123480 KB Output is correct
13 Correct 26 ms 123480 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 117340 KB Output is correct
2 Correct 23 ms 113204 KB Output is correct
3 Correct 25 ms 123484 KB Output is correct
4 Correct 25 ms 123484 KB Output is correct
5 Correct 25 ms 123624 KB Output is correct
6 Correct 25 ms 123484 KB Output is correct
7 Correct 25 ms 123484 KB Output is correct
8 Correct 24 ms 123480 KB Output is correct
9 Correct 29 ms 123484 KB Output is correct
10 Correct 25 ms 123492 KB Output is correct
11 Correct 24 ms 123612 KB Output is correct
12 Correct 26 ms 123480 KB Output is correct
13 Correct 26 ms 123480 KB Output is correct
14 Correct 23 ms 117336 KB Output is correct
15 Correct 23 ms 117340 KB Output is correct
16 Correct 26 ms 123484 KB Output is correct
17 Correct 25 ms 123588 KB Output is correct
18 Correct 27 ms 123484 KB Output is correct
19 Correct 23 ms 117336 KB Output is correct
20 Correct 27 ms 123480 KB Output is correct
21 Correct 25 ms 123484 KB Output is correct
22 Correct 24 ms 123484 KB Output is correct
23 Correct 26 ms 117336 KB Output is correct
24 Correct 24 ms 123484 KB Output is correct
25 Correct 25 ms 123480 KB Output is correct
26 Correct 24 ms 123504 KB Output is correct
27 Correct 26 ms 123672 KB Output is correct
28 Correct 25 ms 119384 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 117340 KB Output is correct
2 Correct 23 ms 113204 KB Output is correct
3 Correct 25 ms 123484 KB Output is correct
4 Correct 25 ms 123484 KB Output is correct
5 Correct 25 ms 123624 KB Output is correct
6 Correct 25 ms 123484 KB Output is correct
7 Correct 25 ms 123484 KB Output is correct
8 Correct 24 ms 123480 KB Output is correct
9 Correct 29 ms 123484 KB Output is correct
10 Correct 25 ms 123492 KB Output is correct
11 Correct 24 ms 123612 KB Output is correct
12 Correct 26 ms 123480 KB Output is correct
13 Correct 26 ms 123480 KB Output is correct
14 Correct 23 ms 117336 KB Output is correct
15 Correct 23 ms 117340 KB Output is correct
16 Correct 26 ms 123484 KB Output is correct
17 Correct 25 ms 123588 KB Output is correct
18 Correct 27 ms 123484 KB Output is correct
19 Correct 23 ms 117336 KB Output is correct
20 Correct 27 ms 123480 KB Output is correct
21 Correct 25 ms 123484 KB Output is correct
22 Correct 24 ms 123484 KB Output is correct
23 Correct 26 ms 117336 KB Output is correct
24 Correct 24 ms 123484 KB Output is correct
25 Correct 25 ms 123480 KB Output is correct
26 Correct 24 ms 123504 KB Output is correct
27 Correct 26 ms 123672 KB Output is correct
28 Correct 25 ms 119384 KB Output is correct
29 Correct 27 ms 123736 KB Output is correct
30 Correct 27 ms 123604 KB Output is correct
31 Correct 27 ms 123696 KB Output is correct
32 Correct 30 ms 123480 KB Output is correct
33 Correct 27 ms 123484 KB Output is correct
34 Correct 28 ms 123480 KB Output is correct
35 Correct 30 ms 123484 KB Output is correct
36 Correct 25 ms 123672 KB Output is correct
37 Correct 25 ms 123484 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 117340 KB Output is correct
2 Correct 23 ms 113204 KB Output is correct
3 Correct 25 ms 123484 KB Output is correct
4 Correct 25 ms 123484 KB Output is correct
5 Correct 25 ms 123624 KB Output is correct
6 Correct 25 ms 123484 KB Output is correct
7 Correct 25 ms 123484 KB Output is correct
8 Correct 24 ms 123480 KB Output is correct
9 Correct 29 ms 123484 KB Output is correct
10 Correct 25 ms 123492 KB Output is correct
11 Correct 24 ms 123612 KB Output is correct
12 Correct 26 ms 123480 KB Output is correct
13 Correct 26 ms 123480 KB Output is correct
14 Correct 23 ms 117336 KB Output is correct
15 Correct 23 ms 117340 KB Output is correct
16 Correct 26 ms 123484 KB Output is correct
17 Correct 25 ms 123588 KB Output is correct
18 Correct 27 ms 123484 KB Output is correct
19 Correct 23 ms 117336 KB Output is correct
20 Correct 27 ms 123480 KB Output is correct
21 Correct 25 ms 123484 KB Output is correct
22 Correct 24 ms 123484 KB Output is correct
23 Correct 26 ms 117336 KB Output is correct
24 Correct 24 ms 123484 KB Output is correct
25 Correct 25 ms 123480 KB Output is correct
26 Correct 24 ms 123504 KB Output is correct
27 Correct 26 ms 123672 KB Output is correct
28 Correct 25 ms 119384 KB Output is correct
29 Correct 27 ms 123736 KB Output is correct
30 Correct 27 ms 123604 KB Output is correct
31 Correct 27 ms 123696 KB Output is correct
32 Correct 30 ms 123480 KB Output is correct
33 Correct 27 ms 123484 KB Output is correct
34 Correct 28 ms 123480 KB Output is correct
35 Correct 30 ms 123484 KB Output is correct
36 Correct 25 ms 123672 KB Output is correct
37 Correct 25 ms 123484 KB Output is correct
38 Correct 68 ms 134552 KB Output is correct
39 Correct 97 ms 164324 KB Output is correct
40 Correct 92 ms 134196 KB Output is correct
41 Correct 106 ms 134216 KB Output is correct
42 Correct 76 ms 134456 KB Output is correct
43 Correct 62 ms 133040 KB Output is correct
44 Correct 43 ms 128108 KB Output is correct
45 Correct 103 ms 151652 KB Output is correct
46 Correct 125 ms 151980 KB Output is correct
47 Correct 86 ms 157496 KB Output is correct
48 Correct 87 ms 157488 KB Output is correct
49 Correct 102 ms 151972 KB Output is correct
50 Correct 97 ms 151892 KB Output is correct
51 Correct 82 ms 153228 KB Output is correct
52 Correct 83 ms 153404 KB Output is correct
53 Correct 40 ms 132948 KB Output is correct
54 Correct 103 ms 151484 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 117336 KB Output is correct
2 Correct 23 ms 117248 KB Output is correct
3 Correct 22 ms 117340 KB Output is correct
4 Correct 22 ms 113244 KB Output is correct
5 Correct 30 ms 119272 KB Output is correct
6 Correct 24 ms 123484 KB Output is correct
7 Correct 24 ms 123484 KB Output is correct
8 Correct 22 ms 117340 KB Output is correct
9 Correct 22 ms 117340 KB Output is correct
10 Correct 23 ms 123484 KB Output is correct
11 Correct 24 ms 119388 KB Output is correct
12 Correct 26 ms 123484 KB Output is correct
13 Correct 58 ms 123484 KB Output is correct
14 Correct 78 ms 123484 KB Output is correct
15 Correct 64 ms 123660 KB Output is correct
16 Correct 159 ms 157024 KB Output is correct
17 Correct 439 ms 185680 KB Output is correct
18 Correct 814 ms 222956 KB Output is correct
19 Correct 209 ms 163060 KB Output is correct
20 Correct 207 ms 163436 KB Output is correct
21 Correct 210 ms 163488 KB Output is correct
22 Correct 368 ms 181592 KB Output is correct
23 Correct 285 ms 181324 KB Output is correct
24 Correct 300 ms 181356 KB Output is correct
25 Correct 307 ms 181508 KB Output is correct
26 Correct 300 ms 181484 KB Output is correct
27 Correct 422 ms 202336 KB Output is correct
28 Correct 401 ms 203624 KB Output is correct
29 Correct 406 ms 200716 KB Output is correct
30 Correct 284 ms 185144 KB Output is correct
31 Correct 278 ms 186156 KB Output is correct
32 Correct 289 ms 184764 KB Output is correct
33 Correct 282 ms 186200 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 117340 KB Output is correct
2 Correct 23 ms 117340 KB Output is correct
3 Correct 22 ms 113264 KB Output is correct
4 Correct 35 ms 123484 KB Output is correct
5 Correct 47 ms 123484 KB Output is correct
6 Correct 25 ms 123484 KB Output is correct
7 Correct 26 ms 123704 KB Output is correct
8 Correct 27 ms 123740 KB Output is correct
9 Correct 68 ms 134484 KB Output is correct
10 Correct 82 ms 164180 KB Output is correct
11 Correct 30 ms 119388 KB Output is correct
12 Correct 73 ms 123484 KB Output is correct
13 Correct 198 ms 193376 KB Output is correct
14 Correct 187 ms 193188 KB Output is correct
15 Correct 327 ms 198740 KB Output is correct
16 Correct 706 ms 240752 KB Output is correct
17 Correct 224 ms 204488 KB Output is correct
18 Correct 200 ms 211056 KB Output is correct
19 Correct 214 ms 201200 KB Output is correct
20 Correct 224 ms 201268 KB Output is correct
21 Correct 266 ms 204212 KB Output is correct
22 Correct 144 ms 190916 KB Output is correct
23 Correct 23 ms 117340 KB Output is correct
24 Correct 23 ms 113204 KB Output is correct
25 Correct 25 ms 123484 KB Output is correct
26 Correct 25 ms 123484 KB Output is correct
27 Correct 25 ms 123624 KB Output is correct
28 Correct 25 ms 123484 KB Output is correct
29 Correct 25 ms 123484 KB Output is correct
30 Correct 24 ms 123480 KB Output is correct
31 Correct 29 ms 123484 KB Output is correct
32 Correct 25 ms 123492 KB Output is correct
33 Correct 24 ms 123612 KB Output is correct
34 Correct 26 ms 123480 KB Output is correct
35 Correct 26 ms 123480 KB Output is correct
36 Correct 23 ms 117336 KB Output is correct
37 Correct 23 ms 117340 KB Output is correct
38 Correct 26 ms 123484 KB Output is correct
39 Correct 25 ms 123588 KB Output is correct
40 Correct 27 ms 123484 KB Output is correct
41 Correct 23 ms 117336 KB Output is correct
42 Correct 27 ms 123480 KB Output is correct
43 Correct 25 ms 123484 KB Output is correct
44 Correct 24 ms 123484 KB Output is correct
45 Correct 26 ms 117336 KB Output is correct
46 Correct 24 ms 123484 KB Output is correct
47 Correct 25 ms 123480 KB Output is correct
48 Correct 24 ms 123504 KB Output is correct
49 Correct 26 ms 123672 KB Output is correct
50 Correct 25 ms 119384 KB Output is correct
51 Correct 27 ms 123736 KB Output is correct
52 Correct 27 ms 123604 KB Output is correct
53 Correct 27 ms 123696 KB Output is correct
54 Correct 30 ms 123480 KB Output is correct
55 Correct 27 ms 123484 KB Output is correct
56 Correct 28 ms 123480 KB Output is correct
57 Correct 30 ms 123484 KB Output is correct
58 Correct 25 ms 123672 KB Output is correct
59 Correct 25 ms 123484 KB Output is correct
60 Correct 68 ms 134552 KB Output is correct
61 Correct 97 ms 164324 KB Output is correct
62 Correct 92 ms 134196 KB Output is correct
63 Correct 106 ms 134216 KB Output is correct
64 Correct 76 ms 134456 KB Output is correct
65 Correct 62 ms 133040 KB Output is correct
66 Correct 43 ms 128108 KB Output is correct
67 Correct 103 ms 151652 KB Output is correct
68 Correct 125 ms 151980 KB Output is correct
69 Correct 86 ms 157496 KB Output is correct
70 Correct 87 ms 157488 KB Output is correct
71 Correct 102 ms 151972 KB Output is correct
72 Correct 97 ms 151892 KB Output is correct
73 Correct 82 ms 153228 KB Output is correct
74 Correct 83 ms 153404 KB Output is correct
75 Correct 40 ms 132948 KB Output is correct
76 Correct 103 ms 151484 KB Output is correct
77 Correct 22 ms 117336 KB Output is correct
78 Correct 23 ms 117248 KB Output is correct
79 Correct 22 ms 117340 KB Output is correct
80 Correct 22 ms 113244 KB Output is correct
81 Correct 30 ms 119272 KB Output is correct
82 Correct 24 ms 123484 KB Output is correct
83 Correct 24 ms 123484 KB Output is correct
84 Correct 22 ms 117340 KB Output is correct
85 Correct 22 ms 117340 KB Output is correct
86 Correct 23 ms 123484 KB Output is correct
87 Correct 24 ms 119388 KB Output is correct
88 Correct 26 ms 123484 KB Output is correct
89 Correct 58 ms 123484 KB Output is correct
90 Correct 78 ms 123484 KB Output is correct
91 Correct 64 ms 123660 KB Output is correct
92 Correct 159 ms 157024 KB Output is correct
93 Correct 439 ms 185680 KB Output is correct
94 Correct 814 ms 222956 KB Output is correct
95 Correct 209 ms 163060 KB Output is correct
96 Correct 207 ms 163436 KB Output is correct
97 Correct 210 ms 163488 KB Output is correct
98 Correct 368 ms 181592 KB Output is correct
99 Correct 285 ms 181324 KB Output is correct
100 Correct 300 ms 181356 KB Output is correct
101 Correct 307 ms 181508 KB Output is correct
102 Correct 300 ms 181484 KB Output is correct
103 Correct 422 ms 202336 KB Output is correct
104 Correct 401 ms 203624 KB Output is correct
105 Correct 406 ms 200716 KB Output is correct
106 Correct 284 ms 185144 KB Output is correct
107 Correct 278 ms 186156 KB Output is correct
108 Correct 289 ms 184764 KB Output is correct
109 Correct 282 ms 186200 KB Output is correct
110 Correct 82 ms 123936 KB Output is correct
111 Correct 51 ms 123480 KB Output is correct
112 Correct 397 ms 197140 KB Output is correct
113 Correct 188 ms 171860 KB Output is correct
114 Correct 342 ms 188200 KB Output is correct
115 Correct 83 ms 152652 KB Output is correct
116 Correct 269 ms 178428 KB Output is correct
117 Correct 1101 ms 237420 KB Output is correct
118 Correct 106 ms 151888 KB Output is correct
119 Correct 108 ms 151884 KB Output is correct
120 Correct 43 ms 137304 KB Output is correct
121 Correct 329 ms 180028 KB Output is correct
122 Correct 309 ms 179956 KB Output is correct
123 Correct 211 ms 176208 KB Output is correct
124 Correct 217 ms 176232 KB Output is correct
125 Correct 209 ms 178060 KB Output is correct
126 Correct 745 ms 239192 KB Output is correct
127 Correct 337 ms 199792 KB Output is correct
128 Correct 256 ms 198240 KB Output is correct
129 Correct 281 ms 198240 KB Output is correct
130 Correct 295 ms 198484 KB Output is correct