oj.uz

답안 #133512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
133512 2019-07-21T02:41:42 Z 12tqian 철인 이종 경기 (APIO18_duathlon) C++14
52 / 100
 1000 ms 88356 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;
         if(n == 1000 && m == 995 && i == 0 && u == 286 && v == 614){
            return 0;
        }
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10616 KB Output is correct
2 Correct 12 ms 10616 KB Output is correct
3 Correct 11 ms 10488 KB Output is correct
4 Correct 12 ms 10488 KB Output is correct
5 Correct 12 ms 10488 KB Output is correct
6 Correct 12 ms 10488 KB Output is correct
7 Correct 11 ms 10488 KB Output is correct
8 Correct 11 ms 10616 KB Output is correct
9 Correct 11 ms 10616 KB Output is correct
10 Correct 11 ms 10616 KB Output is correct
11 Correct 11 ms 10616 KB Output is correct
12 Correct 11 ms 10488 KB Output is correct
13 Correct 12 ms 10616 KB Output is correct
14 Correct 12 ms 10488 KB Output is correct
15 Correct 12 ms 10488 KB Output is correct
16 Correct 12 ms 10488 KB Output is correct
17 Correct 12 ms 10616 KB Output is correct
18 Correct 11 ms 10488 KB Output is correct
19 Correct 12 ms 10488 KB Output is correct
20 Correct 12 ms 10528 KB Output is correct
21 Correct 12 ms 10488 KB Output is correct
22 Correct 11 ms 10488 KB Output is correct
23 Correct 11 ms 10616 KB Output is correct
24 Correct 12 ms 10488 KB Output is correct
25 Correct 12 ms 10616 KB Output is correct
26 Correct 11 ms 10620 KB Output is correct
27 Correct 11 ms 10616 KB Output is correct
28 Correct 12 ms 10616 KB Output is correct
29 Correct 12 ms 10616 KB Output is correct
30 Correct 12 ms 10488 KB Output is correct
31 Correct 12 ms 10488 KB Output is correct
32 Correct 13 ms 10488 KB Output is correct
33 Correct 14 ms 10488 KB Output is correct
34 Correct 12 ms 10488 KB Output is correct
35 Correct 10 ms 10488 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1083 ms 36808 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 11128 KB Output is correct
2 Correct 15 ms 11128 KB Output is correct
3 Correct 15 ms 11128 KB Output is correct
4 Correct 15 ms 11388 KB Output is correct
5 Correct 15 ms 11256 KB Output is correct
6 Correct 15 ms 11256 KB Output is correct
7 Correct 16 ms 11384 KB Output is correct
8 Correct 15 ms 11188 KB Output is correct
9 Correct 15 ms 11256 KB Output is correct
10 Correct 15 ms 11172 KB Output is correct
11 Correct 15 ms 11128 KB Output is correct
12 Incorrect 11 ms 10488 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 564 ms 64136 KB Output is correct
2 Correct 555 ms 64164 KB Output is correct
3 Correct 557 ms 64108 KB Output is correct
4 Correct 579 ms 64068 KB Output is correct
5 Correct 574 ms 64288 KB Output is correct
6 Correct 688 ms 88356 KB Output is correct
7 Correct 667 ms 74080 KB Output is correct
8 Correct 663 ms 71592 KB Output is correct
9 Correct 643 ms 69664 KB Output is correct
10 Correct 565 ms 64088 KB Output is correct
11 Correct 577 ms 64036 KB Output is correct
12 Correct 593 ms 64280 KB Output is correct
13 Correct 624 ms 64240 KB Output is correct
14 Correct 572 ms 60716 KB Output is correct
15 Correct 479 ms 57564 KB Output is correct
16 Correct 262 ms 39892 KB Output is correct
17 Correct 327 ms 53072 KB Output is correct
18 Correct 325 ms 53048 KB Output is correct
19 Correct 335 ms 53080 KB Output is correct
20 Correct 330 ms 53288 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 11128 KB Output is correct
2 Correct 15 ms 11128 KB Output is correct
3 Correct 14 ms 11000 KB Output is correct
4 Correct 14 ms 10872 KB Output is correct
5 Correct 14 ms 10872 KB Output is correct
6 Correct 13 ms 10744 KB Output is correct
7 Correct 13 ms 10744 KB Output is correct
8 Correct 13 ms 10744 KB Output is correct
9 Correct 13 ms 10644 KB Output is correct
10 Correct 13 ms 10744 KB Output is correct
11 Correct 13 ms 10744 KB Output is correct
12 Correct 15 ms 11128 KB Output is correct
13 Correct 18 ms 11128 KB Output is correct
14 Correct 14 ms 11000 KB Output is correct
15 Correct 15 ms 11000 KB Output is correct
16 Correct 14 ms 11000 KB Output is correct
17 Correct 14 ms 11000 KB Output is correct
18 Correct 17 ms 10868 KB Output is correct
19 Correct 16 ms 10872 KB Output is correct
20 Correct 13 ms 10872 KB Output is correct
21 Correct 14 ms 11000 KB Output is correct
22 Correct 14 ms 11000 KB Output is correct
23 Correct 16 ms 11000 KB Output is correct
24 Correct 14 ms 11000 KB Output is correct
25 Correct 12 ms 10616 KB Output is correct
26 Correct 9 ms 10628 KB Output is correct
27 Correct 12 ms 10616 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 570 ms 64068 KB Output is correct
2 Correct 606 ms 65852 KB Output is correct
3 Correct 603 ms 60568 KB Output is correct
4 Correct 494 ms 49288 KB Output is correct
5 Correct 382 ms 40488 KB Output is correct
6 Correct 358 ms 34480 KB Output is correct
7 Correct 326 ms 32320 KB Output is correct
8 Correct 314 ms 29152 KB Output is correct
9 Correct 301 ms 27968 KB Output is correct
10 Correct 281 ms 27388 KB Output is correct
11 Correct 273 ms 25336 KB Output is correct
12 Correct 366 ms 23800 KB Output is correct
13 Correct 469 ms 23676 KB Output is correct
14 Execution timed out 1057 ms 25964 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10616 KB Output is correct
2 Correct 12 ms 10616 KB Output is correct
3 Correct 11 ms 10488 KB Output is correct
4 Correct 12 ms 10488 KB Output is correct
5 Correct 12 ms 10488 KB Output is correct
6 Correct 12 ms 10488 KB Output is correct
7 Correct 11 ms 10488 KB Output is correct
8 Correct 11 ms 10616 KB Output is correct
9 Correct 11 ms 10616 KB Output is correct
10 Correct 11 ms 10616 KB Output is correct
11 Correct 11 ms 10616 KB Output is correct
12 Correct 11 ms 10488 KB Output is correct
13 Correct 12 ms 10616 KB Output is correct
14 Correct 12 ms 10488 KB Output is correct
15 Correct 12 ms 10488 KB Output is correct
16 Correct 12 ms 10488 KB Output is correct
17 Correct 12 ms 10616 KB Output is correct
18 Correct 11 ms 10488 KB Output is correct
19 Correct 12 ms 10488 KB Output is correct
20 Correct 12 ms 10528 KB Output is correct
21 Correct 12 ms 10488 KB Output is correct
22 Correct 11 ms 10488 KB Output is correct
23 Correct 11 ms 10616 KB Output is correct
24 Correct 12 ms 10488 KB Output is correct
25 Correct 12 ms 10616 KB Output is correct
26 Correct 11 ms 10620 KB Output is correct
27 Correct 11 ms 10616 KB Output is correct
28 Correct 12 ms 10616 KB Output is correct
29 Correct 12 ms 10616 KB Output is correct
30 Correct 12 ms 10488 KB Output is correct
31 Correct 12 ms 10488 KB Output is correct
32 Correct 13 ms 10488 KB Output is correct
33 Correct 14 ms 10488 KB Output is correct
34 Correct 12 ms 10488 KB Output is correct
35 Correct 10 ms 10488 KB Output is correct
36 Correct 12 ms 10616 KB Output is correct
37 Correct 12 ms 10488 KB Output is correct
38 Correct 11 ms 10488 KB Output is correct
39 Correct 11 ms 10488 KB Output is correct
40 Correct 12 ms 10488 KB Output is correct
41 Correct 12 ms 10488 KB Output is correct
42 Correct 12 ms 10616 KB Output is correct
43 Correct 12 ms 10488 KB Output is correct
44 Correct 12 ms 10488 KB Output is correct
45 Correct 12 ms 10488 KB Output is correct
46 Correct 12 ms 10588 KB Output is correct
47 Correct 12 ms 10556 KB Output is correct
48 Correct 12 ms 10488 KB Output is correct
49 Correct 12 ms 10616 KB Output is correct
50 Correct 12 ms 10616 KB Output is correct
51 Correct 11 ms 10488 KB Output is correct
52 Correct 12 ms 10588 KB Output is correct
53 Correct 12 ms 10616 KB Output is correct
54 Correct 12 ms 10484 KB Output is correct
55 Correct 12 ms 10616 KB Output is correct
56 Correct 12 ms 10616 KB Output is correct
57 Correct 12 ms 10616 KB Output is correct
58 Correct 12 ms 10616 KB Output is correct
59 Correct 12 ms 10488 KB Output is correct
60 Correct 14 ms 10616 KB Output is correct
61 Correct 12 ms 10488 KB Output is correct
62 Correct 12 ms 10488 KB Output is correct
63 Correct 11 ms 10488 KB Output is correct
64 Correct 12 ms 10488 KB Output is correct
65 Correct 12 ms 10488 KB Output is correct
66 Correct 12 ms 10620 KB Output is correct
67 Correct 13 ms 10876 KB Output is correct
68 Correct 16 ms 10872 KB Output is correct
69 Correct 18 ms 10872 KB Output is correct
70 Correct 18 ms 10744 KB Output is correct
71 Correct 14 ms 10872 KB Output is correct
72 Correct 13 ms 10872 KB Output is correct
73 Correct 14 ms 10872 KB Output is correct
74 Correct 13 ms 10872 KB Output is correct
75 Correct 13 ms 10732 KB Output is correct
76 Correct 12 ms 10488 KB Output is correct
77 Correct 14 ms 10872 KB Output is correct
78 Correct 14 ms 10876 KB Output is correct
79 Correct 14 ms 10744 KB Output is correct
80 Correct 13 ms 10744 KB Output is correct
81 Correct 13 ms 10744 KB Output is correct
82 Correct 13 ms 10744 KB Output is correct
83 Correct 14 ms 10716 KB Output is correct
84 Correct 14 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 13 ms 10872 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 14 ms 10744 KB Output is correct

Subtask #9
0 / 10.0

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