oj.uz

답안 #932786

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932786 2024-02-24T08:16:22 Z abcvuitunggio 참나무 (IOI23_beechtree) C++17
71 / 100
 2000 ms 176848 KB 
#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
const int lim=200001,mxn=2e7+1;
int n,m,bad[lim],sz[lim],tin[lim],tout[lim],t,id,pos[lim],order[lim],root[lim][2],last[lim],cur,a[lim],b[lim];
int le[mxn],ri[mxn],st[mxn];
vector <int> p,c,res,ke[lim],ve[lim],s[lim],sc[lim],tmp;
vector <pair <int, int>> ve2;
void dfs(int u){
    sz[u]=1;
    tin[u]=++t;
    for (int v:ke[u]){
        dfs(v);
        sz[u]+=sz[v];
    }
    tout[u]=t;
    ve[sz[u]].push_back(u);
}
int update(int node, int l, int r, int i){
    cur++;
    if (l==r){
        st[cur]++;
        return cur;
    }
    int tmp=cur,mid=(l+r)>>1;
    le[tmp]=le[node];
    ri[tmp]=ri[node];
    if (mid<i)
        ri[tmp]=update(ri[node],mid+1,r,i);
    else
        le[tmp]=update(le[node],l,mid,i);
    st[tmp]=st[le[tmp]]+st[ri[tmp]];
    return tmp;
}
int get(int node, int l, int r, int u, int v){
    if (l>v||r<u||!node)
        return 0;
    if (l>=u&&r<=v)
        return st[node];
    int mid=(l+r)>>1;
    return get(le[node],l,mid,u,v)+get(ri[node],mid+1,r,u,v);
}
int get(int i, int j, int k){
    int res=get(root[i][k],1,n,tin[j],tout[j])-1;
    return res-(k&&c[i]==c[j]);
}
void dfs2(int u){
    if (ke[u].empty()){
        s[u].push_back(pos[u]);
        return;
    }
    int mx=0,bigchild=-1;
    for (int v:ke[u])
        if (sz[v]>mx){
            bigchild=v;
            mx=sz[v];
        }
    for (int v:ke[u]){
        dfs2(v);
        bad[u]|=bad[v];
    }
    if (bad[u])
        return;
    swap(s[u],s[bigchild]);
    s[u].push_back(pos[u]);
    for (int v:ke[u])
        if (v!=bigchild)
            for (int i:s[v]){
                if (get(order[i],u,1)!=get(p[order[i]],u,0)){
                    bad[u]=1;
                    return;
                }
            }
    if (get(bigchild,u,1)){
        bad[u]=1;
        return;
    }
    for (int v:ke[u])
        if (v!=bigchild){
            for (int i:s[v]){
                s[u].push_back(i);
                tmp.push_back(get(order[i],u,0));
                sc[c[order[i]]].push_back(get(order[i],u,1));
            }
            s[v].clear();
        }
    sc[c[bigchild]].push_back(get(bigchild,u,1));
    tmp.push_back(0);
    tmp.push_back(sz[u]);
    sort(tmp.begin(),tmp.end());
    int last=-1;
    ve2.clear();
    for (int i:tmp){
        int x=i-last-1;
        if (x)
            ve2.push_back({x,last});
        last=i;
    }
    tmp.clear();
    int cnt=0;
    for (int v:ke[u]){
        int i=c[v];
        int num=get(::last[i],1,n,tin[u],tout[u])-(c[u]==i);
        int id=0;
        pair <int, int> cur=ve2[0];
        sc[i].push_back(num);
        sort(sc[i].begin(),sc[i].end());
        int last=-1;
        for (int j:sc[i]){
            int x=j-last-1;
            if (x){
                cnt+=x;
                if (!(x<=cur.first&&last==cur.second)){
                    bad[u]=1;
                    for (int v:ke[u])
                        sc[c[v]].clear();
                    return;
                }
                cur.first-=x;
                if (!cur.first){
                    id++;
                    cur=(id==ve2.size()?make_pair(0,0):ve2[id]);
                }
            }
            last=j;
        }
        sc[i].clear();
    }
    if (cnt<sz[bigchild]-1)
        bad[u]=1;
}
vector <int> beechtree(int N, int M, vector<int> P, vector<int> C){
    n=N,m=M,p=P,c=C;
    for (int i=1;i<n;i++)
        ke[P[i]].push_back(i);
    dfs(0);
    for (int i=n;i>=0;i--){
        sort(ve[i].begin(),ve[i].end(),[](int u, int v){return pos[p[u]]<pos[p[v]];});
        for (int j:ve[i]){
            pos[j]=++id;
            order[id]=j;
        }
    }
    for (int i=1;i<=n;i++){
        int j=order[i];
        root[j][0]=update(root[order[i-1]][0],1,n,tin[j]);
        root[j][1]=update(last[c[j]],1,n,tin[j]);
        last[c[j]]=root[j][1];
    }
    dfs2(0);
    for (int i=0;i<n;i++)
        res.push_back(bad[i]^1);
    return res;
}

