oj.uz

답안 #133518

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
133518 2019-07-21T03:12:12 Z 12tqian 철인 이종 경기 (APIO18_duathlon) C++14
62 / 100
 1000 ms 88744 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];
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash1 {
    int operator()(int x) const { return hash<int>{}(x ^ RANDOM); }
};/*
gp_hash_table<int, int, chash1> vis;
gp_hash_table<int, int, chash1> sub;
gp_hash_table<int, int, chash1> parent;
*/
unordered_map<int, int> vis;
unordered_map<int, int> sub;
unordered_map<int, int> parent;
unordered_map<int, vi> tree1;
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]++;
            }
        }
    }
    //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(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:132: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:172: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:177: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:180: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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10616 KB Output is correct
2 Correct 12 ms 10616 KB Output is correct
3 Correct 11 ms 10524 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 12 ms 10616 KB Output is correct
8 Correct 12 ms 10488 KB Output is correct
9 Correct 12 ms 10488 KB Output is correct
10 Correct 12 ms 10488 KB Output is correct
11 Correct 12 ms 10616 KB Output is correct
12 Correct 12 ms 10472 KB Output is correct
13 Correct 12 ms 10616 KB Output is correct
14 Correct 12 ms 10616 KB Output is correct
15 Correct 12 ms 10616 KB Output is correct
16 Correct 11 ms 10488 KB Output is correct
17 Correct 12 ms 10616 KB Output is correct
18 Correct 11 ms 10616 KB Output is correct
19 Correct 12 ms 10616 KB Output is correct
20 Correct 12 ms 10492 KB Output is correct
21 Correct 12 ms 10616 KB Output is correct
22 Correct 11 ms 10488 KB Output is correct
23 Correct 12 ms 10616 KB Output is correct
24 Correct 12 ms 10488 KB Output is correct
25 Correct 11 ms 10488 KB Output is correct
26 Correct 12 ms 10592 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 10660 KB Output is correct
30 Correct 12 ms 10488 KB Output is correct
31 Correct 12 ms 10616 KB Output is correct
32 Correct 12 ms 10616 KB Output is correct
33 Correct 12 ms 10588 KB Output is correct
34 Correct 12 ms 10616 KB Output is correct
35 Correct 12 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 10524 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 12 ms 10616 KB Output is correct
8 Correct 12 ms 10488 KB Output is correct
9 Correct 12 ms 10488 KB Output is correct
10 Correct 12 ms 10488 KB Output is correct
11 Correct 12 ms 10616 KB Output is correct
12 Correct 12 ms 10472 KB Output is correct
13 Correct 12 ms 10616 KB Output is correct
14 Correct 12 ms 10616 KB Output is correct
15 Correct 12 ms 10616 KB Output is correct
16 Correct 11 ms 10488 KB Output is correct
17 Correct 12 ms 10616 KB Output is correct
18 Correct 11 ms 10616 KB Output is correct
19 Correct 12 ms 10616 KB Output is correct
20 Correct 12 ms 10492 KB Output is correct
21 Correct 12 ms 10616 KB Output is correct
22 Correct 11 ms 10488 KB Output is correct
23 Correct 12 ms 10616 KB Output is correct
24 Correct 12 ms 10488 KB Output is correct
25 Correct 11 ms 10488 KB Output is correct
26 Correct 12 ms 10592 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 10660 KB Output is correct
30 Correct 12 ms 10488 KB Output is correct
31 Correct 12 ms 10616 KB Output is correct
32 Correct 12 ms 10616 KB Output is correct
33 Correct 12 ms 10588 KB Output is correct
34 Correct 12 ms 10616 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 10616 KB Output is correct
38 Correct 12 ms 10616 KB Output is correct
39 Correct 12 ms 10532 KB Output is correct
40 Correct 12 ms 10616 KB Output is correct
41 Correct 12 ms 10616 KB Output is correct
42 Correct 12 ms 10616 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 10492 KB Output is correct
46 Correct 12 ms 10488 KB Output is correct
47 Correct 12 ms 10616 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 12 ms 10488 KB Output is correct
52 Correct 12 ms 10616 KB Output is correct
53 Correct 12 ms 10616 KB Output is correct
54 Correct 14 ms 10488 KB Output is correct
55 Correct 12 ms 10616 KB Output is correct
56 Correct 12 ms 10488 KB Output is correct
57 Correct 12 ms 10588 KB Output is correct
58 Correct 12 ms 10616 KB Output is correct
59 Correct 12 ms 10616 KB Output is correct
60 Correct 12 ms 10576 KB Output is correct
61 Correct 12 ms 10492 KB Output is correct
62 Correct 12 ms 10488 KB Output is correct
63 Correct 12 ms 10616 KB Output is correct
64 Correct 14 ms 10616 KB Output is correct
65 Correct 12 ms 10616 KB Output is correct

Subtask #3
0 / 8.0

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

