oj.uz

Submission #229721

# Submission time Handle Problem Language Result Execution time Memory
229721 2020-05-06T03:54:16 Z lyc Duathlon (APIO18_duathlon) C++14
82 / 100
 162 ms 41724 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)

#define int long long

const int MX_N = 1e5+5;
int N, M;
vector<int> al[MX_N];

namespace BCT {
    int pre[MX_N], low[MX_N], cnt, root, rootChildren;

    vector<int> stk;
    int comp[MX_N], sz[2*MX_N]; // ~N blocks + ~N ap
    int nap, nv;

    vector<int> tree[2*MX_N];

    void dfs(int u, int p) {
        pre[u] = low[u] = ++cnt;
        for (int v : al[u]) if (v != p) {
            if (pre[v] == -1) {
                dfs(v,u);
                if (u == root) ++rootChildren;
                else if (comp[u] == -1 && low[v] >= pre[u]) comp[u] = ++nv, sz[nv] = 1;
                low[u] = min(low[u],low[v]);
            } else {
                low[u] = min(low[u],pre[v]);
            }
        }
    }

    void addEdge(int u, int v) {
        tree[u].push_back(v);
        tree[v].push_back(u);
    }

    void decomp(int u, int p) {
        pre[u] = ++cnt;
        stk.push_back(u);
        for (int v : al[u]) if (v != p) {
            if (pre[v] == -1) {
                int st = stk.back();
                decomp(v,u);

                if (comp[u] != -1 && low[v] >= pre[u]) {
                    sz[++nv] = 1;
                    addEdge(comp[u],nv);
                    while (stk.back() != st) {
                        int& w = stk.back(); stk.pop_back();
                        ++sz[nv];
                        if (comp[w] == -1) comp[w] = nv;
                        else addEdge(comp[w],nv);
                    }
                }
            }
        }
    }

    void run() {
        fill_n(comp,N+1,-1); nv = 0;

        fill_n(pre,N+1,-1); cnt = 0;
        FOR(u,1,N) if (pre[u] == -1) {
            root = u, rootChildren = 0;
            dfs(u,0);
            if (rootChildren > 1) comp[u] = ++nv, sz[nv] = 1;
        }
        nap = nv;

        fill_n(pre,N+1,-1); cnt = 0;
        FOR(u,1,N) if (pre[u] == -1) {
            stk.clear();
            decomp(u,0);
            if (comp[u] == -1) {
                sz[++nv] = 0;
                while (!stk.empty()) {
                    int& w = stk.back(); stk.pop_back();
                    ++sz[nv];
                    if (comp[w] == -1) comp[w] = nv;
                    else addEdge(comp[w],nv);
                }
            }
        }
    }

    void dbg() {
        FOR(i,1,N){ TRACE(i _ pre[i] _ low[i] _ comp[i]); }
        TRACE(nv);
        cout << "APs: "; FOR(i,1,N){ if (comp[i] <= nap) cout << i << ' '; } cout << endl;
        FOR(i,1,nv){ cout << i << " (" << sz[i] << "): "; for(int v : tree[i]) { cout << v << ' '; } cout << endl; }
    }

    long long ans;
    int sub[2*MX_N];

    void precomp(int u, int p) {
        sub[u] = sz[u];
        for (int v : tree[u]) if (v != p) {
            precomp(v,u);
            sub[u] += sub[v];
            --sub[u];
        }
        //TRACE(u _ sz[u] _ u _ sub[u]);
    }

    void trav(int u, int p, int all) {
        //TRACE("trav" _ u _ p _ all);
        if (u <= nap) {
            int other = all - 1;
            for (int v : tree[u]) {
                int cur;
                if (v == p) {
                    cur = all-sub[u];
                } else {
                    cur = sub[v]-1;
                    trav(v,u,all);
                }
                //long long two = 1LL * cur * (other-cur);
                //long long one = 1LL * (sz[v]-1) * (sz[v]-2);
                //long long snk = 2LL * (cur+1-sz[v]) * (sz[v]-2);
                //TRACE(u _ v _ "add" _ cur _ (other-cur) _ "res" _ two _ one _ snk);
                ans += 1LL * cur * (other-cur);     // ep in diff
                ans += 1LL * (sz[v]-1) * (sz[v]-2); // ep in same
                ans += 2LL * (cur+1-sz[v]) * (sz[v]-2); // ep in same subtree
            }
        } else {
            int inside = (sz[u] - SZ(tree[u]));
            int other = all - inside;
            for (int v : tree[u]) {
                other -= sz[v];
            }
            for (int v : tree[u]) {
                int cur;
                if (v == p) {
                    cur = all-sub[u]-(sz[p]-1);
                } else {
                    cur = sub[v]-sz[v];
                    trav(v,u,all);
                }
                //long long two = inside * cur * (other-cur);
                //long long one = 2LL * inside * cur * (sz[u]-2);
                //long long snk = 1LL * (SZ(tree[u])-2) * cur * (other-cur);
                //TRACE(u _ v _ "add" _ cur _ (other-cur) _ "res" _ two _ one _ snk);
                ans += 1LL * inside * cur * (other-cur);// both ep outside
                ans += 2LL * inside * cur * (sz[u]-2);  // one ep outside
                ans += 1LL * (SZ(tree[u])-2) * cur * (other-cur); // both ep outside, mid is ap
            }
            //long long zero = 1LL * inside * (sz[u]-1) * (sz[u]-2);
            //TRACE(u _ zero);
            if (sz[u] >= 3) ans += 1LL * inside * (sz[u]-1) * (sz[u]-2);
        }
    }

