oj.uz

Submission #1023128

# Submission time Handle Problem Language Result Execution time Memory
1023128 2024-07-14T10:05:44 Z JakobZorz Radio Towers (IOI22_towers) C++17
100 / 100
 1157 ms 105416 KB 
#include"towers.h"
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;

const int TREE_SIZE=1<<17;

int n;
vector<int>arr;
vector<int>thres;
vector<int>prv,nxt;
vector<vector<int>>arr_rmq;
vector<vector<pair<int,int>>>arr_rmq2;
vector<vector<int>>thres_rmq;

void init_prev(){
    prv.resize(n);
    vector<int>s;
    for(int i=0;i<n;i++){
        while(s.size()&&arr[s.back()]>arr[i])
            s.pop_back();
        if(s.empty())
            prv[i]=-1;
        else
            prv[i]=s.back();
        s.push_back(i);
    }
}

void init_nxt(){
    nxt.resize(n);
    vector<int>s;
    for(int i=n-1;i>=0;i--){
        while(s.size()&&arr[s.back()]>arr[i])
            s.pop_back();
        if(s.empty())
            nxt[i]=-1;
        else
            nxt[i]=s.back();
        s.push_back(i);
    }
}

void init_arr_rmq(){
    arr_rmq=vector<vector<int>>(20,vector<int>(n));
    arr_rmq[0]=arr;
    for(int p=1;p<20;p++){
        for(int i=0;i+(1<<p)<=n;i++){
            arr_rmq[p][i]=max(arr_rmq[p-1][i],arr_rmq[p-1][i+(1<<(p-1))]);
        }
    }
}

int get_arr_max(int l,int r){
    int pw2=2;
    int p=0;
    while(pw2<r-l){
        pw2*=2;
        p++;
    }
    pw2/=2;
    return max(arr_rmq[p][l],arr_rmq[p][r-pw2]);
}

void init_thres(){
    thres.resize(n);
    for(int i=0;i<n;i++){
        int mn=2e9;
        
        if(prv[i]!=-1){
            int mx1=get_arr_max(prv[i],i);
            mn=min(mn,mx1);
        }
        
        if(nxt[i]!=-1){
            int mx2=get_arr_max(i,nxt[i]);
            mn=min(mn,mx2);
        }
        
        thres[i]=mn-arr[i];
    }
}

void init_thres_rmq(){
    thres_rmq=vector<vector<int>>(20,vector<int>(n));
    thres_rmq[0]=thres;
    for(int p=1;p<20;p++){
        for(int i=0;i+(1<<p)<=n;i++){
            thres_rmq[p][i]=max(thres_rmq[p-1][i],thres_rmq[p-1][i+(1<<(p-1))]);
        }
    }
}

int get_thres_max(int l,int r){
    int pw2=2;
    int p=0;
    while(pw2<r-l){
        pw2*=2;
        p++;
    }
    pw2/=2;
    return max(thres_rmq[p][l],thres_rmq[p][r-pw2]);
}

void init_arr_rmq2(){
    arr_rmq2=vector<vector<pair<int,int>>>(20,vector<pair<int,int>>(n));
    for(int i=0;i<n;i++)
        arr_rmq2[0][i]={arr[i],i};
    for(int p=1;p<20;p++){
        for(int i=0;i+(1<<p)<=n;i++){
            arr_rmq2[p][i]=min(arr_rmq2[p-1][i],arr_rmq2[p-1][i+(1<<(p-1))]);
        }
    }
}

pair<int,int>get_arr_min(int l,int r){
    int pw2=2;
    int p=0;
    while(pw2<r-l){
        pw2*=2;
        p++;
    }
    pw2/=2;
    return min(arr_rmq2[p][l],arr_rmq2[p][r-pw2]);
}

struct Diff{
    vector<int>mn;
    vector<int>mx;
    vector<int>tree;
    Diff():tree(2*TREE_SIZE),mn(2*TREE_SIZE),mx(2*TREE_SIZE){}
    
    void update(int i,int x){
        i+=TREE_SIZE;
        mn[i]=x;
        mx[i]=x;
        tree[i]=0;
        i/=2;
        while(i){
            mn[i]=min(mn[2*i],mn[2*i+1]);
            mx[i]=max(mx[2*i],mx[2*i+1]);
            tree[i]=max(max(tree[2*i],tree[2*i+1]),mx[2*i]-mn[2*i+1]);
            i/=2;
        }
    }
    
