oj.uz

Submission #807312

# Submission time Handle Problem Language Result Execution time Memory
807312 2023-08-04T15:45:41 Z bachhoangxuan IOI Fever (JOI21_fever) C++17
100 / 100
 1734 ms 37976 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=100005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int dx[]={2,1,0,-1,-2,-1,0,1},
    dy[]={0,1,2,1,0,-1,-2,-1};

vector<int> c[8][3];
vector<pii> edge[maxn][4];
int dt[maxn][4];

void solve(){
    int n;cin >> n;
    vector<pii> p(n+1);
    for(int i=1;i<=n;i++){
        cin >> p[i].fi >> p[i].se;
        if(i>=2){
            p[i].fi-=p[1].fi,p[i].se-=p[1].se;
            p[i].fi<<=1;p[i].se<<=1;
        }
    }
    p[1]={0,0};
    //0:right 2:up 4:left 6:down
    //1:right-up 3:left-up 5:left-down 7:right-down
    auto cal = [&](){
        auto dist = [&](int i,int j){
            return abs(p[i].fi-p[j].fi)+abs(p[i].se-p[j].se);
        };

        auto get = [&](int i,int t){
            return p[i].fi*dx[t]+p[i].se*dy[t];
        };

        vector<int> dir(n+1,0);
        for(int i=1;i<=n;i++){
            int X=p[i].fi,Y=p[i].se;
            if(X<=-Y && Y>=X) dir[i]=0;
            else if(X<=-Y && Y<X) dir[i]=2;
            else if(X>-Y && Y<X) dir[i]=4;
            else if(X>-Y && Y>=X) dir[i]=6;
            //cout << p[i].fi << ' ' << p[i].se << ' ' << dir[i] << '\n';
        }
        //cout << '\n';
        for(int i=0;i<8;i++) for(int t=0;t<3;t++) c[i][t].clear();
        for(int i=1;i<=n;i++) for(int t=0;t<4;t++) edge[i][t].clear();
        memset(dt,-1,sizeof(dt));

        for(int i=1;i<=n;i++){
            for(int t=0;t<3;t++) c[(dir[i]+2*(t+1))%8][t].push_back(i);
        }

        for(int i=0;i<8;i++){
            for(int t=0;t<3;t++){
                int xt=(i-t+7)%8,yt=(i-t+9)%8;

                sort(c[i][t].begin(),c[i][t].end(),[&get,&xt,&yt](int a,int b){
                    return mpp(get(a,xt),get(a,yt))<mpp(get(b,xt),get(b,yt));
                });
                for(int j=0;j+1<(int)c[i][t].size();j++){
                    int a=c[i][t][j],b=c[i][t][j+1];
                    if(get(a,xt)==get(b,xt)) edge[a][t].push_back({b,dist(a,b)/2});
                }
            }
        }
        priority_queue<piii,vector<piii>,greater<piii>> pq;
        pq.push({0,{1,3}});

        int cnt=0;
        vector<int> check(n+1,0);

        while(!pq.empty()){
            auto [d,pr]=pq.top();pq.pop();
            auto [u,k]=pr;
            //cout << d << ' ' << u << ' ' << k << '\n';
            if(dt[u][k]!=-1) continue;
            dt[u][k]=d;
            if(!check[u]) check[u]=1,cnt++;

            for(auto [v,w]:edge[u][k]) pq.push({d+w,{v,k}});

            int i=dir[u];
            for(int t=0;t<3;t++){
                int xt=(i-t+7)%8,yt=(i-t+9)%8;
                p[0]={p[u].fi+d*dx[yt],p[u].se+d*dy[yt]};
                //cout << p[0].fi << ' ' << p[0].se << '\n';
                auto it=lower_bound(c[i][t].begin(),c[i][t].end(),0,[get,xt,yt](int a,int b){
                    pii aa={get(a,xt),get(a,yt)};
                    pii bb={get(b,xt),get(b,yt)};
                    return aa==bb?a<b:aa<bb;
                });
                //if(it!=c[i][t].end()) cout << i << ' ' << t << ' ' << u << ' ' << *it << '\n';
                if(it==c[i][t].end() || get(0,xt)!=get(*it,xt)) continue;
                pq.push({dist(u,*it)/2,{*it,t}});
            }
        }
        //cout << cnt << '\n';
        return cnt;
    };

    int ans=0;
    for(int t=0;t<4;t++){
        ans=max(ans,cal());
        for(int i=1;i<=n;i++) swap(p[i].fi,p[i].se),p[i].se=-p[i].se;
    }
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12800 KB Output is correct
3 Correct 6 ms 12796 KB Output is correct
4 Correct 6 ms 12804 KB Output is correct
5 Correct 6 ms 12756 KB Output is correct
6 Correct 6 ms 12756 KB Output is correct
7 Correct 6 ms 12756 KB Output is correct
8 Correct 6 ms 12796 KB Output is correct
9 Correct 7 ms 12756 KB Output is correct
10 Correct 6 ms 12800 KB Output is correct
11 Correct 6 ms 12756 KB Output is correct
12 Correct 6 ms 12800 KB Output is correct
13 Correct 7 ms 12804 KB Output is correct
14 Correct 6 ms 12756 KB Output is correct
15 Correct 6 ms 12816 KB Output is correct
16 Correct 6 ms 12788 KB Output is correct
17 Correct 6 ms 12800 KB Output is correct
18 Correct 6 ms 12756 KB Output is correct
19 Correct 6 ms 12756 KB Output is correct
20 Correct 6 ms 12756 KB Output is correct
21 Correct 6 ms 12756 KB Output is correct
22 Correct 7 ms 12756 KB Output is correct
23 Correct 6 ms 12780 KB Output is correct
24 Correct 7 ms 12756 KB Output is correct
25 Correct 6 ms 12756 KB Output is correct
26 Correct 6 ms 12756 KB Output is correct
27 Correct 6 ms 12756 KB Output is correct
28 Correct 6 ms 12756 KB Output is correct
29 Correct 6 ms 12756 KB Output is correct
30 Correct 6 ms 12796 KB Output is correct
31 Correct 6 ms 12804 KB Output is correct
32 Correct 6 ms 12756 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12800 KB Output is correct
3 Correct 6 ms 12796 KB Output is correct
4 Correct 6 ms 12804 KB Output is correct
5 Correct 6 ms 12756 KB Output is correct
6 Correct 6 ms 12756 KB Output is correct
7 Correct 6 ms 12756 KB Output is correct
8 Correct 6 ms 12796 KB Output is correct
9 Correct 7 ms 12756 KB Output is correct
10 Correct 6 ms 12800 KB Output is correct
11 Correct 6 ms 12756 KB Output is correct
12 Correct 6 ms 12800 KB Output is correct
13 Correct 7 ms 12804 KB Output is correct
14 Correct 6 ms 12756 KB Output is correct
15 Correct 6 ms 12816 KB Output is correct
16 Correct 6 ms 12788 KB Output is correct
17 Correct 6 ms 12800 KB Output is correct
18 Correct 6 ms 12756 KB Output is correct
19 Correct 6 ms 12756 KB Output is correct
20 Correct 6 ms 12756 KB Output is correct
21 Correct 6 ms 12756 KB Output is correct
22 Correct 7 ms 12756 KB Output is correct
23 Correct 6 ms 12780 KB Output is correct
24 Correct 7 ms 12756 KB Output is correct
25 Correct 6 ms 12756 KB Output is correct
26 Correct 6 ms 12756 KB Output is correct
27 Correct 6 ms 12756 KB Output is correct
28 Correct 6 ms 12756 KB Output is correct
29 Correct 6 ms 12756 KB Output is correct
30 Correct 6 ms 12796 KB Output is correct
31 Correct 6 ms 12804 KB Output is correct
32 Correct 6 ms 12756 KB Output is correct
33 Correct 5 ms 12756 KB Output is correct
34 Correct 6 ms 12756 KB Output is correct
35 Correct 6 ms 12808 KB Output is correct
36 Correct 6 ms 12796 KB Output is correct
37 Correct 7 ms 12800 KB Output is correct
38 Correct 7 ms 12796 KB Output is correct
39 Correct 6 ms 12756 KB Output is correct
40 Correct 7 ms 12800 KB Output is correct
41 Correct 6 ms 12836 KB Output is correct
42 Correct 8 ms 12808 KB Output is correct
43 Correct 6 ms 12796 KB Output is correct
44 Correct 6 ms 12756 KB Output is correct
45 Correct 6 ms 12800 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12756 KB Output is correct
3 Correct 7 ms 12756 KB Output is correct
4 Correct 6 ms 12800 KB Output is correct
5 Correct 6 ms 12816 KB Output is correct
6 Correct 6 ms 12800 KB Output is correct
7 Correct 6 ms 12756 KB Output is correct
8 Correct 6 ms 12756 KB Output is correct

Subtask #4
6.0 / 6.0

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

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12800 KB Output is correct
3 Correct 6 ms 12796 KB Output is correct
4 Correct 6 ms 12804 KB Output is correct
5 Correct 6 ms 12756 KB Output is correct
6 Correct 6 ms 12756 KB Output is correct
7 Correct 6 ms 12756 KB Output is correct
8 Correct 6 ms 12796 KB Output is correct
9 Correct 7 ms 12756 KB Output is correct
10 Correct 6 ms 12800 KB Output is correct
11 Correct 6 ms 12756 KB Output is correct
12 Correct 6 ms 12800 KB Output is correct
13 Correct 7 ms 12804 KB Output is correct
14 Correct 6 ms 12756 KB Output is correct
15 Correct 6 ms 12816 KB Output is correct
16 Correct 6 ms 12788 KB Output is correct
17 Correct 6 ms 12800 KB Output is correct
18 Correct 6 ms 12756 KB Output is correct
19 Correct 6 ms 12756 KB Output is correct
20 Correct 6 ms 12756 KB Output is correct
21 Correct 6 ms 12756 KB Output is correct
22 Correct 7 ms 12756 KB Output is correct
23 Correct 6 ms 12780 KB Output is correct
24 Correct 7 ms 12756 KB Output is correct
25 Correct 6 ms 12756 KB Output is correct
26 Correct 6 ms 12756 KB Output is correct
27 Correct 6 ms 12756 KB Output is correct
28 Correct 6 ms 12756 KB Output is correct
29 Correct 6 ms 12756 KB Output is correct
30 Correct 6 ms 12796 KB Output is correct
31 Correct 6 ms 12804 KB Output is correct
32 Correct 6 ms 12756 KB Output is correct
33 Correct 5 ms 12756 KB Output is correct
34 Correct 6 ms 12756 KB Output is correct
35 Correct 6 ms 12808 KB Output is correct
36 Correct 6 ms 12796 KB Output is correct
37 Correct 7 ms 12800 KB Output is correct
38 Correct 7 ms 12796 KB Output is correct
39 Correct 6 ms 12756 KB Output is correct
40 Correct 7 ms 12800 KB Output is correct
41 Correct 6 ms 12836 KB Output is correct
42 Correct 8 ms 12808 KB Output is correct
43 Correct 6 ms 12796 KB Output is correct
44 Correct 6 ms 12756 KB Output is correct
45 Correct 6 ms 12800 KB Output is correct
46 Correct 6 ms 12756 KB Output is correct
47 Correct 6 ms 12756 KB Output is correct
48 Correct 7 ms 12756 KB Output is correct
49 Correct 6 ms 12800 KB Output is correct
50 Correct 6 ms 12816 KB Output is correct
51 Correct 6 ms 12800 KB Output is correct
52 Correct 6 ms 12756 KB Output is correct
53 Correct 6 ms 12756 KB Output is correct
54 Correct 6 ms 12756 KB Output is correct
55 Correct 6 ms 12756 KB Output is correct
56 Correct 6 ms 12756 KB Output is correct
57 Correct 6 ms 12800 KB Output is correct
58 Correct 6 ms 12804 KB Output is correct
59 Correct 6 ms 12756 KB Output is correct
60 Correct 6 ms 12756 KB Output is correct
61 Correct 6 ms 12756 KB Output is correct
62 Correct 6 ms 12756 KB Output is correct
63 Correct 6 ms 12796 KB Output is correct
64 Correct 6 ms 12756 KB Output is correct
65 Correct 6 ms 12756 KB Output is correct
66 Correct 10 ms 13192 KB Output is correct
67 Correct 10 ms 13316 KB Output is correct
68 Correct 10 ms 13172 KB Output is correct
69 Correct 30 ms 13476 KB Output is correct
70 Correct 14 ms 13396 KB Output is correct
71 Correct 14 ms 13312 KB Output is correct
72 Correct 10 ms 13192 KB Output is correct
73 Correct 10 ms 13148 KB Output is correct
74 Correct 10 ms 13352 KB Output is correct
75 Correct 11 ms 13396 KB Output is correct
76 Correct 11 ms 13140 KB Output is correct
77 Correct 13 ms 13388 KB Output is correct
78 Correct 10 ms 13140 KB Output is correct
79 Correct 10 ms 13160 KB Output is correct
80 Correct 10 ms 13012 KB Output is correct
81 Correct 10 ms 13128 KB Output is correct
82 Correct 10 ms 13352 KB Output is correct
83 Correct 10 ms 13396 KB Output is correct
84 Correct 10 ms 13580 KB Output is correct
85 Correct 10 ms 13652 KB Output is correct
86 Correct 13 ms 13440 KB Output is correct
87 Correct 10 ms 13524 KB Output is correct
88 Correct 9 ms 13396 KB Output is correct
89 Correct 10 ms 13068 KB Output is correct
90 Correct 11 ms 13136 KB Output is correct

Subtask #6
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12800 KB Output is correct
3 Correct 6 ms 12796 KB Output is correct
4 Correct 6 ms 12804 KB Output is correct
5 Correct 6 ms 12756 KB Output is correct
6 Correct 6 ms 12756 KB Output is correct
7 Correct 6 ms 12756 KB Output is correct
8 Correct 6 ms 12796 KB Output is correct
9 Correct 7 ms 12756 KB Output is correct
10 Correct 6 ms 12800 KB Output is correct
11 Correct 6 ms 12756 KB Output is correct
12 Correct 6 ms 12800 KB Output is correct
13 Correct 7 ms 12804 KB Output is correct
14 Correct 6 ms 12756 KB Output is correct
15 Correct 6 ms 12816 KB Output is correct
16 Correct 6 ms 12788 KB Output is correct
17 Correct 6 ms 12800 KB Output is correct
18 Correct 6 ms 12756 KB Output is correct
19 Correct 6 ms 12756 KB Output is correct
20 Correct 6 ms 12756 KB Output is correct
21 Correct 6 ms 12756 KB Output is correct
22 Correct 7 ms 12756 KB Output is correct
23 Correct 6 ms 12780 KB Output is correct
24 Correct 7 ms 12756 KB Output is correct
25 Correct 6 ms 12756 KB Output is correct
26 Correct 6 ms 12756 KB Output is correct
27 Correct 6 ms 12756 KB Output is correct
28 Correct 6 ms 12756 KB Output is correct
29 Correct 6 ms 12756 KB Output is correct
30 Correct 6 ms 12796 KB Output is correct
31 Correct 6 ms 12804 KB Output is correct
32 Correct 6 ms 12756 KB Output is correct
33 Correct 5 ms 12756 KB Output is correct
34 Correct 6 ms 12756 KB Output is correct
35 Correct 6 ms 12808 KB Output is correct
36 Correct 6 ms 12796 KB Output is correct
37 Correct 7 ms 12800 KB Output is correct
38 Correct 7 ms 12796 KB Output is correct
39 Correct 6 ms 12756 KB Output is correct
40 Correct 7 ms 12800 KB Output is correct
41 Correct 6 ms 12836 KB Output is correct
42 Correct 8 ms 12808 KB Output is correct
43 Correct 6 ms 12796 KB Output is correct
44 Correct 6 ms 12756 KB Output is correct
45 Correct 6 ms 12800 KB Output is correct
46 Correct 6 ms 12756 KB Output is correct
47 Correct 6 ms 12756 KB Output is correct
48 Correct 7 ms 12756 KB Output is correct
49 Correct 6 ms 12800 KB Output is correct
50 Correct 6 ms 12816 KB Output is correct
51 Correct 6 ms 12800 KB Output is correct
52 Correct 6 ms 12756 KB Output is correct
53 Correct 6 ms 12756 KB Output is correct
54 Correct 6 ms 12756 KB Output is correct
55 Correct 6 ms 12756 KB Output is correct
56 Correct 6 ms 12756 KB Output is correct
57 Correct 6 ms 12800 KB Output is correct
58 Correct 6 ms 12804 KB Output is correct
59 Correct 6 ms 12756 KB Output is correct
60 Correct 6 ms 12756 KB Output is correct
61 Correct 6 ms 12756 KB Output is correct
62 Correct 6 ms 12756 KB Output is correct
63 Correct 6 ms 12796 KB Output is correct
64 Correct 6 ms 12756 KB Output is correct
65 Correct 6 ms 12756 KB Output is correct
66 Correct 156 ms 20164 KB Output is correct
67 Correct 213 ms 23700 KB Output is correct
68 Correct 192 ms 24940 KB Output is correct
69 Correct 265 ms 31252 KB Output is correct
70 Correct 292 ms 28396 KB Output is correct
71 Correct 190 ms 23364 KB Output is correct
72 Correct 191 ms 22852 KB Output is correct
73 Correct 239 ms 30912 KB Output is correct
74 Correct 190 ms 22952 KB Output is correct
75 Correct 197 ms 21084 KB Output is correct
76 Correct 248 ms 23892 KB Output is correct
77 Correct 192 ms 20596 KB Output is correct
78 Correct 250 ms 20736 KB Output is correct
79 Correct 251 ms 20480 KB Output is correct

Subtask #7
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12800 KB Output is correct
3 Correct 6 ms 12796 KB Output is correct
4 Correct 6 ms 12804 KB Output is correct
5 Correct 6 ms 12756 KB Output is correct
6 Correct 6 ms 12756 KB Output is correct
7 Correct 6 ms 12756 KB Output is correct
8 Correct 6 ms 12796 KB Output is correct
9 Correct 7 ms 12756 KB Output is correct
10 Correct 6 ms 12800 KB Output is correct
11 Correct 6 ms 12756 KB Output is correct
12 Correct 6 ms 12800 KB Output is correct
13 Correct 7 ms 12804 KB Output is correct
14 Correct 6 ms 12756 KB Output is correct
15 Correct 6 ms 12816 KB Output is correct
16 Correct 6 ms 12788 KB Output is correct
17 Correct 6 ms 12800 KB Output is correct
18 Correct 6 ms 12756 KB Output is correct
19 Correct 6 ms 12756 KB Output is correct
20 Correct 6 ms 12756 KB Output is correct
21 Correct 6 ms 12756 KB Output is correct
22 Correct 7 ms 12756 KB Output is correct
23 Correct 6 ms 12780 KB Output is correct
24 Correct 7 ms 12756 KB Output is correct
25 Correct 6 ms 12756 KB Output is correct
26 Correct 6 ms 12756 KB Output is correct
27 Correct 6 ms 12756 KB Output is correct
28 Correct 6 ms 12756 KB Output is correct
29 Correct 6 ms 12756 KB Output is correct
30 Correct 6 ms 12796 KB Output is correct
31 Correct 6 ms 12804 KB Output is correct
32 Correct 6 ms 12756 KB Output is correct
33 Correct 5 ms 12756 KB Output is correct
34 Correct 6 ms 12756 KB Output is correct
35 Correct 6 ms 12808 KB Output is correct
36 Correct 6 ms 12796 KB Output is correct
37 Correct 7 ms 12800 KB Output is correct
38 Correct 7 ms 12796 KB Output is correct
39 Correct 6 ms 12756 KB Output is correct
40 Correct 7 ms 12800 KB Output is correct
41 Correct 6 ms 12836 KB Output is correct
42 Correct 8 ms 12808 KB Output is correct
43 Correct 6 ms 12796 KB Output is correct
44 Correct 6 ms 12756 KB Output is correct
45 Correct 6 ms 12800 KB Output is correct
46 Correct 6 ms 12756 KB Output is correct
47 Correct 6 ms 12756 KB Output is correct
48 Correct 7 ms 12756 KB Output is correct
49 Correct 6 ms 12800 KB Output is correct
50 Correct 6 ms 12816 KB Output is correct
51 Correct 6 ms 12800 KB Output is correct
52 Correct 6 ms 12756 KB Output is correct
53 Correct 6 ms 12756 KB Output is correct
54 Correct 6 ms 12756 KB Output is correct
55 Correct 6 ms 12756 KB Output is correct
56 Correct 6 ms 12756 KB Output is correct
57 Correct 6 ms 12800 KB Output is correct
58 Correct 6 ms 12804 KB Output is correct
59 Correct 6 ms 12756 KB Output is correct
60 Correct 6 ms 12756 KB Output is correct
61 Correct 6 ms 12756 KB Output is correct
62 Correct 6 ms 12756 KB Output is correct
63 Correct 6 ms 12796 KB Output is correct
64 Correct 6 ms 12756 KB Output is correct
65 Correct 6 ms 12756 KB Output is correct
66 Correct 10 ms 13192 KB Output is correct
67 Correct 10 ms 13316 KB Output is correct
68 Correct 10 ms 13172 KB Output is correct
69 Correct 30 ms 13476 KB Output is correct
70 Correct 14 ms 13396 KB Output is correct
71 Correct 14 ms 13312 KB Output is correct
72 Correct 10 ms 13192 KB Output is correct
73 Correct 10 ms 13148 KB Output is correct
74 Correct 10 ms 13352 KB Output is correct
75 Correct 11 ms 13396 KB Output is correct
76 Correct 11 ms 13140 KB Output is correct
77 Correct 13 ms 13388 KB Output is correct
78 Correct 10 ms 13140 KB Output is correct
79 Correct 10 ms 13160 KB Output is correct
80 Correct 10 ms 13012 KB Output is correct
81 Correct 10 ms 13128 KB Output is correct
82 Correct 10 ms 13352 KB Output is correct
83 Correct 10 ms 13396 KB Output is correct
84 Correct 10 ms 13580 KB Output is correct
85 Correct 10 ms 13652 KB Output is correct
86 Correct 13 ms 13440 KB Output is correct
87 Correct 10 ms 13524 KB Output is correct
88 Correct 9 ms 13396 KB Output is correct
89 Correct 10 ms 13068 KB Output is correct
90 Correct 11 ms 13136 KB Output is correct
91 Correct 156 ms 20164 KB Output is correct
92 Correct 213 ms 23700 KB Output is correct
93 Correct 192 ms 24940 KB Output is correct
94 Correct 265 ms 31252 KB Output is correct
95 Correct 292 ms 28396 KB Output is correct
96 Correct 190 ms 23364 KB Output is correct
97 Correct 191 ms 22852 KB Output is correct
98 Correct 239 ms 30912 KB Output is correct
99 Correct 190 ms 22952 KB Output is correct
100 Correct 197 ms 21084 KB Output is correct
101 Correct 248 ms 23892 KB Output is correct
102 Correct 192 ms 20596 KB Output is correct
103 Correct 250 ms 20736 KB Output is correct
104 Correct 251 ms 20480 KB Output is correct
105 Correct 710 ms 29060 KB Output is correct
106 Correct 782 ms 32308 KB Output is correct
107 Correct 1734 ms 29948 KB Output is correct
108 Correct 921 ms 32020 KB Output is correct
109 Correct 280 ms 30068 KB Output is correct
110 Correct 232 ms 25612 KB Output is correct
111 Correct 217 ms 23596 KB Output is correct
112 Correct 205 ms 22984 KB Output is correct
113 Correct 197 ms 20700 KB Output is correct
114 Correct 669 ms 32100 KB Output is correct
115 Correct 252 ms 28724 KB Output is correct
116 Correct 197 ms 23040 KB Output is correct
117 Correct 204 ms 20792 KB Output is correct
118 Correct 481 ms 24928 KB Output is correct
119 Correct 292 ms 24592 KB Output is correct
120 Correct 190 ms 20924 KB Output is correct
121 Correct 207 ms 21284 KB Output is correct
122 Correct 262 ms 21304 KB Output is correct
123 Correct 251 ms 30488 KB Output is correct
124 Correct 256 ms 30976 KB Output is correct
125 Correct 101 ms 34652 KB Output is correct
126 Correct 175 ms 37500 KB Output is correct
127 Correct 238 ms 33392 KB Output is correct
128 Correct 181 ms 37976 KB Output is correct
129 Correct 135 ms 36380 KB Output is correct