oj.uz

답안 #824913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824913 2023-08-14T11:51:16 Z andrei_boaca 분수 공원 (IOI21_parks) C++17
70 / 100
 3500 ms 137536 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 comp[700005];
vector<int> dsu[700005];
void dsu_merge(int c1,int c2)
{
    if(dsu[c1].size()<dsu[c2].size())
        swap(c1,c2);
    for(int i:dsu[c2])
    {
        comp[i]=c1;
        dsu[c1].push_back(i);
    }
    dsu[c2].clear();
}
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;
    }
    vector<int> nodes;
    for(int i=0;i<k;i++)
        nodes.push_back(i);
    int bulan=0;
    nr=0;
    while(bulan<=3)
    {
        random_shuffle(nodes.begin(),nodes.end());
        bulan++;
        bool good=1;
        for(int i=0;i<k;i++)
        {
            comp[i]=i;
            dsu[i].clear();
            dsu[i].push_back(i);
            muchii[i].clear();
            use[i]=0;
        }
        edges.clear();
        for(auto p:nodes)
        {
            int nod=p;
            int x=X[nod];
            int y=Y[nod];
            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}];
                        if(comp[nod]!=comp[w])
                        {
                            dsu_merge(comp[nod],comp[w]);
                            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])
                good=0;
        if(good==0)
            continue;
        who.clear();
        who.push_back({0,0});
        for(int i=0;i<edges.size();i++)
        {
            cedge[i+1].clear();
            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);
            }
        }
        for(int i=1;i<=edges.size();i++)
            l[i]=0;
        for(int i=1;i<=nr;i++)
            r[i]=0;
        bool ok=0;
        do
        {
            ok=0;
            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)
                good=0;
        if(good==0)
            continue;
        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;
    }
    return 0;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:99:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |         for(int i=1;i<myy[2].size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:318: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]
  318 |         for(int i=0;i<edges.size();i++)
      |                     ~^~~~~~~~~~~~~
parks.cpp:373: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]
  373 |         for(int i=1;i<=edges.size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:381:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  381 |             for(int i=1;i<=edges.size();i++)
      |                         ~^~~~~~~~~~~~~~
parks.cpp:383:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  383 |             for(int i=1;i<=edges.size();i++)
      |                         ~^~~~~~~~~~~~~~
parks.cpp:387: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]
  387 |         for(int i=1;i<=edges.size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:392: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]
  392 |         for(int i=1;i<=edges.size();i++)
      |                     ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 44884 KB Output is correct