    pair<pair<int,int>,int>get(int node,int rl,int rr,int l,int r){
        if(r<=rl||rr<=l)
            return{{(int)1e9+1,-1},0};
        if(l<=rl&&rr<=r)
            return{{mn[node],mx[node]},tree[node]};
        int mid=(rl+rr)/2;
        auto res1=get(2*node,rl,mid,l,r);
        auto res2=get(2*node+1,mid,rr,l,r);
        int mn1=res1.first.first;
        int mx1=res1.first.second;
        int r1=res1.second;
        int mn2=res2.first.first;
        int mx2=res2.first.second;
        int r2=res2.second;
        int mn=min(mn1,mn2);
        int mx=max(mx1,mx2);
        int rs=max(max(r1,r2),mx1-mn2);
        return{{mn,mx},rs};
    }
    
    int get(int l,int r){
        return get(1,0,TREE_SIZE,l,r).second;
    }
};

Diff diff1,diff2;

struct Node{
    int sum;
    Node*ch1,*ch2;
    Node():sum(0),ch1(nullptr),ch2(nullptr){}
};

int get(Node*node,int rl,int rr,int l,int r){
    if(node==nullptr)
        return 0;
    if(r<=rl||rr<=l)
        return 0;
    if(l<=rl&&rr<=r)
        return node->sum;
    int mid=(rl+rr)/2;
    return get(node->ch1,rl,mid,l,r)+get(node->ch2,mid,rr,l,r);
}

int get_sum(Node*node){
    if(node==nullptr)
        return 0;
    return node->sum;
}

Node*update(Node*node,int rl,int rr,int i){
    if(rl==rr-1){
        node=new Node;
        node->sum=1;
        return node;
    }
    int mid=(rl+rr)/2;
    Node*new_node=new Node;
    new_node->ch1=node->ch1;
    new_node->ch2=node->ch2;
    new_node->ch1=node->ch1;
    if(i>=mid){
        if(!node->ch2)
            node->ch2=new Node;
        new_node->ch2=update(node->ch2,mid,rr,i);
    }else{
        if(!node->ch1)
            node->ch1=new Node;
        new_node->ch1=update(node->ch1,rl,mid,i);
    }
    new_node->sum=get_sum(new_node->ch1)+get_sum(new_node->ch2);
    return new_node;
}

vector<pair<int,Node*>>trees;

void init_tree(){
    vector<pair<int,int>>vec(n);
    for(int i=0;i<n;i++)
        vec[i]={thres[i],i};
    sort(vec.begin(),vec.end());
    reverse(vec.begin(),vec.end());
    
    trees.resize(n+1);
    Node*root=new Node;
    trees[0]={(int)1e9+1,root};
    for(int i=0;i<n;i++){
        root=update(root,0,TREE_SIZE,vec[i].second);
        trees[i+1].first=vec[i].first;
        trees[i+1].second=root;
    }
}

void init(int N,vector<int>H){
    arr=H;
    n=(int)arr.size();
    init_prev();
    init_nxt();
    init_arr_rmq();
    init_thres();
    init_thres_rmq();
    init_arr_rmq2();
    for(int i=0;i<n;i++){
        diff1.update(i,arr[i]);
        diff2.update(i,arr[n-i-1]);
    }
    init_tree();
}