    long long solve() {
        ans = 0;
        fill_n(sub,N+1,-1);
        FOR(i,1,nv) if (sub[i] == -1) {
            precomp(i,0);
            trav(i,0,sub[i]);
        }
        return ans;
    }
};

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M;
    FOR(i,1,M){
        int U, V; cin >> U >> V;
        al[U].push_back(V);
        al[V].push_back(U);
    }

    BCT::run();
    //BCT::dbg();
    cout << BCT::solve() << '\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 25548 KB Output is correct
2 Correct 117 ms 25580 KB Output is correct
3 Correct 128 ms 27504 KB Output is correct
4 Correct 108 ms 24812 KB Output is correct
5 Correct 103 ms 23024 KB Output is correct
6 Incorrect 120 ms 29044 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7552 KB Output is correct
2 Correct 9 ms 7552 KB Output is correct
3 Correct 9 ms 7552 KB Output is correct
4 Correct 10 ms 7808 KB Output is correct
5 Correct 9 ms 7680 KB Output is correct
6 Correct 9 ms 7680 KB Output is correct
7 Correct 10 ms 7808 KB Output is correct
8 Correct 10 ms 7680 KB Output is correct
9 Correct 9 ms 7552 KB Output is correct
10 Correct 10 ms 7552 KB Output is correct
11 Correct 10 ms 7552 KB Output is correct
12 Correct 9 ms 7552 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct
14 Correct 9 ms 7552 KB Output is correct
15 Correct 9 ms 7552 KB Output is correct
16 Correct 9 ms 7552 KB Output is correct
17 Correct 10 ms 7728 KB Output is correct
18 Correct 9 ms 7552 KB Output is correct
19 Correct 9 ms 7552 KB Output is correct
20 Correct 9 ms 7552 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 21296 KB Output is correct
2 Correct 114 ms 21368 KB Output is correct
3 Correct 113 ms 21624 KB Output is correct
4 Correct 113 ms 21368 KB Output is correct
5 Correct 116 ms 21368 KB Output is correct
6 Correct 141 ms 41724 KB Output is correct
7 Correct 137 ms 29228 KB Output is correct
8 Correct 139 ms 27352 KB Output is correct
9 Correct 122 ms 25332 KB Output is correct
10 Correct 112 ms 21368 KB Output is correct
11 Correct 116 ms 21368 KB Output is correct
12 Correct 117 ms 21328 KB Output is correct
13 Correct 109 ms 21368 KB Output is correct
14 Correct 100 ms 20344 KB Output is correct
15 Correct 83 ms 19192 KB Output is correct
16 Correct 55 ms 15736 KB Output is correct
17 Correct 63 ms 19436 KB Output is correct
18 Correct 64 ms 19432 KB Output is correct
19 Correct 64 ms 19808 KB Output is correct
20 Correct 63 ms 19432 KB Output is correct

