oj.uz

Submission #133511

# Submission time Handle Problem Language Result Execution time Memory
133511 2019-07-21T02:32:38 Z 12tqian Duathlon (APIO18_duathlon) C++14
62 / 100
 1000 ms 88292 KB 
#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>


using namespace std;


const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAX = 1e5 + 5;
vi adj[MAX];
vi comp[MAX];
vi bcomp[MAX];
ll precomp[MAX];
int bad[MAX];
unordered_map<int, int> vis;
unordered_map<int, int> sub;
unordered_map<int, int> parent;
unordered_map<int, vi> tree;
template<int SZ> struct DSU{
    int par[SZ], sz[SZ];
    DSU(){
        for(int i = 0; i<SZ; i++){
            par[i] = i;
            sz[i] = 1;
        }
    }
    int get(int x){
        if(par[x] != x){
            par[x] = get(par[x]);
        }
        return par[x];
    }
    bool unite(int x, int y){
        x = get(x);
        y = get(y);
        if(x == y){
            return false;
        }
        if(sz[x] < sz[y]){
            swap(x, y);
        }
        sz[x] += sz[y];
        par[y] = x;
        return true;
    }
};
DSU<MAX> d;
int times = 0;
int dfs(int src, int par){
    times++;
    assert(times<=1e6);
    vis[src] = 1;
    parent[src] = par;
    sub[src] = sz(bcomp[src]);
    if(src>=MAX){
        sub[src] = sz(bcomp[src - MAX]) - bad[src-MAX];
    }
    else{
        sub[src] = 1;
    }
    for(int nxt: tree[src]){
        if(nxt != par){
            sub[src] += dfs(nxt, src);
        }
    }
    return sub[src];
}
template<int SZ> struct BCC {
    int N;
    vi adj[SZ];
    vector<vpi> fin;

    void addEdge(int u, int v) { adj[u].pb(v), adj[v].pb(u); }

    int ti = 0, disc[SZ], low[SZ], comp[SZ], par[SZ];
    vpi st;

    void BCCutil(int u, bool root = 0) {
        disc[u] = low[u] = ti++;
        int child = 0;

        trav(i,adj[u]) if (i != par[u])
            if (disc[i] == -1) {
                child ++; par[i] = u;
                st.pb({u,i});
                BCCutil(i);
                low[u] = min(low[u],low[i]);

                // disc[u] < low[i]: bridge
                if ((root && child > 1) || (!root && disc[u] <= low[i])) { // articulation point!
                    vpi tmp;
                    while (st.back() != mp(u,i)) tmp.pb(st.back()), st.pop_back();
                    tmp.pb(st.back()), st.pop_back();
                    fin.pb(tmp);
                }
            } else if (disc[i] < disc[u]) {
                low[u] = min(low[u],disc[i]);
                st.pb({u,i});
            }
    }
    void bcc(int _N) {
        N = _N;
        f1r(i,1,N+1) par[i] = disc[i] = low[i] = -1;
        f1r(i,1,N+1) if (disc[i] == -1) {
            BCCutil(i,1);
            if (sz(st)) fin.pb(st);
            st.clear();
        }
    }
};
BCC<MAX> bcc;
int n;
int get(int above, int below){
    if(parent[below] == above){
        return sub[below];
    }
    else{
        return d.sz[d.get(below)] - sub[above];
    }
}
int main(){
    fast_io();
    int m;
    cin >> n >> m;
    f0r(i, m){
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        d.unite(u, v);
        adj[u].eb(v);
        adj[v].eb(u);
        bcc.addEdge(u+1, v+1);
    }
    bcc.bcc(n);
    int sz = sz(bcc.fin);
    f0r(i, sz){
        for(auto e: bcc.fin[i]){
            comp[e.f-1].eb(i);
            comp[e.s-1].eb(i);
            bcomp[i].eb(e.f-1);
            bcomp[i].eb(e.s-1);
        }
    }
    f0r(i, n){
        set<int> s (all(comp[i]));
        comp[i].assign(all(s));
    }
    f0r(i, sz){
        set<int> s (all(bcomp[i]));
        bcomp[i].assign(all(s));
    }
    f0r(i, n){
        if(sz(comp[i]) == 1)continue;
        for(int c: comp[i]){
            tree[i].eb(c+MAX);
            tree[c+MAX].eb(i);
        }
    }
    f0r(i,sz){
        for(int x: bcomp[i]){
            if(sz(comp[x]) >1){
                bad[i]++;
            }
        }
    }
    //dfs(MAX, -1);
    f0r(i, sz){
        times = 0;
        if(vis.find(i + MAX) == vis.end()){
            dfs(i+MAX, -1);
        }
    }
   /* f0r(i, sz){
        cout << i << " bcomp: ";
        for(int x: bcomp[i]) cout << x << " " ;
        cout << endl;
    }*/
    f0r(i, sz){
        for(int x: bcomp[i]){
            if(sz(comp[x]) > 1){
                ll val = get(i+MAX, x);
                precomp[i] += (val)*(val-1);
            }
        }
    }
    ll ans = 0;
    f0r(i, n){
        ll cur = d.sz[d.get(i)] - 1;
        if(sz(comp[i]) == 1){
            ///not a cut point
            cur *=(cur-1);
            int c = comp[i][0];
            for(auto pnt: bcomp[c]){
                if(sz(comp[pnt]) > 1){///cut point
                    ll val = get(c+MAX, pnt);
                    cur -= val*(val-1);
                }
            }
            ans += cur;
        }
        else{
            cur *= (cur-1);
            for(int nxt: tree[i]){
                ll val = precomp[nxt-MAX];
                ll subtract = get(nxt, i);
                val -= subtract*(subtract - 1);
                cur -= val;
            }
            ans += cur;
        }
        //cout << i << " " << cur << endl;
    }
    cout << ans << endl;
   // cout << parent[1]- MAX << endl;
    //cout << sub[3+MAX] << endl;
   // cout << sub[5]<< endl;
    return 0;
}