int max_towers(int L,int R,int D){
    int res=0;
    /*for(int i=L;i<=R;i++){
        if(thres[i]>=D){
            res++;
        }
    }*/
    {
        int l=0,r=n+2;
        while(l<r-1){
            int mid=(l+r)/2;
            if(trees[mid].first>=D)
                l=mid;
            else
                r=mid;
        }
        res+=get(trees[l].second,0,TREE_SIZE,L,R+1);
    }
    
    int first=-1,last=-1;
    if(get_thres_max(L,R+1)<D){
        first=get_arr_min(L,R+1).second;
        last=first;
        res=1;
    }else{
        {
            int l=L,r=R+1;
            while(l<r-1){
                int mid=(l+r)/2;
                if(get_thres_max(L,mid)>=D)
                    r=mid;
                else
                    l=mid;
            }
            first=l;
        }
        
        {
            int l=L,r=R+1;
            while(l<r-1){
                int mid=(l+r)/2;
                if(get_thres_max(mid,R+1)>=D)
                    l=mid;
                else
                    r=mid;
            }
            last=l;
        }
    }
    
    if(get_arr_max(L,first)>=arr[first]+D){
        int l=L,r=first;
        while(l<r-1){
            int mid=(l+r)/2;
            if(get_arr_max(mid,first)>=arr[first]+D)
                l=mid;
            else
                r=mid;
        }
        res+=diff2.get(n-l-1,n-L)>=D;
    }
    
    if(get_arr_max(last,R+1)>=arr[last]+D){
        int l=last,r=R+1;
        while(l<r-1){
            int mid=(l+r)/2;
            if(get_arr_max(last,mid)>=arr[last]+D)
                r=mid;
            else
                l=mid;
        }
        res+=diff1.get(l,R+1)>=D;
    }
    
    return res;
}

Compilation message

towers.cpp: In constructor 'Diff::Diff()':
towers.cpp:131:16: warning: 'Diff::tree' will be initialized after [-Wreorder]
  131 |     vector<int>tree;
      |                ^~~~
towers.cpp:129:16: warning:   'std::vector<int> Diff::mn' [-Wreorder]
  129 |     vector<int>mn;
      |                ^~
towers.cpp:132:5: warning:   when initialized here [-Wreorder]
  132 |     Diff():tree(2*TREE_SIZE),mn(2*TREE_SIZE),mx(2*TREE_SIZE){}
      |     ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 65336 KB Output is correct