Compilation message

beechtree.cpp: In function 'void dfs2(int)':
beechtree.cpp:122:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |                     cur=(id==ve2.size()?make_pair(0,0):ve2[id]);
      |                          ~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23132 KB Output is correct

Subtask #1
9.0 / 9.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 6 ms 23388 KB Output is correct
4 Correct 5 ms 23128 KB Output is correct
5 Correct 5 ms 23384 KB Output is correct
6 Correct 6 ms 23132 KB Output is correct
7 Correct 189 ms 176848 KB Output is correct
8 Correct 163 ms 176756 KB Output is correct
9 Correct 6 ms 23128 KB Output is correct
10 Correct 6 ms 23132 KB Output is correct
11 Correct 6 ms 23128 KB Output is correct
12 Correct 5 ms 23132 KB Output is correct
13 Correct 7 ms 24156 KB Output is correct
14 Correct 8 ms 24272 KB Output is correct
15 Correct 7 ms 24924 KB Output is correct
16 Correct 10 ms 25220 KB Output is correct
17 Correct 263 ms 176836 KB Output is correct
18 Correct 213 ms 176540 KB Output is correct
19 Correct 185 ms 176780 KB Output is correct
20 Correct 181 ms 176848 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 6 ms 23132 KB Output is correct
3 Correct 6 ms 23384 KB Output is correct
4 Correct 6 ms 23132 KB Output is correct
5 Correct 5 ms 23132 KB Output is correct
6 Correct 6 ms 23132 KB Output is correct
7 Correct 6 ms 23132 KB Output is correct
8 Correct 5 ms 23132 KB Output is correct
9 Correct 5 ms 23132 KB Output is correct
10 Correct 5 ms 23128 KB Output is correct
11 Correct 6 ms 23640 KB Output is correct
12 Correct 6 ms 23644 KB Output is correct
13 Correct 8 ms 23640 KB Output is correct
14 Correct 6 ms 23644 KB Output is correct
15 Correct 161 ms 79972 KB Output is correct
16 Correct 153 ms 73284 KB Output is correct
17 Correct 161 ms 76872 KB Output is correct
18 Correct 174 ms 78988 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23132 KB Output is correct
4 Correct 5 ms 23132 KB Output is correct
5 Correct 189 ms 176848 KB Output is correct
6 Correct 163 ms 176756 KB Output is correct
7 Correct 6 ms 23128 KB Output is correct
8 Correct 5 ms 23128 KB Output is correct
9 Correct 8 ms 24412 KB Output is correct
10 Correct 7 ms 24516 KB Output is correct
11 Correct 352 ms 138136 KB Output is correct
12 Correct 256 ms 127052 KB Output is correct

