oj.uz

Submission #285657

# Submission time Handle Problem Language Result Execution time Memory
285657 2020-08-29T11:35:39 Z MKopchev Rectangles (IOI19_rect) C++14
100 / 100
 4124 ms 572024 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2500+42,ST=1<<13,ADD=1<<12;

int bigger_up[nmax][nmax],bigger_down[nmax][nmax],bigger_right[nmax][nmax],bigger_left[nmax][nmax];

int tree_up[nmax][ST];

int WANTED_AT_LEAST,WANTED_AT_MOST;

void build_up(int id,int l,int r)
{
    for(int i=ST-1;i>=ADD;i--)
    {
        int where=i-ADD;
        if(where<r)tree_up[id][i]=bigger_up[id][where];
    }

    for(int i=ADD-1;i>=1;i--)
    {
        tree_up[id][i]=max(tree_up[id][i*2],tree_up[id][i*2+1]);
    }
}

int query_up(int id,int node,int l,int r,int lq,int rq)
{
    lq=lq+ADD;
    rq=rq+ADD;

    while(lq<=rq)
    {
        if(tree_up[id][lq]>=WANTED_AT_LEAST)return 1;
        if(tree_up[id][rq]>=WANTED_AT_LEAST)return 1;

        lq=(lq+1)/2;
        rq=(rq-1)/2;
    }
    return 0;
}


int tree_down[nmax][ST];

void build_down(int id,int node,int l,int r)
{
    if(l==r)
    {
        tree_down[id][node]=bigger_down[id][l];
        return;
    }
    int av=(l+r)/2;

    build_down(id,node*2,l,av);
    build_down(id,node*2+1,av+1,r);

    tree_down[id][node]=min(tree_down[id][node*2],tree_down[id][node*2+1]);
}

int fast_down_left(int id,int node,int l,int r,int lq,int rq)
{
    while(tree_down[id][node]<=WANTED_AT_MOST)
    {
        if(l==lq&&r==rq)return 1;

        int av=(l+r)/2;

        if(av<lq)
        {
            l=av+1;
            node=node*2+1;
            continue;
        }

        if(tree_down[id][node*2+1]<=WANTED_AT_MOST)return 1;

        node=node*2;

        r=av;
        rq=av;
    }

    return 0;
}

int fast_down_right(int id,int node,int l,int r,int lq,int rq)
{
    while(tree_down[id][node]<=WANTED_AT_MOST)
    {
        if(l==lq&&r==rq)return 1;

        int av=(l+r)/2;

        if(rq<=av)
        {
            r=av;
            node=node*2;
            continue;
        }

        if(tree_down[id][node*2]<=WANTED_AT_MOST)return 1;

        node=node*2+1;

        l=av+1;
        lq=av+1;
    }

    return 0;
}

int query_down(int id,int node,int l,int r,int lq,int rq)
{
    //cout<<"query_down "<<id<<" "<<node<<" "<<l<<" "<<r<<" "<<lq<<" "<<rq<<endl;

    while(tree_down[id][node]<=WANTED_AT_MOST)
    {
        if(l==lq&&r==rq)return 1;

        int av=(l+r)/2;

        if(rq<=av)
        {
            node=node*2;
            r=av;
            continue;
        }
        if(av<lq)
        {
            node=node*2+1;
            l=av+1;
            continue;
        }
        if(fast_down_left(id,node*2,l,av,lq,av))return 1;
        return fast_down_right(id,node*2+1,av+1,r,av+1,rq);
    }
    return 0;
}




int tree_left[nmax][ST];

void build_left(int id,int l,int r)
{
    for(int i=ST-1;i>=ADD;i--)
    {
        int where=i-ADD;
        if(where<r)tree_left[id][i]=bigger_left[where][id];
    }

    for(int i=ADD-1;i>=1;i--)
    {
        tree_left[id][i]=max(tree_left[id][i*2],tree_left[id][i*2+1]);
    }
}