Subtask #4
10.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 14 ms 11000 KB Output is correct
4 Correct 18 ms 11384 KB Output is correct
5 Correct 16 ms 11256 KB Output is correct
6 Correct 16 ms 11256 KB Output is correct
7 Correct 16 ms 11384 KB Output is correct
8 Correct 15 ms 11256 KB Output is correct
9 Correct 15 ms 11128 KB Output is correct
10 Correct 15 ms 11128 KB Output is correct
11 Correct 15 ms 11128 KB Output is correct
12 Correct 15 ms 11128 KB Output is correct
13 Correct 14 ms 11000 KB Output is correct
14 Correct 14 ms 11000 KB Output is correct
15 Correct 14 ms 11000 KB Output is correct
16 Correct 13 ms 10872 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 11004 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 591 ms 64520 KB Output is correct
2 Correct 591 ms 64392 KB Output is correct
3 Correct 580 ms 64672 KB Output is correct
4 Correct 581 ms 64400 KB Output is correct
5 Correct 628 ms 64420 KB Output is correct
6 Correct 912 ms 88744 KB Output is correct
7 Correct 682 ms 74340 KB Output is correct
8 Correct 660 ms 71908 KB Output is correct
9 Correct 655 ms 70052 KB Output is correct
10 Correct 569 ms 64416 KB Output is correct
11 Correct 571 ms 64548 KB Output is correct
12 Correct 585 ms 64420 KB Output is correct
13 Correct 571 ms 64548 KB Output is correct
14 Correct 518 ms 61032 KB Output is correct
15 Correct 461 ms 58016 KB Output is correct
16 Correct 268 ms 40412 KB Output is correct
17 Correct 336 ms 53464 KB Output is correct
18 Correct 340 ms 53520 KB Output is correct
19 Correct 343 ms 53476 KB Output is correct
20 Correct 342 ms 53540 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 11000 KB Output is correct
5 Correct 14 ms 10872 KB Output is correct
6 Correct 14 ms 10816 KB Output is correct
7 Correct 14 ms 10744 KB Output is correct
8 Correct 15 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 15 ms 11256 KB Output is correct
13 Correct 17 ms 11128 KB Output is correct
14 Correct 14 ms 11000 KB Output is correct
15 Correct 15 ms 11036 KB Output is correct
16 Correct 14 ms 11028 KB Output is correct
17 Correct 14 ms 11128 KB Output is correct
18 Correct 15 ms 11000 KB Output is correct
19 Correct 14 ms 10844 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 14 ms 10972 KB Output is correct
24 Correct 14 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