Compilation message

count_triplets.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
count_triplets.cpp: In member function 'void BCC<SZ>::BCCutil(int, bool)':
count_triplets.cpp:122:27: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
         trav(i,adj[u]) if (i != par[u])
                           ^
count_triplets.cpp: In function 'void io(std::__cxx11::string)':
count_triplets.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
count_triplets.cpp:46:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 36856 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11132 KB Output is correct
2 Correct 15 ms 11124 KB Output is correct
3 Correct 14 ms 11128 KB Output is correct
4 Correct 15 ms 11384 KB Output is correct
5 Correct 15 ms 11256 KB Output is correct
6 Correct 15 ms 11260 KB Output is correct
7 Correct 19 ms 11384 KB Output is correct
8 Correct 15 ms 11256 KB Output is correct
9 Correct 15 ms 11260 KB Output is correct
10 Correct 14 ms 11128 KB Output is correct
11 Correct 15 ms 11128 KB Output is correct
12 Correct 14 ms 11128 KB Output is correct
13 Correct 15 ms 11128 KB Output is correct
14 Correct 14 ms 11004 KB Output is correct
15 Correct 14 ms 11000 KB Output is correct
16 Correct 13 ms 10876 KB Output is correct
17 Correct 14 ms 11000 KB Output is correct
18 Correct 14 ms 11000 KB Output is correct
19 Correct 14 ms 11000 KB Output is correct
20 Correct 14 ms 11000 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 620 ms 64216 KB Output is correct
2 Correct 592 ms 64032 KB Output is correct
3 Correct 571 ms 64008 KB Output is correct
4 Correct 596 ms 64100 KB Output is correct
5 Correct 565 ms 64004 KB Output is correct
6 Correct 680 ms 88292 KB Output is correct
7 Correct 660 ms 73956 KB Output is correct
8 Correct 665 ms 71656 KB Output is correct
9 Correct 630 ms 69792 KB Output is correct
10 Correct 591 ms 64148 KB Output is correct
11 Correct 590 ms 64096 KB Output is correct
12 Correct 617 ms 64036 KB Output is correct
13 Correct 576 ms 64164 KB Output is correct
14 Correct 541 ms 60708 KB Output is correct
15 Correct 485 ms 57676 KB Output is correct
16 Correct 269 ms 39960 KB Output is correct
17 Correct 335 ms 53152 KB Output is correct
18 Correct 334 ms 53136 KB Output is correct
19 Correct 345 ms 53052 KB Output is correct
20 Correct 337 ms 53160 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11128 KB Output is correct
2 Correct 15 ms 11128 KB Output is correct
3 Correct 15 ms 11000 KB Output is correct
4 Correct 13 ms 11000 KB Output is correct
5 Correct 15 ms 10872 KB Output is correct
6 Correct 13 ms 10744 KB Output is correct
7 Correct 14 ms 10744 KB Output is correct
8 Correct 11 ms 10744 KB Output is correct
9 Correct 13 ms 10744 KB Output is correct
10 Correct 13 ms 10744 KB Output is correct
11 Correct 13 ms 10744 KB Output is correct
12 Correct 16 ms 11256 KB Output is correct
13 Correct 15 ms 11128 KB Output is correct
14 Correct 15 ms 11068 KB Output is correct
15 Correct 14 ms 11000 KB Output is correct
16 Correct 14 ms 10872 KB Output is correct
17 Correct 17 ms 10872 KB Output is correct
18 Correct 15 ms 10972 KB Output is correct
19 Correct 16 ms 10872 KB Output is correct
20 Correct 14 ms 10876 KB Output is correct
21 Correct 17 ms 11000 KB Output is correct
22 Correct 14 ms 11000 KB Output is correct
23 Correct 14 ms 11004 KB Output is correct
24 Correct 15 ms 11000 KB Output is correct
25 Correct 12 ms 10744 KB Output is correct
26 Correct 12 ms 10616 KB Output is correct
27 Correct 12 ms 10616 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 64076 KB Output is correct
2 Correct 759 ms 65920 KB Output is correct
3 Correct 779 ms 60716 KB Output is correct
4 Correct 602 ms 49128 KB Output is correct
5 Correct 409 ms 40460 KB Output is correct
6 Correct 364 ms 34392 KB Output is correct
7 Correct 334 ms 32404 KB Output is correct
8 Correct 295 ms 28980 KB Output is correct
9 Correct 295 ms 28084 KB Output is correct
10 Correct 285 ms 27256 KB Output is correct
11 Correct 323 ms 25464 KB Output is correct
12 Correct 360 ms 23800 KB Output is correct
13 Correct 470 ms 23672 KB Output is correct
14 Execution timed out 1088 ms 25836 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #8
8.0 / 8.0

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

Subtask #9
0 / 10.0

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