Subtask #6
15.0 / 15.0

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

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 21240 KB Output is correct
2 Correct 124 ms 21624 KB Output is correct
3 Correct 148 ms 20672 KB Output is correct
4 Correct 149 ms 18912 KB Output is correct
5 Correct 112 ms 16892 KB Output is correct
6 Correct 114 ms 16120 KB Output is correct
7 Correct 93 ms 15660 KB Output is correct
8 Correct 95 ms 15100 KB Output is correct
9 Correct 88 ms 14840 KB Output is correct
10 Correct 93 ms 14712 KB Output is correct
11 Correct 81 ms 14328 KB Output is correct
12 Correct 81 ms 14320 KB Output is correct
13 Correct 88 ms 14456 KB Output is correct
14 Correct 87 ms 17264 KB Output is correct
15 Correct 149 ms 28656 KB Output is correct
16 Correct 149 ms 25896 KB Output is correct
17 Correct 162 ms 26480 KB Output is correct
18 Correct 133 ms 24180 KB Output is correct
19 Correct 123 ms 18936 KB Output is correct
20 Correct 142 ms 18916 KB Output is correct
21 Correct 121 ms 18936 KB Output is correct
22 Correct 115 ms 17656 KB Output is correct
23 Correct 83 ms 16120 KB Output is correct
24 Correct 98 ms 19696 KB Output is correct
25 Correct 105 ms 19828 KB Output is correct
26 Correct 105 ms 18800 KB Output is correct
27 Correct 113 ms 18808 KB Output is correct

Subtask #8
8.0 / 8.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 9 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 8 ms 7424 KB Output is correct
7 Correct 9 ms 7424 KB Output is correct
8 Correct 8 ms 7424 KB Output is correct
9 Correct 8 ms 7424 KB Output is correct
10 Correct 9 ms 7424 KB Output is correct
11 Correct 9 ms 7424 KB Output is correct
12 Correct 9 ms 7424 KB Output is correct
13 Correct 9 ms 7424 KB Output is correct
14 Correct 8 ms 7424 KB Output is correct
15 Correct 9 ms 7424 KB Output is correct
16 Correct 8 ms 7424 KB Output is correct
17 Correct 9 ms 7424 KB Output is correct
18 Correct 9 ms 7424 KB Output is correct
19 Correct 8 ms 7424 KB Output is correct
20 Correct 9 ms 7424 KB Output is correct
21 Correct 8 ms 7424 KB Output is correct
22 Correct 9 ms 7552 KB Output is correct
23 Correct 8 ms 7424 KB Output is correct
24 Correct 9 ms 7424 KB Output is correct
25 Correct 9 ms 7424 KB Output is correct
26 Correct 9 ms 7424 KB Output is correct
27 Correct 8 ms 7424 KB Output is correct
28 Correct 9 ms 7424 KB Output is correct
29 Correct 9 ms 7424 KB Output is correct
30 Correct 8 ms 7424 KB Output is correct
31 Correct 9 ms 7424 KB Output is correct
32 Correct 10 ms 7424 KB Output is correct
33 Correct 8 ms 7424 KB Output is correct
34 Correct 9 ms 7424 KB Output is correct
35 Correct 9 ms 7424 KB Output is correct
36 Correct 10 ms 7424 KB Output is correct
37 Correct 8 ms 7424 KB Output is correct
38 Correct 9 ms 7424 KB Output is correct
39 Correct 9 ms 7424 KB Output is correct
40 Correct 9 ms 7424 KB Output is correct
41 Correct 9 ms 7552 KB Output is correct
42 Correct 9 ms 7424 KB Output is correct
43 Correct 9 ms 7424 KB Output is correct
44 Correct 9 ms 7424 KB Output is correct
45 Correct 8 ms 7424 KB Output is correct
46 Correct 9 ms 7424 KB Output is correct
47 Correct 9 ms 7424 KB Output is correct
48 Correct 9 ms 7424 KB Output is correct
49 Correct 9 ms 7424 KB Output is correct
50 Correct 9 ms 7424 KB Output is correct
51 Correct 8 ms 7424 KB Output is correct
52 Correct 8 ms 7424 KB Output is correct
53 Correct 9 ms 7424 KB Output is correct
54 Correct 9 ms 7424 KB Output is correct
55 Correct 8 ms 7424 KB Output is correct
56 Correct 8 ms 7424 KB Output is correct
57 Correct 9 ms 7424 KB Output is correct
58 Correct 8 ms 7424 KB Output is correct
59 Correct 9 ms 7424 KB Output is correct
60 Correct 9 ms 7424 KB Output is correct
61 Correct 9 ms 7424 KB Output is correct
62 Correct 9 ms 7424 KB Output is correct
63 Correct 9 ms 7424 KB Output is correct
64 Correct 8 ms 7424 KB Output is correct
65 Correct 9 ms 7424 KB Output is correct
66 Correct 102 ms 25548 KB Output is correct
67 Correct 117 ms 25580 KB Output is correct
68 Correct 128 ms 27504 KB Output is correct
69 Correct 108 ms 24812 KB Output is correct
70 Correct 103 ms 23024 KB Output is correct
71 Incorrect 120 ms 29044 KB Output isn't correct
72 Halted 0 ms 0 KB -