int query_left(int id,int node,int l,int r,int lq,int rq)
{
    lq=lq+ADD;
    rq=rq+ADD;

    while(lq<=rq)
    {
        if(tree_left[id][lq]>=WANTED_AT_LEAST)return 1;
        if(tree_left[id][rq]>=WANTED_AT_LEAST)return 1;

        lq=(lq+1)/2;
        rq=(rq-1)/2;
    }
    return 0;
}



int tree_right[nmax][ST];

void build_right(int id,int node,int l,int r)
{
    if(l==r)
    {
        tree_right[id][node]=bigger_right[l][id];
        return;
    }
    int av=(l+r)/2;

    build_right(id,node*2,l,av);
    build_right(id,node*2+1,av+1,r);

    tree_right[id][node]=min(tree_right[id][node*2],tree_right[id][node*2+1]);
}

int fast_right_left(int id,int node,int l,int r,int lq,int rq)
{
    while(tree_right[id][node]<=WANTED_AT_MOST)
    {
        if(l==lq&&r==rq)return 1;

        int av=(l+r)/2;

        if(av<lq)
        {
            l=av+1;
            node=node*2+1;
            continue;
        }

        if(tree_right[id][node*2+1]<=WANTED_AT_MOST)return 1;

        node=node*2;

        r=av;
        rq=av;
    }

    return 0;
}

int fast_right_right(int id,int node,int l,int r,int lq,int rq)
{
    while(tree_right[id][node]<=WANTED_AT_MOST)
    {
        if(l==lq&&r==rq)return 1;

        int av=(l+r)/2;

        if(rq<=av)
        {
            r=av;
            node=node*2;
            continue;
        }

        if(tree_right[id][node*2]<=WANTED_AT_MOST)return 1;

        node=node*2+1;

        l=av+1;
        lq=av+1;
    }

    return 0;
}

int query_right(int id,int node,int l,int r,int lq,int rq)
{
    //cout<<"query_right "<<id<<" "<<node<<" "<<l<<" "<<r<<" "<<lq<<" "<<rq<<endl;

    while(tree_right[id][node]<=WANTED_AT_MOST)
    {
        if(l==lq&&r==rq)return 1;

        int av=(l+r)/2;

        if(rq<=av)
        {
            node=node*2;
            r=av;
            continue;
        }
        if(av<lq)
        {
            node=node*2+1;
            l=av+1;
            continue;
        }
        if(fast_right_left(id,node*2,l,av,lq,av))return 1;
        return fast_right_right(id,node*2+1,av+1,r,av+1,rq);
    }
    return 0;
}



stack<int> active,idle;

int pointer=0;

struct rect
{
    int x1,y1,x2,y2;
};

rect to_test[nmax*nmax];

bool cmp(rect a,rect b)
{
    if(a.x1!=b.x1)return a.x1<b.x1;
    if(a.y1!=b.y1)return a.y1<b.y1;
    if(a.x2!=b.x2)return a.x2<b.x2;
    return a.y2<b.y2;
}

bool eq(rect a,rect b)
{
    return a.x1==b.x1&&a.y1==b.y1&&a.x2==b.x2&&a.y2==b.y2;
}

int n,m;

bool test(rect a)
{
    //cout<<"to test "<<a.x1<<" "<<a.y1<<" "<<a.x2<<" "<<a.y2<<endl;

    WANTED_AT_LEAST=a.x1;

    if(query_up(a.x2+1,1,0,m-1,a.y1,a.y2))return 0;

    WANTED_AT_MOST=a.x2;

    if(query_down(a.x1-1,1,0,m-1,a.y1,a.y2))return 0;

    WANTED_AT_LEAST=a.y1;

    if(query_left(a.y2+1,1,0,n-1,a.x1,a.x2))return 0;

    WANTED_AT_MOST=a.y2;

    if(query_right(a.y1-1,1,0,n-1,a.x1,a.x2))return 0;

    return 1;
}

vector< vector<int> > inp;

