oj.uz

Submission #133522

# Submission time Handle Problem Language Result Execution time Memory
133522 2019-07-21T03:16:33 Z 12tqian Duathlon (APIO18_duathlon) C++14
90 / 100
 1000 ms 94180 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>

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;


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 get_sz[MAX];
int bad[MAX];
unordered_map<int, int> vis;
unordered_map<int, int> sub;
unordered_map<int, int> parent;
unordered_map<int, vi> tree1;
vi cutpoints[MAX];
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 dfs(int src, int par){
//    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: tree1[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 get_sz[below] - sub[above];
    }
}
int main(){
    auto start = chrono::high_resolution_clock::now();
    //io("test");
    fast_io();
    int m;
    //cin >> n >> m;
    scanf("%d %d", &n, &m);
    f0r(i, m){
        int u, v;
        scanf("%d %d", &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);
    }
    f0r(i, n){
        get_sz[i] = d.sz[d.get(i)];
    }
    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));
        for(auto x: comp[i]){
            bcomp[x].eb(i);
        }
    }
   /* 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]){
            tree1[i].eb(c+MAX);
            tree1[c+MAX].eb(i);
        }
    }
    f0r(i,sz){
        for(int x: bcomp[i]){
            if(sz(comp[x]) >1){
                bad[i]++;
                cutpoints[i].eb(x);
            }
        }
    }
    //dfs(MAX, -1);
    /*auto end1 = chrono::high_resolution_clock::now();

    // Calculating total time taken by the program.
    double time_taken1 =
      chrono::duration_cast<chrono::nanoseconds>(end1 - start).count();

    time_taken1 *= 1e-9;

    cout << "Time taken by program is : " << fixed
         << time_taken1 << setprecision(9);
    cout << " sec" << endl;*/
    f0r(i, sz){
        if(vis.find(i + MAX) == vis.end()){
            dfs(i+MAX, -1);
        }
    }

    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 = get_sz[i] - 1;
        if(sz(comp[i]) == 1){
            ///not a cut point
            cur *=(cur-1);
            int c = comp[i][0];
            for(int pnt: cutpoints[c]){
        //    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: tree1[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;
    /*auto end = chrono::high_resolution_clock::now();

    // Calculating total time taken by the program.
    double time_taken =
      chrono::duration_cast<chrono::nanoseconds>(end - start).count();

    time_taken *= 1e-9;

    cout << "Time taken by program is : " << fixed
         << time_taken << setprecision(9);
    cout << " sec" << 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 function 'void io(std::__cxx11::string)':
count_triplets.cpp:47:17: warning: unused variable 'FOUT' [-Wunused-variable]
     const char* FOUT = fout.c_str();
                 ^~~~
count_triplets.cpp: In member function 'void BCC<SZ>::BCCutil(int, bool)':
count_triplets.cpp:125:27: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
         trav(i,adj[u]) if (i != par[u])
                           ^
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:165:10: warning: variable 'start' set but not used [-Wunused-but-set-variable]
     auto start = chrono::high_resolution_clock::now();
          ^~~~~
count_triplets.cpp: In function 'void io(std::__cxx11::string)':
count_triplets.cpp:48: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: In function 'int main()':
count_triplets.cpp:170:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
count_triplets.cpp:173:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 34944 KB Output is correct
2 Correct 187 ms 36364 KB Output is correct
3 Correct 561 ms 61244 KB Output is correct
4 Correct 330 ms 46504 KB Output is correct
5 Correct 375 ms 50676 KB Output is correct
6 Correct 575 ms 70104 KB Output is correct
7 Correct 621 ms 65728 KB Output is correct
8 Correct 620 ms 68216 KB Output is correct
9 Correct 588 ms 63968 KB Output is correct
10 Correct 483 ms 55592 KB Output is correct
11 Correct 372 ms 46892 KB Output is correct
12 Correct 350 ms 46748 KB Output is correct
13 Correct 316 ms 44724 KB Output is correct
14 Correct 296 ms 44344 KB Output is correct
15 Correct 233 ms 38136 KB Output is correct
16 Correct 237 ms 38080 KB Output is correct
17 Correct 32 ms 20104 KB Output is correct
18 Correct 32 ms 20100 KB Output is correct
19 Correct 32 ms 20100 KB Output is correct
20 Correct 33 ms 20104 KB Output is correct
21 Correct 32 ms 19976 KB Output is correct
22 Correct 32 ms 20104 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 13560 KB Output is correct
2 Correct 17 ms 13560 KB Output is correct
3 Correct 17 ms 13432 KB Output is correct
4 Correct 18 ms 13788 KB Output is correct
5 Correct 18 ms 13688 KB Output is correct
6 Correct 17 ms 13560 KB Output is correct
7 Correct 18 ms 13660 KB Output is correct
8 Correct 18 ms 13560 KB Output is correct
9 Correct 18 ms 13560 KB Output is correct
10 Correct 16 ms 13532 KB Output is correct
11 Correct 17 ms 13560 KB Output is correct
12 Correct 17 ms 13560 KB Output is correct
13 Correct 17 ms 13500 KB Output is correct
14 Correct 17 ms 13432 KB Output is correct
15 Correct 16 ms 13432 KB Output is correct
16 Correct 15 ms 13176 KB Output is correct
17 Correct 16 ms 13432 KB Output is correct
18 Correct 16 ms 13304 KB Output is correct
19 Correct 16 ms 13304 KB Output is correct
20 Correct 16 ms 13304 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 69892 KB Output is correct
2 Correct 618 ms 69992 KB Output is correct
3 Correct 644 ms 69924 KB Output is correct
4 Correct 596 ms 69892 KB Output is correct
5 Correct 609 ms 70052 KB Output is correct
6 Correct 747 ms 94180 KB Output is correct
7 Correct 691 ms 79936 KB Output is correct
8 Correct 643 ms 77416 KB Output is correct
9 Correct 690 ms 75564 KB Output is correct
10 Correct 630 ms 70052 KB Output is correct
11 Correct 626 ms 69880 KB Output is correct
12 Correct 608 ms 70048 KB Output is correct
13 Correct 604 ms 70048 KB Output is correct
14 Correct 571 ms 66288 KB Output is correct
15 Correct 522 ms 62788 KB Output is correct
16 Correct 274 ms 43912 KB Output is correct
17 Correct 419 ms 58972 KB Output is correct
18 Correct 447 ms 59024 KB Output is correct
19 Correct 379 ms 59024 KB Output is correct
20 Correct 370 ms 59164 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 13560 KB Output is correct
2 Correct 18 ms 13560 KB Output is correct
3 Correct 17 ms 13404 KB Output is correct
4 Correct 17 ms 13304 KB Output is correct
5 Correct 17 ms 13204 KB Output is correct
6 Correct 16 ms 13176 KB Output is correct
7 Correct 16 ms 13048 KB Output is correct
8 Correct 16 ms 13048 KB Output is correct
9 Correct 15 ms 13048 KB Output is correct
10 Correct 15 ms 13048 KB Output is correct
11 Correct 15 ms 13048 KB Output is correct
12 Correct 18 ms 13688 KB Output is correct
13 Correct 17 ms 13432 KB Output is correct
14 Correct 17 ms 13432 KB Output is correct
15 Correct 17 ms 13432 KB Output is correct
16 Correct 17 ms 13304 KB Output is correct
17 Correct 17 ms 13304 KB Output is correct
18 Correct 16 ms 13304 KB Output is correct
19 Correct 16 ms 13304 KB Output is correct
20 Correct 16 ms 13176 KB Output is correct
21 Correct 17 ms 13432 KB Output is correct
22 Correct 17 ms 13432 KB Output is correct
23 Correct 17 ms 13332 KB Output is correct
24 Correct 16 ms 13304 KB Output is correct
25 Correct 14 ms 13048 KB Output is correct
26 Correct 14 ms 13048 KB Output is correct
27 Correct 15 ms 13048 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 609 ms 70180 KB Output is correct
2 Correct 639 ms 71588 KB Output is correct
3 Correct 620 ms 65572 KB Output is correct
4 Correct 521 ms 53416 KB Output is correct
5 Correct 408 ms 43836 KB Output is correct
6 Correct 352 ms 37420 KB Output is correct
7 Correct 336 ms 35168 KB Output is correct
8 Correct 298 ms 31668 KB Output is correct
9 Correct 261 ms 30388 KB Output is correct
10 Correct 343 ms 29676 KB Output is correct
11 Correct 250 ms 27500 KB Output is correct
12 Correct 219 ms 25976 KB Output is correct
13 Correct 329 ms 25864 KB Output is correct
14 Correct 227 ms 27920 KB Output is correct
15 Correct 873 ms 75816 KB Output is correct
16 Correct 789 ms 72496 KB Output is correct
17 Correct 622 ms 69732 KB Output is correct
18 Correct 597 ms 67440 KB Output is correct
19 Correct 494 ms 54964 KB Output is correct
20 Correct 491 ms 54928 KB Output is correct
21 Correct 516 ms 54956 KB Output is correct
22 Correct 475 ms 49832 KB Output is correct
23 Correct 395 ms 43944 KB Output is correct
24 Correct 777 ms 65704 KB Output is correct
25 Correct 574 ms 65704 KB Output is correct
26 Correct 471 ms 55840 KB Output is correct
27 Correct 505 ms 55840 KB Output is correct

Subtask #8
8.0 / 8.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12920 KB Output is correct
2 Correct 14 ms 12920 KB Output is correct
3 Correct 14 ms 12920 KB Output is correct
4 Correct 14 ms 12920 KB Output is correct
5 Correct 14 ms 12920 KB Output is correct
6 Correct 14 ms 12920 KB Output is correct
7 Correct 14 ms 12920 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 14 ms 12920 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12920 KB Output is correct
12 Correct 14 ms 12920 KB Output is correct
13 Correct 14 ms 12920 KB Output is correct
14 Correct 14 ms 12920 KB Output is correct
15 Correct 14 ms 12920 KB Output is correct
16 Correct 14 ms 12920 KB Output is correct
17 Correct 14 ms 12920 KB Output is correct
18 Correct 14 ms 12920 KB Output is correct
19 Correct 14 ms 12920 KB Output is correct
20 Correct 14 ms 12920 KB Output is correct
21 Correct 14 ms 12920 KB Output is correct
22 Correct 14 ms 12924 KB Output is correct
23 Correct 14 ms 12920 KB Output is correct
24 Correct 14 ms 12920 KB Output is correct
25 Correct 14 ms 12920 KB Output is correct
26 Correct 14 ms 12920 KB Output is correct
27 Correct 14 ms 12920 KB Output is correct
28 Correct 14 ms 12920 KB Output is correct
29 Correct 14 ms 12920 KB Output is correct
30 Correct 14 ms 12920 KB Output is correct
31 Correct 14 ms 12920 KB Output is correct
32 Correct 14 ms 12920 KB Output is correct
33 Correct 14 ms 12920 KB Output is correct
34 Correct 14 ms 12920 KB Output is correct
35 Correct 14 ms 12920 KB Output is correct
36 Correct 14 ms 12920 KB Output is correct
37 Correct 14 ms 12920 KB Output is correct
38 Correct 14 ms 12920 KB Output is correct
39 Correct 14 ms 12920 KB Output is correct
40 Correct 14 ms 12920 KB Output is correct
41 Correct 14 ms 12920 KB Output is correct
42 Correct 14 ms 12920 KB Output is correct
43 Correct 14 ms 12920 KB Output is correct
44 Correct 14 ms 12924 KB Output is correct
45 Correct 14 ms 12892 KB Output is correct
46 Correct 14 ms 12920 KB Output is correct
47 Correct 14 ms 12920 KB Output is correct
48 Correct 14 ms 12940 KB Output is correct
49 Correct 14 ms 12924 KB Output is correct
50 Correct 14 ms 12920 KB Output is correct
51 Correct 15 ms 12920 KB Output is correct
52 Correct 15 ms 13048 KB Output is correct
53 Correct 14 ms 12920 KB Output is correct
54 Correct 14 ms 12920 KB Output is correct
55 Correct 14 ms 12924 KB Output is correct
56 Correct 18 ms 12920 KB Output is correct
57 Correct 14 ms 12920 KB Output is correct
58 Correct 14 ms 12920 KB Output is correct
59 Correct 14 ms 12920 KB Output is correct
60 Correct 14 ms 12920 KB Output is correct
61 Correct 14 ms 12920 KB Output is correct
62 Correct 14 ms 12920 KB Output is correct
63 Correct 14 ms 12920 KB Output is correct
64 Correct 14 ms 12920 KB Output is correct
65 Correct 14 ms 12920 KB Output is correct
66 Correct 199 ms 34944 KB Output is correct
67 Correct 187 ms 36364 KB Output is correct
68 Correct 561 ms 61244 KB Output is correct
69 Correct 330 ms 46504 KB Output is correct
70 Correct 375 ms 50676 KB Output is correct
71 Correct 575 ms 70104 KB Output is correct
72 Correct 621 ms 65728 KB Output is correct
73 Correct 620 ms 68216 KB Output is correct
74 Correct 588 ms 63968 KB Output is correct
75 Correct 483 ms 55592 KB Output is correct
76 Correct 372 ms 46892 KB Output is correct
77 Correct 350 ms 46748 KB Output is correct
78 Correct 316 ms 44724 KB Output is correct
79 Correct 296 ms 44344 KB Output is correct
80 Correct 233 ms 38136 KB Output is correct
81 Correct 237 ms 38080 KB Output is correct
82 Correct 32 ms 20104 KB Output is correct
83 Correct 32 ms 20100 KB Output is correct
84 Correct 32 ms 20100 KB Output is correct
85 Correct 33 ms 20104 KB Output is correct
86 Correct 32 ms 19976 KB Output is correct
87 Correct 32 ms 20104 KB Output is correct
88 Correct 18 ms 13560 KB Output is correct
89 Correct 17 ms 13560 KB Output is correct
90 Correct 17 ms 13432 KB Output is correct
91 Correct 18 ms 13788 KB Output is correct
92 Correct 18 ms 13688 KB Output is correct
93 Correct 17 ms 13560 KB Output is correct
94 Correct 18 ms 13660 KB Output is correct
95 Correct 18 ms 13560 KB Output is correct
96 Correct 18 ms 13560 KB Output is correct
97 Correct 16 ms 13532 KB Output is correct
98 Correct 17 ms 13560 KB Output is correct
99 Correct 17 ms 13560 KB Output is correct
100 Correct 17 ms 13500 KB Output is correct
101 Correct 17 ms 13432 KB Output is correct
102 Correct 16 ms 13432 KB Output is correct
103 Correct 15 ms 13176 KB Output is correct
104 Correct 16 ms 13432 KB Output is correct
105 Correct 16 ms 13304 KB Output is correct
106 Correct 16 ms 13304 KB Output is correct
107 Correct 16 ms 13304 KB Output is correct
108 Correct 591 ms 69892 KB Output is correct
109 Correct 618 ms 69992 KB Output is correct
110 Correct 644 ms 69924 KB Output is correct
111 Correct 596 ms 69892 KB Output is correct
112 Correct 609 ms 70052 KB Output is correct
113 Correct 747 ms 94180 KB Output is correct
114 Correct 691 ms 79936 KB Output is correct
115 Correct 643 ms 77416 KB Output is correct
116 Correct 690 ms 75564 KB Output is correct
117 Correct 630 ms 70052 KB Output is correct
118 Correct 626 ms 69880 KB Output is correct
119 Correct 608 ms 70048 KB Output is correct
120 Correct 604 ms 70048 KB Output is correct
121 Correct 571 ms 66288 KB Output is correct
122 Correct 522 ms 62788 KB Output is correct
123 Correct 274 ms 43912 KB Output is correct
124 Correct 419 ms 58972 KB Output is correct
125 Correct 447 ms 59024 KB Output is correct
126 Correct 379 ms 59024 KB Output is correct
127 Correct 370 ms 59164 KB Output is correct
128 Correct 15 ms 13560 KB Output is correct
129 Correct 18 ms 13560 KB Output is correct
130 Correct 17 ms 13404 KB Output is correct
131 Correct 17 ms 13304 KB Output is correct
132 Correct 17 ms 13204 KB Output is correct
133 Correct 16 ms 13176 KB Output is correct
134 Correct 16 ms 13048 KB Output is correct
135 Correct 16 ms 13048 KB Output is correct
136 Correct 15 ms 13048 KB Output is correct
137 Correct 15 ms 13048 KB Output is correct
138 Correct 15 ms 13048 KB Output is correct
139 Correct 18 ms 13688 KB Output is correct
140 Correct 17 ms 13432 KB Output is correct
141 Correct 17 ms 13432 KB Output is correct
142 Correct 17 ms 13432 KB Output is correct
143 Correct 17 ms 13304 KB Output is correct
144 Correct 17 ms 13304 KB Output is correct
145 Correct 16 ms 13304 KB Output is correct
146 Correct 16 ms 13304 KB Output is correct
147 Correct 16 ms 13176 KB Output is correct
148 Correct 17 ms 13432 KB Output is correct
149 Correct 17 ms 13432 KB Output is correct
150 Correct 17 ms 13332 KB Output is correct
151 Correct 16 ms 13304 KB Output is correct
152 Correct 14 ms 13048 KB Output is correct
153 Correct 14 ms 13048 KB Output is correct
154 Correct 15 ms 13048 KB Output is correct
155 Correct 609 ms 70180 KB Output is correct
156 Correct 639 ms 71588 KB Output is correct
157 Correct 620 ms 65572 KB Output is correct
158 Correct 521 ms 53416 KB Output is correct
159 Correct 408 ms 43836 KB Output is correct
160 Correct 352 ms 37420 KB Output is correct
161 Correct 336 ms 35168 KB Output is correct
162 Correct 298 ms 31668 KB Output is correct
163 Correct 261 ms 30388 KB Output is correct
164 Correct 343 ms 29676 KB Output is correct
165 Correct 250 ms 27500 KB Output is correct
166 Correct 219 ms 25976 KB Output is correct
167 Correct 329 ms 25864 KB Output is correct
168 Correct 227 ms 27920 KB Output is correct
169 Correct 873 ms 75816 KB Output is correct
170 Correct 789 ms 72496 KB Output is correct
171 Correct 622 ms 69732 KB Output is correct
172 Correct 597 ms 67440 KB Output is correct
173 Correct 494 ms 54964 KB Output is correct
174 Correct 491 ms 54928 KB Output is correct
175 Correct 516 ms 54956 KB Output is correct
176 Correct 475 ms 49832 KB Output is correct
177 Correct 395 ms 43944 KB Output is correct
178 Correct 777 ms 65704 KB Output is correct
179 Correct 574 ms 65704 KB Output is correct
180 Correct 471 ms 55840 KB Output is correct
181 Correct 505 ms 55840 KB Output is correct
182 Correct 15 ms 12920 KB Output is correct
183 Correct 16 ms 13176 KB Output is correct
184 Correct 18 ms 13304 KB Output is correct
185 Correct 19 ms 13176 KB Output is correct
186 Correct 18 ms 13176 KB Output is correct
187 Correct 16 ms 13304 KB Output is correct
188 Correct 16 ms 13176 KB Output is correct
189 Correct 16 ms 13176 KB Output is correct
190 Correct 16 ms 13176 KB Output is correct
191 Correct 16 ms 13176 KB Output is correct
192 Correct 14 ms 12920 KB Output is correct
193 Correct 17 ms 13304 KB Output is correct
194 Correct 16 ms 13176 KB Output is correct
195 Correct 16 ms 13132 KB Output is correct
196 Correct 15 ms 13048 KB Output is correct
197 Correct 16 ms 13052 KB Output is correct
198 Correct 15 ms 13048 KB Output is correct
199 Correct 15 ms 13048 KB Output is correct
200 Correct 17 ms 13304 KB Output is correct
201 Correct 16 ms 13176 KB Output is correct
202 Correct 16 ms 13180 KB Output is correct
203 Correct 16 ms 13176 KB Output is correct
204 Correct 17 ms 13176 KB Output is correct
205 Correct 16 ms 13176 KB Output is correct
206 Correct 15 ms 13148 KB Output is correct
207 Correct 15 ms 13176 KB Output is correct
208 Correct 16 ms 13176 KB Output is correct
209 Correct 32 ms 19948 KB Output is correct
210 Correct 448 ms 46952 KB Output is correct
211 Execution timed out 1082 ms 46884 KB Time limit exceeded
212 Halted 0 ms 0 KB -