Subtask #5
14.0 / 14.0

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

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23132 KB Output is correct
4 Correct 5 ms 23132 KB Output is correct
5 Correct 6 ms 23132 KB Output is correct
6 Correct 5 ms 23128 KB Output is correct
7 Correct 5 ms 23132 KB Output is correct
8 Correct 5 ms 23132 KB Output is correct
9 Correct 5 ms 23132 KB Output is correct
10 Correct 6 ms 23132 KB Output is correct
11 Correct 5 ms 23132 KB Output is correct
12 Correct 5 ms 23132 KB Output is correct
13 Correct 5 ms 23128 KB Output is correct
14 Correct 6 ms 23132 KB Output is correct
15 Correct 5 ms 23132 KB Output is correct
16 Correct 5 ms 23132 KB Output is correct
17 Correct 5 ms 23132 KB Output is correct
18 Correct 5 ms 23128 KB Output is correct
19 Correct 6 ms 23132 KB Output is correct
20 Correct 5 ms 23128 KB Output is correct
21 Correct 5 ms 23132 KB Output is correct
22 Correct 5 ms 23132 KB Output is correct
23 Correct 7 ms 23388 KB Output is correct
24 Correct 5 ms 23132 KB Output is correct
25 Correct 8 ms 24152 KB Output is correct
26 Correct 7 ms 24152 KB Output is correct
27 Correct 8 ms 24156 KB Output is correct
28 Correct 7 ms 24156 KB Output is correct
29 Correct 10 ms 24252 KB Output is correct
30 Correct 7 ms 23644 KB Output is correct
31 Correct 9 ms 23644 KB Output is correct
32 Correct 9 ms 23644 KB Output is correct
33 Correct 9 ms 23752 KB Output is correct
34 Correct 10 ms 23644 KB Output is correct
35 Correct 9 ms 23640 KB Output is correct
36 Correct 8 ms 23644 KB Output is correct
37 Correct 7 ms 23900 KB Output is correct
38 Correct 7 ms 23748 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23132 KB Output is correct
4 Correct 5 ms 23128 KB Output is correct
5 Correct 5 ms 23132 KB Output is correct
6 Correct 6 ms 23388 KB Output is correct
7 Correct 5 ms 23128 KB Output is correct
8 Correct 5 ms 23384 KB Output is correct
9 Correct 6 ms 23132 KB Output is correct
10 Correct 5 ms 23132 KB Output is correct
11 Correct 5 ms 23132 KB Output is correct
12 Correct 6 ms 23132 KB Output is correct
13 Correct 5 ms 23128 KB Output is correct
14 Correct 5 ms 23132 KB Output is correct
15 Correct 5 ms 23132 KB Output is correct
16 Correct 5 ms 23132 KB Output is correct
17 Correct 6 ms 23132 KB Output is correct
18 Correct 5 ms 23132 KB Output is correct
19 Correct 5 ms 23132 KB Output is correct
20 Correct 5 ms 23128 KB Output is correct
21 Correct 6 ms 23132 KB Output is correct
22 Correct 5 ms 23132 KB Output is correct
23 Correct 5 ms 23132 KB Output is correct
24 Correct 5 ms 23132 KB Output is correct
25 Correct 5 ms 23128 KB Output is correct
26 Correct 6 ms 23132 KB Output is correct
27 Correct 5 ms 23128 KB Output is correct
28 Correct 5 ms 23132 KB Output is correct
29 Correct 5 ms 23132 KB Output is correct
30 Correct 7 ms 23388 KB Output is correct
31 Correct 5 ms 23132 KB Output is correct
32 Correct 5 ms 23132 KB Output is correct
33 Correct 5 ms 23132 KB Output is correct
34 Correct 5 ms 23128 KB Output is correct
35 Correct 5 ms 23128 KB Output is correct
36 Correct 5 ms 23132 KB Output is correct
37 Correct 5 ms 23132 KB Output is correct
38 Correct 6 ms 23128 KB Output is correct
39 Correct 6 ms 23132 KB Output is correct
40 Correct 6 ms 23128 KB Output is correct
41 Correct 5 ms 23132 KB Output is correct
42 Correct 7 ms 24156 KB Output is correct
43 Correct 8 ms 24272 KB Output is correct
44 Correct 7 ms 24924 KB Output is correct
45 Correct 10 ms 25220 KB Output is correct
46 Correct 5 ms 23128 KB Output is correct
47 Correct 6 ms 23132 KB Output is correct
48 Correct 6 ms 23384 KB Output is correct
49 Correct 6 ms 23132 KB Output is correct
50 Correct 5 ms 23132 KB Output is correct
51 Correct 6 ms 23132 KB Output is correct
52 Correct 6 ms 23132 KB Output is correct
53 Correct 5 ms 23132 KB Output is correct
54 Correct 5 ms 23132 KB Output is correct
55 Correct 5 ms 23128 KB Output is correct
56 Correct 6 ms 23640 KB Output is correct
57 Correct 6 ms 23644 KB Output is correct
58 Correct 8 ms 23640 KB Output is correct
59 Correct 6 ms 23644 KB Output is correct
60 Correct 6 ms 23128 KB Output is correct
61 Correct 5 ms 23128 KB Output is correct
62 Correct 8 ms 24412 KB Output is correct
63 Correct 7 ms 24516 KB Output is correct
64 Correct 7 ms 23132 KB Output is correct
65 Correct 6 ms 23132 KB Output is correct
66 Correct 6 ms 23132 KB Output is correct
67 Correct 6 ms 23216 KB Output is correct
68 Correct 5 ms 23132 KB Output is correct
69 Correct 6 ms 23132 KB Output is correct
70 Correct 6 ms 23132 KB Output is correct
71 Correct 6 ms 23132 KB Output is correct
72 Correct 5 ms 23132 KB Output is correct
73 Correct 7 ms 23132 KB Output is correct
74 Correct 6 ms 23164 KB Output is correct
75 Correct 8 ms 24152 KB Output is correct
76 Correct 7 ms 24152 KB Output is correct
77 Correct 8 ms 24156 KB Output is correct
78 Correct 7 ms 24156 KB Output is correct
79 Correct 10 ms 24252 KB Output is correct
80 Correct 7 ms 23644 KB Output is correct
81 Correct 9 ms 23644 KB Output is correct
82 Correct 9 ms 23644 KB Output is correct
83 Correct 9 ms 23752 KB Output is correct
84 Correct 10 ms 23644 KB Output is correct
85 Correct 9 ms 23640 KB Output is correct
86 Correct 8 ms 23644 KB Output is correct
87 Correct 7 ms 23900 KB Output is correct
88 Correct 7 ms 23748 KB Output is correct
89 Correct 12 ms 23900 KB Output is correct
90 Correct 8 ms 23900 KB Output is correct
91 Correct 10 ms 23644 KB Output is correct
92 Correct 10 ms 23900 KB Output is correct
93 Correct 9 ms 24156 KB Output is correct
94 Correct 10 ms 23644 KB Output is correct
95 Correct 9 ms 23804 KB Output is correct
96 Correct 8 ms 24156 KB Output is correct
97 Correct 7 ms 23900 KB Output is correct
98 Correct 7 ms 23644 KB Output is correct

