oj.uz

Submission #1095162

# Submission time Handle Problem Language Result Execution time Memory
1095162 2024-10-01T13:02:58 Z simona1230 Joker (BOI20_joker) C++17
71 / 100
 1429 ms 17980 KB 
#include <bits/stdc++.h>

using namespace std;
struct query
{
    int l,r,i;
    query(){}
    query(int _l,int _r,int _i)
    {
        l=_l;
        r=_r;
        i=_i;
    }
};

struct edge
{
    int x,y;
    edge(){}
    edge(int _x,int _y)
    {
        x=_x;
        y=_y;
    }
};

int n,m,k;
query a[200001];
pair<int,int> e[200001],q[200001];

void read()
{
    cin>>n>>m>>k;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        e[i]={x,y};
    }

    for(int i=1;i<=k;i++)
    {
        int l,r;
        cin>>l>>r;
        q[i]={l,r};
        a[i]={l,r,i};
    }
}

int used[200001];
vector<int> v[200001];
bool pos;

void dfs(int i)
{
    for(int j=0;j<v[i].size();j++)
    {
        int nb=v[i][j];
        if(!used[nb])
        {
            used[nb]=1;
            if(used[i]==1)used[nb]=2;

            dfs(nb);
        }
        else if(used[i]==used[nb])pos=0;
    }
}

void slow()
{
    for(int i=1;i<=k;i++)
    {
        pos=1;
        for(int j=1;j<=n;j++)
        {
            used[j]=0;
            v[j].clear();
        }

        for(int j=1;j<q[i].first;j++)
        {
            v[e[j].first].push_back(e[j].second);
            v[e[j].second].push_back(e[j].first);
        }

        for(int j=q[i].second+1;j<=m;j++)
        {
            v[e[j].first].push_back(e[j].second);
            v[e[j].second].push_back(e[j].first);
        }

        for(int j=1;j<=n;j++)
        {
            if(!used[j])
            {
                used[j]=1;
                dfs(j);
            }
        }

        if(pos)cout<<"NO"<<endl;
        else cout<<"YES"<<endl;
    }
}


int minr[200001];
int sz[200001];
pair<int,int> p[200001];

void init()
{
    pos=1;
    for(int i=1;i<=n;i++)
        p[i]={i,0},sz[i]=1;
}

pair<int,int> parent(int x)
{
    if(x==p[x].first)return p[x];
    int curr=p[x].second;

    p[x]=parent(p[x].first);
    p[x].second+=curr;
    return p[x];
}

void unite(int x,int y)
{
    pair<int,int> pxx=parent(x);
    pair<int,int> pyy=parent(y);

    int px=pxx.first;
    int py=pyy.first;

    if(px!=py)
    {
        if(sz[px]>sz[py])swap(px,py);

        p[px]={py,pxx.second+1+pyy.second};
        sz[py]+=sz[px];
    }
    else
    {
        //cout<<x<<" "<<y<<" "<<pxx.second<<" "<<pyy.second<<endl;
        if(pxx.second%2==pyy.second%2)
            pos=0;
    }
}