2 Correct 876 ms 105220 KB Output is correct
3 Correct 802 ms 105284 KB Output is correct
4 Correct 799 ms 105264 KB Output is correct
5 Correct 890 ms 105264 KB Output is correct
6 Correct 947 ms 105268 KB Output is correct
7 Correct 828 ms 105264 KB Output is correct
8 Correct 3 ms 6488 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 4 ms 8536 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7000 KB Output is correct
2 Correct 4 ms 8536 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 5 ms 8536 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 6 ms 8536 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Correct 6 ms 8596 KB Output is correct
9 Correct 8 ms 8532 KB Output is correct
10 Correct 5 ms 8536 KB Output is correct
11 Correct 5 ms 8432 KB Output is correct
12 Correct 2 ms 6488 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8536 KB Output is correct
15 Correct 7 ms 8536 KB Output is correct
16 Correct 5 ms 8376 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 5 ms 8536 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 5 ms 8536 KB Output is correct
22 Correct 5 ms 8348 KB Output is correct
23 Correct 5 ms 8456 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 4 ms 7256 KB Output is correct
26 Correct 5 ms 8536 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 5 ms 8536 KB Output is correct
29 Correct 5 ms 8412 KB Output is correct
30 Correct 5 ms 8496 KB Output is correct
31 Correct 5 ms 8536 KB Output is correct
32 Correct 4 ms 8536 KB Output is correct
33 Correct 4 ms 8536 KB Output is correct
34 Correct 5 ms 8536 KB Output is correct
35 Correct 4 ms 8536 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7000 KB Output is correct
2 Correct 4 ms 8536 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 5 ms 8536 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 6 ms 8536 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Correct 6 ms 8596 KB Output is correct
9 Correct 8 ms 8532 KB Output is correct
10 Correct 5 ms 8536 KB Output is correct
11 Correct 5 ms 8432 KB Output is correct
12 Correct 2 ms 6488 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8536 KB Output is correct
15 Correct 7 ms 8536 KB Output is correct
16 Correct 5 ms 8376 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 5 ms 8536 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 5 ms 8536 KB Output is correct
22 Correct 5 ms 8348 KB Output is correct
23 Correct 5 ms 8456 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 4 ms 7256 KB Output is correct
26 Correct 5 ms 8536 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 5 ms 8536 KB Output is correct
29 Correct 5 ms 8412 KB Output is correct
30 Correct 5 ms 8496 KB Output is correct
31 Correct 5 ms 8536 KB Output is correct
32 Correct 4 ms 8536 KB Output is correct
33 Correct 4 ms 8536 KB Output is correct
34 Correct 5 ms 8536 KB Output is correct
35 Correct 4 ms 8536 KB Output is correct
36 Correct 94 ms 70740 KB Output is correct
37 Correct 136 ms 105408 KB Output is correct
38 Correct 132 ms 105144 KB Output is correct
39 Correct 132 ms 105248 KB Output is correct
40 Correct 132 ms 105144 KB Output is correct
41 Correct 135 ms 105276 KB Output is correct
42 Correct 129 ms 105236 KB Output is correct
43 Correct 129 ms 105224 KB Output is correct
44 Correct 109 ms 105224 KB Output is correct
45 Correct 137 ms 105276 KB Output is correct
46 Correct 124 ms 105280 KB Output is correct
47 Correct 129 ms 105268 KB Output is correct
48 Correct 132 ms 105132 KB Output is correct
49 Correct 136 ms 105272 KB Output is correct
50 Correct 114 ms 105164 KB Output is correct
51 Correct 136 ms 105240 KB Output is correct
52 Correct 134 ms 105176 KB Output is correct
53 Correct 141 ms 105144 KB Output is correct
54 Correct 131 ms 105144 KB Output is correct
55 Correct 130 ms 105224 KB Output is correct
56 Correct 143 ms 105272 KB Output is correct
57 Correct 137 ms 101856 KB Output is correct
58 Correct 133 ms 105196 KB Output is correct
59 Correct 137 ms 105268 KB Output is correct
60 Correct 130 ms 105288 KB Output is correct
61 Correct 144 ms 105144 KB Output is correct
62 Correct 139 ms 105144 KB Output is correct
63 Correct 137 ms 105144 KB Output is correct
64 Correct 131 ms 105268 KB Output is correct
65 Correct 106 ms 105264 KB Output is correct
66 Correct 130 ms 105296 KB Output is correct
67 Correct 110 ms 105284 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 803 ms 104364 KB Output is correct
2 Correct 1035 ms 105144 KB Output is correct
3 Correct 983 ms 105144 KB Output is correct
4 Correct 1036 ms 105144 KB Output is correct
5 Correct 981 ms 105152 KB Output is correct
6 Correct 980 ms 105144 KB Output is correct
7 Correct 999 ms 105140 KB Output is correct
8 Correct 832 ms 105060 KB Output is correct
9 Correct 832 ms 105264 KB Output is correct
10 Correct 982 ms 105128 KB Output is correct
11 Correct 963 ms 105132 KB Output is correct
12 Correct 817 ms 105124 KB Output is correct
13 Correct 850 ms 105260 KB Output is correct
14 Correct 3 ms 6488 KB Output is correct
15 Correct 5 ms 8552 KB Output is correct
16 Correct 5 ms 8536 KB Output is correct
17 Correct 135 ms 105292 KB Output is correct
18 Correct 130 ms 105144 KB Output is correct
19 Correct 130 ms 105168 KB Output is correct
20 Correct 118 ms 105344 KB Output is correct
21 Correct 133 ms 105268 KB Output is correct
22 Correct 132 ms 105268 KB Output is correct
23 Correct 139 ms 105144 KB Output is correct
24 Correct 140 ms 105144 KB Output is correct
25 Correct 108 ms 105268 KB Output is correct
26 Correct 160 ms 105328 KB Output is correct
27 Correct 5 ms 8536 KB Output is correct
28 Correct 5 ms 8536 KB Output is correct
29 Correct 5 ms 8536 KB Output is correct
30 Correct 5 ms 8536 KB Output is correct
31 Correct 5 ms 8420 KB Output is correct
32 Correct 5 ms 8536 KB Output is correct
33 Correct 5 ms 8488 KB Output is correct
34 Correct 5 ms 8536 KB Output is correct
35 Correct 5 ms 8536 KB Output is correct
36 Correct 5 ms 8536 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 30188 KB Output is correct
2 Correct 884 ms 105144 KB Output is correct
3 Correct 852 ms 105144 KB Output is correct
4 Correct 890 ms 105256 KB Output is correct
5 Correct 885 ms 105144 KB Output is correct
6 Correct 920 ms 105164 KB Output is correct
7 Correct 834 ms 105144 KB Output is correct
8 Correct 841 ms 105140 KB Output is correct
9 Correct 885 ms 105264 KB Output is correct
10 Correct 847 ms 105264 KB Output is correct
11 Correct 864 ms 105076 KB Output is correct
12 Correct 141 ms 105144 KB Output is correct
13 Correct 138 ms 105144 KB Output is correct
14 Correct 153 ms 105144 KB Output is correct
15 Correct 105 ms 105260 KB Output is correct
16 Correct 133 ms 105328 KB Output is correct
17 Correct 125 ms 101896 KB Output is correct
18 Correct 136 ms 105144 KB Output is correct
19 Correct 158 ms 105144 KB Output is correct
20 Correct 136 ms 105144 KB Output is correct
21 Correct 140 ms 105144 KB Output is correct
22 Correct 137 ms 105144 KB Output is correct
23 Correct 130 ms 105252 KB Output is correct
24 Correct 134 ms 105264 KB Output is correct
25 Correct 110 ms 105260 KB Output is correct
26 Correct 129 ms 105280 KB Output is correct
27 Correct 124 ms 105284 KB Output is correct
28 Correct 5 ms 8536 KB Output is correct
29 Correct 5 ms 8536 KB Output is correct
30 Correct 5 ms 8536 KB Output is correct
31 Correct 5 ms 8536 KB Output is correct
32 Correct 5 ms 8536 KB Output is correct
33 Correct 3 ms 7256 KB Output is correct
34 Correct 5 ms 8536 KB Output is correct
35 Correct 5 ms 8536 KB Output is correct
36 Correct 5 ms 8420 KB Output is correct
37 Correct 5 ms 8536 KB Output is correct
38 Correct 5 ms 8536 KB Output is correct
39 Correct 5 ms 8536 KB Output is correct
40 Correct 5 ms 8444 KB Output is correct
41 Correct 5 ms 8536 KB Output is correct
42 Correct 5 ms 8512 KB Output is correct
43 Correct 5 ms 8536 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7000 KB Output is correct
2 Correct 4 ms 8536 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 5 ms 8536 KB Output is correct
5 Correct 5 ms 8536 KB Output is correct
6 Correct 6 ms 8536 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Correct 6 ms 8596 KB Output is correct
9 Correct 8 ms 8532 KB Output is correct
10 Correct 5 ms 8536 KB Output is correct
11 Correct 5 ms 8432 KB Output is correct
12 Correct 2 ms 6488 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8536 KB Output is correct
15 Correct 7 ms 8536 KB Output is correct
16 Correct 5 ms 8376 KB Output is correct
17 Correct 5 ms 8536 KB Output is correct
18 Correct 5 ms 8536 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 5 ms 8536 KB Output is correct
22 Correct 5 ms 8348 KB Output is correct
23 Correct 5 ms 8456 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 4 ms 7256 KB Output is correct
26 Correct 5 ms 8536 KB Output is correct
27 Correct 4 ms 8536 KB Output is correct
28 Correct 5 ms 8536 KB Output is correct
29 Correct 5 ms 8412 KB Output is correct
30 Correct 5 ms 8496 KB Output is correct
31 Correct 5 ms 8536 KB Output is correct
32 Correct 4 ms 8536 KB Output is correct
33 Correct 4 ms 8536 KB Output is correct
34 Correct 5 ms 8536 KB Output is correct
35 Correct 4 ms 8536 KB Output is correct
36 Correct 94 ms 70740 KB Output is correct
37 Correct 136 ms 105408 KB Output is correct
38 Correct 132 ms 105144 KB Output is correct
39 Correct 132 ms 105248 KB Output is correct
40 Correct 132 ms 105144 KB Output is correct
41 Correct 135 ms 105276 KB Output is correct
42 Correct 129 ms 105236 KB Output is correct
43 Correct 129 ms 105224 KB Output is correct
44 Correct 109 ms 105224 KB Output is correct
45 Correct 137 ms 105276 KB Output is correct
46 Correct 124 ms 105280 KB Output is correct
47 Correct 129 ms 105268 KB Output is correct
48 Correct 132 ms 105132 KB Output is correct
49 Correct 136 ms 105272 KB Output is correct
50 Correct 114 ms 105164 KB Output is correct
51 Correct 136 ms 105240 KB Output is correct
52 Correct 134 ms 105176 KB Output is correct
53 Correct 141 ms 105144 KB Output is correct
54 Correct 131 ms 105144 KB Output is correct
55 Correct 130 ms 105224 KB Output is correct
56 Correct 143 ms 105272 KB Output is correct
57 Correct 137 ms 101856 KB Output is correct
58 Correct 133 ms 105196 KB Output is correct
59 Correct 137 ms 105268 KB Output is correct
60 Correct 130 ms 105288 KB Output is correct
61 Correct 144 ms 105144 KB Output is correct
62 Correct 139 ms 105144 KB Output is correct
63 Correct 137 ms 105144 KB Output is correct
64 Correct 131 ms 105268 KB Output is correct
65 Correct 106 ms 105264 KB Output is correct
66 Correct 130 ms 105296 KB Output is correct
67 Correct 110 ms 105284 KB Output is correct
68 Correct 803 ms 104364 KB Output is correct
69 Correct 1035 ms 105144 KB Output is correct
70 Correct 983 ms 105144 KB Output is correct
71 Correct 1036 ms 105144 KB Output is correct
72 Correct 981 ms 105152 KB Output is correct
73 Correct 980 ms 105144 KB Output is correct
74 Correct 999 ms 105140 KB Output is correct
75 Correct 832 ms 105060 KB Output is correct
76 Correct 832 ms 105264 KB Output is correct
77 Correct 982 ms 105128 KB Output is correct
78 Correct 963 ms 105132 KB Output is correct
79 Correct 817 ms 105124 KB Output is correct
80 Correct 850 ms 105260 KB Output is correct
81 Correct 3 ms 6488 KB Output is correct
82 Correct 5 ms 8552 KB Output is correct
83 Correct 5 ms 8536 KB Output is correct
84 Correct 135 ms 105292 KB Output is correct
85 Correct 130 ms 105144 KB Output is correct
86 Correct 130 ms 105168 KB Output is correct
87 Correct 118 ms 105344 KB Output is correct
88 Correct 133 ms 105268 KB Output is correct
89 Correct 132 ms 105268 KB Output is correct
90 Correct 139 ms 105144 KB Output is correct
91 Correct 140 ms 105144 KB Output is correct
92 Correct 108 ms 105268 KB Output is correct
93 Correct 160 ms 105328 KB Output is correct
94 Correct 5 ms 8536 KB Output is correct
95 Correct 5 ms 8536 KB Output is correct
96 Correct 5 ms 8536 KB Output is correct
97 Correct 5 ms 8536 KB Output is correct
98 Correct 5 ms 8420 KB Output is correct
99 Correct 5 ms 8536 KB Output is correct
100 Correct 5 ms 8488 KB Output is correct
101 Correct 5 ms 8536 KB Output is correct
102 Correct 5 ms 8536 KB Output is correct
103 Correct 5 ms 8536 KB Output is correct
104 Correct 847 ms 94012 KB Output is correct
105 Correct 986 ms 105144 KB Output is correct
106 Correct 970 ms 105160 KB Output is correct
107 Correct 1036 ms 105188 KB Output is correct
108 Correct 993 ms 105136 KB Output is correct
109 Correct 985 ms 105144 KB Output is correct
110 Correct 987 ms 105144 KB Output is correct
111 Correct 856 ms 105264 KB Output is correct
112 Correct 847 ms 105260 KB Output is correct
113 Correct 913 ms 105300 KB Output is correct
114 Correct 875 ms 105128 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 65336 KB Output is correct
2 Correct 876 ms 105220 KB Output is correct
3 Correct 802 ms 105284 KB Output is correct
4 Correct 799 ms 105264 KB Output is correct
5 Correct 890 ms 105264 KB Output is correct
6 Correct 947 ms 105268 KB Output is correct
7 Correct 828 ms 105264 KB Output is correct
8 Correct 3 ms 6488 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 4 ms 8536 KB Output is correct
11 Correct 3 ms 7000 KB Output is correct
12 Correct 4 ms 8536 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 5 ms 8536 KB Output is correct
15 Correct 5 ms 8536 KB Output is correct
16 Correct 6 ms 8536 KB Output is correct
17 Correct 6 ms 8536 KB Output is correct
18 Correct 6 ms 8596 KB Output is correct
19 Correct 8 ms 8532 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 5 ms 8432 KB Output is correct
22 Correct 2 ms 6488 KB Output is correct
23 Correct 5 ms 8536 KB Output is correct
24 Correct 5 ms 8536 KB Output is correct
25 Correct 7 ms 8536 KB Output is correct
26 Correct 5 ms 8376 KB Output is correct
27 Correct 5 ms 8536 KB Output is correct
28 Correct 5 ms 8536 KB Output is correct
29 Correct 4 ms 8536 KB Output is correct
30 Correct 5 ms 8536 KB Output is correct
31 Correct 5 ms 8536 KB Output is correct
32 Correct 5 ms 8348 KB Output is correct
33 Correct 5 ms 8456 KB Output is correct
34 Correct 5 ms 8536 KB Output is correct
35 Correct 4 ms 7256 KB Output is correct
36 Correct 5 ms 8536 KB Output is correct
37 Correct 4 ms 8536 KB Output is correct
38 Correct 5 ms 8536 KB Output is correct
39 Correct 5 ms 8412 KB Output is correct
40 Correct 5 ms 8496 KB Output is correct
41 Correct 5 ms 8536 KB Output is correct
42 Correct 4 ms 8536 KB Output is correct
43 Correct 4 ms 8536 KB Output is correct
44 Correct 5 ms 8536 KB Output is correct
45 Correct 4 ms 8536 KB Output is correct
46 Correct 94 ms 70740 KB Output is correct
47 Correct 136 ms 105408 KB Output is correct
48 Correct 132 ms 105144 KB Output is correct
49 Correct 132 ms 105248 KB Output is correct
50 Correct 132 ms 105144 KB Output is correct
51 Correct 135 ms 105276 KB Output is correct
52 Correct 129 ms 105236 KB Output is correct
53 Correct 129 ms 105224 KB Output is correct
54 Correct 109 ms 105224 KB Output is correct
55 Correct 137 ms 105276 KB Output is correct
56 Correct 124 ms 105280 KB Output is correct
57 Correct 129 ms 105268 KB Output is correct
58 Correct 132 ms 105132 KB Output is correct
59 Correct 136 ms 105272 KB Output is correct
60 Correct 114 ms 105164 KB Output is correct
61 Correct 136 ms 105240 KB Output is correct
62 Correct 134 ms 105176 KB Output is correct
63 Correct 141 ms 105144 KB Output is correct
64 Correct 131 ms 105144 KB Output is correct
65 Correct 130 ms 105224 KB Output is correct
66 Correct 143 ms 105272 KB Output is correct
67 Correct 137 ms 101856 KB Output is correct
68 Correct 133 ms 105196 KB Output is correct
69 Correct 137 ms 105268 KB Output is correct
70 Correct 130 ms 105288 KB Output is correct
71 Correct 144 ms 105144 KB Output is correct
72 Correct 139 ms 105144 KB Output is correct
73 Correct 137 ms 105144 KB Output is correct
74 Correct 131 ms 105268 KB Output is correct
75 Correct 106 ms 105264 KB Output is correct
76 Correct 130 ms 105296 KB Output is correct
77 Correct 110 ms 105284 KB Output is correct
78 Correct 803 ms 104364 KB Output is correct
79 Correct 1035 ms 105144 KB Output is correct
80 Correct 983 ms 105144 KB Output is correct
81 Correct 1036 ms 105144 KB Output is correct
82 Correct 981 ms 105152 KB Output is correct
83 Correct 980 ms 105144 KB Output is correct
84 Correct 999 ms 105140 KB Output is correct
85 Correct 832 ms 105060 KB Output is correct
86 Correct 832 ms 105264 KB Output is correct
87 Correct 982 ms 105128 KB Output is correct
88 Correct 963 ms 105132 KB Output is correct
89 Correct 817 ms 105124 KB Output is correct
90 Correct 850 ms 105260 KB Output is correct
91 Correct 3 ms 6488 KB Output is correct
92 Correct 5 ms 8552 KB Output is correct
93 Correct 5 ms 8536 KB Output is correct
94 Correct 135 ms 105292 KB Output is correct
95 Correct 130 ms 105144 KB Output is correct
96 Correct 130 ms 105168 KB Output is correct
97 Correct 118 ms 105344 KB Output is correct
98 Correct 133 ms 105268 KB Output is correct
99 Correct 132 ms 105268 KB Output is correct
100 Correct 139 ms 105144 KB Output is correct
101 Correct 140 ms 105144 KB Output is correct
102 Correct 108 ms 105268 KB Output is correct
103 Correct 160 ms 105328 KB Output is correct
104 Correct 5 ms 8536 KB Output is correct
105 Correct 5 ms 8536 KB Output is correct
106 Correct 5 ms 8536 KB Output is correct
107 Correct 5 ms 8536 KB Output is correct
108 Correct 5 ms 8420 KB Output is correct
109 Correct 5 ms 8536 KB Output is correct
110 Correct 5 ms 8488 KB Output is correct
111 Correct 5 ms 8536 KB Output is correct
112 Correct 5 ms 8536 KB Output is correct
113 Correct 5 ms 8536 KB Output is correct
114 Correct 284 ms 30188 KB Output is correct
115 Correct 884 ms 105144 KB Output is correct
116 Correct 852 ms 105144 KB Output is correct
117 Correct 890 ms 105256 KB Output is correct
118 Correct 885 ms 105144 KB Output is correct
119 Correct 920 ms 105164 KB Output is correct
120 Correct 834 ms 105144 KB Output is correct
121 Correct 841 ms 105140 KB Output is correct
122 Correct 885 ms 105264 KB Output is correct
123 Correct 847 ms 105264 KB Output is correct
124 Correct 864 ms 105076 KB Output is correct
125 Correct 141 ms 105144 KB Output is correct
126 Correct 138 ms 105144 KB Output is correct
127 Correct 153 ms 105144 KB Output is correct
128 Correct 105 ms 105260 KB Output is correct
129 Correct 133 ms 105328 KB Output is correct
130 Correct 125 ms 101896 KB Output is correct
131 Correct 136 ms 105144 KB Output is correct
132 Correct 158 ms 105144 KB Output is correct
133 Correct 136 ms 105144 KB Output is correct
134 Correct 140 ms 105144 KB Output is correct
135 Correct 137 ms 105144 KB Output is correct
136 Correct 130 ms 105252 KB Output is correct
137 Correct 134 ms 105264 KB Output is correct
138 Correct 110 ms 105260 KB Output is correct
139 Correct 129 ms 105280 KB Output is correct
140 Correct 124 ms 105284 KB Output is correct
141 Correct 5 ms 8536 KB Output is correct
142 Correct 5 ms 8536 KB Output is correct
143 Correct 5 ms 8536 KB Output is correct
144 Correct 5 ms 8536 KB Output is correct
145 Correct 5 ms 8536 KB Output is correct
146 Correct 3 ms 7256 KB Output is correct
147 Correct 5 ms 8536 KB Output is correct
148 Correct 5 ms 8536 KB Output is correct
149 Correct 5 ms 8420 KB Output is correct
150 Correct 5 ms 8536 KB Output is correct
151 Correct 5 ms 8536 KB Output is correct
152 Correct 5 ms 8536 KB Output is correct
153 Correct 5 ms 8444 KB Output is correct
154 Correct 5 ms 8536 KB Output is correct
155 Correct 5 ms 8512 KB Output is correct
156 Correct 5 ms 8536 KB Output is correct
157 Correct 847 ms 94012 KB Output is correct
158 Correct 986 ms 105144 KB Output is correct
159 Correct 970 ms 105160 KB Output is correct
160 Correct 1036 ms 105188 KB Output is correct
161 Correct 993 ms 105136 KB Output is correct
162 Correct 985 ms 105144 KB Output is correct
163 Correct 987 ms 105144 KB Output is correct
164 Correct 856 ms 105264 KB Output is correct
165 Correct 847 ms 105260 KB Output is correct
166 Correct 913 ms 105300 KB Output is correct
167 Correct 875 ms 105128 KB Output is correct
168 Correct 3 ms 6488 KB Output is correct
169 Correct 580 ms 40772 KB Output is correct
170 Correct 1129 ms 105416 KB Output is correct
171 Correct 1156 ms 105144 KB Output is correct
172 Correct 1157 ms 105144 KB Output is correct
173 Correct 1117 ms 105144 KB Output is correct
174 Correct 1136 ms 105144 KB Output is correct
175 Correct 1101 ms 105144 KB Output is correct
176 Correct 796 ms 105260 KB Output is correct
177 Correct 816 ms 105260 KB Output is correct
178 Correct 900 ms 105128 KB Output is correct
179 Correct 833 ms 105092 KB Output is correct