# 결과 실행 시간 메모리 Grader output
1 Correct 590 ms 64532 KB Output is correct
2 Correct 603 ms 66256 KB Output is correct
3 Correct 596 ms 60896 KB Output is correct
4 Correct 580 ms 49200 KB Output is correct
5 Correct 464 ms 40292 KB Output is correct
6 Correct 324 ms 34224 KB Output is correct
7 Correct 324 ms 32176 KB Output is correct
8 Correct 284 ms 28848 KB Output is correct
9 Correct 306 ms 27892 KB Output is correct
10 Correct 283 ms 27036 KB Output is correct
11 Correct 268 ms 25080 KB Output is correct
12 Correct 364 ms 23672 KB Output is correct
13 Correct 499 ms 23540 KB Output is correct
14 Execution timed out 1081 ms 25624 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 10524 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 12 ms 10616 KB Output is correct
8 Correct 12 ms 10488 KB Output is correct
9 Correct 12 ms 10488 KB Output is correct
10 Correct 12 ms 10488 KB Output is correct
11 Correct 12 ms 10616 KB Output is correct
12 Correct 12 ms 10472 KB Output is correct
13 Correct 12 ms 10616 KB Output is correct
14 Correct 12 ms 10616 KB Output is correct
15 Correct 12 ms 10616 KB Output is correct
16 Correct 11 ms 10488 KB Output is correct
17 Correct 12 ms 10616 KB Output is correct
18 Correct 11 ms 10616 KB Output is correct
19 Correct 12 ms 10616 KB Output is correct
20 Correct 12 ms 10492 KB Output is correct
21 Correct 12 ms 10616 KB Output is correct
22 Correct 11 ms 10488 KB Output is correct
23 Correct 12 ms 10616 KB Output is correct
24 Correct 12 ms 10488 KB Output is correct
25 Correct 11 ms 10488 KB Output is correct
26 Correct 12 ms 10592 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 10660 KB Output is correct
30 Correct 12 ms 10488 KB Output is correct
31 Correct 12 ms 10616 KB Output is correct
32 Correct 12 ms 10616 KB Output is correct
33 Correct 12 ms 10588 KB Output is correct
34 Correct 12 ms 10616 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 10616 KB Output is correct
38 Correct 12 ms 10616 KB Output is correct
39 Correct 12 ms 10532 KB Output is correct
40 Correct 12 ms 10616 KB Output is correct
41 Correct 12 ms 10616 KB Output is correct
42 Correct 12 ms 10616 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 10492 KB Output is correct
46 Correct 12 ms 10488 KB Output is correct
47 Correct 12 ms 10616 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 12 ms 10488 KB Output is correct
52 Correct 12 ms 10616 KB Output is correct
53 Correct 12 ms 10616 KB Output is correct
54 Correct 14 ms 10488 KB Output is correct
55 Correct 12 ms 10616 KB Output is correct
56 Correct 12 ms 10488 KB Output is correct
57 Correct 12 ms 10588 KB Output is correct
58 Correct 12 ms 10616 KB Output is correct
59 Correct 12 ms 10616 KB Output is correct
60 Correct 12 ms 10576 KB Output is correct
61 Correct 12 ms 10492 KB Output is correct
62 Correct 12 ms 10488 KB Output is correct
63 Correct 12 ms 10616 KB Output is correct
64 Correct 14 ms 10616 KB Output is correct
65 Correct 12 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 18 ms 10744 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 10832 KB Output is correct
73 Correct 13 ms 10872 KB Output is correct
74 Correct 13 ms 10872 KB Output is correct
75 Correct 13 ms 10872 KB Output is correct
76 Correct 12 ms 10616 KB Output is correct
77 Correct 15 ms 11000 KB Output is correct
78 Correct 14 ms 10812 KB Output is correct
79 Correct 13 ms 10872 KB Output is correct
80 Correct 13 ms 10744 KB Output is correct
81 Correct 13 ms 10660 KB Output is correct
82 Correct 16 ms 10744 KB Output is correct
83 Correct 15 ms 10744 KB Output is correct
84 Correct 14 ms 11000 KB Output is correct
85 Correct 14 ms 10872 KB Output is correct
86 Correct 14 ms 10872 KB Output is correct
87 Correct 15 ms 10872 KB Output is correct
88 Correct 14 ms 10744 KB Output is correct
89 Correct 14 ms 10744 KB Output is correct
90 Correct 13 ms 10744 KB Output is correct
91 Correct 13 ms 10872 KB Output is correct
92 Correct 13 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 10524 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 12 ms 10616 KB Output is correct
8 Correct 12 ms 10488 KB Output is correct
9 Correct 12 ms 10488 KB Output is correct
10 Correct 12 ms 10488 KB Output is correct
11 Correct 12 ms 10616 KB Output is correct
12 Correct 12 ms 10472 KB Output is correct
13 Correct 12 ms 10616 KB Output is correct
14 Correct 12 ms 10616 KB Output is correct
15 Correct 12 ms 10616 KB Output is correct
16 Correct 11 ms 10488 KB Output is correct
17 Correct 12 ms 10616 KB Output is correct
18 Correct 11 ms 10616 KB Output is correct
19 Correct 12 ms 10616 KB Output is correct
20 Correct 12 ms 10492 KB Output is correct
21 Correct 12 ms 10616 KB Output is correct
22 Correct 11 ms 10488 KB Output is correct
23 Correct 12 ms 10616 KB Output is correct
24 Correct 12 ms 10488 KB Output is correct
25 Correct 11 ms 10488 KB Output is correct
26 Correct 12 ms 10592 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 10660 KB Output is correct
30 Correct 12 ms 10488 KB Output is correct
31 Correct 12 ms 10616 KB Output is correct
32 Correct 12 ms 10616 KB Output is correct
33 Correct 12 ms 10588 KB Output is correct
34 Correct 12 ms 10616 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 10616 KB Output is correct
38 Correct 12 ms 10616 KB Output is correct
39 Correct 12 ms 10532 KB Output is correct
40 Correct 12 ms 10616 KB Output is correct
41 Correct 12 ms 10616 KB Output is correct
42 Correct 12 ms 10616 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 10492 KB Output is correct
46 Correct 12 ms 10488 KB Output is correct
47 Correct 12 ms 10616 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 12 ms 10488 KB Output is correct
52 Correct 12 ms 10616 KB Output is correct
53 Correct 12 ms 10616 KB Output is correct
54 Correct 14 ms 10488 KB Output is correct
55 Correct 12 ms 10616 KB Output is correct
56 Correct 12 ms 10488 KB Output is correct
57 Correct 12 ms 10588 KB Output is correct
58 Correct 12 ms 10616 KB Output is correct
59 Correct 12 ms 10616 KB Output is correct
60 Correct 12 ms 10576 KB Output is correct
61 Correct 12 ms 10492 KB Output is correct
62 Correct 12 ms 10488 KB Output is correct
63 Correct 12 ms 10616 KB Output is correct
64 Correct 14 ms 10616 KB Output is correct
65 Correct 12 ms 10616 KB Output is correct
66 Execution timed out 1049 ms 32616 KB Time limit exceeded
67 Halted 0 ms 0 KB -