oj.uz

답안 #824842

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824842 2023-08-14T11:06:17 Z andrei_boaca 분수 공원 (IOI21_parks) C++17
30 / 100
 3500 ms 103048 KB 
#include "parks.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;

typedef pair<int,int> pii;
map<pii,int> ind;
map<pii,int> ocup;
map<pii,int> match;
struct point
{
    int x,y;
} v[200005];
int k;
vector<int> myy[200005];
vector<int> muchii[200005];
vector<pii> edges;
bool have[11][200005];
bool use[200005];
void dfs(int nod)
{
    use[nod]=1;
    for(int i:muchii[nod])
        if(!use[i])
            dfs(i);
}
int c[11][200005];
vector<int> U,V,A,B;
void addedge(int xa,int ya,int xb,int yb,int xc,int yc)
{
    int a=ind[{xa,ya}];
    int b=ind[{xb,yb}];
    U.push_back(a);
    V.push_back(b);
    muchii[a].push_back(b);
    muchii[b].push_back(a);
    A.push_back(xc);
    B.push_back(yc);
}
int diri[5]={-2,2,0,0};
int dirj[5]={0,0,-2,2};
int nr;
vector<int> cedge[800005];
int l[800005],r[800005];
vector<pii> who;
bool pairup(int nod)
{
    if(use[nod])
        return 0;
    use[nod]=1;
    for(int i:cedge[nod])
        if(r[i]==0)
        {
            l[nod]=i;
            r[i]=nod;
            return 1;
        }
    for(int i:cedge[nod])
        if(pairup(r[i]))
        {
            l[nod]=i;
            r[i]=nod;
            return 1;
        }
    return 0;
}
int construct_roads(std::vector<int> X, std::vector<int> Y)
{
    k=X.size();
    int xmax=0;
    for(int i=0;i<k;i++)
    {
        v[i]={X[i],Y[i]};
        ind[{X[i],Y[i]}]=i;
        xmax=max(xmax,X[i]);
        if(X[i]<=6)
        {
            myy[X[i]].push_back(Y[i]);
            have[X[i]][Y[i]]=1;
        }
    }
    if(xmax<=2)
    {
        sort(myy[2].begin(),myy[2].end());
        vector<int> U,V,a,b;
        for(int i=1;i<myy[2].size();i++)
        {
            if(myy[2][i]-myy[2][i-1]!=2)
                return 0;
            int x=2;
            int yu=myy[2][i-1];
            int yv=myy[2][i];
            U.push_back(ind[{x,yu}]);
            V.push_back(ind[{x,yv}]);
            a.push_back(x-1);
            b.push_back(yv-1);
        }
        build(U,V,a,b);
        return 1;
    }
    if(xmax<=4)
    {
        sort(myy[2].begin(),myy[2].end());
        sort(myy[4].begin(),myy[4].end());
        vector<int> U,V,A,B;
        for(int i=2;i<=200000;i+=2)
            if(have[2][i]&&have[2][i-2])
            {
                int a=ind[{2,i}];
                int b=ind[{2,i-2}];
                U.push_back(a);
                V.push_back(b);
                muchii[a].push_back(b);
                muchii[b].push_back(a);
                A.push_back(1);
                B.push_back(i-1);
            }
        for(int i=2;i<=200000;i+=2)
            if(have[4][i]&&have[4][i-2])
            {
                int a=ind[{4,i}];
                int b=ind[{4,i-2}];
                U.push_back(a);
                V.push_back(b);
                muchii[a].push_back(b);
                muchii[b].push_back(a);
                A.push_back(5);
                B.push_back(i-1);
            }
        for(int i=2;i<=200000;i+=2)
            if(have[2][i]&&have[4][i])
            {
                int a=ind[{2,i}];
                int b=ind[{4,i}];
                U.push_back(a);
                V.push_back(b);
                muchii[a].push_back(b);
                muchii[b].push_back(a);
                A.push_back(3);
                B.push_back(i+1);
            }
        dfs(0);
        for(int i=0;i<k;i++)
            if(!use[i])
                return 0;
        build(U,V,A,B);
        return 1;
    }
    if(xmax<=6)
    {
        sort(myy[2].begin(),myy[2].end());
        sort(myy[4].begin(),myy[4].end());
        sort(myy[6].begin(),myy[6].end());
        int nr=0;
        for(int i=2;i<=200000;i+=2)
            if(have[2][i])
            {
                if(have[2][i-2])
                {
                    addedge(2,i,2,i-2,1,i-1);
                    c[2][i]=c[2][i-2];
                }
                else
                {
                    nr++;
                    c[2][i]=nr;
                }
            }
        for(int i=2;i<=200000;i+=2)
            if(have[6][i])
            {
                if(have[6][i-2])
                {
                    addedge(6,i,6,i-2,7,i-1);
                    c[6][i]=c[6][i-2];
                }
                else
                {
                    nr++;
                    c[6][i]=nr;
                }
            }
        int lft=1;
        for(int i=2;i<=200000;i+=2)
            if(have[4][i])
            {
                if(have[4][i-2])
                {
                    if(lft==1)
                    {
                        addedge(4,i,4,i-2,3,i-1);
                        ocup[{3,i-1}]=1;
                    }
                    else
                    {
                        addedge(4,i,4,i-2,5,i-1);
                        ocup[{5,i-1}]=1;
                    }
                    lft^=1;
                    c[4][i]=c[4][i-2];
                }
                else
                {
                    lft=1;
                    nr++;
                    c[4][i]=nr;
                }
            }
        for(int i=2;i<=200000;i+=2)
            if(have[2][i]&&have[4][i])
            {
                int a=c[2][i];
                int b=c[4][i];
                if(match[{a,b}]==0)
                    {
                        match[{a,b}]=1;
                        if(!ocup[{3,i-1}])
                            {
                                addedge(2,i,4,i,3,i-1);
                                ocup[{3,i-1}]=1;
                            }
                        else
                        {
                            addedge(2,i,4,i,3,i+1);
                            ocup[{3,i+1}]=1;
                        }
                    }
            }
        for(int i=2;i<=200000;i+=2)
            if(have[4][i]&&have[6][i])
            {
                int a=c[4][i];
                int b=c[6][i];
                if(match[{a,b}]==0)
                    {
                        match[{a,b}]=1;
                        if(!ocup[{5,i-1}])
                            {
                                addedge(4,i,6,i,5,i-1);
                                ocup[{5,i-1}]=1;
                            }
                        else
                        {
                            addedge(4,i,6,i,5,i+1);
                            ocup[{5,i+1}]=1;
                        }
                    }
            }
        dfs(0);
        for(int i=0;i<k;i++)
            if(!use[i])
                return 0;
        build(U,V,A,B);
        return 1;
    }
    for(auto p:ind)
    {
        int x=p.first.first;
        int y=p.first.second;
        int nod=p.second;
        for(int z=0;z<4;z++)
        {
            int lin=x+diri[z];
            int col=y+dirj[z];
            if(ind.count({lin,col})!=0)
                {
                    int w=ind[{lin,col}];
                    muchii[nod].push_back(w);
                    muchii[w].push_back(nod);
                    edges.push_back({nod,w});
                }
        }
    }
    dfs(0);
    for(int i=0;i<k;i++)
        if(!use[i])
            return 0;
    nr=0;
    who.push_back({0,0});
    for(int i=0;i<edges.size();i++)
    {
        int a=edges[i].first;
        int b=edges[i].second;
        int xa=X[a],ya=Y[a],xb=X[b],yb=Y[b];
        if(xa==xb)
        {
            int x=xa+1;
            int y=(ya+yb)/2;
            if(ind[{x,y}]==0)
                {
                    nr++;
                    ind[{x,y}]=nr;
                    who.push_back({x,y});
                }
            int nrm=ind[{x,y}];
            cedge[i+1].push_back(nrm);

            x=xa-1;
            y=(ya+yb)/2;
            if(ind[{x,y}]==0)
                {
                    nr++;
                    ind[{x,y}]=nr;
                    who.push_back({x,y});
                }
            nrm=ind[{x,y}];
            cedge[i+1].push_back(nrm);
        }
        else
        {
            int x=(xa+xb)/2;
            int y=ya-1;
            if(ind[{x,y}]==0)
                {
                    nr++;
                    ind[{x,y}]=nr;
                    who.push_back({x,y});
                }
            int nrm=ind[{x,y}];
            cedge[i+1].push_back(nrm);

            x=(xa+xb)/2;
            y=ya+1;
            if(ind[{x,y}]==0)
                {
                    nr++;
                    ind[{x,y}]=nr;
                    who.push_back({x,y});
                }
            nrm=ind[{x,y}];
            cedge[i+1].push_back(nrm);
        }
    }
    bool ok=0;
    do
    {
        for(int i=1;i<=edges.size();i++)
            use[i]=0;
        for(int i=1;i<=edges.size();i++)
            if(l[i]==0)
                ok|=pairup(i);
    }while(ok);
    for(int i=1;i<=edges.size();i++)
        if(l[i]==0)
            return 0;
    for(int i=1;i<=edges.size();i++)
    {
        U.push_back(edges[i-1].first);
        V.push_back(edges[i-1].second);
        A.push_back(who[l[i]].first);
        B.push_back(who[l[i]].second);
    }
    build(U,V,A,B);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:86:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |         for(int i=1;i<myy[2].size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:280:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  280 |     for(int i=0;i<edges.size();i++)
      |                 ~^~~~~~~~~~~~~
parks.cpp:337:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  337 |         for(int i=1;i<=edges.size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:339:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  339 |         for(int i=1;i<=edges.size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:343:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  343 |     for(int i=1;i<=edges.size();i++)
      |                 ~^~~~~~~~~~~~~~
parks.cpp:346:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  346 |     for(int i=1;i<=edges.size();i++)
      |                 ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28500 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 14 ms 28460 KB Output is correct
5 Correct 14 ms 28412 KB Output is correct
6 Correct 15 ms 28500 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 15 ms 28396 KB Output is correct
9 Correct 102 ms 42720 KB Output is correct
10 Correct 22 ms 30036 KB Output is correct
11 Correct 53 ms 36160 KB Output is correct
12 Correct 24 ms 30872 KB Output is correct
13 Correct 34 ms 33344 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 16 ms 28628 KB Output is correct
16 Correct 105 ms 42768 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28500 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 14 ms 28460 KB Output is correct
5 Correct 14 ms 28412 KB Output is correct
6 Correct 15 ms 28500 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 15 ms 28396 KB Output is correct
9 Correct 102 ms 42720 KB Output is correct
10 Correct 22 ms 30036 KB Output is correct
11 Correct 53 ms 36160 KB Output is correct
12 Correct 24 ms 30872 KB Output is correct
13 Correct 34 ms 33344 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 16 ms 28628 KB Output is correct
16 Correct 105 ms 42768 KB Output is correct
17 Correct 14 ms 28420 KB Output is correct
18 Correct 14 ms 28468 KB Output is correct
19 Correct 13 ms 28500 KB Output is correct
20 Correct 15 ms 28504 KB Output is correct
21 Correct 19 ms 28492 KB Output is correct
22 Correct 14 ms 28504 KB Output is correct
23 Correct 359 ms 70880 KB Output is correct
24 Correct 15 ms 28500 KB Output is correct
25 Correct 18 ms 28760 KB Output is correct
26 Correct 16 ms 29012 KB Output is correct
27 Correct 17 ms 29148 KB Output is correct
28 Correct 120 ms 45504 KB Output is correct
29 Correct 174 ms 53976 KB Output is correct
30 Correct 241 ms 62384 KB Output is correct
31 Correct 351 ms 70992 KB Output is correct
32 Correct 15 ms 28500 KB Output is correct
33 Correct 15 ms 28500 KB Output is correct
34 Correct 15 ms 28520 KB Output is correct
35 Correct 15 ms 28500 KB Output is correct
36 Correct 16 ms 28500 KB Output is correct
37 Correct 16 ms 28444 KB Output is correct
38 Correct 15 ms 28440 KB Output is correct
39 Correct 15 ms 28524 KB Output is correct
40 Correct 15 ms 28428 KB Output is correct
41 Correct 15 ms 28480 KB Output is correct
42 Correct 15 ms 28508 KB Output is correct
43 Correct 18 ms 28736 KB Output is correct
44 Correct 17 ms 28884 KB Output is correct
45 Correct 122 ms 46740 KB Output is correct
46 Correct 208 ms 55368 KB Output is correct
47 Correct 194 ms 55224 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28500 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 14 ms 28460 KB Output is correct
5 Correct 14 ms 28412 KB Output is correct
6 Correct 15 ms 28500 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 15 ms 28396 KB Output is correct
9 Correct 102 ms 42720 KB Output is correct
10 Correct 22 ms 30036 KB Output is correct
11 Correct 53 ms 36160 KB Output is correct
12 Correct 24 ms 30872 KB Output is correct
13 Correct 34 ms 33344 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 16 ms 28628 KB Output is correct
16 Correct 105 ms 42768 KB Output is correct
17 Correct 14 ms 28420 KB Output is correct
18 Correct 14 ms 28468 KB Output is correct
19 Correct 13 ms 28500 KB Output is correct
20 Correct 15 ms 28504 KB Output is correct
21 Correct 19 ms 28492 KB Output is correct
22 Correct 14 ms 28504 KB Output is correct
23 Correct 359 ms 70880 KB Output is correct
24 Correct 15 ms 28500 KB Output is correct
25 Correct 18 ms 28760 KB Output is correct
26 Correct 16 ms 29012 KB Output is correct
27 Correct 17 ms 29148 KB Output is correct
28 Correct 120 ms 45504 KB Output is correct
29 Correct 174 ms 53976 KB Output is correct
30 Correct 241 ms 62384 KB Output is correct
31 Correct 351 ms 70992 KB Output is correct
32 Correct 15 ms 28500 KB Output is correct
33 Correct 15 ms 28500 KB Output is correct
34 Correct 15 ms 28520 KB Output is correct
35 Correct 15 ms 28500 KB Output is correct
36 Correct 16 ms 28500 KB Output is correct
37 Correct 16 ms 28444 KB Output is correct
38 Correct 15 ms 28440 KB Output is correct
39 Correct 15 ms 28524 KB Output is correct
40 Correct 15 ms 28428 KB Output is correct
41 Correct 15 ms 28480 KB Output is correct
42 Correct 15 ms 28508 KB Output is correct
43 Correct 18 ms 28736 KB Output is correct
44 Correct 17 ms 28884 KB Output is correct
45 Correct 122 ms 46740 KB Output is correct
46 Correct 208 ms 55368 KB Output is correct
47 Correct 194 ms 55224 KB Output is correct
48 Correct 17 ms 28500 KB Output is correct
49 Correct 15 ms 28444 KB Output is correct
50 Correct 15 ms 28500 KB Output is correct
51 Correct 15 ms 28444 KB Output is correct
52 Correct 15 ms 28476 KB Output is correct
53 Correct 15 ms 28456 KB Output is correct
54 Correct 15 ms 28500 KB Output is correct
55 Correct 289 ms 70452 KB Output is correct
56 Correct 14 ms 28500 KB Output is correct
57 Correct 17 ms 28884 KB Output is correct
58 Correct 21 ms 29864 KB Output is correct
59 Correct 22 ms 30340 KB Output is correct
60 Correct 127 ms 49092 KB Output is correct
61 Correct 183 ms 57852 KB Output is correct
62 Correct 218 ms 63136 KB Output is correct
63 Correct 291 ms 70104 KB Output is correct
64 Correct 15 ms 28440 KB Output is correct
65 Correct 14 ms 28500 KB Output is correct
66 Correct 13 ms 28524 KB Output is correct
67 Correct 265 ms 66788 KB Output is correct
68 Correct 275 ms 66996 KB Output is correct
69 Correct 303 ms 67064 KB Output is correct
70 Correct 17 ms 29396 KB Output is correct
71 Correct 21 ms 30308 KB Output is correct
72 Correct 220 ms 52940 KB Output is correct
73 Correct 241 ms 65544 KB Output is correct
74 Correct 361 ms 77284 KB Output is correct
75 Correct 397 ms 79336 KB Output is correct
76 Correct 279 ms 67832 KB Output is correct
77 Correct 18 ms 29620 KB Output is correct
78 Correct 30 ms 30504 KB Output is correct
79 Correct 172 ms 53860 KB Output is correct
80 Correct 275 ms 66596 KB Output is correct
81 Correct 416 ms 79144 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28500 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 14 ms 28460 KB Output is correct
5 Correct 14 ms 28412 KB Output is correct
6 Correct 15 ms 28500 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 15 ms 28396 KB Output is correct
9 Correct 102 ms 42720 KB Output is correct
10 Correct 22 ms 30036 KB Output is correct
11 Correct 53 ms 36160 KB Output is correct
12 Correct 24 ms 30872 KB Output is correct
13 Correct 34 ms 33344 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 16 ms 28628 KB Output is correct
16 Correct 105 ms 42768 KB Output is correct
17 Execution timed out 3539 ms 28500 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28500 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 14 ms 28460 KB Output is correct
5 Correct 14 ms 28412 KB Output is correct
6 Correct 15 ms 28500 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 15 ms 28396 KB Output is correct
9 Correct 102 ms 42720 KB Output is correct
10 Correct 22 ms 30036 KB Output is correct
11 Correct 53 ms 36160 KB Output is correct
12 Correct 24 ms 30872 KB Output is correct
13 Correct 34 ms 33344 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 16 ms 28628 KB Output is correct
16 Correct 105 ms 42768 KB Output is correct
17 Execution timed out 3553 ms 103048 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 15 ms 28500 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 14 ms 28460 KB Output is correct
5 Correct 14 ms 28412 KB Output is correct
6 Correct 15 ms 28500 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 15 ms 28396 KB Output is correct
9 Correct 102 ms 42720 KB Output is correct
10 Correct 22 ms 30036 KB Output is correct
11 Correct 53 ms 36160 KB Output is correct
12 Correct 24 ms 30872 KB Output is correct
13 Correct 34 ms 33344 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 16 ms 28628 KB Output is correct
16 Correct 105 ms 42768 KB Output is correct
17 Correct 14 ms 28420 KB Output is correct
18 Correct 14 ms 28468 KB Output is correct
19 Correct 13 ms 28500 KB Output is correct
20 Correct 15 ms 28504 KB Output is correct
21 Correct 19 ms 28492 KB Output is correct
22 Correct 14 ms 28504 KB Output is correct
23 Correct 359 ms 70880 KB Output is correct
24 Correct 15 ms 28500 KB Output is correct
25 Correct 18 ms 28760 KB Output is correct
26 Correct 16 ms 29012 KB Output is correct
27 Correct 17 ms 29148 KB Output is correct
28 Correct 120 ms 45504 KB Output is correct
29 Correct 174 ms 53976 KB Output is correct
30 Correct 241 ms 62384 KB Output is correct
31 Correct 351 ms 70992 KB Output is correct
32 Correct 15 ms 28500 KB Output is correct
33 Correct 15 ms 28500 KB Output is correct
34 Correct 15 ms 28520 KB Output is correct
35 Correct 15 ms 28500 KB Output is correct
36 Correct 16 ms 28500 KB Output is correct
37 Correct 16 ms 28444 KB Output is correct
38 Correct 15 ms 28440 KB Output is correct
39 Correct 15 ms 28524 KB Output is correct
40 Correct 15 ms 28428 KB Output is correct
41 Correct 15 ms 28480 KB Output is correct
42 Correct 15 ms 28508 KB Output is correct
43 Correct 18 ms 28736 KB Output is correct
44 Correct 17 ms 28884 KB Output is correct
45 Correct 122 ms 46740 KB Output is correct
46 Correct 208 ms 55368 KB Output is correct
47 Correct 194 ms 55224 KB Output is correct
48 Correct 17 ms 28500 KB Output is correct
49 Correct 15 ms 28444 KB Output is correct
50 Correct 15 ms 28500 KB Output is correct
51 Correct 15 ms 28444 KB Output is correct
52 Correct 15 ms 28476 KB Output is correct
53 Correct 15 ms 28456 KB Output is correct
54 Correct 15 ms 28500 KB Output is correct
55 Correct 289 ms 70452 KB Output is correct
56 Correct 14 ms 28500 KB Output is correct
57 Correct 17 ms 28884 KB Output is correct
58 Correct 21 ms 29864 KB Output is correct
59 Correct 22 ms 30340 KB Output is correct
60 Correct 127 ms 49092 KB Output is correct
61 Correct 183 ms 57852 KB Output is correct
62 Correct 218 ms 63136 KB Output is correct
63 Correct 291 ms 70104 KB Output is correct
64 Correct 15 ms 28440 KB Output is correct
65 Correct 14 ms 28500 KB Output is correct
66 Correct 13 ms 28524 KB Output is correct
67 Correct 265 ms 66788 KB Output is correct
68 Correct 275 ms 66996 KB Output is correct
69 Correct 303 ms 67064 KB Output is correct
70 Correct 17 ms 29396 KB Output is correct
71 Correct 21 ms 30308 KB Output is correct
72 Correct 220 ms 52940 KB Output is correct
73 Correct 241 ms 65544 KB Output is correct
74 Correct 361 ms 77284 KB Output is correct
75 Correct 397 ms 79336 KB Output is correct
76 Correct 279 ms 67832 KB Output is correct
77 Correct 18 ms 29620 KB Output is correct
78 Correct 30 ms 30504 KB Output is correct
79 Correct 172 ms 53860 KB Output is correct
80 Correct 275 ms 66596 KB Output is correct
81 Correct 416 ms 79144 KB Output is correct
82 Execution timed out 3539 ms 28500 KB Time limit exceeded
83 Halted 0 ms 0 KB -