oj.uz

Submission #380941

# Submission time Handle Problem Language Result Execution time Memory
380941 2021-03-23T18:40:14 Z usachevd0 Duathlon (APIO18_duathlon) C++14
57 / 100
 1000 ms 58344 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1 &x, T2 y) { return y < x ? (x = y, true) : false; }
template<typename T1, typename T2> bool chkmax(T1 &x, T2 y) { return y > x ? (x = y, true) : false; }
void debug_out() { cerr << endl; }
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) { cerr << ' ' << A; debug_out(B...); }
template<typename T> void mdebug_out(T* a, int n) { for (int i = 0; i < n; ++i) cerr << a[i] << ' '; cerr << endl; }
#ifdef DEBUG
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
    #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
    #define debug(...) 1337
    #define mdebug(a, n) 1337
#endif
template<typename T> ostream& operator << (ostream& stream, const vector<T> &v) { for (auto x : v) stream << x << ' '; return stream; }
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) { return stream << p.first << ' ' << p.second; }

const int N = 100005;
int n, m;
vector<int> G[N];
int tin[N], fup[N], timer;
int used[3 * N];
bool cut[N];

vector<int> block[2 * N];
int blocks;

vector<int> stk;
void dfs1(int v, int p = -1)
{
    used[v] = 1;
    tin[v] = fup[v] = timer++;
    stk.push_back(v);

    int cnt_down = 0;
    for (int& u : G[v])
    {
        if (u == p) continue;
        if (!used[u])
        {   
            dfs1(u, v);
            chkmin(fup[v], fup[u]);
            if (fup[u] >= tin[v])
            {
                // v is a cut
                ++cnt_down;
                cut[v] = true;
                auto &b = block[blocks++];
                for (; tin[stk.back()] >= tin[u]; stk.pop_back())
                    b.push_back(stk.back());
                b.push_back(v);
            }
        }
        else
        {
            chkmin(fup[v], tin[u]);
        }
    }
    if (p == -1 && cnt_down <= 1)
        cut[v] = false;
}

vector<int> T[3 * N]; // block-cut tree
ll C[3 * N], nC[3 * N];
ll cnt[3 * N];
ll sum[3 * N];
ll sum2[3 * N];
ll ans;

void add_edge(int u, int v)
{
//    debug(u, v);
    T[u].pb(v);
    T[v].pb(u);
}

ll curSum;
void dfs2(int v, int p = -1)
{
    used[v] = 1;
    sum[v] = nC[v];
    for (int& u : T[v]) if (u != p)
    {
        dfs2(u, v);
        sum[v] += sum[u];
    }
}

void dfs3(int v, int p = -1)
{
    for (int& u : T[v]) if (u != p)
    {
        dfs3(u, v);
    }
    if (v <= n) // v is a cut
    {
        vector<pii> a = {{C[p] - 1, curSum - sum[v]}};
        for (int& u : T[v]) if (u != p)
            a.emplace_back(C[u] - 1, sum[u]);
        for (int i = 0; i < a.size(); ++i)
        {
            ll x = a[i].fi;
            ll rem = 1;
            for (int j = 0; j < a.size(); ++j) if (j != i)
            {
                rem += a[j].se;
            }
            ans -= x * rem * (rem - 1);
        }
    }
}