Subtask #8
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23132 KB Output is correct
4 Correct 5 ms 23132 KB Output is correct
5 Correct 6 ms 23132 KB Output is correct
6 Correct 5 ms 23128 KB Output is correct
7 Correct 5 ms 23132 KB Output is correct
8 Correct 5 ms 23132 KB Output is correct
9 Correct 5 ms 23132 KB Output is correct
10 Correct 6 ms 23132 KB Output is correct
11 Correct 5 ms 23132 KB Output is correct
12 Correct 5 ms 23132 KB Output is correct
13 Correct 5 ms 23128 KB Output is correct
14 Correct 6 ms 23132 KB Output is correct
15 Correct 5 ms 23132 KB Output is correct
16 Correct 5 ms 23132 KB Output is correct
17 Correct 5 ms 23132 KB Output is correct
18 Correct 5 ms 23128 KB Output is correct
19 Correct 6 ms 23132 KB Output is correct
20 Correct 5 ms 23128 KB Output is correct
21 Correct 5 ms 23132 KB Output is correct
22 Correct 5 ms 23132 KB Output is correct
23 Correct 7 ms 23388 KB Output is correct
24 Correct 5 ms 23132 KB Output is correct
25 Correct 8 ms 24152 KB Output is correct
26 Correct 7 ms 24152 KB Output is correct
27 Correct 8 ms 24156 KB Output is correct
28 Correct 7 ms 24156 KB Output is correct
29 Correct 10 ms 24252 KB Output is correct
30 Correct 7 ms 23644 KB Output is correct
31 Correct 9 ms 23644 KB Output is correct
32 Correct 9 ms 23644 KB Output is correct
33 Correct 9 ms 23752 KB Output is correct
34 Correct 10 ms 23644 KB Output is correct
35 Correct 9 ms 23640 KB Output is correct
36 Correct 8 ms 23644 KB Output is correct
37 Correct 7 ms 23900 KB Output is correct
38 Correct 7 ms 23748 KB Output is correct
39 Correct 231 ms 176708 KB Output is correct
40 Correct 213 ms 176720 KB Output is correct
41 Correct 190 ms 176464 KB Output is correct
42 Correct 161 ms 176024 KB Output is correct
43 Correct 321 ms 161816 KB Output is correct
44 Correct 412 ms 136872 KB Output is correct
45 Execution timed out 2045 ms 135136 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23132 KB Output is correct
4 Correct 5 ms 23128 KB Output is correct
5 Correct 5 ms 23132 KB Output is correct
6 Correct 6 ms 23388 KB Output is correct
7 Correct 5 ms 23128 KB Output is correct
8 Correct 5 ms 23384 KB Output is correct
9 Correct 6 ms 23132 KB Output is correct
10 Correct 5 ms 23132 KB Output is correct
11 Correct 5 ms 23132 KB Output is correct
12 Correct 6 ms 23132 KB Output is correct
13 Correct 5 ms 23128 KB Output is correct
14 Correct 5 ms 23132 KB Output is correct
15 Correct 5 ms 23132 KB Output is correct
16 Correct 5 ms 23132 KB Output is correct
17 Correct 6 ms 23132 KB Output is correct
18 Correct 5 ms 23132 KB Output is correct
19 Correct 5 ms 23132 KB Output is correct
20 Correct 5 ms 23128 KB Output is correct
21 Correct 6 ms 23132 KB Output is correct
22 Correct 5 ms 23132 KB Output is correct
23 Correct 5 ms 23132 KB Output is correct
24 Correct 5 ms 23132 KB Output is correct
25 Correct 5 ms 23128 KB Output is correct
26 Correct 6 ms 23132 KB Output is correct
27 Correct 5 ms 23128 KB Output is correct
28 Correct 5 ms 23132 KB Output is correct
29 Correct 5 ms 23132 KB Output is correct
30 Correct 7 ms 23388 KB Output is correct
31 Correct 5 ms 23132 KB Output is correct
32 Correct 5 ms 23132 KB Output is correct
33 Correct 5 ms 23132 KB Output is correct
34 Correct 5 ms 23128 KB Output is correct
35 Correct 5 ms 23128 KB Output is correct
36 Correct 5 ms 23132 KB Output is correct
37 Correct 5 ms 23132 KB Output is correct
38 Correct 189 ms 176848 KB Output is correct
39 Correct 163 ms 176756 KB Output is correct
40 Correct 6 ms 23128 KB Output is correct
41 Correct 6 ms 23132 KB Output is correct
42 Correct 6 ms 23128 KB Output is correct
43 Correct 5 ms 23132 KB Output is correct
44 Correct 7 ms 24156 KB Output is correct
45 Correct 8 ms 24272 KB Output is correct
46 Correct 7 ms 24924 KB Output is correct
47 Correct 10 ms 25220 KB Output is correct
48 Correct 263 ms 176836 KB Output is correct
49 Correct 213 ms 176540 KB Output is correct
50 Correct 185 ms 176780 KB Output is correct
51 Correct 181 ms 176848 KB Output is correct
52 Correct 5 ms 23128 KB Output is correct
53 Correct 6 ms 23132 KB Output is correct
54 Correct 6 ms 23384 KB Output is correct
55 Correct 6 ms 23132 KB Output is correct
56 Correct 5 ms 23132 KB Output is correct
57 Correct 6 ms 23132 KB Output is correct
58 Correct 6 ms 23132 KB Output is correct
59 Correct 5 ms 23132 KB Output is correct
60 Correct 5 ms 23132 KB Output is correct
61 Correct 5 ms 23128 KB Output is correct
62 Correct 6 ms 23640 KB Output is correct
63 Correct 6 ms 23644 KB Output is correct
64 Correct 8 ms 23640 KB Output is correct
65 Correct 6 ms 23644 KB Output is correct
66 Correct 161 ms 79972 KB Output is correct
67 Correct 153 ms 73284 KB Output is correct
68 Correct 161 ms 76872 KB Output is correct
69 Correct 174 ms 78988 KB Output is correct
70 Correct 6 ms 23128 KB Output is correct
71 Correct 5 ms 23128 KB Output is correct
72 Correct 8 ms 24412 KB Output is correct
73 Correct 7 ms 24516 KB Output is correct
74 Correct 352 ms 138136 KB Output is correct
75 Correct 256 ms 127052 KB Output is correct
76 Correct 7 ms 23132 KB Output is correct
77 Correct 6 ms 23132 KB Output is correct
78 Correct 6 ms 23132 KB Output is correct
79 Correct 6 ms 23216 KB Output is correct
80 Correct 5 ms 23132 KB Output is correct
81 Correct 6 ms 23132 KB Output is correct
82 Correct 6 ms 23132 KB Output is correct
83 Correct 6 ms 23132 KB Output is correct
84 Correct 5 ms 23132 KB Output is correct
85 Correct 7 ms 23132 KB Output is correct
86 Correct 6 ms 23164 KB Output is correct
87 Correct 8 ms 24152 KB Output is correct
88 Correct 7 ms 24152 KB Output is correct
89 Correct 8 ms 24156 KB Output is correct
90 Correct 7 ms 24156 KB Output is correct
91 Correct 10 ms 24252 KB Output is correct
92 Correct 7 ms 23644 KB Output is correct
93 Correct 9 ms 23644 KB Output is correct
94 Correct 9 ms 23644 KB Output is correct
95 Correct 9 ms 23752 KB Output is correct
96 Correct 10 ms 23644 KB Output is correct
97 Correct 9 ms 23640 KB Output is correct
98 Correct 8 ms 23644 KB Output is correct
99 Correct 7 ms 23900 KB Output is correct
100 Correct 7 ms 23748 KB Output is correct
101 Correct 12 ms 23900 KB Output is correct
102 Correct 8 ms 23900 KB Output is correct
103 Correct 10 ms 23644 KB Output is correct
104 Correct 10 ms 23900 KB Output is correct
105 Correct 9 ms 24156 KB Output is correct
106 Correct 10 ms 23644 KB Output is correct
107 Correct 9 ms 23804 KB Output is correct
108 Correct 8 ms 24156 KB Output is correct
109 Correct 7 ms 23900 KB Output is correct
110 Correct 7 ms 23644 KB Output is correct
111 Correct 231 ms 176708 KB Output is correct
112 Correct 213 ms 176720 KB Output is correct
113 Correct 190 ms 176464 KB Output is correct
114 Correct 161 ms 176024 KB Output is correct
115 Correct 321 ms 161816 KB Output is correct
116 Correct 412 ms 136872 KB Output is correct
117 Execution timed out 2045 ms 135136 KB Time limit exceeded
118 Halted 0 ms 0 KB -