void eval(int type)//1=> bigger, 0=> bigger or equal
{
    n=inp.size();
	m=inp[0].size();

	for(int i=0;i<n;i++)
    {
        active=idle;

        for(int j=0;j<m;j++)
        {
            while(active.size()&&inp[i][active.top()]+type<=inp[i][j])active.pop();

            if(active.size())bigger_left[i][j]=active.top();
            else bigger_left[i][j]=-1;

            active.push(j);
        }
    }

    for(int i=0;i<n;i++)
    {
        active=idle;

        for(int j=m-1;j>=0;j--)
        {
            while(active.size()&&inp[i][active.top()]+type<=inp[i][j])active.pop();

            if(active.size())bigger_right[i][j]=active.top();
            else bigger_right[i][j]=m;

            active.push(j);
        }
    }

    for(int j=0;j<m;j++)
    {
        active=idle;

        for(int i=0;i<n;i++)
        {
            while(active.size()&&inp[active.top()][j]+type<=inp[i][j])active.pop();

            if(active.size())bigger_up[i][j]=active.top();
            else bigger_up[i][j]=-1;

            active.push(i);
        }
    }

    for(int j=0;j<m;j++)
    {
        active=idle;

        for(int i=n-1;i>=0;i--)
        {
            while(active.size()&&inp[active.top()][j]+type<=inp[i][j])active.pop();

            if(active.size())bigger_down[i][j]=active.top();
            else bigger_down[i][j]=n;

            active.push(i);
        }
    }
}