void subt()
{
    for(int i=1;i<=min(200,m);i++)
    {
        //cout<<i<<endl;
        init();
        for(int j=1;j<i;j++)
        {
            unite(e[j].first,e[j].second);
            if(pos==0)
            {
                //cout<<"in"<<" "<<i<<" "<<j<<endl;
                minr[i]=m+1;
                break;
            }
        }
        for(int j=m;j>i;j--)
        {
            unite(e[j].first,e[j].second);
            if(pos==0)
            {
                //cout<<"in"<<" "<<i<<" "<<j<<endl;
                minr[i]=max(minr[i],j);
                break;
            }
        }
    }

    for(int i=1;i<=k;i++)
    {
        if(minr[q[i].first]>q[i].second)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
}

int s;

bool cmp(query q1,query q2)
{
    int b1=q1.l/s;
    int b2=q2.l/s;
    if(q1.l%s!=0)b1++;
    if(q2.l%s!=0)b2++;

    if(b1==b2)return q1.r>q2.r;
    return q1.l<q2.l;
}

stack<pair<int,int> > st;
int cnt1,cnt2;

pair<int,int> parent2(int x)
{
    if(p[x].first==x)return p[x];
    pair<int,int> h=parent2(p[x].first);
    h.second+=p[x].second;
    return h;
}

void unite2(int x,int y,int&cnt)
{
    //cout<<x<<" + "<<y<<endl;
    pair<int,int> pxx=parent2(x);
    pair<int,int> pyy=parent2(y);

    int px=pxx.first;
    int py=pyy.first;
    if(px!=py)
    {
        if(sz[px]>sz[py])swap(px,py);

        p[px]={py,pxx.second+pyy.second+1};
        sz[py]+=sz[px];
        st.push({px,py});
        cnt++;
        //cout<<"in"<<endl;
    }
    else
    {
        if(pxx.second%2==pyy.second%2)
        {
            pos=1;
            //cout<<"fing"<<endl;
        }
    }
}

int nun;

void rollback()
{
    pair<int,int> h=st.top();
    st.pop();

    //cout<<h.first<<" - "<<h.second<<endl;
    sz[h.second]-=sz[h.first];
    p[h.first]={h.first,0};
}

int ans[200001];
bool mark;

void small()
{
    init();
    s=sqrt(m);
    sort(a+1,a+k+1,cmp);

    int bg=1;
    int curr=m;
    int pr=0;
    int all=0;
    pos=0;
    for(int i=1;i<=k;i++)
    {
        //cout<<i<<"!"<<" "<<all<<endl;
        if(all==1)
        {
            ans[a[i].i]=1;
            continue;
        }
        int b=a[i].l/s;
        if(a[i].l%s!=0)b++;
        //cout<<"i "<<a[i].l<<" "<<b<<endl;
        if(pr!=b)
        {
            if(mark)pos=0,mark=0;
            while(cnt2)
            {
                cnt2--;
                rollback();
            }
            curr=m;

            bool pc=pos;

            for(int j=bg+1;j<=(b-1)*s;j++)
            {
                //cout<<"added "<<j<<endl;
                unite2(e[j].first,e[j].second,nun);
            }

            if(pos)all=1;
            bg=(b-1)*s;
            pr=b;
        }

        bool pc1=pos;
        while(curr>a[i].r)
        {
            unite2(e[curr].first,e[curr].second,cnt2);
            curr--;
        }
        //cout<<pos<<endl;
        if(pos==1&&pc1==0)mark=1;

        bool pc=pos;
        for(int j=(b-1)*(s)+1;j<a[i].l;j++)
            unite2(e[j].first,e[j].second,cnt1);

        if(pos)ans[a[i].i]=1;

        while(cnt1)
        {
            cnt1--;
            rollback();
        }

        pos=pc;
    }

    for(int i=1;i<=k;i++)
        if(ans[i])cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
}




int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	read();
	if(k<=2000)small();
	else if(n<=2000)slow();
	else subt();

	//slow();
	return 0;
}
/*
6 8 2
1 3
1 5
1 6
2 5
2 6
3 4
3 5
5 6

1 8
8 8
*/

Compilation message

Joker.cpp: In function 'void dfs(int)':
Joker.cpp:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int j=0;j<v[i].size();j++)
      |                 ~^~~~~~~~~~~~
Joker.cpp: In function 'void small()':
Joker.cpp:286:18: warning: unused variable 'pc' [-Wunused-variable]
  286 |             bool pc=pos;
      |                  ^~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 3 ms 5196 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 5184 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 2 ms 5212 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct
16 Correct 2 ms 5096 KB Output is correct
17 Correct 3 ms 5184 KB Output is correct
18 Correct 3 ms 4984 KB Output is correct
19 Correct 2 ms 5036 KB Output is correct
20 Correct 3 ms 5208 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 3 ms 5208 KB Output is correct
23 Correct 4 ms 5208 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 5212 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 3 ms 5184 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 3 ms 5196 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 5184 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 2 ms 5212 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct
16 Correct 2 ms 5096 KB Output is correct
17 Correct 3 ms 5184 KB Output is correct
18 Correct 3 ms 4984 KB Output is correct
19 Correct 2 ms 5036 KB Output is correct
20 Correct 3 ms 5208 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 3 ms 5208 KB Output is correct
23 Correct 4 ms 5208 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 5212 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 3 ms 5184 KB Output is correct
29 Correct 6 ms 5212 KB Output is correct
30 Correct 6 ms 5208 KB Output is correct
31 Correct 6 ms 5208 KB Output is correct
32 Correct 6 ms 5192 KB Output is correct
33 Correct 5 ms 5212 KB Output is correct
34 Correct 6 ms 5208 KB Output is correct
35 Correct 6 ms 5212 KB Output is correct
36 Correct 5 ms 5212 KB Output is correct
37 Correct 6 ms 5212 KB Output is correct
38 Correct 5 ms 5340 KB Output is correct
39 Correct 6 ms 5208 KB Output is correct
40 Correct 5 ms 5212 KB Output is correct
41 Correct 6 ms 5196 KB Output is correct
42 Correct 5 ms 5192 KB Output is correct
43 Correct 6 ms 5212 KB Output is correct
44 Correct 9 ms 5212 KB Output is correct
45 Correct 6 ms 5196 KB Output is correct
46 Correct 7 ms 5212 KB Output is correct
47 Correct 7 ms 5212 KB Output is correct
48 Correct 5 ms 5332 KB Output is correct
49 Correct 6 ms 5212 KB Output is correct
50 Correct 6 ms 5212 KB Output is correct
51 Correct 6 ms 5212 KB Output is correct
52 Correct 6 ms 5212 KB Output is correct
53 Correct 5 ms 5212 KB Output is correct
54 Correct 6 ms 5208 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 679 ms 16468 KB Output is correct
4 Correct 1283 ms 17044 KB Output is correct
5 Correct 318 ms 17492 KB Output is correct
6 Correct 307 ms 16468 KB Output is correct
7 Correct 298 ms 16212 KB Output is correct
8 Correct 437 ms 15324 KB Output is correct
9 Correct 477 ms 15924 KB Output is correct
10 Correct 743 ms 17300 KB Output is correct
11 Correct 691 ms 16212 KB Output is correct
12 Correct 707 ms 17236 KB Output is correct
13 Correct 600 ms 15184 KB Output is correct
14 Correct 471 ms 15956 KB Output is correct
15 Correct 661 ms 16724 KB Output is correct
16 Correct 763 ms 17544 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 3 ms 5196 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 5184 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 2 ms 5212 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct
16 Correct 2 ms 5096 KB Output is correct
17 Correct 3 ms 5184 KB Output is correct
18 Correct 3 ms 4984 KB Output is correct
19 Correct 2 ms 5036 KB Output is correct
20 Correct 3 ms 5208 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 3 ms 5208 KB Output is correct
23 Correct 4 ms 5208 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 5212 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 3 ms 5184 KB Output is correct
29 Correct 679 ms 16468 KB Output is correct
30 Correct 1283 ms 17044 KB Output is correct
31 Correct 318 ms 17492 KB Output is correct
32 Correct 307 ms 16468 KB Output is correct
33 Correct 298 ms 16212 KB Output is correct
34 Correct 437 ms 15324 KB Output is correct
35 Correct 477 ms 15924 KB Output is correct
36 Correct 743 ms 17300 KB Output is correct
37 Correct 691 ms 16212 KB Output is correct
38 Correct 707 ms 17236 KB Output is correct
39 Correct 600 ms 15184 KB Output is correct
40 Correct 471 ms 15956 KB Output is correct
41 Correct 661 ms 16724 KB Output is correct
42 Correct 763 ms 17544 KB Output is correct
43 Correct 653 ms 16720 KB Output is correct
44 Correct 1279 ms 17532 KB Output is correct
45 Correct 1129 ms 17752 KB Output is correct
46 Correct 279 ms 16724 KB Output is correct
47 Correct 298 ms 16644 KB Output is correct
48 Correct 515 ms 16464 KB Output is correct
49 Correct 823 ms 17792 KB Output is correct
50 Correct 751 ms 16444 KB Output is correct
51 Correct 752 ms 17224 KB Output is correct
52 Correct 728 ms 17748 KB Output is correct
53 Correct 498 ms 15440 KB Output is correct
54 Correct 521 ms 16388 KB Output is correct
55 Correct 664 ms 17232 KB Output is correct
56 Correct 776 ms 17980 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 3 ms 5196 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 5184 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 2 ms 5212 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct
16 Correct 2 ms 5096 KB Output is correct
17 Correct 3 ms 5184 KB Output is correct
18 Correct 3 ms 4984 KB Output is correct
19 Correct 2 ms 5036 KB Output is correct
20 Correct 3 ms 5208 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 3 ms 5208 KB Output is correct
23 Correct 4 ms 5208 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 5212 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 3 ms 5184 KB Output is correct
29 Correct 6 ms 5212 KB Output is correct
30 Correct 6 ms 5208 KB Output is correct
31 Correct 6 ms 5208 KB Output is correct
32 Correct 6 ms 5192 KB Output is correct
33 Correct 5 ms 5212 KB Output is correct
34 Correct 6 ms 5208 KB Output is correct
35 Correct 6 ms 5212 KB Output is correct
36 Correct 5 ms 5212 KB Output is correct
37 Correct 6 ms 5212 KB Output is correct
38 Correct 5 ms 5340 KB Output is correct
39 Correct 6 ms 5208 KB Output is correct
40 Correct 5 ms 5212 KB Output is correct
41 Correct 6 ms 5196 KB Output is correct
42 Correct 5 ms 5192 KB Output is correct
43 Correct 6 ms 5212 KB Output is correct
44 Correct 9 ms 5212 KB Output is correct
45 Correct 6 ms 5196 KB Output is correct
46 Correct 7 ms 5212 KB Output is correct
47 Correct 7 ms 5212 KB Output is correct
48 Correct 5 ms 5332 KB Output is correct
49 Correct 6 ms 5212 KB Output is correct
50 Correct 6 ms 5212 KB Output is correct
51 Correct 6 ms 5212 KB Output is correct
52 Correct 6 ms 5212 KB Output is correct
53 Correct 5 ms 5212 KB Output is correct
54 Correct 6 ms 5208 KB Output is correct
55 Correct 321 ms 11116 KB Output is correct
56 Correct 1088 ms 13328 KB Output is correct
57 Correct 586 ms 12908 KB Output is correct
58 Correct 453 ms 11120 KB Output is correct
59 Correct 1298 ms 11092 KB Output is correct
60 Correct 1429 ms 12360 KB Output is correct
61 Correct 514 ms 11092 KB Output is correct
62 Correct 617 ms 12724 KB Output is correct
63 Correct 527 ms 9868 KB Output is correct
64 Correct 710 ms 11348 KB Output is correct
65 Correct 710 ms 12688 KB Output is correct

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 3 ms 5196 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 5184 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 2 ms 5212 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct
16 Correct 2 ms 5096 KB Output is correct
17 Correct 3 ms 5184 KB Output is correct
18 Correct 3 ms 4984 KB Output is correct
19 Correct 2 ms 5036 KB Output is correct
20 Correct 3 ms 5208 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 3 ms 5208 KB Output is correct
23 Correct 4 ms 5208 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 5212 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 3 ms 5184 KB Output is correct
29 Correct 6 ms 5212 KB Output is correct
30 Correct 6 ms 5208 KB Output is correct
31 Correct 6 ms 5208 KB Output is correct
32 Correct 6 ms 5192 KB Output is correct
33 Correct 5 ms 5212 KB Output is correct
34 Correct 6 ms 5208 KB Output is correct
35 Correct 6 ms 5212 KB Output is correct
36 Correct 5 ms 5212 KB Output is correct
37 Correct 6 ms 5212 KB Output is correct
38 Correct 5 ms 5340 KB Output is correct
39 Correct 6 ms 5208 KB Output is correct
40 Correct 5 ms 5212 KB Output is correct
41 Correct 6 ms 5196 KB Output is correct
42 Correct 5 ms 5192 KB Output is correct
43 Correct 6 ms 5212 KB Output is correct
44 Correct 9 ms 5212 KB Output is correct
45 Correct 6 ms 5196 KB Output is correct
46 Correct 7 ms 5212 KB Output is correct
47 Correct 7 ms 5212 KB Output is correct
48 Correct 5 ms 5332 KB Output is correct
49 Correct 6 ms 5212 KB Output is correct
50 Correct 6 ms 5212 KB Output is correct
51 Correct 6 ms 5212 KB Output is correct
52 Correct 6 ms 5212 KB Output is correct
53 Correct 5 ms 5212 KB Output is correct
54 Correct 6 ms 5208 KB Output is correct
55 Correct 679 ms 16468 KB Output is correct
56 Correct 1283 ms 17044 KB Output is correct
57 Correct 318 ms 17492 KB Output is correct
58 Correct 307 ms 16468 KB Output is correct
59 Correct 298 ms 16212 KB Output is correct
60 Correct 437 ms 15324 KB Output is correct
61 Correct 477 ms 15924 KB Output is correct
62 Correct 743 ms 17300 KB Output is correct
63 Correct 691 ms 16212 KB Output is correct
64 Correct 707 ms 17236 KB Output is correct
65 Correct 600 ms 15184 KB Output is correct
66 Correct 471 ms 15956 KB Output is correct
67 Correct 661 ms 16724 KB Output is correct
68 Correct 763 ms 17544 KB Output is correct
69 Correct 653 ms 16720 KB Output is correct
70 Correct 1279 ms 17532 KB Output is correct
71 Correct 1129 ms 17752 KB Output is correct
72 Correct 279 ms 16724 KB Output is correct
73 Correct 298 ms 16644 KB Output is correct
74 Correct 515 ms 16464 KB Output is correct
75 Correct 823 ms 17792 KB Output is correct
76 Correct 751 ms 16444 KB Output is correct
77 Correct 752 ms 17224 KB Output is correct
78 Correct 728 ms 17748 KB Output is correct
79 Correct 498 ms 15440 KB Output is correct
80 Correct 521 ms 16388 KB Output is correct
81 Correct 664 ms 17232 KB Output is correct
82 Correct 776 ms 17980 KB Output is correct
83 Correct 321 ms 11116 KB Output is correct
84 Correct 1088 ms 13328 KB Output is correct
85 Correct 586 ms 12908 KB Output is correct
86 Correct 453 ms 11120 KB Output is correct
87 Correct 1298 ms 11092 KB Output is correct
88 Correct 1429 ms 12360 KB Output is correct
89 Correct 514 ms 11092 KB Output is correct
90 Correct 617 ms 12724 KB Output is correct
91 Correct 527 ms 9868 KB Output is correct
92 Correct 710 ms 11348 KB Output is correct
93 Correct 710 ms 12688 KB Output is correct
94 Incorrect 660 ms 17236 KB Output isn't correct
95 Halted 0 ms 0 KB -