oj.uz

Submission #133524

# Submission time Handle Problem Language Result Execution time Memory
133524 2019-07-21T03:28:53 Z 12tqian Duathlon (APIO18_duathlon) C++14
90 / 100
 1000 ms 94308 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;
        }
    }
    inline int get(int x){
        if(par[x] != x){
            par[x] = get(par[x]);
        }
        return par[x];
    }
    inline 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;
inline 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;

    inline 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;

    inline 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;
inline 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));
        sort(all(comp[i]));
        comp[i].erase(unique(all(comp[i])), comp[i].end());
        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: cutpoints[i]){
            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 '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 15 ms 12920 KB Output is correct
7 Correct 14 ms 12836 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 17 ms 12920 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12824 KB Output is correct
12 Correct 14 ms 12924 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 12920 KB Output is correct
23 Correct 14 ms 12920 KB Output is correct
24 Correct 15 ms 13048 KB Output is correct
25 Correct 14 ms 12924 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 15 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 15 ms 12920 KB Output is correct
7 Correct 14 ms 12836 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 17 ms 12920 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12824 KB Output is correct
12 Correct 14 ms 12924 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 12920 KB Output is correct
23 Correct 14 ms 12920 KB Output is correct
24 Correct 15 ms 13048 KB Output is correct
25 Correct 14 ms 12924 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 15 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 12924 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 12916 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 12920 KB Output is correct
45 Correct 15 ms 12924 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 12920 KB Output is correct
49 Correct 14 ms 12920 KB Output is correct
50 Correct 14 ms 12924 KB Output is correct
51 Correct 14 ms 12920 KB Output is correct
52 Correct 14 ms 12924 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 14 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 12892 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 196 ms 34968 KB Output is correct
2 Correct 214 ms 34912 KB Output is correct
3 Correct 496 ms 59836 KB Output is correct
4 Correct 312 ms 45252 KB Output is correct
5 Correct 362 ms 49264 KB Output is correct
6 Correct 511 ms 68780 KB Output is correct
7 Correct 526 ms 64332 KB Output is correct
8 Correct 552 ms 66920 KB Output is correct
9 Correct 539 ms 62688 KB Output is correct
10 Correct 490 ms 54432 KB Output is correct
11 Correct 302 ms 45868 KB Output is correct
12 Correct 324 ms 45736 KB Output is correct
13 Correct 313 ms 43820 KB Output is correct
14 Correct 298 ms 43532 KB Output is correct
15 Correct 219 ms 37528 KB Output is correct
16 Correct 215 ms 37300 KB Output is correct
17 Correct 31 ms 20104 KB Output is correct
18 Correct 31 ms 20104 KB Output is correct
19 Correct 31 ms 20104 KB Output is correct
20 Correct 30 ms 19976 KB Output is correct
21 Correct 30 ms 19976 KB Output is correct
22 Correct 31 ms 20104 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 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 13688 KB Output is correct
5 Correct 17 ms 13688 KB Output is correct
6 Correct 17 ms 13532 KB Output is correct
7 Correct 17 ms 13736 KB Output is correct
8 Correct 20 ms 13560 KB Output is correct
9 Correct 18 ms 13560 KB Output is correct
10 Correct 17 ms 13560 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 13436 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 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 13304 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 646 ms 69996 KB Output is correct
2 Correct 589 ms 69924 KB Output is correct
3 Correct 587 ms 70132 KB Output is correct
4 Correct 664 ms 69932 KB Output is correct
5 Correct 613 ms 69920 KB Output is correct
6 Correct 729 ms 94308 KB Output is correct
7 Correct 669 ms 79760 KB Output is correct
8 Correct 624 ms 77472 KB Output is correct
9 Correct 637 ms 75552 KB Output is correct
10 Correct 549 ms 70080 KB Output is correct
11 Correct 566 ms 70152 KB Output is correct
12 Correct 534 ms 69840 KB Output is correct
13 Correct 543 ms 70048 KB Output is correct
14 Correct 508 ms 66072 KB Output is correct
15 Correct 485 ms 62632 KB Output is correct
16 Correct 251 ms 43900 KB Output is correct
17 Correct 335 ms 59176 KB Output is correct
18 Correct 351 ms 59028 KB Output is correct
19 Correct 334 ms 59024 KB Output is correct
20 Correct 315 ms 59048 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 13560 KB Output is correct
2 Correct 17 ms 13692 KB Output is correct
3 Correct 17 ms 13432 KB Output is correct
4 Correct 17 ms 13304 KB Output is correct
5 Correct 16 ms 13200 KB Output is correct
6 Correct 16 ms 13176 KB Output is correct
7 Correct 16 ms 13176 KB Output is correct
8 Correct 15 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 17 ms 13652 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 13248 KB Output is correct
17 Correct 17 ms 13236 KB Output is correct
18 Correct 16 ms 13304 KB Output is correct
19 Correct 16 ms 13176 KB Output is correct
20 Correct 15 ms 13176 KB Output is correct
21 Correct 17 ms 13304 KB Output is correct
22 Correct 16 ms 13304 KB Output is correct
23 Correct 16 ms 13304 KB Output is correct
24 Correct 16 ms 13304 KB Output is correct
25 Correct 15 ms 13048 KB Output is correct
26 Correct 14 ms 13036 KB Output is correct
27 Correct 14 ms 13048 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 552 ms 69932 KB Output is correct
2 Correct 602 ms 71700 KB Output is correct
3 Correct 615 ms 65676 KB Output is correct
4 Correct 465 ms 53456 KB Output is correct
5 Correct 387 ms 43688 KB Output is correct
6 Correct 325 ms 37424 KB Output is correct
7 Correct 315 ms 35080 KB Output is correct
8 Correct 276 ms 31536 KB Output is correct
9 Correct 249 ms 30412 KB Output is correct
10 Correct 237 ms 29580 KB Output is correct
11 Correct 217 ms 27612 KB Output is correct
12 Correct 208 ms 25976 KB Output is correct
13 Correct 213 ms 25904 KB Output is correct
14 Correct 197 ms 27752 KB Output is correct
15 Correct 640 ms 74212 KB Output is correct
16 Correct 700 ms 70964 KB Output is correct
17 Correct 640 ms 68180 KB Output is correct
18 Correct 605 ms 66028 KB Output is correct
19 Correct 506 ms 53576 KB Output is correct
20 Correct 506 ms 53420 KB Output is correct
21 Correct 500 ms 53380 KB Output is correct
22 Correct 434 ms 48432 KB Output is correct
23 Correct 367 ms 42680 KB Output is correct
24 Correct 530 ms 64120 KB Output is correct
25 Correct 531 ms 64420 KB Output is correct
26 Correct 452 ms 54432 KB Output is correct
27 Correct 598 ms 54396 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 15 ms 12920 KB Output is correct
7 Correct 14 ms 12836 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 17 ms 12920 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12824 KB Output is correct
12 Correct 14 ms 12924 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 12920 KB Output is correct
23 Correct 14 ms 12920 KB Output is correct
24 Correct 15 ms 13048 KB Output is correct
25 Correct 14 ms 12924 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 15 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 12924 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 12916 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 12920 KB Output is correct
45 Correct 15 ms 12924 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 12920 KB Output is correct
49 Correct 14 ms 12920 KB Output is correct
50 Correct 14 ms 12924 KB Output is correct
51 Correct 14 ms 12920 KB Output is correct
52 Correct 14 ms 12924 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 14 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 12892 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 14 ms 12920 KB Output is correct
67 Correct 15 ms 13176 KB Output is correct
68 Correct 17 ms 13176 KB Output is correct
69 Correct 18 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 13304 KB Output is correct
73 Correct 15 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 19 ms 13304 KB Output is correct
78 Correct 19 ms 13176 KB Output is correct
79 Correct 15 ms 13048 KB Output is correct
80 Correct 15 ms 13048 KB Output is correct
81 Correct 15 ms 13020 KB Output is correct
82 Correct 15 ms 13056 KB Output is correct
83 Correct 15 ms 13052 KB Output is correct
84 Correct 16 ms 13176 KB Output is correct
85 Correct 16 ms 13176 KB Output is correct
86 Correct 16 ms 13088 KB Output is correct
87 Correct 16 ms 13176 KB Output is correct
88 Correct 16 ms 13176 KB Output is correct
89 Correct 16 ms 13176 KB Output is correct
90 Correct 15 ms 13180 KB Output is correct
91 Correct 16 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 15 ms 12920 KB Output is correct
7 Correct 14 ms 12836 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 17 ms 12920 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12824 KB Output is correct
12 Correct 14 ms 12924 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 12920 KB Output is correct
23 Correct 14 ms 12920 KB Output is correct
24 Correct 15 ms 13048 KB Output is correct
25 Correct 14 ms 12924 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 15 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 12924 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 12916 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 12920 KB Output is correct
45 Correct 15 ms 12924 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 12920 KB Output is correct
49 Correct 14 ms 12920 KB Output is correct
50 Correct 14 ms 12924 KB Output is correct
51 Correct 14 ms 12920 KB Output is correct
52 Correct 14 ms 12924 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 14 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 12892 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 196 ms 34968 KB Output is correct
67 Correct 214 ms 34912 KB Output is correct
68 Correct 496 ms 59836 KB Output is correct
69 Correct 312 ms 45252 KB Output is correct
70 Correct 362 ms 49264 KB Output is correct
71 Correct 511 ms 68780 KB Output is correct
72 Correct 526 ms 64332 KB Output is correct
73 Correct 552 ms 66920 KB Output is correct
74 Correct 539 ms 62688 KB Output is correct
75 Correct 490 ms 54432 KB Output is correct
76 Correct 302 ms 45868 KB Output is correct
77 Correct 324 ms 45736 KB Output is correct
78 Correct 313 ms 43820 KB Output is correct
79 Correct 298 ms 43532 KB Output is correct
80 Correct 219 ms 37528 KB Output is correct
81 Correct 215 ms 37300 KB Output is correct
82 Correct 31 ms 20104 KB Output is correct
83 Correct 31 ms 20104 KB Output is correct
84 Correct 31 ms 20104 KB Output is correct
85 Correct 30 ms 19976 KB Output is correct
86 Correct 30 ms 19976 KB Output is correct
87 Correct 31 ms 20104 KB Output is correct
88 Correct 17 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 13688 KB Output is correct
92 Correct 17 ms 13688 KB Output is correct
93 Correct 17 ms 13532 KB Output is correct
94 Correct 17 ms 13736 KB Output is correct
95 Correct 20 ms 13560 KB Output is correct
96 Correct 18 ms 13560 KB Output is correct
97 Correct 17 ms 13560 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 13436 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 13304 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 646 ms 69996 KB Output is correct
109 Correct 589 ms 69924 KB Output is correct
110 Correct 587 ms 70132 KB Output is correct
111 Correct 664 ms 69932 KB Output is correct
112 Correct 613 ms 69920 KB Output is correct
113 Correct 729 ms 94308 KB Output is correct
114 Correct 669 ms 79760 KB Output is correct
115 Correct 624 ms 77472 KB Output is correct
116 Correct 637 ms 75552 KB Output is correct
117 Correct 549 ms 70080 KB Output is correct
118 Correct 566 ms 70152 KB Output is correct
119 Correct 534 ms 69840 KB Output is correct
120 Correct 543 ms 70048 KB Output is correct
121 Correct 508 ms 66072 KB Output is correct
122 Correct 485 ms 62632 KB Output is correct
123 Correct 251 ms 43900 KB Output is correct
124 Correct 335 ms 59176 KB Output is correct
125 Correct 351 ms 59028 KB Output is correct
126 Correct 334 ms 59024 KB Output is correct
127 Correct 315 ms 59048 KB Output is correct
128 Correct 17 ms 13560 KB Output is correct
129 Correct 17 ms 13692 KB Output is correct
130 Correct 17 ms 13432 KB Output is correct
131 Correct 17 ms 13304 KB Output is correct
132 Correct 16 ms 13200 KB Output is correct
133 Correct 16 ms 13176 KB Output is correct
134 Correct 16 ms 13176 KB Output is correct
135 Correct 15 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 17 ms 13652 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 13248 KB Output is correct
144 Correct 17 ms 13236 KB Output is correct
145 Correct 16 ms 13304 KB Output is correct
146 Correct 16 ms 13176 KB Output is correct
147 Correct 15 ms 13176 KB Output is correct
148 Correct 17 ms 13304 KB Output is correct
149 Correct 16 ms 13304 KB Output is correct
150 Correct 16 ms 13304 KB Output is correct
151 Correct 16 ms 13304 KB Output is correct
152 Correct 15 ms 13048 KB Output is correct
153 Correct 14 ms 13036 KB Output is correct
154 Correct 14 ms 13048 KB Output is correct
155 Correct 552 ms 69932 KB Output is correct
156 Correct 602 ms 71700 KB Output is correct
157 Correct 615 ms 65676 KB Output is correct
158 Correct 465 ms 53456 KB Output is correct
159 Correct 387 ms 43688 KB Output is correct
160 Correct 325 ms 37424 KB Output is correct
161 Correct 315 ms 35080 KB Output is correct
162 Correct 276 ms 31536 KB Output is correct
163 Correct 249 ms 30412 KB Output is correct
164 Correct 237 ms 29580 KB Output is correct
165 Correct 217 ms 27612 KB Output is correct
166 Correct 208 ms 25976 KB Output is correct
167 Correct 213 ms 25904 KB Output is correct
168 Correct 197 ms 27752 KB Output is correct
169 Correct 640 ms 74212 KB Output is correct
170 Correct 700 ms 70964 KB Output is correct
171 Correct 640 ms 68180 KB Output is correct
172 Correct 605 ms 66028 KB Output is correct
173 Correct 506 ms 53576 KB Output is correct
174 Correct 506 ms 53420 KB Output is correct
175 Correct 500 ms 53380 KB Output is correct
176 Correct 434 ms 48432 KB Output is correct
177 Correct 367 ms 42680 KB Output is correct
178 Correct 530 ms 64120 KB Output is correct
179 Correct 531 ms 64420 KB Output is correct
180 Correct 452 ms 54432 KB Output is correct
181 Correct 598 ms 54396 KB Output is correct
182 Correct 14 ms 12920 KB Output is correct
183 Correct 15 ms 13176 KB Output is correct
184 Correct 17 ms 13176 KB Output is correct
185 Correct 18 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 13304 KB Output is correct
189 Correct 15 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 19 ms 13304 KB Output is correct
194 Correct 19 ms 13176 KB Output is correct
195 Correct 15 ms 13048 KB Output is correct
196 Correct 15 ms 13048 KB Output is correct
197 Correct 15 ms 13020 KB Output is correct
198 Correct 15 ms 13056 KB Output is correct
199 Correct 15 ms 13052 KB Output is correct
200 Correct 16 ms 13176 KB Output is correct
201 Correct 16 ms 13176 KB Output is correct
202 Correct 16 ms 13088 KB Output is correct
203 Correct 16 ms 13176 KB Output is correct
204 Correct 16 ms 13176 KB Output is correct
205 Correct 16 ms 13176 KB Output is correct
206 Correct 15 ms 13180 KB Output is correct
207 Correct 16 ms 13176 KB Output is correct
208 Correct 16 ms 13176 KB Output is correct
209 Correct 31 ms 20016 KB Output is correct
210 Correct 297 ms 46252 KB Output is correct
211 Execution timed out 1079 ms 45728 KB Time limit exceeded
212 Halted 0 ms 0 KB -