signed main()
{
#ifdef DEBUG
    freopen("in", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;
    for (int i = 0; i < m; ++i)
    {
        int a, b;
        cin >> a >> b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    for (int v = 1; v <= n; ++v) if (!used[v])
    {
        // new component
        dfs1(v);
    }
    for (int bi = 0; bi < blocks; ++bi)
    {
        auto& b = block[bi];
//        debug(bi, b);
        for (auto& v : b)
        {
            if (cut[v])
            {
                add_edge(v, bi + n + 1);
            }
            else
            {
                nC[bi + n + 1]++;
            }
        }
        C[bi + n + 1] = b.size();
    }
    for (int v = 1; v <= n; ++v)
        if (cut[v])
            nC[v] = C[v] = 1;
//    mdebug(C + 1, n + blocks);
    ans = 0;
    memset(used, 0, sizeof used);
    for (int bi = 0; bi < blocks; ++bi)
    {
        int v = bi + n + 1;
        if (!used[v])
        {
            dfs2(v);
            curSum = sum[v];
//            debug(curSum);
            ans += curSum * (curSum - 1) * (curSum - 2);
            dfs3(v);
        }
    }
    cout << ans << '\n';
    
    return 0;
}
/*
6 9

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


7 10
3 5
2 3
1 5
6 4
5 7
6 5
1 3
4 1
3 6
1 6


10 20
5 6
10 5
7 3
7 4
2 4
10 3
1 10
7 1
8 10
4 6
6 10
10 4
1 3
4 5
4 1
7 2
3 4
9 7
5 1
2 3
*/

Compilation message

count_triplets.cpp: In function 'void dfs3(int, int)':
count_triplets.cpp:114:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |         for (int i = 0; i < a.size(); ++i)
      |                         ~~^~~~~~~~~~
count_triplets.cpp:118:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |             for (int j = 0; j < a.size(); ++j) if (j != i)
      |                             ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15596 KB Output is correct
2 Correct 10 ms 15596 KB Output is correct
3 Correct 10 ms 15596 KB Output is correct
4 Correct 10 ms 15596 KB Output is correct
5 Correct 11 ms 15596 KB Output is correct
6 Correct 12 ms 15596 KB Output is correct
7 Correct 10 ms 15596 KB Output is correct
8 Correct 11 ms 15596 KB Output is correct
9 Correct 10 ms 15596 KB Output is correct
10 Correct 10 ms 15596 KB Output is correct
11 Correct 10 ms 15596 KB Output is correct
12 Correct 10 ms 15596 KB Output is correct
13 Correct 10 ms 15596 KB Output is correct
14 Correct 10 ms 15596 KB Output is correct
15 Correct 11 ms 15596 KB Output is correct
16 Correct 11 ms 15596 KB Output is correct
17 Correct 10 ms 15596 KB Output is correct
18 Correct 10 ms 15616 KB Output is correct
19 Correct 10 ms 15596 KB Output is correct
20 Correct 10 ms 15596 KB Output is correct
21 Correct 10 ms 15596 KB Output is correct
22 Correct 11 ms 15596 KB Output is correct
23 Correct 10 ms 15596 KB Output is correct
24 Correct 11 ms 15596 KB Output is correct
25 Correct 10 ms 15596 KB Output is correct
26 Correct 10 ms 15596 KB Output is correct
27 Correct 10 ms 15596 KB Output is correct
28 Correct 10 ms 15596 KB Output is correct
29 Correct 10 ms 15616 KB Output is correct
30 Correct 10 ms 15596 KB Output is correct
31 Correct 11 ms 15596 KB Output is correct
32 Correct 10 ms 15596 KB Output is correct
33 Correct 10 ms 15596 KB Output is correct
34 Correct 11 ms 15724 KB Output is correct
35 Correct 10 ms 15596 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15596 KB Output is correct
2 Correct 10 ms 15596 KB Output is correct
3 Correct 10 ms 15596 KB Output is correct
4 Correct 10 ms 15596 KB Output is correct
5 Correct 11 ms 15596 KB Output is correct
6 Correct 12 ms 15596 KB Output is correct
7 Correct 10 ms 15596 KB Output is correct
8 Correct 11 ms 15596 KB Output is correct
9 Correct 10 ms 15596 KB Output is correct
10 Correct 10 ms 15596 KB Output is correct
11 Correct 10 ms 15596 KB Output is correct
12 Correct 10 ms 15596 KB Output is correct
13 Correct 10 ms 15596 KB Output is correct
14 Correct 10 ms 15596 KB Output is correct
15 Correct 11 ms 15596 KB Output is correct
16 Correct 11 ms 15596 KB Output is correct
17 Correct 10 ms 15596 KB Output is correct
18 Correct 10 ms 15616 KB Output is correct
19 Correct 10 ms 15596 KB Output is correct
20 Correct 10 ms 15596 KB Output is correct
21 Correct 10 ms 15596 KB Output is correct
22 Correct 11 ms 15596 KB Output is correct
23 Correct 10 ms 15596 KB Output is correct
24 Correct 11 ms 15596 KB Output is correct
25 Correct 10 ms 15596 KB Output is correct
26 Correct 10 ms 15596 KB Output is correct
27 Correct 10 ms 15596 KB Output is correct
28 Correct 10 ms 15596 KB Output is correct
29 Correct 10 ms 15616 KB Output is correct
30 Correct 10 ms 15596 KB Output is correct
31 Correct 11 ms 15596 KB Output is correct
32 Correct 10 ms 15596 KB Output is correct
33 Correct 10 ms 15596 KB Output is correct
34 Correct 11 ms 15724 KB Output is correct
35 Correct 10 ms 15596 KB Output is correct
36 Correct 10 ms 15596 KB Output is correct
37 Correct 10 ms 15596 KB Output is correct
38 Correct 10 ms 15596 KB Output is correct
39 Correct 10 ms 15596 KB Output is correct
40 Correct 10 ms 15596 KB Output is correct
41 Correct 10 ms 15596 KB Output is correct
42 Correct 10 ms 15596 KB Output is correct
43 Correct 10 ms 15724 KB Output is correct
44 Correct 10 ms 15596 KB Output is correct
45 Correct 10 ms 15596 KB Output is correct
46 Correct 10 ms 15596 KB Output is correct
47 Correct 10 ms 15744 KB Output is correct
48 Correct 10 ms 15596 KB Output is correct
49 Correct 10 ms 15596 KB Output is correct
50 Correct 10 ms 15596 KB Output is correct
51 Correct 10 ms 15596 KB Output is correct
52 Correct 10 ms 15616 KB Output is correct
53 Correct 10 ms 15744 KB Output is correct
54 Correct 10 ms 15596 KB Output is correct
55 Correct 10 ms 15740 KB Output is correct
56 Correct 10 ms 15596 KB Output is correct
57 Correct 10 ms 15596 KB Output is correct
58 Correct 10 ms 15596 KB Output is correct
59 Correct 11 ms 15596 KB Output is correct
60 Correct 10 ms 15596 KB Output is correct
61 Correct 10 ms 15596 KB Output is correct
62 Correct 10 ms 15596 KB Output is correct
63 Correct 10 ms 15596 KB Output is correct
64 Correct 10 ms 15596 KB Output is correct
65 Correct 10 ms 15596 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 31624 KB Output is correct
2 Correct 83 ms 31720 KB Output is correct
3 Correct 122 ms 40556 KB Output is correct
4 Correct 109 ms 33700 KB Output is correct
5 Correct 108 ms 34472 KB Output is correct
6 Correct 130 ms 42348 KB Output is correct
7 Correct 130 ms 34028 KB Output is correct
8 Correct 140 ms 37996 KB Output is correct
9 Correct 123 ms 31596 KB Output is correct
10 Correct 119 ms 32208 KB Output is correct
11 Correct 81 ms 26860 KB Output is correct
12 Correct 82 ms 26732 KB Output is correct
13 Correct 82 ms 26216 KB Output is correct
14 Correct 84 ms 26088 KB Output is correct
15 Correct 55 ms 24808 KB Output is correct
16 Correct 59 ms 24680 KB Output is correct
17 Correct 13 ms 17004 KB Output is correct
18 Correct 12 ms 17008 KB Output is correct
19 Correct 12 ms 17136 KB Output is correct
20 Correct 13 ms 17008 KB Output is correct
21 Correct 12 ms 17000 KB Output is correct
22 Correct 12 ms 17000 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15852 KB Output is correct
2 Correct 11 ms 15852 KB Output is correct
3 Correct 11 ms 15852 KB Output is correct
4 Correct 11 ms 16108 KB Output is correct
5 Correct 11 ms 15980 KB Output is correct
6 Correct 11 ms 15980 KB Output is correct
7 Correct 11 ms 16108 KB Output is correct
8 Correct 12 ms 15872 KB Output is correct
9 Correct 11 ms 15852 KB Output is correct
10 Correct 11 ms 15852 KB Output is correct
11 Correct 11 ms 15852 KB Output is correct
12 Correct 11 ms 15852 KB Output is correct
13 Correct 11 ms 15852 KB Output is correct
14 Correct 11 ms 15852 KB Output is correct
15 Correct 11 ms 15852 KB Output is correct
16 Correct 10 ms 15724 KB Output is correct
17 Correct 11 ms 15852 KB Output is correct
18 Correct 11 ms 15852 KB Output is correct
19 Correct 12 ms 15852 KB Output is correct
20 Correct 11 ms 15852 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 32492 KB Output is correct
2 Correct 119 ms 32492 KB Output is correct
3 Correct 133 ms 32604 KB Output is correct
4 Correct 124 ms 32748 KB Output is correct
5 Correct 121 ms 32492 KB Output is correct
6 Correct 162 ms 58344 KB Output is correct
7 Correct 149 ms 42344 KB Output is correct
8 Correct 140 ms 39788 KB Output is correct
9 Correct 148 ms 37612 KB Output is correct
10 Correct 129 ms 32492 KB Output is correct
11 Correct 130 ms 32492 KB Output is correct
12 Correct 121 ms 32492 KB Output is correct
13 Correct 129 ms 32492 KB Output is correct
14 Correct 117 ms 31468 KB Output is correct
15 Correct 100 ms 30188 KB Output is correct
16 Correct 59 ms 26112 KB Output is correct
17 Execution timed out 1063 ms 30308 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
15.0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 32492 KB Output is correct
2 Correct 141 ms 32748 KB Output is correct
3 Correct 132 ms 31144 KB Output is correct
4 Correct 126 ms 30316 KB Output is correct
5 Correct 110 ms 27572 KB Output is correct
6 Correct 95 ms 26476 KB Output is correct
7 Correct 96 ms 25964 KB Output is correct
8 Correct 94 ms 25196 KB Output is correct
9 Correct 82 ms 24940 KB Output is correct
10 Correct 79 ms 24684 KB Output is correct
11 Correct 84 ms 24344 KB Output is correct
12 Correct 80 ms 24172 KB Output is correct
13 Correct 73 ms 24044 KB Output is correct
14 Correct 86 ms 24936 KB Output is correct
15 Correct 162 ms 42472 KB Output is correct
16 Correct 158 ms 39020 KB Output is correct
17 Correct 141 ms 39656 KB Output is correct
18 Correct 137 ms 36736 KB Output is correct
19 Correct 136 ms 30316 KB Output is correct
20 Correct 139 ms 30188 KB Output is correct
21 Correct 120 ms 30188 KB Output is correct
22 Correct 102 ms 28780 KB Output is correct
23 Correct 96 ms 27116 KB Output is correct
24 Execution timed out 1059 ms 32676 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15596 KB Output is correct
2 Correct 10 ms 15596 KB Output is correct
3 Correct 10 ms 15596 KB Output is correct
4 Correct 10 ms 15596 KB Output is correct
5 Correct 11 ms 15596 KB Output is correct
6 Correct 12 ms 15596 KB Output is correct
7 Correct 10 ms 15596 KB Output is correct
8 Correct 11 ms 15596 KB Output is correct
9 Correct 10 ms 15596 KB Output is correct
10 Correct 10 ms 15596 KB Output is correct
11 Correct 10 ms 15596 KB Output is correct
12 Correct 10 ms 15596 KB Output is correct
13 Correct 10 ms 15596 KB Output is correct
14 Correct 10 ms 15596 KB Output is correct
15 Correct 11 ms 15596 KB Output is correct
16 Correct 11 ms 15596 KB Output is correct
17 Correct 10 ms 15596 KB Output is correct
18 Correct 10 ms 15616 KB Output is correct
19 Correct 10 ms 15596 KB Output is correct
20 Correct 10 ms 15596 KB Output is correct
21 Correct 10 ms 15596 KB Output is correct
22 Correct 11 ms 15596 KB Output is correct
23 Correct 10 ms 15596 KB Output is correct
24 Correct 11 ms 15596 KB Output is correct
25 Correct 10 ms 15596 KB Output is correct
26 Correct 10 ms 15596 KB Output is correct
27 Correct 10 ms 15596 KB Output is correct
28 Correct 10 ms 15596 KB Output is correct
29 Correct 10 ms 15616 KB Output is correct
30 Correct 10 ms 15596 KB Output is correct
31 Correct 11 ms 15596 KB Output is correct
32 Correct 10 ms 15596 KB Output is correct
33 Correct 10 ms 15596 KB Output is correct
34 Correct 11 ms 15724 KB Output is correct
35 Correct 10 ms 15596 KB Output is correct
36 Correct 10 ms 15596 KB Output is correct
37 Correct 10 ms 15596 KB Output is correct
38 Correct 10 ms 15596 KB Output is correct
39 Correct 10 ms 15596 KB Output is correct
40 Correct 10 ms 15596 KB Output is correct
41 Correct 10 ms 15596 KB Output is correct
42 Correct 10 ms 15596 KB Output is correct
43 Correct 10 ms 15724 KB Output is correct
44 Correct 10 ms 15596 KB Output is correct
45 Correct 10 ms 15596 KB Output is correct
46 Correct 10 ms 15596 KB Output is correct
47 Correct 10 ms 15744 KB Output is correct
48 Correct 10 ms 15596 KB Output is correct
49 Correct 10 ms 15596 KB Output is correct
50 Correct 10 ms 15596 KB Output is correct
51 Correct 10 ms 15596 KB Output is correct
52 Correct 10 ms 15616 KB Output is correct
53 Correct 10 ms 15744 KB Output is correct
54 Correct 10 ms 15596 KB Output is correct
55 Correct 10 ms 15740 KB Output is correct
56 Correct 10 ms 15596 KB Output is correct
57 Correct 10 ms 15596 KB Output is correct
58 Correct 10 ms 15596 KB Output is correct
59 Correct 11 ms 15596 KB Output is correct
60 Correct 10 ms 15596 KB Output is correct
61 Correct 10 ms 15596 KB Output is correct
62 Correct 10 ms 15596 KB Output is correct
63 Correct 10 ms 15596 KB Output is correct
64 Correct 10 ms 15596 KB Output is correct
65 Correct 10 ms 15596 KB Output is correct
66 Correct 10 ms 15724 KB Output is correct
67 Correct 11 ms 15724 KB Output is correct
68 Correct 11 ms 15852 KB Output is correct
69 Correct 11 ms 15852 KB Output is correct
70 Correct 11 ms 15852 KB Output is correct
71 Correct 10 ms 15724 KB Output is correct
72 Correct 12 ms 15724 KB Output is correct
73 Correct 11 ms 15724 KB Output is correct
74 Correct 10 ms 15724 KB Output is correct
75 Correct 11 ms 15724 KB Output is correct
76 Correct 10 ms 15596 KB Output is correct
77 Correct 11 ms 15852 KB Output is correct
78 Correct 11 ms 15724 KB Output is correct
79 Correct 11 ms 15724 KB Output is correct
80 Correct 10 ms 15724 KB Output is correct
81 Correct 10 ms 15724 KB Output is correct
82 Correct 10 ms 15852 KB Output is correct
83 Correct 10 ms 15852 KB Output is correct
84 Correct 11 ms 15852 KB Output is correct
85 Correct 11 ms 15852 KB Output is correct
86 Correct 11 ms 15724 KB Output is correct
87 Correct 11 ms 15724 KB Output is correct
88 Correct 11 ms 15724 KB Output is correct
89 Correct 11 ms 15724 KB Output is correct
90 Correct 11 ms 15724 KB Output is correct
91 Correct 11 ms 15724 KB Output is correct
92 Correct 12 ms 15724 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15596 KB Output is correct
2 Correct 10 ms 15596 KB Output is correct
3 Correct 10 ms 15596 KB Output is correct
4 Correct 10 ms 15596 KB Output is correct
5 Correct 11 ms 15596 KB Output is correct
6 Correct 12 ms 15596 KB Output is correct
7 Correct 10 ms 15596 KB Output is correct
8 Correct 11 ms 15596 KB Output is correct
9 Correct 10 ms 15596 KB Output is correct
10 Correct 10 ms 15596 KB Output is correct
11 Correct 10 ms 15596 KB Output is correct
12 Correct 10 ms 15596 KB Output is correct
13 Correct 10 ms 15596 KB Output is correct
14 Correct 10 ms 15596 KB Output is correct
15 Correct 11 ms 15596 KB Output is correct
16 Correct 11 ms 15596 KB Output is correct
17 Correct 10 ms 15596 KB Output is correct
18 Correct 10 ms 15616 KB Output is correct
19 Correct 10 ms 15596 KB Output is correct
20 Correct 10 ms 15596 KB Output is correct
21 Correct 10 ms 15596 KB Output is correct
22 Correct 11 ms 15596 KB Output is correct
23 Correct 10 ms 15596 KB Output is correct
24 Correct 11 ms 15596 KB Output is correct
25 Correct 10 ms 15596 KB Output is correct
26 Correct 10 ms 15596 KB Output is correct
27 Correct 10 ms 15596 KB Output is correct
28 Correct 10 ms 15596 KB Output is correct
29 Correct 10 ms 15616 KB Output is correct
30 Correct 10 ms 15596 KB Output is correct
31 Correct 11 ms 15596 KB Output is correct
32 Correct 10 ms 15596 KB Output is correct
33 Correct 10 ms 15596 KB Output is correct
34 Correct 11 ms 15724 KB Output is correct
35 Correct 10 ms 15596 KB Output is correct
36 Correct 10 ms 15596 KB Output is correct
37 Correct 10 ms 15596 KB Output is correct
38 Correct 10 ms 15596 KB Output is correct
39 Correct 10 ms 15596 KB Output is correct
40 Correct 10 ms 15596 KB Output is correct
41 Correct 10 ms 15596 KB Output is correct
42 Correct 10 ms 15596 KB Output is correct
43 Correct 10 ms 15724 KB Output is correct
44 Correct 10 ms 15596 KB Output is correct
45 Correct 10 ms 15596 KB Output is correct
46 Correct 10 ms 15596 KB Output is correct
47 Correct 10 ms 15744 KB Output is correct
48 Correct 10 ms 15596 KB Output is correct
49 Correct 10 ms 15596 KB Output is correct
50 Correct 10 ms 15596 KB Output is correct
51 Correct 10 ms 15596 KB Output is correct
52 Correct 10 ms 15616 KB Output is correct
53 Correct 10 ms 15744 KB Output is correct
54 Correct 10 ms 15596 KB Output is correct
55 Correct 10 ms 15740 KB Output is correct
56 Correct 10 ms 15596 KB Output is correct
57 Correct 10 ms 15596 KB Output is correct
58 Correct 10 ms 15596 KB Output is correct
59 Correct 11 ms 15596 KB Output is correct
60 Correct 10 ms 15596 KB Output is correct
61 Correct 10 ms 15596 KB Output is correct
62 Correct 10 ms 15596 KB Output is correct
63 Correct 10 ms 15596 KB Output is correct
64 Correct 10 ms 15596 KB Output is correct
65 Correct 10 ms 15596 KB Output is correct
66 Correct 97 ms 31624 KB Output is correct
67 Correct 83 ms 31720 KB Output is correct
68 Correct 122 ms 40556 KB Output is correct
69 Correct 109 ms 33700 KB Output is correct
70 Correct 108 ms 34472 KB Output is correct
71 Correct 130 ms 42348 KB Output is correct
72 Correct 130 ms 34028 KB Output is correct
73 Correct 140 ms 37996 KB Output is correct
74 Correct 123 ms 31596 KB Output is correct
75 Correct 119 ms 32208 KB Output is correct
76 Correct 81 ms 26860 KB Output is correct
77 Correct 82 ms 26732 KB Output is correct
78 Correct 82 ms 26216 KB Output is correct
79 Correct 84 ms 26088 KB Output is correct
80 Correct 55 ms 24808 KB Output is correct
81 Correct 59 ms 24680 KB Output is correct
82 Correct 13 ms 17004 KB Output is correct
83 Correct 12 ms 17008 KB Output is correct
84 Correct 12 ms 17136 KB Output is correct
85 Correct 13 ms 17008 KB Output is correct
86 Correct 12 ms 17000 KB Output is correct
87 Correct 12 ms 17000 KB Output is correct
88 Correct 11 ms 15852 KB Output is correct
89 Correct 11 ms 15852 KB Output is correct
90 Correct 11 ms 15852 KB Output is correct
91 Correct 11 ms 16108 KB Output is correct
92 Correct 11 ms 15980 KB Output is correct
93 Correct 11 ms 15980 KB Output is correct
94 Correct 11 ms 16108 KB Output is correct
95 Correct 12 ms 15872 KB Output is correct
96 Correct 11 ms 15852 KB Output is correct
97 Correct 11 ms 15852 KB Output is correct
98 Correct 11 ms 15852 KB Output is correct
99 Correct 11 ms 15852 KB Output is correct
100 Correct 11 ms 15852 KB Output is correct
101 Correct 11 ms 15852 KB Output is correct
102 Correct 11 ms 15852 KB Output is correct
103 Correct 10 ms 15724 KB Output is correct
104 Correct 11 ms 15852 KB Output is correct
105 Correct 11 ms 15852 KB Output is correct
106 Correct 12 ms 15852 KB Output is correct
107 Correct 11 ms 15852 KB Output is correct
108 Correct 135 ms 32492 KB Output is correct
109 Correct 119 ms 32492 KB Output is correct
110 Correct 133 ms 32604 KB Output is correct
111 Correct 124 ms 32748 KB Output is correct
112 Correct 121 ms 32492 KB Output is correct
113 Correct 162 ms 58344 KB Output is correct
114 Correct 149 ms 42344 KB Output is correct
115 Correct 140 ms 39788 KB Output is correct
116 Correct 148 ms 37612 KB Output is correct
117 Correct 129 ms 32492 KB Output is correct
118 Correct 130 ms 32492 KB Output is correct
119 Correct 121 ms 32492 KB Output is correct
120 Correct 129 ms 32492 KB Output is correct
121 Correct 117 ms 31468 KB Output is correct
122 Correct 100 ms 30188 KB Output is correct
123 Correct 59 ms 26112 KB Output is correct
124 Execution timed out 1063 ms 30308 KB Time limit exceeded
125 Halted 0 ms 0 KB -