2 Correct 27 ms 44948 KB Output is correct
3 Correct 23 ms 44948 KB Output is correct
4 Correct 24 ms 44856 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 24 ms 44844 KB Output is correct
7 Correct 24 ms 44884 KB Output is correct
8 Correct 24 ms 44948 KB Output is correct
9 Correct 111 ms 59968 KB Output is correct
10 Correct 31 ms 46612 KB Output is correct
11 Correct 61 ms 53076 KB Output is correct
12 Correct 34 ms 47392 KB Output is correct
13 Correct 49 ms 50108 KB Output is correct
14 Correct 24 ms 44956 KB Output is correct
15 Correct 24 ms 45172 KB Output is correct
16 Correct 118 ms 60076 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 44884 KB Output is correct
2 Correct 27 ms 44948 KB Output is correct
3 Correct 23 ms 44948 KB Output is correct
4 Correct 24 ms 44856 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 24 ms 44844 KB Output is correct
7 Correct 24 ms 44884 KB Output is correct
8 Correct 24 ms 44948 KB Output is correct
9 Correct 111 ms 59968 KB Output is correct
10 Correct 31 ms 46612 KB Output is correct
11 Correct 61 ms 53076 KB Output is correct
12 Correct 34 ms 47392 KB Output is correct
13 Correct 49 ms 50108 KB Output is correct
14 Correct 24 ms 44956 KB Output is correct
15 Correct 24 ms 45172 KB Output is correct
16 Correct 118 ms 60076 KB Output is correct
17 Correct 24 ms 44884 KB Output is correct
18 Correct 24 ms 44848 KB Output is correct
19 Correct 24 ms 44952 KB Output is correct
20 Correct 24 ms 44908 KB Output is correct
21 Correct 22 ms 44960 KB Output is correct
22 Correct 27 ms 45056 KB Output is correct
23 Correct 340 ms 88968 KB Output is correct
24 Correct 23 ms 44884 KB Output is correct
25 Correct 25 ms 45232 KB Output is correct
26 Correct 26 ms 45496 KB Output is correct
27 Correct 26 ms 45600 KB Output is correct
28 Correct 122 ms 62516 KB Output is correct
29 Correct 188 ms 71428 KB Output is correct
30 Correct 258 ms 80176 KB Output is correct
31 Correct 341 ms 89044 KB Output is correct
32 Correct 24 ms 44956 KB Output is correct
33 Correct 24 ms 44840 KB Output is correct
34 Correct 24 ms 44864 KB Output is correct
35 Correct 27 ms 45148 KB Output is correct
36 Correct 24 ms 44848 KB Output is correct
37 Correct 24 ms 44952 KB Output is correct
38 Correct 24 ms 44876 KB Output is correct
39 Correct 24 ms 44884 KB Output is correct
40 Correct 24 ms 44936 KB Output is correct
41 Correct 24 ms 44884 KB Output is correct
42 Correct 24 ms 44932 KB Output is correct
43 Correct 32 ms 45280 KB Output is correct
44 Correct 26 ms 45368 KB Output is correct
45 Correct 130 ms 64056 KB Output is correct
46 Correct 214 ms 72916 KB Output is correct
47 Correct 200 ms 72784 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 44884 KB Output is correct
2 Correct 27 ms 44948 KB Output is correct
3 Correct 23 ms 44948 KB Output is correct
4 Correct 24 ms 44856 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 24 ms 44844 KB Output is correct
7 Correct 24 ms 44884 KB Output is correct
8 Correct 24 ms 44948 KB Output is correct
9 Correct 111 ms 59968 KB Output is correct
10 Correct 31 ms 46612 KB Output is correct
11 Correct 61 ms 53076 KB Output is correct
12 Correct 34 ms 47392 KB Output is correct
13 Correct 49 ms 50108 KB Output is correct
14 Correct 24 ms 44956 KB Output is correct
15 Correct 24 ms 45172 KB Output is correct
16 Correct 118 ms 60076 KB Output is correct
17 Correct 24 ms 44884 KB Output is correct
18 Correct 24 ms 44848 KB Output is correct
19 Correct 24 ms 44952 KB Output is correct
20 Correct 24 ms 44908 KB Output is correct
21 Correct 22 ms 44960 KB Output is correct
22 Correct 27 ms 45056 KB Output is correct
23 Correct 340 ms 88968 KB Output is correct
24 Correct 23 ms 44884 KB Output is correct
25 Correct 25 ms 45232 KB Output is correct
26 Correct 26 ms 45496 KB Output is correct
27 Correct 26 ms 45600 KB Output is correct
28 Correct 122 ms 62516 KB Output is correct
29 Correct 188 ms 71428 KB Output is correct
30 Correct 258 ms 80176 KB Output is correct
31 Correct 341 ms 89044 KB Output is correct
32 Correct 24 ms 44956 KB Output is correct
33 Correct 24 ms 44840 KB Output is correct
34 Correct 24 ms 44864 KB Output is correct
35 Correct 27 ms 45148 KB Output is correct
36 Correct 24 ms 44848 KB Output is correct
37 Correct 24 ms 44952 KB Output is correct
38 Correct 24 ms 44876 KB Output is correct
39 Correct 24 ms 44884 KB Output is correct
40 Correct 24 ms 44936 KB Output is correct
41 Correct 24 ms 44884 KB Output is correct
42 Correct 24 ms 44932 KB Output is correct
43 Correct 32 ms 45280 KB Output is correct
44 Correct 26 ms 45368 KB Output is correct
45 Correct 130 ms 64056 KB Output is correct
46 Correct 214 ms 72916 KB Output is correct
47 Correct 200 ms 72784 KB Output is correct
48 Correct 31 ms 44884 KB Output is correct
49 Correct 23 ms 44884 KB Output is correct
50 Correct 24 ms 44904 KB Output is correct
51 Correct 24 ms 44884 KB Output is correct
52 Correct 24 ms 44976 KB Output is correct
53 Correct 24 ms 44912 KB Output is correct
54 Correct 24 ms 44884 KB Output is correct
55 Correct 310 ms 88572 KB Output is correct
56 Correct 24 ms 44884 KB Output is correct
57 Correct 28 ms 45396 KB Output is correct
58 Correct 30 ms 46364 KB Output is correct
59 Correct 32 ms 46880 KB Output is correct
60 Correct 141 ms 66308 KB Output is correct
61 Correct 185 ms 75256 KB Output is correct
62 Correct 242 ms 81104 KB Output is correct
63 Correct 289 ms 88148 KB Output is correct
64 Correct 31 ms 44924 KB Output is correct
65 Correct 24 ms 44968 KB Output is correct
66 Correct 25 ms 44992 KB Output is correct
67 Correct 266 ms 84900 KB Output is correct
68 Correct 287 ms 84912 KB Output is correct
69 Correct 253 ms 85204 KB Output is correct
70 Correct 23 ms 45772 KB Output is correct
71 Correct 27 ms 46780 KB Output is correct
72 Correct 153 ms 70124 KB Output is correct
73 Correct 272 ms 83236 KB Output is correct
74 Correct 377 ms 95416 KB Output is correct
75 Correct 430 ms 97512 KB Output is correct
76 Correct 296 ms 85920 KB Output is correct
77 Correct 31 ms 46104 KB Output is correct
78 Correct 32 ms 47060 KB Output is correct
79 Correct 179 ms 71064 KB Output is correct
80 Correct 291 ms 84264 KB Output is correct
81 Correct 399 ms 97372 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 44884 KB Output is correct
2 Correct 27 ms 44948 KB Output is correct
3 Correct 23 ms 44948 KB Output is correct
4 Correct 24 ms 44856 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 24 ms 44844 KB Output is correct
7 Correct 24 ms 44884 KB Output is correct
8 Correct 24 ms 44948 KB Output is correct
9 Correct 111 ms 59968 KB Output is correct
10 Correct 31 ms 46612 KB Output is correct
11 Correct 61 ms 53076 KB Output is correct
12 Correct 34 ms 47392 KB Output is correct
13 Correct 49 ms 50108 KB Output is correct
14 Correct 24 ms 44956 KB Output is correct
15 Correct 24 ms 45172 KB Output is correct
16 Correct 118 ms 60076 KB Output is correct
17 Correct 27 ms 44864 KB Output is correct
18 Correct 20 ms 44948 KB Output is correct
19 Correct 20 ms 44952 KB Output is correct
20 Correct 998 ms 123944 KB Output is correct
21 Correct 1098 ms 123472 KB Output is correct
22 Correct 1038 ms 122492 KB Output is correct
23 Correct 878 ms 123944 KB Output is correct
24 Correct 1078 ms 71832 KB Output is correct
25 Correct 2288 ms 92212 KB Output is correct
26 Correct 1963 ms 91672 KB Output is correct
27 Correct 1107 ms 131988 KB Output is correct
28 Correct 1087 ms 132248 KB Output is correct
29 Correct 1297 ms 132064 KB Output is correct
30 Correct 1236 ms 132132 KB Output is correct
31 Correct 29 ms 44852 KB Output is correct
32 Correct 64 ms 50788 KB Output is correct
33 Correct 345 ms 58820 KB Output is correct
34 Correct 1097 ms 123220 KB Output is correct
35 Correct 77 ms 47400 KB Output is correct
36 Correct 322 ms 57436 KB Output is correct
37 Correct 887 ms 69784 KB Output is correct
38 Correct 381 ms 76268 KB Output is correct
39 Correct 510 ms 87012 KB Output is correct
40 Correct 789 ms 99892 KB Output is correct
41 Correct 1043 ms 111148 KB Output is correct
42 Correct 1320 ms 122472 KB Output is correct
43 Correct 24 ms 44904 KB Output is correct
44 Correct 24 ms 44884 KB Output is correct
45 Correct 25 ms 44884 KB Output is correct
46 Correct 25 ms 44956 KB Output is correct
47 Correct 30 ms 44948 KB Output is correct
48 Correct 25 ms 44884 KB Output is correct
49 Correct 24 ms 44884 KB Output is correct
50 Correct 23 ms 44960 KB Output is correct
51 Correct 30 ms 44836 KB Output is correct
52 Correct 24 ms 44860 KB Output is correct
53 Correct 24 ms 44948 KB Output is correct
54 Correct 31 ms 45276 KB Output is correct
55 Correct 29 ms 45388 KB Output is correct
56 Correct 154 ms 64012 KB Output is correct
57 Correct 259 ms 73004 KB Output is correct
58 Correct 234 ms 72880 KB Output is correct
59 Correct 28 ms 44924 KB Output is correct
60 Correct 24 ms 44952 KB Output is correct
61 Correct 24 ms 44936 KB Output is correct
62 Correct 305 ms 84872 KB Output is correct
63 Correct 334 ms 84988 KB Output is correct
64 Correct 314 ms 85204 KB Output is correct
65 Correct 30 ms 45816 KB Output is correct
66 Correct 34 ms 46720 KB Output is correct
67 Correct 174 ms 70120 KB Output is correct
68 Correct 302 ms 83212 KB Output is correct
69 Correct 400 ms 95464 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 44884 KB Output is correct
2 Correct 27 ms 44948 KB Output is correct
3 Correct 23 ms 44948 KB Output is correct
4 Correct 24 ms 44856 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 24 ms 44844 KB Output is correct
7 Correct 24 ms 44884 KB Output is correct
8 Correct 24 ms 44948 KB Output is correct
9 Correct 111 ms 59968 KB Output is correct
10 Correct 31 ms 46612 KB Output is correct
11 Correct 61 ms 53076 KB Output is correct
12 Correct 34 ms 47392 KB Output is correct
13 Correct 49 ms 50108 KB Output is correct
14 Correct 24 ms 44956 KB Output is correct
15 Correct 24 ms 45172 KB Output is correct
16 Correct 118 ms 60076 KB Output is correct
17 Correct 1163 ms 137536 KB Output is correct
18 Correct 1099 ms 137104 KB Output is correct
19 Correct 1184 ms 124660 KB Output is correct
20 Correct 1212 ms 118356 KB Output is correct
21 Correct 1008 ms 116896 KB Output is correct
22 Correct 25 ms 44884 KB Output is correct
23 Correct 112 ms 57272 KB Output is correct
24 Correct 114 ms 49688 KB Output is correct
25 Correct 596 ms 61692 KB Output is correct
26 Correct 1000 ms 73776 KB Output is correct
27 Correct 490 ms 83504 KB Output is correct
28 Correct 636 ms 93000 KB Output is correct
29 Correct 873 ms 103824 KB Output is correct
30 Correct 1142 ms 112544 KB Output is correct
31 Correct 1283 ms 122296 KB Output is correct
32 Correct 411 ms 97424 KB Output is correct
33 Correct 280 ms 85888 KB Output is correct
34 Correct 31 ms 46112 KB Output is correct
35 Correct 33 ms 47068 KB Output is correct
36 Correct 180 ms 71060 KB Output is correct
37 Correct 300 ms 84232 KB Output is correct
38 Correct 398 ms 97276 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 44884 KB Output is correct
2 Correct 27 ms 44948 KB Output is correct
3 Correct 23 ms 44948 KB Output is correct
4 Correct 24 ms 44856 KB Output is correct
5 Correct 23 ms 45012 KB Output is correct
6 Correct 24 ms 44844 KB Output is correct
7 Correct 24 ms 44884 KB Output is correct
8 Correct 24 ms 44948 KB Output is correct
9 Correct 111 ms 59968 KB Output is correct
10 Correct 31 ms 46612 KB Output is correct
11 Correct 61 ms 53076 KB Output is correct
12 Correct 34 ms 47392 KB Output is correct
13 Correct 49 ms 50108 KB Output is correct
14 Correct 24 ms 44956 KB Output is correct
15 Correct 24 ms 45172 KB Output is correct
16 Correct 118 ms 60076 KB Output is correct
17 Correct 24 ms 44884 KB Output is correct
18 Correct 24 ms 44848 KB Output is correct
19 Correct 24 ms 44952 KB Output is correct
20 Correct 24 ms 44908 KB Output is correct
21 Correct 22 ms 44960 KB Output is correct
22 Correct 27 ms 45056 KB Output is correct
23 Correct 340 ms 88968 KB Output is correct
24 Correct 23 ms 44884 KB Output is correct
25 Correct 25 ms 45232 KB Output is correct
26 Correct 26 ms 45496 KB Output is correct
27 Correct 26 ms 45600 KB Output is correct
28 Correct 122 ms 62516 KB Output is correct
29 Correct 188 ms 71428 KB Output is correct
30 Correct 258 ms 80176 KB Output is correct
31 Correct 341 ms 89044 KB Output is correct
32 Correct 24 ms 44956 KB Output is correct
33 Correct 24 ms 44840 KB Output is correct
34 Correct 24 ms 44864 KB Output is correct
35 Correct 27 ms 45148 KB Output is correct
36 Correct 24 ms 44848 KB Output is correct
37 Correct 24 ms 44952 KB Output is correct
38 Correct 24 ms 44876 KB Output is correct
39 Correct 24 ms 44884 KB Output is correct
40 Correct 24 ms 44936 KB Output is correct
41 Correct 24 ms 44884 KB Output is correct
42 Correct 24 ms 44932 KB Output is correct
43 Correct 32 ms 45280 KB Output is correct
44 Correct 26 ms 45368 KB Output is correct
45 Correct 130 ms 64056 KB Output is correct
46 Correct 214 ms 72916 KB Output is correct
47 Correct 200 ms 72784 KB Output is correct
48 Correct 31 ms 44884 KB Output is correct
49 Correct 23 ms 44884 KB Output is correct
50 Correct 24 ms 44904 KB Output is correct
51 Correct 24 ms 44884 KB Output is correct
52 Correct 24 ms 44976 KB Output is correct
53 Correct 24 ms 44912 KB Output is correct
54 Correct 24 ms 44884 KB Output is correct
55 Correct 310 ms 88572 KB Output is correct
56 Correct 24 ms 44884 KB Output is correct
57 Correct 28 ms 45396 KB Output is correct
58 Correct 30 ms 46364 KB Output is correct
59 Correct 32 ms 46880 KB Output is correct
60 Correct 141 ms 66308 KB Output is correct
61 Correct 185 ms 75256 KB Output is correct
62 Correct 242 ms 81104 KB Output is correct
63 Correct 289 ms 88148 KB Output is correct
64 Correct 31 ms 44924 KB Output is correct
65 Correct 24 ms 44968 KB Output is correct
66 Correct 25 ms 44992 KB Output is correct
67 Correct 266 ms 84900 KB Output is correct
68 Correct 287 ms 84912 KB Output is correct
69 Correct 253 ms 85204 KB Output is correct
70 Correct 23 ms 45772 KB Output is correct
71 Correct 27 ms 46780 KB Output is correct
72 Correct 153 ms 70124 KB Output is correct
73 Correct 272 ms 83236 KB Output is correct
74 Correct 377 ms 95416 KB Output is correct
75 Correct 430 ms 97512 KB Output is correct
76 Correct 296 ms 85920 KB Output is correct
77 Correct 31 ms 46104 KB Output is correct
78 Correct 32 ms 47060 KB Output is correct
79 Correct 179 ms 71064 KB Output is correct
80 Correct 291 ms 84264 KB Output is correct
81 Correct 399 ms 97372 KB Output is correct
82 Correct 27 ms 44864 KB Output is correct
83 Correct 20 ms 44948 KB Output is correct
84 Correct 20 ms 44952 KB Output is correct
85 Correct 998 ms 123944 KB Output is correct
86 Correct 1098 ms 123472 KB Output is correct
87 Correct 1038 ms 122492 KB Output is correct
88 Correct 878 ms 123944 KB Output is correct
89 Correct 1078 ms 71832 KB Output is correct
90 Correct 2288 ms 92212 KB Output is correct
91 Correct 1963 ms 91672 KB Output is correct
92 Correct 1107 ms 131988 KB Output is correct
93 Correct 1087 ms 132248 KB Output is correct
94 Correct 1297 ms 132064 KB Output is correct
95 Correct 1236 ms 132132 KB Output is correct
96 Correct 29 ms 44852 KB Output is correct
97 Correct 64 ms 50788 KB Output is correct
98 Correct 345 ms 58820 KB Output is correct
99 Correct 1097 ms 123220 KB Output is correct
100 Correct 77 ms 47400 KB Output is correct
101 Correct 322 ms 57436 KB Output is correct
102 Correct 887 ms 69784 KB Output is correct
103 Correct 381 ms 76268 KB Output is correct
104 Correct 510 ms 87012 KB Output is correct
105 Correct 789 ms 99892 KB Output is correct
106 Correct 1043 ms 111148 KB Output is correct
107 Correct 1320 ms 122472 KB Output is correct
108 Correct 24 ms 44904 KB Output is correct
109 Correct 24 ms 44884 KB Output is correct
110 Correct 25 ms 44884 KB Output is correct
111 Correct 25 ms 44956 KB Output is correct
112 Correct 30 ms 44948 KB Output is correct
113 Correct 25 ms 44884 KB Output is correct
114 Correct 24 ms 44884 KB Output is correct
115 Correct 23 ms 44960 KB Output is correct
116 Correct 30 ms 44836 KB Output is correct
117 Correct 24 ms 44860 KB Output is correct
118 Correct 24 ms 44948 KB Output is correct
119 Correct 31 ms 45276 KB Output is correct
120 Correct 29 ms 45388 KB Output is correct
121 Correct 154 ms 64012 KB Output is correct
122 Correct 259 ms 73004 KB Output is correct
123 Correct 234 ms 72880 KB Output is correct
124 Correct 28 ms 44924 KB Output is correct
125 Correct 24 ms 44952 KB Output is correct
126 Correct 24 ms 44936 KB Output is correct
127 Correct 305 ms 84872 KB Output is correct
128 Correct 334 ms 84988 KB Output is correct
129 Correct 314 ms 85204 KB Output is correct
130 Correct 30 ms 45816 KB Output is correct
131 Correct 34 ms 46720 KB Output is correct
132 Correct 174 ms 70120 KB Output is correct
133 Correct 302 ms 83212 KB Output is correct
134 Correct 400 ms 95464 KB Output is correct
135 Correct 1163 ms 137536 KB Output is correct
136 Correct 1099 ms 137104 KB Output is correct
137 Correct 1184 ms 124660 KB Output is correct
138 Correct 1212 ms 118356 KB Output is correct
139 Correct 1008 ms 116896 KB Output is correct
140 Correct 25 ms 44884 KB Output is correct
141 Correct 112 ms 57272 KB Output is correct
142 Correct 114 ms 49688 KB Output is correct
143 Correct 596 ms 61692 KB Output is correct
144 Correct 1000 ms 73776 KB Output is correct
145 Correct 490 ms 83504 KB Output is correct
146 Correct 636 ms 93000 KB Output is correct
147 Correct 873 ms 103824 KB Output is correct
148 Correct 1142 ms 112544 KB Output is correct
149 Correct 1283 ms 122296 KB Output is correct
150 Correct 411 ms 97424 KB Output is correct
151 Correct 280 ms 85888 KB Output is correct
152 Correct 31 ms 46112 KB Output is correct
153 Correct 33 ms 47068 KB Output is correct
154 Correct 180 ms 71060 KB Output is correct
155 Correct 300 ms 84232 KB Output is correct
156 Correct 398 ms 97276 KB Output is correct
157 Correct 29 ms 44884 KB Output is correct
158 Correct 26 ms 44864 KB Output is correct
159 Correct 26 ms 44884 KB Output is correct
160 Correct 24 ms 44900 KB Output is correct
161 Execution timed out 3575 ms 116492 KB Time limit exceeded
162 Halted 0 ms 0 KB -