long long count_rectangles(std::vector<std::vector<int> > a)
{
    inp=a;

    int n=inp.size();
	int m=inp[0].size();

    eval(0);
    /*
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        {
            cout<<i<<" "<<j<<" -> "<<bigger_up[i][j]<<" "<<bigger_right[i][j]<<" "<<bigger_down[i][j]<<" "<<bigger_left[i][j]<<endl;
        }
    */

    pointer=0;

    for(int i=1;i<n-1;i++)
        for(int j=1;j<m-1;j++)
        {
            rect cur;

            cur.x1=bigger_up[i][j]+1;
            cur.y1=bigger_left[i][j]+1;
            cur.x2=bigger_down[i][j]-1;
            cur.y2=bigger_right[i][j]-1;

            //cout<<i<<" "<<j<<" -> "<<cur.x1<<" "<<cur.y1<<" "<<cur.x2<<" "<<cur.y2<<endl;

            if(1<=cur.x1&&cur.x2<=n-2&&1<=cur.y1&&cur.y2<=m-2)
            {
                pointer++;

                to_test[pointer]=cur;
            }
        }

    sort(to_test+1,to_test+pointer+1,cmp);

    eval(1);

    for(int i=0;i<n;i++)
    {
        build_up(i,0,m-1);
        build_down(i,1,0,m-1);
    }

    for(int j=0;j<m;j++)
    {
        build_right(j,1,0,n-1);
        build_left(j,0,n-1);
    }

    int outp=0;

    for(int i=1;i<=pointer;i++)
    {
        if(eq(to_test[i-1],to_test[i]))continue;

        outp+=test(to_test[i]);
    }

    return outp;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 3 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 3 ms 2304 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 3 ms 2304 KB Output is correct
11 Correct 2 ms 2304 KB Output is correct
12 Correct 2 ms 2304 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 1024 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 2 ms 2304 KB Output is correct
20 Correct 2 ms 1920 KB Output is correct
21 Correct 1 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 3 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 3 ms 2304 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 3 ms 2304 KB Output is correct
11 Correct 2 ms 2304 KB Output is correct
12 Correct 2 ms 2304 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 1024 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 6 ms 5760 KB Output is correct
18 Correct 6 ms 5888 KB Output is correct
19 Correct 6 ms 5760 KB Output is correct
20 Correct 7 ms 5760 KB Output is correct
21 Correct 7 ms 5760 KB Output is correct
22 Correct 10 ms 5760 KB Output is correct
23 Correct 7 ms 5760 KB Output is correct
24 Correct 5 ms 4736 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 2 ms 2304 KB Output is correct
28 Correct 2 ms 1920 KB Output is correct
29 Correct 1 ms 768 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 3 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 3 ms 2304 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 3 ms 2304 KB Output is correct
11 Correct 2 ms 2304 KB Output is correct
12 Correct 2 ms 2304 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 1024 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 6 ms 5760 KB Output is correct
18 Correct 6 ms 5888 KB Output is correct
19 Correct 6 ms 5760 KB Output is correct
20 Correct 7 ms 5760 KB Output is correct
21 Correct 7 ms 5760 KB Output is correct
22 Correct 10 ms 5760 KB Output is correct
23 Correct 7 ms 5760 KB Output is correct
24 Correct 5 ms 4736 KB Output is correct
25 Correct 26 ms 15104 KB Output is correct
26 Correct 22 ms 15104 KB Output is correct
27 Correct 26 ms 15224 KB Output is correct
28 Correct 23 ms 14848 KB Output is correct
29 Correct 27 ms 14972 KB Output is correct
30 Correct 30 ms 15232 KB Output is correct
31 Correct 27 ms 15104 KB Output is correct
32 Correct 27 ms 14976 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 2 ms 2304 KB Output is correct
36 Correct 2 ms 1920 KB Output is correct
37 Correct 1 ms 768 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 3 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 3 ms 2304 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 3 ms 2304 KB Output is correct
11 Correct 2 ms 2304 KB Output is correct
12 Correct 2 ms 2304 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 1024 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 6 ms 5760 KB Output is correct
18 Correct 6 ms 5888 KB Output is correct
19 Correct 6 ms 5760 KB Output is correct
20 Correct 7 ms 5760 KB Output is correct
21 Correct 7 ms 5760 KB Output is correct
22 Correct 10 ms 5760 KB Output is correct
23 Correct 7 ms 5760 KB Output is correct
24 Correct 5 ms 4736 KB Output is correct
25 Correct 26 ms 15104 KB Output is correct
26 Correct 22 ms 15104 KB Output is correct
27 Correct 26 ms 15224 KB Output is correct
28 Correct 23 ms 14848 KB Output is correct
29 Correct 27 ms 14972 KB Output is correct
30 Correct 30 ms 15232 KB Output is correct
31 Correct 27 ms 15104 KB Output is correct
32 Correct 27 ms 14976 KB Output is correct
33 Correct 131 ms 71092 KB Output is correct
34 Correct 139 ms 71160 KB Output is correct
35 Correct 139 ms 71036 KB Output is correct
36 Correct 139 ms 71160 KB Output is correct
37 Correct 211 ms 78712 KB Output is correct
38 Correct 211 ms 78804 KB Output is correct
39 Correct 218 ms 78688 KB Output is correct
40 Correct 197 ms 75128 KB Output is correct
41 Correct 183 ms 74488 KB Output is correct
42 Correct 207 ms 75896 KB Output is correct
43 Correct 272 ms 78072 KB Output is correct
44 Correct 286 ms 78456 KB Output is correct
45 Correct 145 ms 53624 KB Output is correct
46 Correct 139 ms 47904 KB Output is correct
47 Correct 280 ms 78456 KB Output is correct
48 Correct 280 ms 78348 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 2 ms 2304 KB Output is correct
52 Correct 2 ms 1920 KB Output is correct
53 Correct 1 ms 768 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 61048 KB Output is correct
2 Correct 50 ms 52096 KB Output is correct
3 Correct 61 ms 61004 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 59 ms 61048 KB Output is correct
6 Correct 58 ms 61048 KB Output is correct
7 Correct 59 ms 61048 KB Output is correct
8 Correct 60 ms 61048 KB Output is correct
9 Correct 58 ms 61048 KB Output is correct
10 Correct 56 ms 60792 KB Output is correct
11 Correct 58 ms 60920 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1162 ms 282300 KB Output is correct
3 Correct 2522 ms 522492 KB Output is correct
4 Correct 2531 ms 523264 KB Output is correct
5 Correct 2612 ms 523400 KB Output is correct
6 Correct 775 ms 270796 KB Output is correct
7 Correct 1450 ms 460900 KB Output is correct
8 Correct 1570 ms 474488 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 2 ms 2304 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 1 ms 768 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 3 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 3 ms 2304 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 3 ms 2304 KB Output is correct
11 Correct 2 ms 2304 KB Output is correct
12 Correct 2 ms 2304 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 1024 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 6 ms 5760 KB Output is correct
18 Correct 6 ms 5888 KB Output is correct
19 Correct 6 ms 5760 KB Output is correct
20 Correct 7 ms 5760 KB Output is correct
21 Correct 7 ms 5760 KB Output is correct
22 Correct 10 ms 5760 KB Output is correct
23 Correct 7 ms 5760 KB Output is correct
24 Correct 5 ms 4736 KB Output is correct
25 Correct 26 ms 15104 KB Output is correct
26 Correct 22 ms 15104 KB Output is correct
27 Correct 26 ms 15224 KB Output is correct
28 Correct 23 ms 14848 KB Output is correct
29 Correct 27 ms 14972 KB Output is correct
30 Correct 30 ms 15232 KB Output is correct
31 Correct 27 ms 15104 KB Output is correct
32 Correct 27 ms 14976 KB Output is correct
33 Correct 131 ms 71092 KB Output is correct
34 Correct 139 ms 71160 KB Output is correct
35 Correct 139 ms 71036 KB Output is correct
36 Correct 139 ms 71160 KB Output is correct
37 Correct 211 ms 78712 KB Output is correct
38 Correct 211 ms 78804 KB Output is correct
39 Correct 218 ms 78688 KB Output is correct
40 Correct 197 ms 75128 KB Output is correct
41 Correct 183 ms 74488 KB Output is correct
42 Correct 207 ms 75896 KB Output is correct
43 Correct 272 ms 78072 KB Output is correct
44 Correct 286 ms 78456 KB Output is correct
45 Correct 145 ms 53624 KB Output is correct
46 Correct 139 ms 47904 KB Output is correct
47 Correct 280 ms 78456 KB Output is correct
48 Correct 280 ms 78348 KB Output is correct
49 Correct 58 ms 61048 KB Output is correct
50 Correct 50 ms 52096 KB Output is correct
51 Correct 61 ms 61004 KB Output is correct
52 Correct 1 ms 512 KB Output is correct
53 Correct 59 ms 61048 KB Output is correct
54 Correct 58 ms 61048 KB Output is correct
55 Correct 59 ms 61048 KB Output is correct
56 Correct 60 ms 61048 KB Output is correct
57 Correct 58 ms 61048 KB Output is correct
58 Correct 56 ms 60792 KB Output is correct
59 Correct 58 ms 60920 KB Output is correct
60 Correct 1 ms 1024 KB Output is correct
61 Correct 1162 ms 282300 KB Output is correct
62 Correct 2522 ms 522492 KB Output is correct
63 Correct 2531 ms 523264 KB Output is correct
64 Correct 2612 ms 523400 KB Output is correct
65 Correct 775 ms 270796 KB Output is correct
66 Correct 1450 ms 460900 KB Output is correct
67 Correct 1570 ms 474488 KB Output is correct
68 Correct 1994 ms 474744 KB Output is correct
69 Correct 1752 ms 474744 KB Output is correct
70 Correct 1803 ms 474184 KB Output is correct
71 Correct 1747 ms 474232 KB Output is correct
72 Correct 3391 ms 571940 KB Output is correct
73 Correct 2466 ms 362808 KB Output is correct
74 Correct 2424 ms 412632 KB Output is correct
75 Correct 4035 ms 570732 KB Output is correct
76 Correct 2431 ms 362608 KB Output is correct
77 Correct 3081 ms 476748 KB Output is correct
78 Correct 4124 ms 570864 KB Output is correct
79 Correct 2367 ms 362464 KB Output is correct
80 Correct 4094 ms 570428 KB Output is correct
81 Correct 3991 ms 558796 KB Output is correct
82 Correct 1812 ms 402776 KB Output is correct
83 Correct 3414 ms 571644 KB Output is correct
84 Correct 3506 ms 572024 KB Output is correct
85 Correct 3407 ms 571884 KB Output is correct
86 Correct 1 ms 384 KB Output is correct
87 Correct 1 ms 512 KB Output is correct
88 Correct 2 ms 2304 KB Output is correct
89 Correct 2 ms 1920 KB Output is correct
90 Correct 1 ms 768 KB Output is correct