oj.uz

Submission #974171

# Submission time Handle Problem Language Result Execution time Memory
974171 2024-05-03T03:40:32 Z modwwe Event Hopping 2 (JOI21_event2) C++17
100 / 100
 215 ms 97864 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void ngha();
const int mod2=1e9+7;
const int  mod1=998244353;
struct ib
{
    int a;
    int b;
};
struct icd
{
    int a,b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int el=29;
main()
{
//#ifndef ONLINE_JUDGE
   /// fin(task),fou(task);
//#endif
    NHP
//modwwe
    //  cin>>res;
    ngha();

}
ic bit[1000001];
int bit2[1000001];
ic a[500002];
int b[500001];
ic c[500001];
int st[18][1000003];
int g[1000003];
vector<int>v;
vector<int> v2;
bool cmp(ic a,ic b)
{
    return a.a<b.a;
}

void upd(int x,int y,int z,int cc)
{
    for(x; x<=2*n; x+=x&-x)
    {
        if(y>bit[x].a)
            bit[x].a=y,bit[x].b=z,bit[x].c=cc;
    }
    ///bit[x]=max(bit[x],y);
}
ic get(int x)
{
    int ss=0;
    for(x; x; x-=x&-x)
    {
        if(bit[x].a>bit[ss].a)ss=x;
    }
    return bit[ss];
}
void upd2(int x,int y)
{
    for(x; x; x-=x&-x)bit2[x]=min(bit2[x],y);
}
int get2(int x)
{
    int ss=1e9+1;
    for(x; x<=2*n; x+=x&-x) //cout<<x<<" "<<bit2[x]<<" "<<ss,down
    {
        ss=min(bit2[x],ss);
    }
    return ss;
}
int get3(int x,int y)
{
    int ss=0;
    for(int j=17; j>=0; --j)
    {
        if(g[st[j][x]]<=y)
        {
            //  cout<<g[st[j][x]]<<" "<<st[j][x]<<" "<<j<<" "<<x,down
            //if(j==17) cout<<j<<" "<<st[j][x],down
            x=st[j][x];
            ss+=(1<<j);
        }
    }
    return ss;
}
int get4(int x,int y)
{
    int ss=0;
    for(int j=17; j>=0; --j)
    {
        if(g[st[j][x]]<=y)
        {
            //  cout<<g[st[j][x]]<<" "<<st[j][x]<<" "<<j<<" "<<x,down
            //if(j==17) cout<<j<<" "<<st[j][x],down
            x=st[j][x];
            ss+=(1<<j);
        }
    }
    return ss;
}
vector<int> v3;
void ngha()
{
    cin>>n>>k;
    for(int i=1; i<=n; i++)
        cin>>a[i].a>>a[i].b,v.pb(a[i].a),v.pb(a[i].b),v3.pb(a[i].a),a[i].c=i;
    v3.pb(0);
    v3.pb(1e9+1);
    sort(v.begin(),v.end());
    sort(v3.begin(),v3.end());
    for(int i=1; i<=n; i++)
        a[i].a=lower_bound(v.begin(),v.end(),a[i].a)-v.begin()+1,
            a[i].b=lower_bound(v.begin(),v.end(),a[i].b)-v.begin()+1;
    ///c[i]=a[i];
    for(int i=1; i<=n; i++) c[i]=a[i];
    sort(a+1,a+1+n,cmp);
/// nhay nhi phan :/
    s2=a[n].b;
    s3=n;
    b[n]=n;
    b[n+1]=n+1;
    a[n+1].a=1e9+1;
    a[n+1].c=n+1;
    for(int i=0; i<=17; i++)
        st[i][n+1]=n+1;
    for(int i=n-1; i>=1; --i)
    {
        if(a[i].b<s2) s2=a[i].b,s3=i;
        b[i]=s3;
    }
    g[n+1]=1e9;
    for(int i=0; i<=n; ++i)
    {
        l=i+1;
        r=n;
        while(l<=r)
        {
            int mid=l+r>>1;
            if(a[mid].a>=a[i].b) r=mid-1;
            else l=mid+1;
        }
        st[0][a[i].c]=a[b[r+1]].c;
        if(a[r+1].a==1e9+1)
        {s8=lower_bound(v3.begin(),v3.end(),a[r+1].a)-v3.begin();
            if(g[a[i].c]==0) g[a[i].c]=s8;
            g[a[i].c]=min(g[a[i].c],s8);
        }
        else
        { s8=lower_bound(v3.begin(),v3.end(),v[a[r+1].a-1])-v3.begin();
            if(g[a[i].c]==0) g[a[i].c]=s8;
            g[a[i].c]=min(g[a[i].c],s8);
        }
        // cout<<i<<" "<<a[i].a<<" "<<b[r+1]<<" "<<a[b[r+1]].a<<" "<<r+1,down
///if(a[i].c==3) cout<<r+1<<" "<<g[a[i].c],down
    }
    for(int i=1; i<18; i++)
        for(int j=0; j<=n*2; j++)
            st[i][j]=st[i-1][st[i-1][j]];
    for(int i=1; i<=n*2; i++)
        bit[i]= {0,0,0},bit2[i]=1e9+1;
    for(int i=1; i<=n; i++)
        a[i]=c[i];
    /// cout<<get3(1,4)<<" "<<get3(0,2),down
    /// cout<<get3(0,2),down
    ///  cout<<st[0][1],down
    dem=0;
    // cout<<get3(1,11);
    mx2=get3(0,n+1);
    for(int i=1; i<=n; i++)
    {
        //cout<<i,down
        if(dem==k)
        {
            break;
        }
        ic ss2=get(a[i].a);
        if(ss2.b>a[i].a) continue;

        s2=ss2.c;
        s3=get2(a[i].a);
        if(a[i].b>s3) continue;
        if(s3==1e9+1) s3=lower_bound(v3.begin(),v3.end(),s3)-v3.begin();
        else s3=lower_bound(v3.begin(),v3.end(),v[s3-1])-v3.begin();
        s9=lower_bound(v3.begin(),v3.end(),v[a[i].a-1])-v3.begin();
        if(mx2-get3(s2,s3)+get3(s2,s9)+get3(i,s3)+1>=k)
        {
            mx2=mx2-get3(s2,s3)+get3(s2,s9)+get3(i,s3)+1;
            dem++;
            upd(a[i].a,a[i].a,a[i].b,i);
            upd2(a[i].a,a[i].a);
            v2.pb(i);

        }
    }
    if(dem==k)
        for(auto x:v2)
            cout<<x,down
                else cout<<-1;
}
/*
4 3
21 54
86 92
85 90
90 101



*/

Compilation message

event2.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~
event2.cpp: In function 'void upd(long long int, long long int, long long int, long long int)':
event2.cpp:72:9: warning: statement has no effect [-Wunused-value]
   72 |     for(x; x<=2*n; x+=x&-x)
      |         ^
event2.cpp: In function 'ic get(long long int)':
event2.cpp:82:9: warning: statement has no effect [-Wunused-value]
   82 |     for(x; x; x-=x&-x)
      |         ^
event2.cpp: In function 'void upd2(long long int, long long int)':
event2.cpp:90:9: warning: statement has no effect [-Wunused-value]
   90 |     for(x; x; x-=x&-x)bit2[x]=min(bit2[x],y);
      |         ^
event2.cpp: In function 'long long int get2(long long int)':
event2.cpp:95:9: warning: statement has no effect [-Wunused-value]
   95 |     for(x; x<=2*n; x+=x&-x) //cout<<x<<" "<<bit2[x]<<" "<<ss,down
      |         ^
event2.cpp: In function 'void ngha()':
event2.cpp:168:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  168 |             int mid=l+r>>1;
      |                     ~^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47452 KB Output is correct
2 Correct 7 ms 47452 KB Output is correct
3 Correct 7 ms 47452 KB Output is correct
4 Correct 119 ms 97340 KB Output is correct
5 Correct 100 ms 97352 KB Output is correct
6 Correct 98 ms 97344 KB Output is correct
7 Correct 94 ms 97092 KB Output is correct
8 Correct 101 ms 97432 KB Output is correct
9 Correct 99 ms 97344 KB Output is correct
10 Correct 97 ms 97236 KB Output is correct
11 Correct 95 ms 97180 KB Output is correct
12 Correct 89 ms 96528 KB Output is correct
13 Correct 87 ms 96368 KB Output is correct
14 Correct 86 ms 96460 KB Output is correct
15 Correct 87 ms 96580 KB Output is correct
16 Correct 72 ms 96064 KB Output is correct
17 Correct 70 ms 96068 KB Output is correct
18 Correct 71 ms 96064 KB Output is correct
19 Correct 69 ms 96068 KB Output is correct
20 Correct 70 ms 96576 KB Output is correct
21 Correct 66 ms 96064 KB Output is correct
22 Correct 73 ms 96612 KB Output is correct
23 Correct 72 ms 96068 KB Output is correct
24 Correct 72 ms 96076 KB Output is correct
25 Correct 80 ms 96228 KB Output is correct
26 Correct 82 ms 96068 KB Output is correct
27 Correct 81 ms 96148 KB Output is correct
28 Correct 80 ms 96220 KB Output is correct
29 Correct 86 ms 96144 KB Output is correct
30 Correct 95 ms 96140 KB Output is correct
31 Correct 81 ms 96064 KB Output is correct
32 Correct 87 ms 96072 KB Output is correct
33 Correct 96 ms 96148 KB Output is correct
34 Correct 84 ms 96348 KB Output is correct
35 Correct 70 ms 96324 KB Output is correct
36 Correct 63 ms 96156 KB Output is correct
37 Correct 88 ms 96320 KB Output is correct
38 Correct 92 ms 96324 KB Output is correct
39 Correct 81 ms 96396 KB Output is correct
40 Correct 80 ms 96404 KB Output is correct
41 Correct 80 ms 96396 KB Output is correct
42 Correct 92 ms 96456 KB Output is correct
43 Correct 93 ms 96324 KB Output is correct
44 Correct 91 ms 96412 KB Output is correct
45 Correct 90 ms 96468 KB Output is correct
46 Correct 95 ms 96324 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 47448 KB Output is correct
2 Correct 6 ms 47452 KB Output is correct
3 Correct 6 ms 47452 KB Output is correct
4 Correct 6 ms 47452 KB Output is correct
5 Correct 6 ms 47568 KB Output is correct
6 Correct 6 ms 47448 KB Output is correct
7 Correct 5 ms 47452 KB Output is correct
8 Correct 6 ms 47452 KB Output is correct
9 Correct 5 ms 47452 KB Output is correct
10 Correct 6 ms 47452 KB Output is correct
11 Correct 5 ms 47452 KB Output is correct
12 Correct 6 ms 47452 KB Output is correct
13 Correct 6 ms 47608 KB Output is correct
14 Correct 5 ms 47452 KB Output is correct
15 Correct 6 ms 47592 KB Output is correct
16 Correct 6 ms 47568 KB Output is correct
17 Correct 6 ms 47452 KB Output is correct
18 Correct 5 ms 47620 KB Output is correct
19 Correct 5 ms 47452 KB Output is correct
20 Correct 6 ms 47452 KB Output is correct
21 Correct 5 ms 47452 KB Output is correct
22 Correct 6 ms 47448 KB Output is correct
23 Correct 6 ms 47452 KB Output is correct
24 Correct 5 ms 47452 KB Output is correct
25 Correct 6 ms 47452 KB Output is correct
26 Correct 5 ms 47452 KB Output is correct
27 Correct 5 ms 47452 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 47448 KB Output is correct
2 Correct 6 ms 47452 KB Output is correct
3 Correct 6 ms 47452 KB Output is correct
4 Correct 6 ms 47452 KB Output is correct
5 Correct 6 ms 47568 KB Output is correct
6 Correct 6 ms 47448 KB Output is correct
7 Correct 5 ms 47452 KB Output is correct
8 Correct 6 ms 47452 KB Output is correct
9 Correct 5 ms 47452 KB Output is correct
10 Correct 6 ms 47452 KB Output is correct
11 Correct 5 ms 47452 KB Output is correct
12 Correct 6 ms 47452 KB Output is correct
13 Correct 6 ms 47608 KB Output is correct
14 Correct 5 ms 47452 KB Output is correct
15 Correct 6 ms 47592 KB Output is correct
16 Correct 6 ms 47568 KB Output is correct
17 Correct 6 ms 47452 KB Output is correct
18 Correct 5 ms 47620 KB Output is correct
19 Correct 5 ms 47452 KB Output is correct
20 Correct 6 ms 47452 KB Output is correct
21 Correct 5 ms 47452 KB Output is correct
22 Correct 6 ms 47448 KB Output is correct
23 Correct 6 ms 47452 KB Output is correct
24 Correct 5 ms 47452 KB Output is correct
25 Correct 6 ms 47452 KB Output is correct
26 Correct 5 ms 47452 KB Output is correct
27 Correct 5 ms 47452 KB Output is correct
28 Correct 8 ms 49756 KB Output is correct
29 Correct 8 ms 49756 KB Output is correct
30 Correct 8 ms 49896 KB Output is correct
31 Correct 8 ms 49756 KB Output is correct
32 Correct 8 ms 49904 KB Output is correct
33 Correct 9 ms 49756 KB Output is correct
34 Correct 8 ms 49756 KB Output is correct
35 Correct 9 ms 49756 KB Output is correct
36 Correct 10 ms 49752 KB Output is correct
37 Correct 8 ms 49752 KB Output is correct
38 Correct 9 ms 49840 KB Output is correct
39 Correct 9 ms 49752 KB Output is correct
40 Correct 9 ms 49756 KB Output is correct
41 Correct 9 ms 49756 KB Output is correct
42 Correct 9 ms 49756 KB Output is correct
43 Correct 8 ms 49756 KB Output is correct
44 Correct 8 ms 49756 KB Output is correct
45 Correct 8 ms 49748 KB Output is correct
46 Correct 9 ms 49756 KB Output is correct
47 Correct 8 ms 49756 KB Output is correct
48 Correct 8 ms 50000 KB Output is correct
49 Correct 8 ms 49752 KB Output is correct
50 Correct 8 ms 49756 KB Output is correct
51 Correct 8 ms 49840 KB Output is correct
52 Correct 8 ms 49752 KB Output is correct
53 Correct 8 ms 49756 KB Output is correct
54 Correct 8 ms 49756 KB Output is correct
55 Correct 8 ms 49756 KB Output is correct
56 Correct 8 ms 49836 KB Output is correct
57 Correct 9 ms 49756 KB Output is correct
58 Correct 9 ms 49712 KB Output is correct
59 Correct 8 ms 49752 KB Output is correct
60 Correct 8 ms 49752 KB Output is correct
61 Correct 8 ms 49756 KB Output is correct
62 Correct 8 ms 49756 KB Output is correct
63 Correct 8 ms 49756 KB Output is correct
64 Correct 8 ms 49908 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47452 KB Output is correct
2 Correct 7 ms 47452 KB Output is correct
3 Correct 7 ms 47452 KB Output is correct
4 Correct 119 ms 97340 KB Output is correct
5 Correct 100 ms 97352 KB Output is correct
6 Correct 98 ms 97344 KB Output is correct
7 Correct 94 ms 97092 KB Output is correct
8 Correct 101 ms 97432 KB Output is correct
9 Correct 99 ms 97344 KB Output is correct
10 Correct 97 ms 97236 KB Output is correct
11 Correct 95 ms 97180 KB Output is correct
12 Correct 89 ms 96528 KB Output is correct
13 Correct 87 ms 96368 KB Output is correct
14 Correct 86 ms 96460 KB Output is correct
15 Correct 87 ms 96580 KB Output is correct
16 Correct 72 ms 96064 KB Output is correct
17 Correct 70 ms 96068 KB Output is correct
18 Correct 71 ms 96064 KB Output is correct
19 Correct 69 ms 96068 KB Output is correct
20 Correct 70 ms 96576 KB Output is correct
21 Correct 66 ms 96064 KB Output is correct
22 Correct 73 ms 96612 KB Output is correct
23 Correct 72 ms 96068 KB Output is correct
24 Correct 72 ms 96076 KB Output is correct
25 Correct 80 ms 96228 KB Output is correct
26 Correct 82 ms 96068 KB Output is correct
27 Correct 81 ms 96148 KB Output is correct
28 Correct 80 ms 96220 KB Output is correct
29 Correct 86 ms 96144 KB Output is correct
30 Correct 95 ms 96140 KB Output is correct
31 Correct 81 ms 96064 KB Output is correct
32 Correct 87 ms 96072 KB Output is correct
33 Correct 96 ms 96148 KB Output is correct
34 Correct 84 ms 96348 KB Output is correct
35 Correct 70 ms 96324 KB Output is correct
36 Correct 63 ms 96156 KB Output is correct
37 Correct 88 ms 96320 KB Output is correct
38 Correct 92 ms 96324 KB Output is correct
39 Correct 81 ms 96396 KB Output is correct
40 Correct 80 ms 96404 KB Output is correct
41 Correct 80 ms 96396 KB Output is correct
42 Correct 92 ms 96456 KB Output is correct
43 Correct 93 ms 96324 KB Output is correct
44 Correct 91 ms 96412 KB Output is correct
45 Correct 90 ms 96468 KB Output is correct
46 Correct 95 ms 96324 KB Output is correct
47 Correct 5 ms 47448 KB Output is correct
48 Correct 6 ms 47452 KB Output is correct
49 Correct 6 ms 47452 KB Output is correct
50 Correct 6 ms 47452 KB Output is correct
51 Correct 6 ms 47568 KB Output is correct
52 Correct 6 ms 47448 KB Output is correct
53 Correct 5 ms 47452 KB Output is correct
54 Correct 6 ms 47452 KB Output is correct
55 Correct 5 ms 47452 KB Output is correct
56 Correct 6 ms 47452 KB Output is correct
57 Correct 5 ms 47452 KB Output is correct
58 Correct 6 ms 47452 KB Output is correct
59 Correct 6 ms 47608 KB Output is correct
60 Correct 5 ms 47452 KB Output is correct
61 Correct 6 ms 47592 KB Output is correct
62 Correct 6 ms 47568 KB Output is correct
63 Correct 6 ms 47452 KB Output is correct
64 Correct 5 ms 47620 KB Output is correct
65 Correct 5 ms 47452 KB Output is correct
66 Correct 6 ms 47452 KB Output is correct
67 Correct 5 ms 47452 KB Output is correct
68 Correct 6 ms 47448 KB Output is correct
69 Correct 6 ms 47452 KB Output is correct
70 Correct 5 ms 47452 KB Output is correct
71 Correct 6 ms 47452 KB Output is correct
72 Correct 5 ms 47452 KB Output is correct
73 Correct 5 ms 47452 KB Output is correct
74 Correct 8 ms 49756 KB Output is correct
75 Correct 8 ms 49756 KB Output is correct
76 Correct 8 ms 49896 KB Output is correct
77 Correct 8 ms 49756 KB Output is correct
78 Correct 8 ms 49904 KB Output is correct
79 Correct 9 ms 49756 KB Output is correct
80 Correct 8 ms 49756 KB Output is correct
81 Correct 9 ms 49756 KB Output is correct
82 Correct 10 ms 49752 KB Output is correct
83 Correct 8 ms 49752 KB Output is correct
84 Correct 9 ms 49840 KB Output is correct
85 Correct 9 ms 49752 KB Output is correct
86 Correct 9 ms 49756 KB Output is correct
87 Correct 9 ms 49756 KB Output is correct
88 Correct 9 ms 49756 KB Output is correct
89 Correct 8 ms 49756 KB Output is correct
90 Correct 8 ms 49756 KB Output is correct
91 Correct 8 ms 49748 KB Output is correct
92 Correct 9 ms 49756 KB Output is correct
93 Correct 8 ms 49756 KB Output is correct
94 Correct 8 ms 50000 KB Output is correct
95 Correct 8 ms 49752 KB Output is correct
96 Correct 8 ms 49756 KB Output is correct
97 Correct 8 ms 49840 KB Output is correct
98 Correct 8 ms 49752 KB Output is correct
99 Correct 8 ms 49756 KB Output is correct
100 Correct 8 ms 49756 KB Output is correct
101 Correct 8 ms 49756 KB Output is correct
102 Correct 8 ms 49836 KB Output is correct
103 Correct 9 ms 49756 KB Output is correct
104 Correct 9 ms 49712 KB Output is correct
105 Correct 8 ms 49752 KB Output is correct
106 Correct 8 ms 49752 KB Output is correct
107 Correct 8 ms 49756 KB Output is correct
108 Correct 8 ms 49756 KB Output is correct
109 Correct 8 ms 49756 KB Output is correct
110 Correct 8 ms 49908 KB Output is correct
111 Correct 120 ms 96144 KB Output is correct
112 Correct 123 ms 96176 KB Output is correct
113 Correct 120 ms 96156 KB Output is correct
114 Correct 120 ms 96072 KB Output is correct
115 Correct 121 ms 96572 KB Output is correct
116 Correct 157 ms 96068 KB Output is correct
117 Correct 155 ms 96072 KB Output is correct
118 Correct 215 ms 97436 KB Output is correct
119 Correct 171 ms 97240 KB Output is correct
120 Correct 143 ms 96328 KB Output is correct
121 Correct 177 ms 96064 KB Output is correct
122 Correct 150 ms 96328 KB Output is correct
123 Correct 144 ms 96468 KB Output is correct
124 Correct 137 ms 96320 KB Output is correct
125 Correct 193 ms 96324 KB Output is correct
126 Correct 123 ms 96320 KB Output is correct
127 Correct 115 ms 96412 KB Output is correct
128 Correct 114 ms 96072 KB Output is correct
129 Correct 170 ms 96152 KB Output is correct
130 Correct 116 ms 96068 KB Output is correct
131 Correct 114 ms 96140 KB Output is correct
132 Correct 105 ms 96068 KB Output is correct
133 Correct 156 ms 96156 KB Output is correct
134 Correct 117 ms 96160 KB Output is correct
135 Correct 111 ms 96068 KB Output is correct
136 Correct 108 ms 96144 KB Output is correct
137 Correct 157 ms 96148 KB Output is correct
138 Correct 113 ms 96188 KB Output is correct
139 Correct 118 ms 96064 KB Output is correct
140 Correct 109 ms 96064 KB Output is correct
141 Correct 151 ms 96504 KB Output is correct
142 Correct 102 ms 97564 KB Output is correct
143 Correct 106 ms 97460 KB Output is correct
144 Correct 103 ms 97500 KB Output is correct
145 Correct 105 ms 97588 KB Output is correct
146 Correct 103 ms 97348 KB Output is correct
147 Correct 102 ms 97496 KB Output is correct
148 Correct 102 ms 97352 KB Output is correct
149 Correct 102 ms 97468 KB Output is correct
150 Correct 100 ms 97240 KB Output is correct
151 Correct 94 ms 97088 KB Output is correct
152 Correct 78 ms 96144 KB Output is correct
153 Correct 103 ms 97436 KB Output is correct
154 Correct 105 ms 97344 KB Output is correct
155 Correct 112 ms 97496 KB Output is correct
156 Correct 103 ms 97740 KB Output is correct
157 Correct 101 ms 97792 KB Output is correct
158 Correct 105 ms 97864 KB Output is correct
159 Correct 95 ms 97096 KB Output is correct
160 Correct 81 ms 96156 KB Output is correct
161 Correct 162 ms 96392 KB Output is correct
162 Correct 145 ms 96332 KB Output is correct
163 Correct 136 ms 96400 KB Output is correct
164 Correct 138 ms 96392 KB Output is correct
165 Correct 131 ms 96224 KB Output is correct
166 Correct 92 ms 96068 KB Output is correct
167 Correct 101 ms 96472 KB Output is correct
168 Correct 93 ms 96316 KB Output is correct
169 Correct 94 ms 96328 KB Output is correct
170 Correct 93 ms 96320 KB Output is correct
171 Correct 78 ms 95724 KB Output is correct
172 Correct 82 ms 96324 KB Output is correct
173 Correct 166 ms 96400 KB Output is correct
174 Correct 158 ms 96396 KB Output is correct
175 Correct 157 ms 96592 KB Output is correct
176 Correct 133 ms 96216 KB Output is correct