oj.uz

답안 #250563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250563 2020-07-18T11:05:30 Z rrrr10000 철인 이종 경기 (APIO18_duathlon) C++14
100 / 100
 349 ms 36968 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

vvp g;
ll c,num;
vi id_ver,id_edge,lk,ord,tmp;
vb used,back_edge;
vi group;
void dfs(int i,int p){
    used[i]=true;
    group.pb(i);
    ord[i]=c++;
    lk[i]=ord[i];
    for(auto x:g[i]){
        if(x.fi!=p){
            if(ord[x.fi]<ord[i])tmp.pb(x.se);
            if(!used[x.fi]){
                dfs(x.fi,i);
                chmin(lk[i],lk[x.fi]);
                if(lk[x.fi]>=ord[i]){
                    while(true){
                        id_edge[tmp.back()]=num;
                        bool done=false;
                        if(tmp.back()==x.se)done=true;
                        tmp.pop_back();
                        if(done)break;
                    }
                    num++;
                }
            }
            else chmin(lk[i],ord[x.fi]);
        }
    }
}
vi f,sz,par;
vvi edge;
ll getsz(int i,int p){
    par[i]=p;
    if(i>=num)sz[i]=1;
    else sz[i]=f[i];
    for(ll x:edge[i])if(x!=p){
        sz[i]+=getsz(x,i);
    }
    return sz[i];
}
int main(){
    ll n,m,ans=0;cin>>n>>m;
    g=vvp(n);
    used=vb(n,false);
    lk=vi(n,inf);
    id_ver=vi(n,-2);
    id_edge=vi(m);
    back_edge=vb(m,false);
    ord=vi(n,-1);
    rep(i,m){
        ll a,b;cin>>a>>b;a--;b--;
        g[a].pb(b,i);g[b].pb(a,i);
    }
    rep(i,n){
        if(used[i])continue;
        tmp=vi(0);
        group=vi(0);
        c=0;num=0;
        ll cnt=0;
        dfs(i,-1);
        if(group.size()<3)continue;
        f=vi(num);
        for(auto j:group){
            bool b=false;
            ll t=id_edge[g[j][0].se];
            for(auto x:g[j]){
                if(t!=id_edge[x.se])b=true;
            }
            if(b){
                id_ver[j]=num+cnt;
                cnt++;
            }
            else{
                id_ver[j]=t;
                f[t]++;
            }
        }
        // outv(id_ver);outv(id_edge);
        // out(num);out(cnt);
        edge=vvi(num+cnt);
        for(ll x:group){
            if(id_ver[x]>=num)for(auto to:g[x]){
                edge[id_ver[x]].pb(id_edge[to.se]);
                edge[id_edge[to.se]].pb(id_ver[x]);
            }
        }
        rep(j,cnt+num)dupli(edge[j]);
        par=vi(num+cnt);sz=vi(num+cnt);
        // outv(f);
        rep(j,num+cnt)dupli(edge[j]);
        // outvv(edge);
        getsz(0,-1);
        vi s(num);
        rep(j,num){
            for(ll x:edge[j])if(x!=par[j])s[j]+=sz[x]*(sz[x]-1);
            ans+=f[j]*((group.size()-1)*(group.size()-2)-s[j]);
            if(par[j]!=-1)ans-=f[j]*(group.size()-sz[j])*(group.size()-sz[j]-1);
        }
        // outv(s);outv(sz);
        // out(ans);
        REP(j,num,num+cnt){
            ans+=(group.size()-1)*(group.size()-2);
            for(ll x:edge[j])if(x!=par[j])ans-=s[x];
            ll p=par[j];
            ans-=(s[p]+(group.size()-sz[p])*(group.size()-sz[p]-1)-sz[j]*(sz[j]-1));
        }
    }
    out(ans);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 20708 KB Output is correct
2 Correct 196 ms 20580 KB Output is correct
3 Correct 180 ms 24156 KB Output is correct
4 Correct 203 ms 22504 KB Output is correct
5 Correct 170 ms 19576 KB Output is correct
6 Correct 176 ms 25400 KB Output is correct
7 Correct 178 ms 17292 KB Output is correct
8 Correct 182 ms 20632 KB Output is correct
9 Correct 242 ms 14164 KB Output is correct
10 Correct 217 ms 15276 KB Output is correct
11 Correct 145 ms 10364 KB Output is correct
12 Correct 183 ms 10232 KB Output is correct
13 Correct 155 ms 9848 KB Output is correct
14 Correct 148 ms 9720 KB Output is correct
15 Correct 90 ms 8568 KB Output is correct
16 Correct 104 ms 8572 KB Output is correct
17 Correct 9 ms 4992 KB Output is correct
18 Correct 8 ms 4992 KB Output is correct
19 Correct 8 ms 4992 KB Output is correct
20 Correct 8 ms 4992 KB Output is correct
21 Correct 8 ms 4992 KB Output is correct
22 Correct 8 ms 4992 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 24556 KB Output is correct
2 Correct 189 ms 24556 KB Output is correct
3 Correct 181 ms 24560 KB Output is correct
4 Correct 186 ms 24556 KB Output is correct
5 Correct 189 ms 24464 KB Output is correct
6 Correct 202 ms 36968 KB Output is correct
7 Correct 202 ms 29800 KB Output is correct
8 Correct 196 ms 28440 KB Output is correct
9 Correct 195 ms 27320 KB Output is correct
10 Correct 181 ms 19644 KB Output is correct
11 Correct 235 ms 22892 KB Output is correct
12 Correct 182 ms 15508 KB Output is correct
13 Correct 173 ms 14420 KB Output is correct
14 Correct 165 ms 10488 KB Output is correct
15 Correct 135 ms 9864 KB Output is correct
16 Correct 82 ms 8184 KB Output is correct
17 Correct 128 ms 20712 KB Output is correct
18 Correct 151 ms 20964 KB Output is correct
19 Correct 136 ms 20948 KB Output is correct
20 Correct 132 ms 20764 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 189 ms 24448 KB Output is correct
2 Correct 206 ms 25068 KB Output is correct
3 Correct 270 ms 24660 KB Output is correct
4 Correct 296 ms 23404 KB Output is correct
5 Correct 187 ms 19564 KB Output is correct
6 Correct 229 ms 17900 KB Output is correct
7 Correct 189 ms 16752 KB Output is correct
8 Correct 173 ms 15468 KB Output is correct
9 Correct 169 ms 14956 KB Output is correct
10 Correct 159 ms 14572 KB Output is correct
11 Correct 154 ms 13940 KB Output is correct
12 Correct 149 ms 13808 KB Output is correct
13 Correct 150 ms 13936 KB Output is correct
14 Correct 150 ms 15820 KB Output is correct
15 Correct 244 ms 30796 KB Output is correct
16 Correct 234 ms 29324 KB Output is correct
17 Correct 218 ms 28776 KB Output is correct
18 Correct 244 ms 27372 KB Output is correct
19 Correct 349 ms 22892 KB Output is correct
20 Correct 225 ms 19252 KB Output is correct
21 Correct 232 ms 17060 KB Output is correct
22 Correct 200 ms 13176 KB Output is correct
23 Correct 180 ms 12432 KB Output is correct
24 Correct 207 ms 23920 KB Output is correct
25 Correct 212 ms 23984 KB Output is correct
26 Correct 216 ms 22888 KB Output is correct
27 Correct 243 ms 22760 KB Output is correct

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 256 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 1 ms 256 KB Output is correct
45 Correct 0 ms 256 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 0 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 0 ms 384 KB Output is correct
52 Correct 0 ms 384 KB Output is correct
53 Correct 0 ms 384 KB Output is correct
54 Correct 0 ms 256 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 1 ms 256 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 1 ms 384 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 2 ms 512 KB Output is correct
69 Correct 2 ms 512 KB Output is correct
70 Correct 2 ms 640 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 2 ms 384 KB Output is correct
73 Correct 1 ms 384 KB Output is correct
74 Correct 2 ms 384 KB Output is correct
75 Correct 2 ms 384 KB Output is correct
76 Correct 1 ms 384 KB Output is correct
77 Correct 2 ms 512 KB Output is correct
78 Correct 2 ms 512 KB Output is correct
79 Correct 1 ms 512 KB Output is correct
80 Correct 2 ms 512 KB Output is correct
81 Correct 2 ms 512 KB Output is correct
82 Correct 1 ms 512 KB Output is correct
83 Correct 1 ms 512 KB Output is correct
84 Correct 2 ms 512 KB Output is correct
85 Correct 2 ms 512 KB Output is correct
86 Correct 2 ms 512 KB Output is correct
87 Correct 2 ms 512 KB Output is correct
88 Correct 2 ms 512 KB Output is correct
89 Correct 2 ms 512 KB Output is correct
90 Correct 2 ms 384 KB Output is correct
91 Correct 2 ms 512 KB Output is correct
92 Correct 3 ms 512 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 256 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 1 ms 256 KB Output is correct
45 Correct 0 ms 256 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 0 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 0 ms 384 KB Output is correct
52 Correct 0 ms 384 KB Output is correct
53 Correct 0 ms 384 KB Output is correct
54 Correct 0 ms 256 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 1 ms 256 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 168 ms 20708 KB Output is correct
67 Correct 196 ms 20580 KB Output is correct
68 Correct 180 ms 24156 KB Output is correct
69 Correct 203 ms 22504 KB Output is correct
70 Correct 170 ms 19576 KB Output is correct
71 Correct 176 ms 25400 KB Output is correct
72 Correct 178 ms 17292 KB Output is correct
73 Correct 182 ms 20632 KB Output is correct
74 Correct 242 ms 14164 KB Output is correct
75 Correct 217 ms 15276 KB Output is correct
76 Correct 145 ms 10364 KB Output is correct
77 Correct 183 ms 10232 KB Output is correct
78 Correct 155 ms 9848 KB Output is correct
79 Correct 148 ms 9720 KB Output is correct
80 Correct 90 ms 8568 KB Output is correct
81 Correct 104 ms 8572 KB Output is correct
82 Correct 9 ms 4992 KB Output is correct
83 Correct 8 ms 4992 KB Output is correct
84 Correct 8 ms 4992 KB Output is correct
85 Correct 8 ms 4992 KB Output is correct
86 Correct 8 ms 4992 KB Output is correct
87 Correct 8 ms 4992 KB Output is correct
88 Correct 2 ms 512 KB Output is correct
89 Correct 2 ms 512 KB Output is correct
90 Correct 2 ms 512 KB Output is correct
91 Correct 2 ms 640 KB Output is correct
92 Correct 3 ms 640 KB Output is correct
93 Correct 1 ms 640 KB Output is correct
94 Correct 2 ms 640 KB Output is correct
95 Correct 2 ms 640 KB Output is correct
96 Correct 2 ms 640 KB Output is correct
97 Correct 2 ms 512 KB Output is correct
98 Correct 2 ms 512 KB Output is correct
99 Correct 2 ms 512 KB Output is correct
100 Correct 2 ms 512 KB Output is correct
101 Correct 1 ms 384 KB Output is correct
102 Correct 1 ms 384 KB Output is correct
103 Correct 2 ms 384 KB Output is correct
104 Correct 1 ms 512 KB Output is correct
105 Correct 1 ms 512 KB Output is correct
106 Correct 1 ms 512 KB Output is correct
107 Correct 1 ms 512 KB Output is correct
108 Correct 204 ms 24556 KB Output is correct
109 Correct 189 ms 24556 KB Output is correct
110 Correct 181 ms 24560 KB Output is correct
111 Correct 186 ms 24556 KB Output is correct
112 Correct 189 ms 24464 KB Output is correct
113 Correct 202 ms 36968 KB Output is correct
114 Correct 202 ms 29800 KB Output is correct
115 Correct 196 ms 28440 KB Output is correct
116 Correct 195 ms 27320 KB Output is correct
117 Correct 181 ms 19644 KB Output is correct
118 Correct 235 ms 22892 KB Output is correct
119 Correct 182 ms 15508 KB Output is correct
120 Correct 173 ms 14420 KB Output is correct
121 Correct 165 ms 10488 KB Output is correct
122 Correct 135 ms 9864 KB Output is correct
123 Correct 82 ms 8184 KB Output is correct
124 Correct 128 ms 20712 KB Output is correct
125 Correct 151 ms 20964 KB Output is correct
126 Correct 136 ms 20948 KB Output is correct
127 Correct 132 ms 20764 KB Output is correct
128 Correct 1 ms 512 KB Output is correct
129 Correct 2 ms 512 KB Output is correct
130 Correct 2 ms 512 KB Output is correct
131 Correct 3 ms 504 KB Output is correct
132 Correct 2 ms 512 KB Output is correct
133 Correct 2 ms 512 KB Output is correct
134 Correct 1 ms 512 KB Output is correct
135 Correct 2 ms 512 KB Output is correct
136 Correct 2 ms 512 KB Output is correct
137 Correct 1 ms 512 KB Output is correct
138 Correct 1 ms 512 KB Output is correct
139 Correct 2 ms 640 KB Output is correct
140 Correct 2 ms 640 KB Output is correct
141 Correct 2 ms 640 KB Output is correct
142 Correct 2 ms 512 KB Output is correct
143 Correct 2 ms 512 KB Output is correct
144 Correct 2 ms 512 KB Output is correct
145 Correct 3 ms 512 KB Output is correct
146 Correct 2 ms 384 KB Output is correct
147 Correct 2 ms 384 KB Output is correct
148 Correct 2 ms 512 KB Output is correct
149 Correct 2 ms 512 KB Output is correct
150 Correct 2 ms 512 KB Output is correct
151 Correct 2 ms 512 KB Output is correct
152 Correct 1 ms 384 KB Output is correct
153 Correct 1 ms 384 KB Output is correct
154 Correct 0 ms 384 KB Output is correct
155 Correct 189 ms 24448 KB Output is correct
156 Correct 206 ms 25068 KB Output is correct
157 Correct 270 ms 24660 KB Output is correct
158 Correct 296 ms 23404 KB Output is correct
159 Correct 187 ms 19564 KB Output is correct
160 Correct 229 ms 17900 KB Output is correct
161 Correct 189 ms 16752 KB Output is correct
162 Correct 173 ms 15468 KB Output is correct
163 Correct 169 ms 14956 KB Output is correct
164 Correct 159 ms 14572 KB Output is correct
165 Correct 154 ms 13940 KB Output is correct
166 Correct 149 ms 13808 KB Output is correct
167 Correct 150 ms 13936 KB Output is correct
168 Correct 150 ms 15820 KB Output is correct
169 Correct 244 ms 30796 KB Output is correct
170 Correct 234 ms 29324 KB Output is correct
171 Correct 218 ms 28776 KB Output is correct
172 Correct 244 ms 27372 KB Output is correct
173 Correct 349 ms 22892 KB Output is correct
174 Correct 225 ms 19252 KB Output is correct
175 Correct 232 ms 17060 KB Output is correct
176 Correct 200 ms 13176 KB Output is correct
177 Correct 180 ms 12432 KB Output is correct
178 Correct 207 ms 23920 KB Output is correct
179 Correct 212 ms 23984 KB Output is correct
180 Correct 216 ms 22888 KB Output is correct
181 Correct 243 ms 22760 KB Output is correct
182 Correct 1 ms 384 KB Output is correct
183 Correct 1 ms 384 KB Output is correct
184 Correct 2 ms 512 KB Output is correct
185 Correct 2 ms 512 KB Output is correct
186 Correct 2 ms 640 KB Output is correct
187 Correct 1 ms 384 KB Output is correct
188 Correct 2 ms 384 KB Output is correct
189 Correct 1 ms 384 KB Output is correct
190 Correct 2 ms 384 KB Output is correct
191 Correct 2 ms 384 KB Output is correct
192 Correct 1 ms 384 KB Output is correct
193 Correct 2 ms 512 KB Output is correct
194 Correct 2 ms 512 KB Output is correct
195 Correct 1 ms 512 KB Output is correct
196 Correct 2 ms 512 KB Output is correct
197 Correct 2 ms 512 KB Output is correct
198 Correct 1 ms 512 KB Output is correct
199 Correct 1 ms 512 KB Output is correct
200 Correct 2 ms 512 KB Output is correct
201 Correct 2 ms 512 KB Output is correct
202 Correct 2 ms 512 KB Output is correct
203 Correct 2 ms 512 KB Output is correct
204 Correct 2 ms 512 KB Output is correct
205 Correct 2 ms 512 KB Output is correct
206 Correct 2 ms 384 KB Output is correct
207 Correct 2 ms 512 KB Output is correct
208 Correct 3 ms 512 KB Output is correct
209 Correct 8 ms 4992 KB Output is correct
210 Correct 114 ms 9592 KB Output is correct
211 Correct 236 ms 20716 KB Output is correct
212 Correct 249 ms 24160 KB Output is correct
213 Correct 317 ms 27760 KB Output is correct
214 Correct 144 ms 13100 KB Output is correct
215 Correct 159 ms 13864 KB Output is correct
216 Correct 258 ms 24128 KB Output is correct
217 Correct 227 ms 20756 KB Output is correct
218 Correct 186 ms 15856 KB Output is correct
219 Correct 173 ms 14520 KB Output is correct
220 Correct 185 ms 14000 KB Output is correct
221 Correct 153 ms 13680 KB Output is correct
222 Correct 215 ms 14960 KB Output is correct
223 Correct 268 ms 24040 KB Output is correct
224 Correct 311 ms 23328 KB Output is correct
225 Correct 234 ms 18116 KB Output is correct
226 Correct 241 ms 17044 KB Output is correct
227 Correct 238 ms 16812 KB Output is correct
228 Correct 341 ms 13600 KB Output is correct
229 Correct 176 ms 12664 KB Output is correct
230 Correct 228 ms 19036 KB Output is correct
231 Correct 319 ms 19044 KB Output is correct