oj.uz

Submission #776309

# Submission time Handle Problem Language Result Execution time Memory
776309 2023-07-07T16:09:00 Z bachhoangxuan Food Court (JOI21_foodcourt) C++17
100 / 100
 358 ms 45312 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<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=250005;
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 n,m,q,c[maxn],ans[maxn],lst;
vector<tuple<int,int,int>> add[maxn];
namespace Segtree{
    int tree[4*maxn],lazy[4*maxn],sum[4*maxn];
    void getnew(int id,int val){
        tree[id]+=val;
        lazy[id]+=val;
    }
    void pushdown(int id){
        if(lazy[id]==0) return;
        getnew(id<<1,lazy[id]);
        getnew(id<<1|1,lazy[id]);
        lazy[id]=0;
    }
    void update(int l,int r,int id,int p,int k){
        if(l==r){getnew(id,k);return;}
        pushdown(id);
        int mid=(l+r)>>1;
        if(p<=mid){update(l,mid,id<<1,p,k);getnew(id<<1|1,k);}
        else update(mid+1,r,id<<1|1,p,k);
        tree[id]=min(tree[id<<1],tree[id<<1|1]);
    }
    void updatesum(int l,int r,int id,int p,int k){
        if(l==r){sum[id]+=k;return;}
        int mid=(l+r)>>1;
        if(p<=mid) updatesum(l,mid,id<<1,p,k);
        else updatesum(mid+1,r,id<<1|1,p,k);
        sum[id]=sum[id<<1]+sum[id<<1|1];
    }
    int queryMin(int l,int r,int id,int p){
        if(l==r) return lst=tree[id];
        pushdown(id);
        int mid=(l+r)>>1;
        if(p<=mid) return queryMin(l,mid,id<<1,p);
        else return min(tree[id<<1],queryMin(mid+1,r,id<<1|1,p));
    }
    pii query(int l,int r,int id,int p,int cnt){
        if(l==r) return {sum[id],l};
        pushdown(id);
        int mid=(l+r)>>1;
        if(r<p){
            if(sum[id<<1|1]>=cnt) return query(mid+1,r,id<<1|1,p,cnt);
            else{
                pii f=query(l,mid,id<<1,p,cnt-sum[id<<1|1]);
                return {f.fi+sum[id<<1|1],f.se};
            }
        }
        else if(p<=mid) return query(l,mid,id<<1,p,cnt);
        else{
            pii f=query(mid+1,r,id<<1|1,p,cnt);
            if(f.fi>=cnt) return f;
            else if(f.fi+sum[id<<1]<cnt) return {f.fi+sum[id<<1],-1};
            else{
                pii g=query(l,mid,id<<1,p,cnt-f.fi);
                return {f.fi+g.fi,g.se};
            }
        }
    }
}
void solve(){
    cin >> n >> m >> q;
    for(int i=1;i<=q;i++){
        int t,l,r,k;cin >> t;ans[i]=-1;
        if(t==1) cin >> l >> r >> c[i] >> k;
        else if(t==2) cin >> l >> r >> k,k=-k;
        else cin >> l >> k;
        if(t==3) add[l].push_back({t,i,k});
        else{
            add[l].push_back({t,i,k});
            add[r+1].push_back({t,i,-k});
        }
    }
    for(int i=1;i<=n;i++){
        for(auto &[t,id,k]:add[i]){
            if(t<=2) Segtree::update(1,q,1,id,k);
            if(t==1) Segtree::updatesum(1,q,1,id,k);
            if(t==3){
                int Min=min(0LL,Segtree::queryMin(1,q,1,id));lst-=Min;
                //if(id==6) cout << id << ' ' << lst << ' ' << k << ' ' << Segtree::query(1,q,1,id,lst-k+1).se << '\n';
                if(k>lst) ans[id]=0;
                else ans[id]=c[Segtree::query(1,q,1,id,lst-k+1).se];
            }
        }
    }
    for(int i=1;i<=q;i++){
        if(ans[i]!=-1) cout << ans[i] << '\n';
    }
}
/*
1457 236823 6
1 282 1270 166817 1
2 258 413 1
3 71 1
1 599 1196 220672 1
1 603 1271 178260 1
3 976 3
*/
signed main(){
    //freopen("food.inp","r",stdin);
    //freopen("food.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6356 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6360 KB Output is correct
4 Correct 4 ms 6480 KB Output is correct
5 Correct 4 ms 6484 KB Output is correct
6 Correct 4 ms 6476 KB Output is correct
7 Correct 4 ms 6480 KB Output is correct
8 Correct 5 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 4 ms 6476 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 4 ms 6476 KB Output is correct
14 Correct 4 ms 6484 KB Output is correct
15 Correct 6 ms 6432 KB Output is correct
16 Correct 5 ms 6480 KB Output is correct
17 Correct 4 ms 6484 KB Output is correct
18 Correct 5 ms 6484 KB Output is correct
19 Correct 4 ms 6480 KB Output is correct
20 Correct 4 ms 6484 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6356 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6360 KB Output is correct
4 Correct 4 ms 6480 KB Output is correct
5 Correct 4 ms 6484 KB Output is correct
6 Correct 4 ms 6476 KB Output is correct
7 Correct 4 ms 6480 KB Output is correct
8 Correct 5 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 4 ms 6476 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 4 ms 6476 KB Output is correct
14 Correct 4 ms 6484 KB Output is correct
15 Correct 6 ms 6432 KB Output is correct
16 Correct 5 ms 6480 KB Output is correct
17 Correct 4 ms 6484 KB Output is correct
18 Correct 5 ms 6484 KB Output is correct
19 Correct 4 ms 6480 KB Output is correct
20 Correct 4 ms 6484 KB Output is correct
21 Correct 4 ms 6484 KB Output is correct
22 Correct 4 ms 6484 KB Output is correct
23 Correct 4 ms 6484 KB Output is correct
24 Correct 4 ms 6484 KB Output is correct
25 Correct 4 ms 6484 KB Output is correct
26 Correct 4 ms 6476 KB Output is correct
27 Correct 5 ms 6480 KB Output is correct
28 Correct 4 ms 6484 KB Output is correct
29 Correct 4 ms 6476 KB Output is correct
30 Correct 4 ms 6472 KB Output is correct
31 Correct 4 ms 6484 KB Output is correct
32 Correct 4 ms 6412 KB Output is correct
33 Correct 4 ms 6480 KB Output is correct
34 Correct 4 ms 6484 KB Output is correct
35 Correct 4 ms 6484 KB Output is correct
36 Correct 4 ms 6552 KB Output is correct
37 Correct 4 ms 6348 KB Output is correct
38 Correct 5 ms 6484 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 15180 KB Output is correct
2 Correct 52 ms 15336 KB Output is correct
3 Correct 51 ms 15116 KB Output is correct
4 Correct 53 ms 15128 KB Output is correct
5 Correct 52 ms 15416 KB Output is correct
6 Correct 52 ms 15308 KB Output is correct
7 Correct 27 ms 13532 KB Output is correct
8 Correct 30 ms 13440 KB Output is correct
9 Correct 52 ms 14836 KB Output is correct
10 Correct 52 ms 15392 KB Output is correct
11 Correct 50 ms 15200 KB Output is correct
12 Correct 56 ms 15364 KB Output is correct
13 Correct 47 ms 14552 KB Output is correct
14 Correct 50 ms 15088 KB Output is correct
15 Correct 57 ms 15636 KB Output is correct
16 Correct 59 ms 15676 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 40504 KB Output is correct
2 Correct 219 ms 36144 KB Output is correct
3 Correct 318 ms 42436 KB Output is correct
4 Correct 223 ms 36172 KB Output is correct
5 Correct 243 ms 36816 KB Output is correct
6 Correct 315 ms 43440 KB Output is correct
7 Correct 116 ms 36624 KB Output is correct
8 Correct 130 ms 36652 KB Output is correct
9 Correct 322 ms 41164 KB Output is correct
10 Correct 331 ms 41288 KB Output is correct
11 Correct 297 ms 40356 KB Output is correct
12 Correct 323 ms 43344 KB Output is correct
13 Correct 339 ms 40540 KB Output is correct
14 Correct 316 ms 43172 KB Output is correct
15 Correct 352 ms 43220 KB Output is correct
16 Correct 299 ms 43084 KB Output is correct
17 Correct 306 ms 43104 KB Output is correct
18 Correct 314 ms 41812 KB Output is correct
19 Correct 320 ms 43212 KB Output is correct
20 Correct 316 ms 42120 KB Output is correct
21 Correct 338 ms 43216 KB Output is correct
22 Correct 327 ms 43336 KB Output is correct
23 Correct 339 ms 43220 KB Output is correct
24 Correct 354 ms 43208 KB Output is correct
25 Correct 240 ms 43952 KB Output is correct
26 Correct 248 ms 44612 KB Output is correct
27 Correct 291 ms 44364 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6356 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6360 KB Output is correct
4 Correct 4 ms 6480 KB Output is correct
5 Correct 4 ms 6484 KB Output is correct
6 Correct 4 ms 6476 KB Output is correct
7 Correct 4 ms 6480 KB Output is correct
8 Correct 5 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 4 ms 6476 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 4 ms 6476 KB Output is correct
14 Correct 4 ms 6484 KB Output is correct
15 Correct 6 ms 6432 KB Output is correct
16 Correct 5 ms 6480 KB Output is correct
17 Correct 4 ms 6484 KB Output is correct
18 Correct 5 ms 6484 KB Output is correct
19 Correct 4 ms 6480 KB Output is correct
20 Correct 4 ms 6484 KB Output is correct
21 Correct 67 ms 15180 KB Output is correct
22 Correct 52 ms 15336 KB Output is correct
23 Correct 51 ms 15116 KB Output is correct
24 Correct 53 ms 15128 KB Output is correct
25 Correct 52 ms 15416 KB Output is correct
26 Correct 52 ms 15308 KB Output is correct
27 Correct 27 ms 13532 KB Output is correct
28 Correct 30 ms 13440 KB Output is correct
29 Correct 52 ms 14836 KB Output is correct
30 Correct 52 ms 15392 KB Output is correct
31 Correct 50 ms 15200 KB Output is correct
32 Correct 56 ms 15364 KB Output is correct
33 Correct 47 ms 14552 KB Output is correct
34 Correct 50 ms 15088 KB Output is correct
35 Correct 57 ms 15636 KB Output is correct
36 Correct 59 ms 15676 KB Output is correct
37 Correct 46 ms 14412 KB Output is correct
38 Correct 46 ms 14036 KB Output is correct
39 Correct 26 ms 12972 KB Output is correct
40 Correct 29 ms 13552 KB Output is correct
41 Correct 54 ms 14492 KB Output is correct
42 Correct 76 ms 15304 KB Output is correct
43 Correct 63 ms 15200 KB Output is correct
44 Correct 60 ms 14924 KB Output is correct
45 Correct 53 ms 15188 KB Output is correct
46 Correct 53 ms 15204 KB Output is correct
47 Correct 33 ms 13952 KB Output is correct
48 Correct 50 ms 15572 KB Output is correct
49 Correct 40 ms 13524 KB Output is correct
50 Correct 46 ms 14376 KB Output is correct
51 Correct 54 ms 15324 KB Output is correct
52 Correct 57 ms 15324 KB Output is correct
53 Correct 45 ms 14244 KB Output is correct
54 Correct 60 ms 15644 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 14632 KB Output is correct
2 Correct 57 ms 15308 KB Output is correct
3 Correct 60 ms 15296 KB Output is correct
4 Correct 42 ms 13500 KB Output is correct
5 Correct 49 ms 14428 KB Output is correct
6 Correct 56 ms 15308 KB Output is correct
7 Correct 32 ms 13592 KB Output is correct
8 Correct 35 ms 13484 KB Output is correct
9 Correct 49 ms 14588 KB Output is correct
10 Correct 39 ms 13644 KB Output is correct
11 Correct 56 ms 15128 KB Output is correct
12 Correct 55 ms 15180 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6356 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6360 KB Output is correct
4 Correct 4 ms 6480 KB Output is correct
5 Correct 4 ms 6484 KB Output is correct
6 Correct 4 ms 6476 KB Output is correct
7 Correct 4 ms 6480 KB Output is correct
8 Correct 5 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 4 ms 6476 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 4 ms 6476 KB Output is correct
14 Correct 4 ms 6484 KB Output is correct
15 Correct 6 ms 6432 KB Output is correct
16 Correct 5 ms 6480 KB Output is correct
17 Correct 4 ms 6484 KB Output is correct
18 Correct 5 ms 6484 KB Output is correct
19 Correct 4 ms 6480 KB Output is correct
20 Correct 4 ms 6484 KB Output is correct
21 Correct 4 ms 6484 KB Output is correct
22 Correct 4 ms 6484 KB Output is correct
23 Correct 4 ms 6484 KB Output is correct
24 Correct 4 ms 6484 KB Output is correct
25 Correct 4 ms 6484 KB Output is correct
26 Correct 4 ms 6476 KB Output is correct
27 Correct 5 ms 6480 KB Output is correct
28 Correct 4 ms 6484 KB Output is correct
29 Correct 4 ms 6476 KB Output is correct
30 Correct 4 ms 6472 KB Output is correct
31 Correct 4 ms 6484 KB Output is correct
32 Correct 4 ms 6412 KB Output is correct
33 Correct 4 ms 6480 KB Output is correct
34 Correct 4 ms 6484 KB Output is correct
35 Correct 4 ms 6484 KB Output is correct
36 Correct 4 ms 6552 KB Output is correct
37 Correct 4 ms 6348 KB Output is correct
38 Correct 5 ms 6484 KB Output is correct
39 Correct 67 ms 15180 KB Output is correct
40 Correct 52 ms 15336 KB Output is correct
41 Correct 51 ms 15116 KB Output is correct
42 Correct 53 ms 15128 KB Output is correct
43 Correct 52 ms 15416 KB Output is correct
44 Correct 52 ms 15308 KB Output is correct
45 Correct 27 ms 13532 KB Output is correct
46 Correct 30 ms 13440 KB Output is correct
47 Correct 52 ms 14836 KB Output is correct
48 Correct 52 ms 15392 KB Output is correct
49 Correct 50 ms 15200 KB Output is correct
50 Correct 56 ms 15364 KB Output is correct
51 Correct 47 ms 14552 KB Output is correct
52 Correct 50 ms 15088 KB Output is correct
53 Correct 57 ms 15636 KB Output is correct
54 Correct 59 ms 15676 KB Output is correct
55 Correct 46 ms 14412 KB Output is correct
56 Correct 46 ms 14036 KB Output is correct
57 Correct 26 ms 12972 KB Output is correct
58 Correct 29 ms 13552 KB Output is correct
59 Correct 54 ms 14492 KB Output is correct
60 Correct 76 ms 15304 KB Output is correct
61 Correct 63 ms 15200 KB Output is correct
62 Correct 60 ms 14924 KB Output is correct
63 Correct 53 ms 15188 KB Output is correct
64 Correct 53 ms 15204 KB Output is correct
65 Correct 33 ms 13952 KB Output is correct
66 Correct 50 ms 15572 KB Output is correct
67 Correct 40 ms 13524 KB Output is correct
68 Correct 46 ms 14376 KB Output is correct
69 Correct 54 ms 15324 KB Output is correct
70 Correct 57 ms 15324 KB Output is correct
71 Correct 45 ms 14244 KB Output is correct
72 Correct 60 ms 15644 KB Output is correct
73 Correct 71 ms 14632 KB Output is correct
74 Correct 57 ms 15308 KB Output is correct
75 Correct 60 ms 15296 KB Output is correct
76 Correct 42 ms 13500 KB Output is correct
77 Correct 49 ms 14428 KB Output is correct
78 Correct 56 ms 15308 KB Output is correct
79 Correct 32 ms 13592 KB Output is correct
80 Correct 35 ms 13484 KB Output is correct
81 Correct 49 ms 14588 KB Output is correct
82 Correct 39 ms 13644 KB Output is correct
83 Correct 56 ms 15128 KB Output is correct
84 Correct 55 ms 15180 KB Output is correct
85 Correct 51 ms 14976 KB Output is correct
86 Correct 76 ms 15632 KB Output is correct
87 Correct 54 ms 15036 KB Output is correct
88 Correct 60 ms 15868 KB Output is correct
89 Correct 38 ms 12944 KB Output is correct
90 Correct 57 ms 15820 KB Output is correct
91 Correct 46 ms 14652 KB Output is correct
92 Correct 44 ms 14316 KB Output is correct
93 Correct 59 ms 15800 KB Output is correct
94 Correct 55 ms 15436 KB Output is correct
95 Correct 55 ms 15616 KB Output is correct
96 Correct 59 ms 15720 KB Output is correct
97 Correct 56 ms 15716 KB Output is correct
98 Correct 51 ms 14860 KB Output is correct
99 Correct 36 ms 14512 KB Output is correct
100 Correct 43 ms 14516 KB Output is correct
101 Correct 54 ms 16060 KB Output is correct
102 Correct 54 ms 16152 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6356 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6360 KB Output is correct
4 Correct 4 ms 6480 KB Output is correct
5 Correct 4 ms 6484 KB Output is correct
6 Correct 4 ms 6476 KB Output is correct
7 Correct 4 ms 6480 KB Output is correct
8 Correct 5 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 4 ms 6476 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 4 ms 6476 KB Output is correct
14 Correct 4 ms 6484 KB Output is correct
15 Correct 6 ms 6432 KB Output is correct
16 Correct 5 ms 6480 KB Output is correct
17 Correct 4 ms 6484 KB Output is correct
18 Correct 5 ms 6484 KB Output is correct
19 Correct 4 ms 6480 KB Output is correct
20 Correct 4 ms 6484 KB Output is correct
21 Correct 4 ms 6484 KB Output is correct
22 Correct 4 ms 6484 KB Output is correct
23 Correct 4 ms 6484 KB Output is correct
24 Correct 4 ms 6484 KB Output is correct
25 Correct 4 ms 6484 KB Output is correct
26 Correct 4 ms 6476 KB Output is correct
27 Correct 5 ms 6480 KB Output is correct
28 Correct 4 ms 6484 KB Output is correct
29 Correct 4 ms 6476 KB Output is correct
30 Correct 4 ms 6472 KB Output is correct
31 Correct 4 ms 6484 KB Output is correct
32 Correct 4 ms 6412 KB Output is correct
33 Correct 4 ms 6480 KB Output is correct
34 Correct 4 ms 6484 KB Output is correct
35 Correct 4 ms 6484 KB Output is correct
36 Correct 4 ms 6552 KB Output is correct
37 Correct 4 ms 6348 KB Output is correct
38 Correct 5 ms 6484 KB Output is correct
39 Correct 67 ms 15180 KB Output is correct
40 Correct 52 ms 15336 KB Output is correct
41 Correct 51 ms 15116 KB Output is correct
42 Correct 53 ms 15128 KB Output is correct
43 Correct 52 ms 15416 KB Output is correct
44 Correct 52 ms 15308 KB Output is correct
45 Correct 27 ms 13532 KB Output is correct
46 Correct 30 ms 13440 KB Output is correct
47 Correct 52 ms 14836 KB Output is correct
48 Correct 52 ms 15392 KB Output is correct
49 Correct 50 ms 15200 KB Output is correct
50 Correct 56 ms 15364 KB Output is correct
51 Correct 47 ms 14552 KB Output is correct
52 Correct 50 ms 15088 KB Output is correct
53 Correct 57 ms 15636 KB Output is correct
54 Correct 59 ms 15676 KB Output is correct
55 Correct 275 ms 40504 KB Output is correct
56 Correct 219 ms 36144 KB Output is correct
57 Correct 318 ms 42436 KB Output is correct
58 Correct 223 ms 36172 KB Output is correct
59 Correct 243 ms 36816 KB Output is correct
60 Correct 315 ms 43440 KB Output is correct
61 Correct 116 ms 36624 KB Output is correct
62 Correct 130 ms 36652 KB Output is correct
63 Correct 322 ms 41164 KB Output is correct
64 Correct 331 ms 41288 KB Output is correct
65 Correct 297 ms 40356 KB Output is correct
66 Correct 323 ms 43344 KB Output is correct
67 Correct 339 ms 40540 KB Output is correct
68 Correct 316 ms 43172 KB Output is correct
69 Correct 352 ms 43220 KB Output is correct
70 Correct 299 ms 43084 KB Output is correct
71 Correct 306 ms 43104 KB Output is correct
72 Correct 314 ms 41812 KB Output is correct
73 Correct 320 ms 43212 KB Output is correct
74 Correct 316 ms 42120 KB Output is correct
75 Correct 338 ms 43216 KB Output is correct
76 Correct 327 ms 43336 KB Output is correct
77 Correct 339 ms 43220 KB Output is correct
78 Correct 354 ms 43208 KB Output is correct
79 Correct 240 ms 43952 KB Output is correct
80 Correct 248 ms 44612 KB Output is correct
81 Correct 291 ms 44364 KB Output is correct
82 Correct 46 ms 14412 KB Output is correct
83 Correct 46 ms 14036 KB Output is correct
84 Correct 26 ms 12972 KB Output is correct
85 Correct 29 ms 13552 KB Output is correct
86 Correct 54 ms 14492 KB Output is correct
87 Correct 76 ms 15304 KB Output is correct
88 Correct 63 ms 15200 KB Output is correct
89 Correct 60 ms 14924 KB Output is correct
90 Correct 53 ms 15188 KB Output is correct
91 Correct 53 ms 15204 KB Output is correct
92 Correct 33 ms 13952 KB Output is correct
93 Correct 50 ms 15572 KB Output is correct
94 Correct 40 ms 13524 KB Output is correct
95 Correct 46 ms 14376 KB Output is correct
96 Correct 54 ms 15324 KB Output is correct
97 Correct 57 ms 15324 KB Output is correct
98 Correct 45 ms 14244 KB Output is correct
99 Correct 60 ms 15644 KB Output is correct
100 Correct 71 ms 14632 KB Output is correct
101 Correct 57 ms 15308 KB Output is correct
102 Correct 60 ms 15296 KB Output is correct
103 Correct 42 ms 13500 KB Output is correct
104 Correct 49 ms 14428 KB Output is correct
105 Correct 56 ms 15308 KB Output is correct
106 Correct 32 ms 13592 KB Output is correct
107 Correct 35 ms 13484 KB Output is correct
108 Correct 49 ms 14588 KB Output is correct
109 Correct 39 ms 13644 KB Output is correct
110 Correct 56 ms 15128 KB Output is correct
111 Correct 55 ms 15180 KB Output is correct
112 Correct 51 ms 14976 KB Output is correct
113 Correct 76 ms 15632 KB Output is correct
114 Correct 54 ms 15036 KB Output is correct
115 Correct 60 ms 15868 KB Output is correct
116 Correct 38 ms 12944 KB Output is correct
117 Correct 57 ms 15820 KB Output is correct
118 Correct 46 ms 14652 KB Output is correct
119 Correct 44 ms 14316 KB Output is correct
120 Correct 59 ms 15800 KB Output is correct
121 Correct 55 ms 15436 KB Output is correct
122 Correct 55 ms 15616 KB Output is correct
123 Correct 59 ms 15720 KB Output is correct
124 Correct 56 ms 15716 KB Output is correct
125 Correct 51 ms 14860 KB Output is correct
126 Correct 36 ms 14512 KB Output is correct
127 Correct 43 ms 14516 KB Output is correct
128 Correct 54 ms 16060 KB Output is correct
129 Correct 54 ms 16152 KB Output is correct
130 Correct 311 ms 43108 KB Output is correct
131 Correct 229 ms 36304 KB Output is correct
132 Correct 319 ms 43020 KB Output is correct
133 Correct 347 ms 42976 KB Output is correct
134 Correct 270 ms 40040 KB Output is correct
135 Correct 332 ms 44180 KB Output is correct
136 Correct 313 ms 42144 KB Output is correct
137 Correct 331 ms 42104 KB Output is correct
138 Correct 330 ms 40984 KB Output is correct
139 Correct 311 ms 43852 KB Output is correct
140 Correct 292 ms 41560 KB Output is correct
141 Correct 299 ms 43832 KB Output is correct
142 Correct 324 ms 43788 KB Output is correct
143 Correct 305 ms 43732 KB Output is correct
144 Correct 301 ms 42416 KB Output is correct
145 Correct 322 ms 43840 KB Output is correct
146 Correct 321 ms 42956 KB Output is correct
147 Correct 349 ms 43736 KB Output is correct
148 Correct 325 ms 43776 KB Output is correct
149 Correct 358 ms 43836 KB Output is correct
150 Correct 162 ms 38964 KB Output is correct
151 Correct 248 ms 45304 KB Output is correct
152 Correct 245 ms 45312 KB Output is correct
153 Correct 271 ms 45236 KB Output is correct